umu.sePublications
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Reviewing the Closure Hierarchy of Orbits and Bundles of System Pencils and Their Canonical Forms
Umeå University, Faculty of Science and Technology, Department of Computing Science. (UMIT)
2009 (English)Report (Other academic)
Abstract [en]

Using a unifying terminology and notation an introduction to the theory of stratification for orbits and bundles of matrices, matrix pencils and system pencils with applications in systems and control is presented. Canonical forms of such orbits and bundles reveal the important system characteristics of the models under investigation. A stratification provides the qualitative information of which canonical structures are near each other in the sense of small perturbations. We discuss how fundamental concepts like controllability and observability of a system can be studied with the use of the stratification theory. Important results are presented in the form of the closure and cover relations for controllability and observability pairs. Furthermore, different canonical forms are considered from which we can derive the characteristics of a system. Specifically, we discuss how the Kronecker canonical form is related to the Brunovsky canonical form and its generalizations. Concepts and results are illustrated with several examples throughout the presentation.

Place, publisher, year, edition, pages
Umeå: Institutionen för datavetenskap, Umeå universitet , 2009. , 88 p.
Series
Report / UMINF, ISSN 0348-0542 ; 09.02
Keyword [en]
Stratification, Jordan canonical form, Kronecker canonical form, Brunovsky canonical form, orbit, bundle, closure relations, cover relations, state-space system, system pencil, matrix pencil, matrix pair
National Category
Computer Science
Research subject
Numerical Analysis
Identifiers
URN: urn:nbn:se:umu:diva-18475OAI: oai:DiVA.org:umu-18475DiVA: diva2:159844
Available from: 2009-02-12 Created: 2009-02-10 Last updated: 2011-12-28Bibliographically approved
In thesis
1. Tools for Control System Design: Stratification of Matrix Pairs and Periodic Riccati Differential Equation Solvers
Open this publication in new window or tab >>Tools for Control System Design: Stratification of Matrix Pairs and Periodic Riccati Differential Equation Solvers
2009 (English)Doctoral thesis, comprehensive summary (Other academic)
Abstract [en]

Modern control theory is today an interdisciplinary area of research. Just as much as this can be problematic, it also provides a rich research environment where practice and theory meet. This Thesis is conducted in the borderline between computing science (numerical analysis) and applied control theory. The design and analysis of a modern control system is a complex problem that requires high qualitative software to accomplish. Ideally, such software should be based on robust methods and numerical stable algorithms that provide quantitative as well as qualitative information.

The introduction of the Thesis is dedicated to the underlying control theory and to introduce the reader to the main subjects. Throughout the Thesis, the theory is illustrated with several examples, and similarities and differences between the terminology from mathematics, systems and control theory, and numerical linear algebra are highlighted. The main contributions of the Thesis are structured in two parts, dealing with two mainly unrelated subjects.

Part I is devoted to the qualitative information which is provided by the stratification of orbits and bundles of matrices, matrix pencils and system pencils. Before the theory of stratification is established the reader is introduced to different canonical forms which reveal the system characteristics of the model under investigation. A stratification reveals which canonical structures of matrix (system) pencils are near each other in the sense of small perturbations of the data. Fundamental concepts in systems and control, like controllability and observability of linear continuous-time systems, are considered and it is shown how these system characteristics can be investigated using the stratification theory. New results are presented in the form of the cover relations (nearest neighbours) for controllability and observability pairs. Moreover, the permutation matrices which take a matrix pencil in the Kronecker canonical form to the corresponding system pencil in (generalized) Brunovsky canonical form are derived. Two novel algorithms for determining the permutation matrices are provided.

Part II deals with numerical methods for solving periodic Riccati differential equations (PRDE:s). The PRDE:s under investigation arise when solving the linear quadratic regulator (LQR) problem for periodic linear time-varying (LTV) systems. These types of (periodic) LQR problems turn up for example in motion planning of underactuated mechanical systems, like a humanoid robot, the Furuta pendulum, and pendulums on carts. The constructions of the nonlinear controllers are based on linear versions found by stabilizing transverse dynamics of the systems along cycles.

Three different methods explicitly designed for solving the PRDE are evaluated on both artificial systems and stabilizing problems originating from experimental control systems. The methods are the one-shot generator method and two recently proposed methods: the multi-shot method (two variants) and the SDP method. As these methods use different approaches to solve the PRDE, their numerical behavior and performance are dependent on the nature of the underlying control problem. Such method characteristics are investigated and summarized with respect to different user requirements (the need for accuracy and possible restrictions on the solution time).

Abstract [sv]

Modern reglerteknik är idag i högsta grad ett interdisciplinärt forskningsområde. Lika mycket som detta kan vara problematiskt, resulterar det i en stimulerande forskningsmiljö där både praktik och teori knyts samman. Denna avhandling är utförd i gränsområdet mellan datavetenskap (numerisk analys) och tillämpad reglerteknik. Att designa och analysera ett modernt styrsystem är ett komplext problem som erfordrar högkvalitativ mjukvara. Det ideala är att mjukvaran består av robusta metoder och numeriskt stabila algoritmer som kan leverera både kvantitativ och kvalitativ information.Introduktionen till avhandlingen beskriver grundläggande styr- och reglerteori samt ger en introduktion till de huvudsakliga problemställningarna. Genom hela avhandlingen illustreras teori med exempel. Vidare belyses likheter och skillnader i terminologin som används inom matematik, styr- och reglerteori samt numerisk linjär algebra. Avhandlingen är uppdelade i två delar som behandlar två i huvudsak orelaterade problemklasser.

Del I ägnas åt den kvalitativa informationen som ges av stratifiering av mångfalder (orbits och bundles) av matriser, matrisknippen och systemknippen. Innan teorin för stratifiering introduceras beskrivs olika kanoniska former, vilka var och en avslöjar olika systemegenskaper hos den undersökta modellen. En stratifiering ger information om bl.a. vilka kanoniska strukturer av matrisknippen (systemknippen) som är nära varandra med avseende på små störningar i datat. Fundamentala koncept i styr- och reglerteori behandlas, så som styrbarhet och observerbarhet av linjära tidskontinuerliga system, och hur dessa systemegenskaper kan undersökas med hjälp av stratifiering. Nya resultat presenteras i form av relationerna för täckande (närmsta grannar) styrbarhets- och observerbarhets-par. Dessutom härleds permutationsmatriserna som tar ett matrisknippe i Kroneckers kanoniska form till motsvarande systemknippe i (generaliserade) Brunovskys kanoniska form. Två algoritmer för att bestämma dessa permutationsmatriser presenteras.

Del II avhandlar numeriska metoder för att lösa periodiska Riccati differentialekvationer (PRDE:er). De undersökta PRDE:erna uppkommer när ett linjärt kvadratiskt regulatorproblem för periodiska linjära tidsvariabla (LTV) system löses. Dessa typer av (periodiska) regulatorproblem dyker upp till exempel när man planerar rörelser för understyrda (underactuated) mekaniska system, så som en humanoid (mänsklig) robot, Furuta-pendeln och en vagn med en inverterad (stående) pendel. Konstruktionen av det icke-linjära styrsystemet är baserat på en linjär variant som bestäms via stabilisering av systemets transversella dynamik längs med cirkulära banor.

Tre metoder explicit konstruerade för att lösa PRDE:er evalueras på både artificiella system och stabiliseringsproblem av experimentella styrsystem. Metoderna är sk. en- och flerskotts metoder (one-shot, multi-shot) och SDP-metoden. Då dessa metoder använder olika tillvägagångssätt för att lösa en PRDE, beror dess numeriska egenskaper och effektivitet på det underliggande styrproblemet. Sådana metodegenskaper undersöks och sammanfattas med avseende på olika användares behov, t.ex. önskad noggrannhet och tänkbar begränsning i hur lång tid det får ta att hitta en lösning.

Place, publisher, year, edition, pages
Umeå: Print & Media, Umeå universitet, 2009. 59 p.
Series
Report / UMINF, ISSN 0348-0542 ; 09.04
Keyword
control system design, stratification, controllability, observability, matrix pair, canonical forms, linear quadratic regulator, periodic systems, periodic Riccati differential equation
National Category
Computer Science
Research subject
Numerical Analysis
Identifiers
urn:nbn:se:umu:diva-18509 (URN)978-91-7264-733-6 (ISBN)
Public defence
2009-03-06, MA121, Umeå universitet, MIT-huset, Umeå, 13:15 (English)
Opponent
Supervisors
Available from: 2009-02-13 Created: 2009-02-12 Last updated: 2009-02-13Bibliographically approved

Open Access in DiVA

fulltext(1065 kB)220 downloads
File information
File name FULLTEXT01.pdfFile size 1065 kBChecksum SHA-512
e9309a26cc45f09c185585ecb424c767377841e8eda0db9b1947c865dfefcdaf027e3c163c456cd63038a30a98b12a9abf5b328f36f2499ba902238444162546
Type fulltextMimetype application/pdf

Search in DiVA

By author/editor
Johansson, Stefan
By organisation
Department of Computing Science
Computer Science

Search outside of DiVA

GoogleGoogle Scholar
Total: 220 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

urn-nbn

Altmetric score

urn-nbn
Total: 200 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf