Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Next Article in Journal
Fuzzy Interpolation with Extensional Fuzzy Numbers
Next Article in Special Issue
A Heuristic Approach to Shelf Space Allocation Decision Support Including Facings, Capping, and Nesting
Previous Article in Journal
Stability Analysis and Cauchy Matrix of a Mathematical Model of Hepatitis B Virus with Control on Immune System near Neighborhood of Equilibrium Free Point
Previous Article in Special Issue
Dynamic Cost Ant Colony Algorithm to Optimize Query for Distributed Database Based on Quantum-Inspired Approach
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Toward Applications of Linear Control Systems on the Real World and Theoretical Challenges

1
Instituto de Alta Investigación, Universidad de Tarapacá, Casilla 7D, Arica 1000000, Chile
2
Departamento Académico de Matemáticas, Universidad Nacional de San Agustín de Arequipa, Calle Santa Catalina, Nro. 117, Arequipa 04001, Peru
*
Author to whom correspondence should be addressed.
Symmetry 2021, 13(2), 167; https://doi.org/10.3390/sym13020167
Submission received: 16 December 2020 / Revised: 28 December 2020 / Accepted: 29 December 2020 / Published: 22 January 2021
(This article belongs to the Special Issue Symmetry in Optimization and Control with Real World Applications)

Abstract

:
Many significant real world challenges arise as optimization problems on different classes of control systems. In particular, ordinary differential equations with symmetries. The purpose of this review article is twofold. First, we give the information we have about the class of Linear Control Systems Σ G on a low dimension matrix Lie group G. Second, we invite the Mathematical community to consider possible applications through the Pontryagin Maximum Principle for Σ G . In addition, we challenge some theoretical open problems. The class Σ G is a perfect generalization of the classical Linear Control System on the Abelian group R n . Let G be a Lie group of dimension two or three. Related to Σ G , this review describes the actual results about controllability, the time-optimal Hamiltonian equations and, the Pontryagin Maximum Principle. We show how to build Σ G , through several examples on low dimensional matrix groups.

1. Introduction

Many significant real world challenges arise as optimization problems on different classes of control systems. In particular, ordinary differential equations with symmetries. The purpose of this review article is twofold. First, we give the information we have about the class of Linear Control Systems Σ G on a low dimension matrix Lie group G. Second, we invite the Mathematical community to consider possible applications through the Pontryagin Maximum Principle for Σ G . In addition, we challenge some theoretical open problems. The class Σ G is a perfect generalization of the classical Linear Control System on the Abelian group R n .
Lie theory refers to the theory integrating the concept of Lie group and Lie algebra through the exponential map, and provides a natural model for the notion of continuous symmetry. Lie groups are widely used in almost every part of modern mathematics and physics. The relevance of the Lie theory in applications has become evident. With respect to this article, we mention that Lie theory is a powerful tool for the study of differential equations [1,2]. Therefore, the extension of linear system from R n to any connected Lie group, it is necessary.
In order to build examples, in this review we explicitly show the Lie algebras of dimension 2 and 3 , and its corresponding simply connected Lie groups. Furthermore, we compute all the possible linear vector fields, and the left invariant vector fields. They are the main ingredients to build the dynamic of Σ G . For both dimensions, we characterize the Linear Algebra Rank Condition L A R C , the controllability property, the existence, uniqueness, and the shape of control sets in dimension 2 . There is no information about control sets for Σ G on dimension 3. From the optimization point of view, we give explicitly the Hamiltonian equations of a time-optimal problem for Σ G , as appear in [3,4]. The optimal quadratic problem is open for this class.
It is very well known that control systems, particularly the classical class Σ R n , had been used as a model for beautiful and concrete applications. For instance, optimal control problems: in Economic growth [5], in Mechanics [2,6], in Medicine, Biology and Chemistry in [7,8], in spacecraft [9], in engineering systems in [10], for the Dubin’s problem in [11], for the brachistochrone and related topics in [12], etc. In addition, we are confident that the same is true for Σ G . There are some reasons to believe that. In the first place, the notion of the Lie group allows discovering the symmetries of analytical structures. In addition, it is able to discover the symmetries of classes of differential equations, [13]. Examples of these manifolds are the Abelian group R n , the spheres S n R n + 1 for n = 1 , 3 and 7 , the set G L ( n , R ) of the invertible real matrices of order n, and its relevant subgroups S L ( n , R ) of matrices with determinant 1 , the orthogonal group O ( n , R ) , the spinor group S p i n ( n , R ) , the unitary group U ( n , R ) and many others. These apply not just to real, but also complex coefficients. However, the main reason comes from the Jouan Equivalence Theorem [14] which roughly says that: ”Any affine control systems on an arbitrary differentiable manifold is equivalent to a linear control system on a Lie group, or on a homogeneous space if and only if the Lie algebra generated by the vector fields of the system is finite-dimensional”.
To understand the meaning of the Equivalence Theorem, and also as a general motivation, consider a tumor growth with initial condition x 0 and dynamics determined by a vector field f on the space state M , as the solution x ( t ) of the associated differential equation,
x ( t ) · = f ( x ( t ) ) , x ( t ) M , with x ( 0 ) = x 0 .
Deciding which combination of treatments is right for a patient is critical. The introduction of the treatments g 1 , . . . , g m , and the control function u = ( u 1 , , u m ) U define an affine control system which changes the behavior of the tumor, as the solutions of the controlled family of differential equations
Σ M : x ( t ) · = f ( x ( t ) ) + Σ m j = 1 u j ( t ) g j ( x ( t ) ) , x ( t ) M , u U , x ( 0 ) = x 0 .
Here, U is the admissible class of control functions to be chosen.
This process gives you a way to combine a global tumor treatment in time. Two theoretical-practical problems appear:
To compute A ( x 0 ) M , the reachable set from x 0 through the controls u U , in positive time
Assume x 1 A ( x 0 ) . Starting at x 0 , is it possible to reach x 1 with the minimum time, or with the minimum collateral damage?
The system Σ M is controllable from x 0 if A ( x 0 ) = M . In addition, it is controllable if it is controllable from any element of M . Let t > 0 , for technical reasons sometimes it is necessary to consider the set A ( x 0 , t ) , i.e., the reachable set from x 0 through the controls u U up to the time t . In addition, the set A * ( x 0 ) which are the elements that can be carried to the state x 0 in positive time through the system.
Like the tumor treatment problem, similar questions can be asked in the real world for many situations. From a practical point of view, given a manifold M , the drift f to be controlled and the control vectors g 1 , . . . , g m , the admissible class of control U must be properly chosen, according to any real situation.
To establish the Equivalence Theorem, we need to introduce the notion of Lie brackets between vector fields, given by the formula,
X , Y = X . Y Y . X , where X . Y = X Y .
The Lie algebra S p a n L A f , g 1 , , g m denotes the small vector space generated by f , g 1 , . . . , g m and closed by the bracket , .
Theorem 1.
(Jouan Equivalence Theorem, [14]) If for Σ M
dim ( S p a n L A f , g 1 , . . . , g m ) < ,
then, there exits a Lie group G such that Σ M is equivalent to Σ G or, it is equivalent to Σ G / H , where G / H is a homogeneous space.
Equivalent systems share the same topological, dynamic and algebraic properties. Therefore, it is possible to get information of any arbitrary system Σ M which satisfy the Jouan condition through a linear system Σ G or via a homogeneous system Σ G / H . Here, H is a closed subgroup of G . This is one of the main reasons it is necessary to classify Σ G for different classes of groups: compact, non-compact, Abelian, nilpotent, solvable, simple, semi-simple, and the direct and semi-direct product between them. Since 1999, a group of mathematician had been working in the structure of Σ G . Results about controllability, and the existence, uniqueness, and topological properties of control sets, (maximal regions of controllability), were established for several classes of groups. We refer the readers to the following [14,15,16,17,18,19,20,21,22,23,24,25].
As mentioned before, the main goal of this review is to invite the community to search for real world applications of Σ G . However, there are also several theoretical open problems to be challenging. For instance, we mention that except for the Euclidean case, any other classical optimal issue for Σ G , such as the quadratic one, is an open problem for Σ G .
According to the aim of this review article, we concentrate on matrix groups. Precisely, for a group G of dimension 2 and 3 , we describe the main ingredients to build Σ G by showing a basis of the Lie algebra g of G , the face of g -derivations and all possible associated linear vector fields. We also mention the existent controllability results and the Hamiltonian equations to apply the Pontryagin Maximum Principle in these cases.
For a general view of the theory of control systems we refer the readers to [1,2,26,27,28,29,30,31,32]. For the Lie theory, we mention [33,34,35,36]. For the connection with Sub-Riemannian, almost-Riemmanian geometry we suggest the references [37].
This article is organized as follows. Section 2 introduces the algebraic structures to define Σ G . Section 3 contains an explicit description of linear control systems and their main properties on groups of dimensions 2 and 3 . In Section 4, we establish the Pontryagin Maximum Principle for Σ G . Finally, in Section 5 we end with several examples. We include a classical optimal problem on the Euclidean plane, several examples on the 2-dimensional solvable group, and a time-optimal theoretical problems on 3-dimensional groups.

2. Matrix Groups Dynamics and Systems

In the sequel, g l ( n , R ) will denote the vector space of the n by n matrices with real coefficients. The open set G L ( n , R ) = det ( A ) 1 ( 0 ) c g l ( n , R ) , is the group of invertible matrices. In fact, g l ( n , R ) is canonically isomorphic to R n 2 , the determinant map det: g l ( n , R ) R is continuous, and det ( A ) 1 ( 0 ) is closed. We also denote by G L + ( n , R ) the connected component of G L ( n , R ) which contains the identity element I d = e . In particular, for any A G L + ( n , R ) , det ( A ) > 0 . It turns out that the topology and the differentiable structure of G L + ( n , R ) are the induced ones, coming directly from the Euclidean space R n 2 . Here, we just consider closed or path connected subgroups G of G L + ( n , R ) . Thus, G is a matrix Lie group. In particular, it is possible to define appropriate control systems whenever the dynamic determining the system is well defined on G. The notion of a linear control system on a connected Lie group G depends on two different classes of dynamics: linear and invariant vector fields. For that, we need to introduce the notion of the Lie algebra g of G, which is isomorphic to the tangent space T e G of G at the identity element e. The tangent space T g G of G at g reads
T g G = { Y g : γ : ( ε , ε ) c o n t i n u o u s G , γ ( 0 ) = g and γ · ( 0 ) = Y g } ,
and T G = g G T g G denotes the tangent bundle.
A vector field P on G is defined by the selection of P g T g G for any g G . Since we consider just subgroups G of G L + ( n , R ) , it follows that
T g G T g G L + ( n , R ) = g + T e G L + ( n , R ) = g + g l ( n , R ) .
For matrices, the bracket X , Y = X Y Y X , is the commutator.
By definition, the drift X is a linear vector field if its flows X t : t R is a 1-parameter group of A u t ( G ) , the group of G-automorphisms. Moreover, X induced a derivation,
D ( X ) = D : g g : D X , Y = D X , Y + X , D Y , X , Y g ,
i.e., a linear transformation which respects the Leibnitz rule for the Lie bracket. Furthermore, X is computed through the following identities,
X g = d d t t = 0 X t ( g ) , X t ( exp Y ) = e t D Y , and X t ( g h ) = X t ( g ) X t ( h ) .
In fact, since we just consider connected groups, any element g G is a finite product of exponential members of g .
A special situation happens when the Lie algebra g is semi-simple, i.e., when the solvable radical r ( g ) of g is trivial. Here, r ( g ) is defined as the biggest solvable subalgebra of g . In this case, any derivation D is inner. It turns out that there exists an invariant vector field Y = Y ( D ) , such that D = , Y . Therefore, D is easily computed by
D = a d ( Y ) X g = g Y Y g , g G .
Denote by T n = S 1 × . . . × S 1 , ( n -times) the Torus. Therefore, A u t ( T n ) = S L ( n , Z ) is the discrete group of determinant 1 matrices of order n with integer coefficients. It turns out that any linear vector field X on T n is trivial, i.e., X g = 0 . In fact, X t : t R should be discrete. Because of that, we do not consider T n in this analysis.
An invariant vector field is determined by G-translations. Precisely, to define a left invariant vector field Y on G we just need to determine a tangent vector at the identity element Y = Y e . Thus, for any g G its value Y g T g G is determined by the derivative at e of the corresponding left translation L g . Precisely,
Y g = ( d L g ) e ( Y e ) , where ( d L g ) e : T e G T g G
Since we work with matrices, it turns out that Y g is obtained by the derivative of the curve γ ( t ) = g exp ( t Y ) . Therefore, Y g = g Y , with Y e = Y . Thus, g is isomorphic to the tangent space T e G . Right invariant vector fields are defined in a similar way. The vector space g of the left invariant vector fields of G, is a Lie algebra [35,36]. The skew-symmetric bilinear map [ , ] : g × g g , satisfy
1.
P , Q = Q , P skew-symmetric, and the Jacobi identity
2.
[ X , [ Y , Z ] ] + [ Z , [ X , Y ] ] + [ Y , [ Z , X ] ] = 0 , for any X , Y , Z g .
Recall that the Lie algebra g is said to be:
  • Abelian, if for any X , Y g , X , Y = 0 .
  • Nilpotent, if k 1 : a d 1 = g , g . . . a d k + 1 = a d k , g = 0 .
  • Solvable, if k 1 : a d 1 . . . a d ( k ) = a d ( k 1 ) , a d ( k 1 ) = 0 .
  • Semisimple, if the largest solvable subalgebra r ( g ) of g is trivial.
  • Finite semi-simple center if any semi-simple subalgebra has a trivial center.
Finally, the group G is said to be Abelian, nilpotent, solvable, semi-simple, and finite semi-simple center, if g satisfies the corresponding property.

2.1. The Notion of Linear Control System on G

Let G be a connected Lie group with Lie algebra g . By definition, see [20,25], a linear control systems Σ G is determined by the differential equations
Σ G : g ( t ) · = X ( g ( t ) ) + Σ m j = 1 u j ( t ) Y j ( g ( t ) ) , g ( t ) G , u U ,
parametrized by u U . Here, X is a linear vector field which means that its flows X t : t R     A u t ( G ) is a 1-parameter group of G-automorphisms. In addition, for any j = 1 , , m , the control vector Y j g is a left invariant vector field. We consider a large class of admissible control functions
U = u : 0 , T u Ω R m : u is locally integrable ,
where Ω is a closed and convex subset with 0 i n t ( Ω ) . Just observe that U contains the constant, continuous and also differentiable functions.
Because of that, given any initial condition g G and each control u U there exist a solution φ ( g , u , t ) of Σ G . Precisely,
φ ( g , u , t ) = X t ( g ) φ ( e , u , t ) ,
where φ ( e , u , t ) is the solution of the system with the same control u through the identity element e [20]. We denote the reachable set from e by
A = φ ( e , u , t ) : u U , and the set ,
A * = g G : u U , and t > 0 , with φ ( g , u , t ) = e ,
of state of the group that can be transferred to the identity in a positive time.
We call the system unbounded if Ω = R m , and bounded if Ω is compact. From now U R m will denote the unbounded case, U Ω the bounded one and U when both condition are possible.
Therefore, the notion of Σ G is a natural extension of the classical linear control system Σ R n on the Abelian group R n .
Recall that the system satisfy the Lie algebra rank condition ( L A R C ), if
S p a n L A X , Y 1 , , Y m = g .
Furthermore, the system satisfies the ad-rank condition a d R C if
S p a n D k ( Y j ) : j = 1 , . . . , m , k 0 = g .
We denote by Δ the Lie algebra generated by the control vectors, i.e.,
Δ = S p a n L A Y 1 , . . . , Y m .
Finally, we introduce the notion of a control set, which means a region where controllability holds in its interior. Let Σ G be a linear control system. A subset C is said to be a control set if
  • for any g G , u such that φ ( g , u , t ) C , t 0
  • C c l ( A ( g ) , for any g C
  • C is maximal with respect 1 and 2.
Furthermore, the control set C is said to be positive invariant if,
g C φ ( g , u , t ) C , for any u U , t > 0 ,
Here, c l denotes the topological closure.

2.2. The Classical Linear Control System on R n

In the Euclidean Abelian group
R n = x = ( x 1 , x 2 , , x n ) : x i R , i = 1 , , n
the classical linear control system is as follows
Σ R n : x ˙ ( t ) = A x ( t ) + B u , u U .
In this case, D corresponds to the matrix A of order n, which flows e t A : t R A u t ( R n ) is computed from the exponential map. On the other hand, B u R n can be written as Σ m j = 1 u j b j , where b 1 , , b m , are the column vectors of the n by m matrix B. Since, any vector b R n induces by translation an invariant vector field on R n , it is now clear that Σ G is a perfect extension of Σ R n .
It is well known that the solution with initial condition and control u is given by,
φ ( x 0 , u , t ) = e t A x 0 + 0 t e τ A B u ( τ ) d τ .

2.3. The D -Decomposition of g

The dynamic behavior of Σ G strongly depends on the spectrum of D associated with X . We consider the Lie algebra decomposition of g induced by D . For any α S p e c ( D ) , the D -generalized eigenspaces reads
g α = { Y g : ( D α I d ) n Y = 0 , for some n 1 .
It turns out that [ g α , g β ] g α + β if α + β S p e c ( D ) and 0 otherwise. In addition, g decomposes as g = g + g 0 g , where
g + = R e ( α ) > 0 g α , g 0 = R e ( α ) = 0 g α a n d g = R e ( α ) < 0 g α .
g + , g 0 , g are Lie subalgebras and g + , g are nilpotent [22,35].
We finish this section bt mentioning some differences between Σ G and the well-known class of invariant control system I n v G on G [38,39]. For I n v G the drift is also an element of the Lie algebra g . One of the main differences comes from the fact that the reachable set from the identity is a semigroup for I n v G but not for Σ G . This difference has important consequences. For example, the controllability property of I n v G turns into a local property, which is no the case for Σ G [19]. On the other hand, the Hamiltonian lifting of the linear vector field is more complicated because the invariant field does not depend on the state.

3. Linear Control Systems and Controllability

For a group G of dimension 2 and 3 , in the sequel, we describe the main ingredients to build Σ G . We show a basis of the Lie algebra g of G , the form of all g -derivations, and the associated linear vector fields. We also mention some normal form of Σ G associated with the L A R C property, which we always assume, without loss of generality. Finally, we characterize the controllability property of each system, (A few words about assuming L A R C . For a regular (constant dimension) and involutive (closed by Lie brackets) distribution Ψ generated by a family of vector fields Γ on a manifold M, the Sussmann Orbit Theorem implies that the integral manifold M ( Ψ ) of Ψ , a submanifold of M is built by the concatenation of the integral curves of the vector fields in Γ , in positive and negative time. In particular, if M ( Ψ ) M we just consider Γ on M ( Ψ ) . Therefore, by assuming that Σ G satisfy the L A R C property, it turns out that G ( Ψ ) = G , when
Ψ = S p a n L A X , Y 1 , , Y m . )

3.1. The Dimension 2

In dimension two, there are just two Lie algebras: the Abelian and solvable.

3.1.1. The Abelian Structure

The Lie algebra R 2 is generated by the basis X = e 1 , Y = e 2 , with X , Y = 0 . The associated group is R 2 with the Abelian structure
( x 1 , y 1 ) + ( x 2 , y 2 ) = ( x 1 + x 2 , y 1 + y 2 )
induced by its Lie algebra. The Left invariant vector fields are given by
X g = x , Y g = y , where g = x e 1 + y e 2 .
Any matrix D = A = a 11 a 12 a 21 a 22 , a i , j R where i , j = 1 , 2 , is a derivation, determining the linear vector field x ˙ ( t ) = A x ( t ) . Therefore, any classical linear control system on the Abelian group has the face
Σ R 2 : x ˙ ( t ) y ˙ ( t ) = A x ( t ) y ( t ) + b 1 b 2 u , u U R , or u U Ω .
In reference [27] it is possible to find the controllability results for the unbounded and bounded admissible control functions, see also [29]. If U = U R 2 , the L A R C property is equivalent to the controllability property, which is equivalent to the Kalman rank condition. Precisely,
Theorem 2.
Let Σ R 2 be a linear control system with U = U R 2 . Then,
Σ R 2 is controllable r a n k ( b A b ) = 2 , b = ( b 1 b 2 ) T .
Furthermore, consider u * < 0 < u * and Ω = u * , u * . If U = U Ω , it holds
1 .
Σ R 2 is controllable ⇔ Kalman rank condition and S p e c L y ( D ) = 0 .
2 .
Around the identity element 0, there exists an unique control set with non-empty interior, given by
C = c l ( A ) A * .

3.1.2. The Solvable Structure

Here, we follow the reference [24]. The Lie algebra a f f + ( R ) is realized as the vector space of the real matrices of order 2 generated by X = 1 0 0 0 ,
Y = 0 1 0 0 , with X , Y = Y . The simply connected Lie group reads as
G = g = x y 0 1 : x > 0 , y R A f f + ( R ) = R + × R ,
with the solvable algebraic structure
( x 1 , y 1 ) × ( x 2 , y 2 ) = ( x 1 x 2 , x 1 y 2 + x 1 )
The left invariant vector fields are given by X g = g X = x x and Y g = g Y = x y . Any derivation
D = 0 0 a b , a , b R
is inner, and induces the linear vector field
X g = 0 a ( x 1 ) + b y 0 0 , a , b R .
Next, we follow reference Jouan. The linear system Σ G
g ˙ = X g + u g ( c X + d Y )
satisfies L A R C if and only if
Σ G : x ˙ = u c x , c 0 y ˙ = x 1 + b y , u U .
In this case, the linear system Σ G is said to be in normal form.
Theorem 3
([24]). Assume, Σ G is in normal form, therefore
Σ G i s c o n t r o l l a b l e b = 0 .
In [15], the authors compute the control set of any linear control system Σ G on G, with and without non-empty interior. There are six classes. Here, we just show three.
  • Let us consider
    Σ G : x ˙ = u x y ˙ = b y , w h e r e u Ω = u * , u * ,
    whose solutions starting at ( x , y ) G are given by concatenations of the flows
    φ ( t , ( x , y ) , u ) = ( e t u x , e t b y ) , t R .
    As a matter of fact, the only control set is given by C = R + × { 0 } .
  • Let us consider the linear system
    Σ G : x ˙ = 0 y ˙ = a ( x 1 ) + u x , w h e r e u Ω = u * , u * ,
    whose solution with initial condition ( x , y ) and control u is given by
    φ ( ( x , y ) , u , t ) = ( x , ( a ( x 1 ) + u x ) t + y ) , t R .
    Here, there are an infinity number of control sets. In fact, for any x R
    C x = x × R , when x ( 1 ε , 1 + ε ) , and any y R
    for an existent positive number ε .
  • Consider the linear system
    Σ G : x ˙ = u x y ˙ = b y + u x , where , b < 0 , u Ω = u * , u * ,
In this case it is possible to prove that the only one control set with non-empty interior is given by
C = c l A ( x , y ) for any ( x , y ) C

3.2. The Dimension 3

In this section, we describe the ingredients to build a linear control system on any 3-dimensional matrix Lie group. In particular, in the Abelian, nilpotent, solvable, finite center, semi-simple compact, and non-compact case.

3.2.1. The Abelian Structure

Here, R 3 is generated by the basis X = e 1 , Y = e 2 , Z = e 3 . In addition, all the brackets are null. The associated group is also R 3 with the Abelian structure
( x 1 , y 1 , z 1 ) + ( x 2 , y 2 , z 2 ) = ( x 1 + x 2 , y 1 + y 2 , z 1 + z 2 ) ,
induced by its Lie algebra. The Left invariant vector fields are given by
X g = x , Y g = y , Z g = z where g = x e 1 + y e 2 + z e 3 .
Any matrix D = A = a i , j , a i , j R i , j = 1 , 2 , 3 , is a derivation, determining the linear vector field x ˙ ( t ) = A x ( t ) . Therefore, any classical linear control system on the Abelian group has the face
Σ R 3 : x ˙ ( t ) = A x ( t ) + B u ( t ) , u U .
Here, the matrix B = ( b i , j ) , with the possibilities: i = 1 , 2 , 3 ; j = 1 , and u 1 U , or, i = 1 , 2 , 3 ; j = 1 , 2 and u 1 U , u 2 U .
In reference [27] it is possible to find the controllability results for the unbounded and bounded admissible control functions, see also [29]. If U = U R 3 , the L A R C property is equivalent to the controllability property which, is also equivalent to the Kalman rank condition. Precisely,
Theorem 4.
Let Σ R 3 be a linear control system with U = U R 3 . Then,
Σ R 3 i s c o n t r o l l a b l e rank ( B A B A 2 B ) = 3 .
Furthermore, consider u * < 0 < u * and Ω = u * , u * . If U = U Ω , it holds
  • Σ R 3 is controllable ⇔ Kalman rank condition and S p e c L y ( D ) = 0 .
  • Around the identity element 0, there exists an unique control set with non-empty interior, given by
    C = c l ( A ) A * .
In what follows, we denote by M ( i , j ) , the matrix of order three with all coefficients 0 , except 1 at the position ( i , j ) .

3.2.2. The Nilpotent Structure

The Heisenberg Lie algebra is the only nilpotent Lie algebra of dimension three. It is generated by X = M ( 1 , 2 ) , Y = M ( 2 , 3 ) , and Z = M ( 1 , 3 ) . The simply connected Heisenberg Lie group reads as
G = 1 x z 0 1 y 0 0 1 : x , y , z R ( x , y , z ) R 3 .
The left invariant vector fields and its brackets are given by
X g = x , Y g = y + x z , Z g = z ; X , Y = Z , X , Z = Y , Z = 0 .
An arbitrary derivation of the Heisenberg has the form,
D = a b 0 c d 0 e f a + d : a , b , c , d , e , f R ,
and induces the general linear vector field on G ,
X ( g ) = ( a x + b y ) x + ( c x + d y ) y + ( e x + f y + ( a + d ) z + 1 2 c x 2 + 1 2 b y 2 ) z .
Next, we follow reference [24]. The authors consider two different situations: one and two control vectors. On the Heisenberg Lie group, U = U R m .
The single control vector
Any linear control system on the Heisenberg group satisfy the L A R C property if and only if it is written in normal form,
Σ G : g ˙ = X g + u X g , u U ,
where X comes from the derivation 0 b 0 1 d 0 0 f d , and X = M ( 1 , 2 ) .
Theorem 5
([24]). If Σ G is in normal form, then
g ˙ = X g + u X g i s c o n t r o l l a b l e b < d 2 4 d = 0 , f 0 .
It is possible to obtain algebraic conditions for a 1-input linear system on the Heisenberg group when the system is not written in normal form, Jouan.
The two control vectors
Any linear control system which satisfy L A R C reads as follows,
Σ G : g ˙ = X g + u 1 P g + u 2 Q g , u U
where P , Q g are linear independent invariant vector fields on G .
Theorem 6
([24]). Let Σ G be a linear control system with two control vectors and U = U R 3 . Then,
Σ G i s c o n t r o l l a b l e Σ G satisfy L A R C .

3.2.3. The Solvable Structure

According to Onishchik and Vinberg [34], there are five nonisomorphic, nonnilpotent solvable Lie algebras of dimension three. On the other hand, for these five classes of Lie algebras, the authors in [16], describe general formulas through the semi-direct product to compute the simply connected Lie groups associated with the Lie algebras, the derivations and its associated linear vector fields in any case. Furthermore, they characterize the controllability property on any linear control system which satisfies the L A R C property for one and two control vectors. We also inform the readers that there is no information about control sets.
Let us consider the canonical basis,
g = S p a n X = ( 1 , 0 , 0 ) , Y = ( 0 , 1 , 0 ) , Z = ( 0 , 0 , 1 ) .
The classification goes through the notion of the semi-direct product between the Abelian Lie algebras R and R 2 . Precisely,
g θ = R θ R 2 : [ ( z 1 , v 1 ) , ( z 2 , v 2 ) ] = ( 0 , z 1 θ v 2 z 2 θ v 1 ) g .
Up to automorphisms, these solvable Lie algebras depend on a matrix θ .
The Lie algebra r 2 : θ = 0 0 0 1 , X , Z = Z , X , Y = 0 .
The Lie algebra r 3 : θ = 1 1 0 1 , X , Y = Y , X , Z = Y + Z .
The Lie algebra r 3 , λ : θ = λ 1 1 λ , λ R , λ 0 , X , Y = Z ,
X , Z = Y .
The Lie algebra r 3 , λ * : θ = λ 1 1 λ , λ R , λ 0 , X , Y = λ Y ,
X , Z = Y + λ Z .
The Lie algebra e : θ = 0 1 1 0 , X , Y = Z , X , Z = Y .
Let us show how it works this special product. By the own definition, for every solvable class, Y = ( 0 , 1 , 0 ) , Z = ( 0 , 0 , 1 ) = ( 0 , 0 , 0 ) . For r 2 , the bracket [ X , Z ] is computed as follows
[ X , Z ] = ( 0 , 0 0 0 1 0 1 0 0 ) = Z .
The solvable Lie groups
The simply connected Lie groups R 2 , R 3 , R 3 , λ , R 3 , λ * and E with Lie algebras r 2 , r 3 , r 3 , λ , r 3 , λ * and e respectively, are computed by the semi-direct product G θ = R ρ R 2 through the representation ρ and the formula
ρ θ ( t ) = e t θ , where e t θ = Σ n = 0 t n n ! θ n , θ 0 = I d , t R .
Furthermore, any connected Lie group G which solvable Lie algebra is determined by the matrix θ , is given by a homogeneous space G θ / P , where P is a discrete subgroup of G θ . For more details, see [16].
Linear and left invariant vector fields
Next, we show the face of the dynamic involved in Σ G on any three dimensional solvable non-nilpotent simply connected Lie group G.
Algebra , Group Left invariant vector fields Linear vector fields g θ = R θ R 2 G θ = R ρ R 2 Y = ( a , w ) g θ Y ( t , v ) = ( a , ρ t w ) X ( t , 0 ) = ( 0 , Λ t ξ ) X ( t , v ) = ( 0 , D * v + Λ t ξ ) where D * is defined through the formula D ( 0 , v ) = ( 0 , D * v ) , and
Λ t = ( ρ s 1 ) θ 1 det ( θ ) 0 s 0 0 e s 1 det ( θ ) = 0 . .
Any linear control system Σ G on a three-dimensional, solvable, connected, nonnilpotent Lie group G that satisfies L A R C is equivalent to one of the following linear systems:
1 .
The one control vector,
g ˙ = X ( g ) + u Y 1 ( g ) , where Y 1 = ( 1 , 0 ) .
2 .
The two control vectors,
g ˙ = X ( g ) + u 1 Y 1 ( g ) + u 2 Y 2 ( g ) , with Y 1 = ( 1 , 0 ) , Y 2 = ( 0 , w ) , some w R 2
Next, we present a characterization of the controllability property in both cases.
The single control vector
As always, we assume the L A R C property.
Theorem 7
([16]). Let Σ G : g ˙ = X ( g ) + u Y 1 ( g ) , Y 1 = ( 1 , 0 ) . Then,
  • If G = R 2 : Σ G is controllable g 0 aff ( R )
  • If G = E 2 or R 3 : Σ G is controllable ⇔ g = g 0 and D * 0
  • If G = R 3 , λ : Σ G is controllable λ = 1 and D * has a pair of complex eigenvalues
  • If G = R 3 , λ : Σ G is controllable.
The two control vectors
Let Σ G be a linear control system with two control vectors which satisfy the L A R C property. For the controllability property it holds,
Theorem 8
([16]). Let Σ G : g ˙ = X ( g ) + u 1 Y 1 ( g ) + u 2 Y 2 ( g ) ,
Y 1 = ( 1 , 0 )   and   Y 2 = ( 0 , w ) ,   for some   w R 2 .   Then ,
Theorem 9.
  • If G = R 2 : Σ G is controllable ⇔ dim g 0 > 1 or dim g 0 = 1 and Δ aff ( R )
  • If G = E 2 , or R 3 , λ : Σ G is controllable
  • If G = R 3 : Σ G is controllable ⇔ g = g 0
  • If G = R 3 , λ : Σ G is controllable ⇔ ker D * Δ or D has a pair of complex eigenvalues.

3.2.4. The Finite Semi-Simple Center Structure

In [18] the authors introduce the notion of a finite semi-simple Lie algebra g , which means that any semi-simple subalgebra of g has a finite center. In particular, any solvable Lie algebra has this property. Any semi-simple Lie algebra with a finite center such as the skew-symmetric algebra s o ( n , R ) and s l ( n , R ) , the trace zero matrices of order n. In both cases the center z is discrete: the identity I d , and ± I d , respectively. In the sequel, we consider two topological different cases.

3.2.5. The Compact Semi-Simple Structure

The vector space g = S p a n X , Y , Z is the Lie algebra of skew-symmetric matrices of order three, generated by the basis
X = M ( 1 , 2 ) M ( 2 , 1 ) , Y = M ( 2 , 3 ) M ( 3 , 2 ) , M ( 1 , 3 ) M ( 3 , 1 ) .
The brackets rules are [ X , Y ] = Z , [ X , Z ] = Y , [ Y , Z ] = X .
Since g is semi-simple, any derivation is inner. It turns out that D = a d ( U ) , for U s o ( 3 , R ) . Thus, the linear vector field associated to D reads
X g = g U U g , U g .
The connected Lie group with Lie algebra s o ( 3 , R ) is the orthogonal group with positive determinant S O ( 3 , R ) , i.e., it is the rotational group of R 3 .
Any linear control system on the compact group S O ( 3 , R ) , reads as
Σ G : g ˙ = X g + u 1 P g + u 2 Q g , P , Q g , u 1 , u 2 U .
The single control vector case comes from u 2 = 0 .
Since S O ( 3 , R ) is a topological compact manifold, it turns out that L A R C is equivalent to the controllability property [19]. Thus, in both cases, we have
Σ G i s c o n t r o l l a b l e S p a n LA X , P , Q = s o ( 3 , R ) .

3.2.6. The Non-Compact Semi-Simple Structure

Here, we follow the reference [17]. The Iwasawa decomposition of
sl ( 2 ; R ) = k a n
is given by
k = S p a n X = 0 1 1 0 , a = S p a n Y = 1 0 0 1 , n = S p a n Z = 0 1 0 0 ,
with brackets [ X , Y ] = 2 Z 4 X , [ X , Z ] = Y , [ Y , Z ] = 2 Z .
According to this data, through the exponential map, the Lie group decomposes as the product G = K A N , where
K = cos θ sin θ sin θ cos θ : 0 θ < 2 π , A = x 0 0 1 x : x > 0 , N = 1 y 0 1 : y R
is the compact, Abelian and nilpotent part of G , respectively. Furthermore, any element in G has the form g = ( θ , x , y ) .
Any U = X , Y , Z give raise a linear vector field as follows,
D = a d ( U ) X g = g U U g .
About the controllability, we have here some results for local controllability on the identity element, some controllability relationship between the linear systems and an associated invariant system [19]. Finally, we describe a result that appear very recently involving the notion of a control set, which roughly means a region where the system is controllable in its interior. In addition, the linear system will be controllable if this set is positive invariant.
Theorem 10
([17]). For a linear system on a semisimple Lie group G with the L A R C property, we have
  • a control set C with nonempty interior around e given by,
    C = c l ( A ) A *
  • The only possible invariant control set is the whole group, i.e.,
    if C is positive invariant , then C = G .
Thus, the system Σ G is controllable.
However, in this case, there is not a complete characterization for the controllability of Σ G .

4. The Pontryagin Maximum Principle

The Pontryagin Maximum Principle is one of the main theoretical and useful optimal results available in the literature. Lev Pontryagin, a theoretical topological Mathematician, publish this result in his book Theory of Optimal Processes [40], in collaboration with several researchers of the Steklov Institute in Russia. For his work during the period from 1956 to 1961, he was awarded the Lenin Prize. The principle is fundamental to the control system theory and its applications. However, it also is instrumental for Carnot-Caratheodory geometry, sub-Riemannian, and almost-Riemannian geometries with applications in several areas. The mathematical machinery to establish and prove these results strongly depends on the associated Hamiltonian equations, obtained from a geometric point of view by lifting the initial system to the co-tangent bundle of the state manifold [26].
The Principle works on the co-tangent bundle T * M of the manifold state M. Our case is quite favorable since T * G is a trivial bundle. Precisely,
T * G g * × G ,
where g * denotes the dual of the Lie algebra g of the connected group G . To establish this Principle on Σ G , we recall the Hamiltonian equations associated to Σ G , as appear in [3,4].
For a given admissible control u U , the associated Σ G -Hamiltonian H u defined on g * × G reads as
H u ( λ , g ) = < λ , F ( g ) > + j = 1 m λ , Y j > , g G ,
where λ : g R , F ( g ) = ( d L g 1 ) g ( X g ) , and Y j = ( d L g ) g 1 Y g j .
Just observe that the system was translated from g G to the identity.
Next, we introduce the Pontryagin Maximum Principle for the class of linear control systems on a matrix Lie group.
Theorem 11
([4]). Let u * : [ 0 , T ] Ω R m be an admissible control such that the solution φ ( , u * , t ) of Σ G minimizes the time among all Σ G -admissible curves sending φ ( , u , 0 ) to φ ( , u , T ) . Then, there exists a Lipschitzian curve ( λ ( t ) , g ( t ) ) T * G such that
  • λ ( t ) 0 for all t [ 0 , T ] . In addition, for almost all t [ 0 , T ]
  • H u * ( λ ( t ) , g ( t ) ) = max u U H u ( λ ( t ) , g ( t ) )
  • H u * ( λ ( t ) , g ( t ) ) 0 .
Furthermore, ( λ ( t ) , g ( t ) ) g * × G satisfy the Hamiltonian equations
g ˙ = X g + j = 1 m u j Y j ( g ) and λ ˙ = λ ( D + j = 1 m u j a d ( Y j ) .
Here, D and a d ( Y j ) = Y j , are the lifting vector fields from G to T * G of the corresponding dynamic X and Y j , j = 1 , . . . , m . In the general case of a system Σ M on a differentiable manifold M, this construction depends on a differentiable nondegenerate 2-form which always exists on T * M . The second relationship is a differential equation on g * induced by ( 1 + m ) derivations.
Next, we collect the main results we know about the time optimal problem for Σ G , as appears in [4]. Let Σ G be a linear control system, which includes the constant control u Ω R m .
We consider first the unbounded case. Since H u is maximum, then λ , Y j = 0 , for j = 1 , , m . Moreover, if ( λ ( t ) , g ( t ) ) satisfy the Pontryagin Maximum Principle, it follows that,
λ ˙ ( t ) , Y j = 0 , and λ ( t ) , D Y j + i = 1 m u i [ Y i , Y j ] = 0 , a . e . , j = 1 , , m .
For the bounded case, let B > 0 , and − B u j B for j = 1 , , m . Since H u is maximum, it turns out that
u j = s i g n λ , Y j B , if λ , Y j 0 ,
Otherwise, u j is not determined. However, according to Filippov’s Theorem in [26], minimizers exist. Moreover, if [ Y i , Y j ] = 0 for i , j = 1 , , m , then we get an extra equation λ ( t ) , D Y j = 0 . In the classical case Σ R n , a d ( b j ) = 0 , since the Lie algebra R n is Abelian. However, in groups, it is not the case. In particular, the bang bang control theorem for Σ R n , is not longer true for Σ G , see [4].

5. Examples

In this section, we develop several examples on different groups of dimensions 2 and 3. We start with the more famous one: Stop a train in a station in minimum time, coming from the Pontryagin book, [40].
Example 1.
Let us consider a train Γ of mass one moving on the real line without friction. Denote by x ( t ) the distance from Γ to the origin (the station) at time t. From the Newton law, we have x · ( t ) = y ( t ) and y · ( t ) = u ( t ) . Here, u U Ω with Ω = [ 1.1 ] R . Thus, we obtain a classical control system on the Abelian Lie group R 2 , as follows
Σ G : x ( t ) y ( t ) · = 0 1 0 0 x ( t ) y ( t ) + u ( t ) 0 1 , u U Ω .
Any control u determine an ordinary differential equation. Geometrically, any initial condition ( x , y ) should be steer to ( 0 , 0 ) in minimum time. The system is restricted, satisfy the Kalman rank condition, rank 0 1 1 0 = 2 and S p e c ( A ) L y = 0 . Hence, according to Theorem 2, the system is controllable.
From the Pontryagin Maximum Principle, we should consider two class of controls: u 1 and u 1 and the minimum time curve is built with at most one change of the control.
The family of parabolas generated by the solutions of the differential equations
x · ( t ) = y ( t ) , y ( t ) = 1 and x · ( t ) = y ( t ) , y ( t ) = 1
generates a curve built through two specific parabolas reaching the origin: ϕ with control 1 and ϕ + with control 1. Hence, starting from any arbitrary initial condition ( x 0 , y 0 ) outside this curves, you choice the unique parabola which starting from ( x 0 , y 0 ) and moving in positive time hit one of the curves ϕ or ϕ + . After that, you change the control by remaining in the hitting curve up to reach the target. For instance, if you start from ( x 0 , y 0 ) in the third quadrant and under ϕ , you first take the integral curve γ ( t , ( x 0 , y 0 ) , u 1 ) , which means that you accelerate at maximum up to intersect ϕ . After that, you follow the ϕ trajectory by breaking at maximum and finishing in the origin. Just observe that the projection in the first variable
π 1 ( γ ( t , ( x 0 , y 0 ) , u 1 ) ϕ ) R
give you the distance to the station where you need to change the control.
Example 2.
In the 2-dimensional connected affine group A f f + ( 2 ) , we consider the linear system,
Σ A f f + ( 2 ) : x ˙ = u x y ˙ = x 1 , u U .
According to Theorem, the systems is controllable. Here,
D = 0 0 1 0 , X = 1 0 , and X g = 0 x 1 0 0 .
The Hamiltonian reads,
H ( λ g , g , u ) = λ , F g + u λ , X .
For the unbounded case, we obtain λ ( t ) , X = 0 . Thus,
λ ˙ ( t ) , X = λ ( t ) , D X + u [ X , X ] = λ ( t ) , Y = 0 .
Since, λ is null on a basis of the Lie algebra a f f + ( 2 ) of the group, it follows that λ = 0 . It turns out that no extremal trajectory exists. Actually, in [4] the authors show that the minimal time to reach ( 1 , 1 ) from the identity is 1 but there is not a control u U which connect the states in 1 unit of time.
Next, we analyze the bounded case, u [ 1 , 1 ] . In coordinates λ g = ( p , q ) the Hamiltonian is given by ( 5 ) as
H ( λ g , g , u ) = λ g , X g + u λ g , X g = p u x + q ( x 1 ) .
Therefore, the Hamiltonian equations are:
x ˙ = H p = u x y ˙ = H q = x 1 and p ˙ = H x = u p q q ˙ = H y = 0 .
First of all, q is constant. Now, if for some t 0 : p ( t 0 ) = 0 , then q = q 0 0 . In fact, by the Pontryagin Maximum Principle ( p ( t ) , q 0 ) vanishes nowhere. Since p ˙ ( t 0 ) = q 0 0 . It turns out that an optimal control takes the constant value B or B and changes at most once. In fact, p cannot vanish more than once.
In [15] the authors prove that the system is controllable by showing explicitly the trajectories connecting any two sates. Therefore, let us show how to reach the state ( e , 1 ) from the identity element by an optimal path. According to their computations, the solution starting at any initial condition ( x , y ) G , is given by concatenation of the following two flows
ϕ ( ( x , y ) , u , t ) = ( e u t x , ( e u t 1 ) x u t + y ) , t R , u 0 ϕ ( ( x , y ) , 0 , t ) = ( x , ( x 1 ) t + y ) , t R , u = 0 .
In order to travel to the right side from ( 1 , 0 ) , we need to consider first the control u = 1 . We get,
ϕ ( ( 1 , 0 ) , 1 , t ) = ( e t , ( e t 1 ) t ) , t R .
When, t = 1 , the state of the curve is ( e , e 2 ) . However, the second coordinate does not coincide with our target. Therefore, the optimal control should change from u 1 to u 1 , in some instant t 0 of the curve. Thus, we need to apply the control u 1 , to the initial state ( e t 0 , ( e t 0 1 ) t 0 ) . We obtain,
ϕ ( ( e t 0 , ( e t 0 1 ) t 0 ) , 1 , t ) = ( e t e t 0 , ( 1 e t ) e t 0 t + ( e t 0 1 ) t 0 ) .
It turns out that
t + t 0 = 1 and e t 0 e t + e t 0 1 t 0 = 1 .
From that, we get
e t 0 t 0 = 1 + e 2 .
The continuous function f ( x ) = e x x , satisfy f ( 1 2 ) < 1 + e 2 < f ( 2 ) . Since, f is strict increasing the only one switch time t 0 exists. The optimal curve is given by the optimal control u * ( ζ ) = 1 if 0 < ζ t 0 1 if t 0 < ζ and the optimal time is t = t 0 1 .
Example 3.
For a 3-dimensional semisimple compact group G = S O ( 3 , R ) , we consider the unbounded linear system
Σ S O ( 3 , R ) : g ˙ = X g + u 1 X g + u 2 Y g , where D = a d ( X ) .
Since S p a n L A { X , X , Y } = g the system satisfies the LARC condition. As we know, Σ is controllable.
The associated Hamiltonian function reads as
H ( λ g , g , u ) = λ , F g + u 1 λ , X + u 2 λ , Y .
The maximization condition implies λ ( t ) , X = λ ( t ) , Y = 0 . According to ( 6 ) ,
0 = λ ˙ ( t ) , X = λ ( t ) , ( D X + u 1 a d ( X ) + u 2 a d ( Y ) ) X = λ ( t ) , u 2 Z ,
In the same way,
0 = λ ˙ ( t ) , Y = λ ( t ) , D Y + u 1 Z = λ ( t ) , ( u 1 1 ) Z .
According to the Pontryagin Maximum Principle, if a time optimal minimizer exists, then λ ( t ) , Z 0 . It turns out that u 1 1 , and u 2 0 . So, the only existent minimizers connect two points on the same integral curves of the vector field
g ˙ = X g + X g .
In order to invite the reader to work out an optimal problem of a linear system Σ G , on a 3-dimensional Lie group, we give a matrix representation of the solvable Lie algebras r 2 and e .
  • For r 2 consider the basis
    X = M ( 1 , 1 ) , Y = M ( 2 , 3 ) , Z = M ( 1 , 3 ) .
    With the change of variable Y by Z , we obtain r 2 with the same bracket rules: [ X , Y ] = Y , [ X , Z ] = 0 . The left invariant vector fields are given by
    X g = y x , Y g = y y , Z g = z .
    the associated simply connected matrix Lie group G reads as
    G = { g = y 0 x 0 1 z 0 0 1 : x , z R , y < 0 . } ( x , y , z ) R × R × R .
    with the solvable structure
    ( x 1 , y 1 , z 1 ) ( x 2 , y 2 , z 2 ) = ( x 1 y 1 x 2 , y 1 y 2 , z 1 + z 2 ) .
    The derivation Lie algebra has dimension 4. Precisely, each derivation
    D = a b 0 0 0 0 0 c d : a , b , c , d R ,
    determines the linear vector field
    X g = ( a x + b y + b ) x + ( d z c ln ( y ) ) z .
  • Consider the Lie algebra with a basis
    X = M ( 1 , 3 ) , Y = M ( 2 , 3 ) , Z = M ( 1 , 2 ) M ( 2 , 1 ) ,
    and brackets X , Y = Z , X , Z = Y . With the change of variable X by Y and Y by Z, we recover e .
The associated group is the so called Euclidean group of the affine transformations of R 2 , which preserves the Euclidean metric. It is isomorphic to the order three matrices,
E = P x 0 1 : P P T = I d , x R 2 .
This realization is geometrical. The orthogonal matrix P and the vector x R 2 represents a rotation and translation in the plane, respectively. Again, any derivation is inner, and each linear vector field is associated with D = a d ( U ) , U e .

6. Conclusions

In this article, we describe some existent information of the class of Linear Control Systems Σ G on a low dimensional matrix Lie group G. As a second purpose, we invite the Mathematical community to consider real-world applications of the Pontryagin Maximum Principle and the Equivalence Theorem for Σ G . Also, we challenge some theoretical open problems.
Specifically, we inform about the controllability property; the existence, uniqueness and the shape of control sets, with and without an empty interior. Furthermore, we establish the Pontryagin Maximum Principle for Σ G . We mainly focus on Lie groups of dimension two and three.
Through several examples, we explicitly show how to compute a linear system on a matrix group. We hope the Mathematical community will have the opportunity to take profit of this construction and apply this theory on real world situations.
Through the text we also mention some open problems for Σ G . For instance,
  • To compute the control sets when G has dimension three
  • To characterize the controllability property when G = S L ( 2 , R )
  • To study the optimal control problem with quadratic cost.

Author Contributions

W.V., V.A. and M.T. participated in the concepcion and desisgn of the article. Drafting and revising were mainly doing by V.A. and M.T. All authors have read and agreed to the published version of the manuscript.

Funding

We thanks Universidad Nacional de San Agustín de Arequipa, UNSA, Arequipa, Perú. This article was supported by the Research Project under the Contract IBA-IB-04-2020-UNSA.

Institutional Review Board Statement

Not applicable.

Informed Consent Statement

Informed consent was obtained from all subjects involved in the study.

Data Availability Statement

The data presented in this study are available in the mentioned references.

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Brockett, R.W. Finite Dimensional Linear Systems; John Wiley & Sons: Hoboken, NJ, USA, 1970; ISBN 978-0-471-10585-5. [Google Scholar]
  2. Jurdjevic, V. Geometric Control Theory; Cambridge University Press: Cambridge, UK, 1997. [Google Scholar]
  3. Ayala, V.; Jouan, P. Almost Riemannian Structures and Linear Control Systems on Lie Groups. SIAM J. Control Optim. 2016, 54, 2919–2947. [Google Scholar] [CrossRef] [Green Version]
  4. Ayala, V.; Juan, P.; Torreblanca, M.; Zsigmond, G. Time Optimal Control for Linear Systems on Lie Groups; Submitted to Systems and Control Letters; Elsevier: Amsterdam, The Netherlands, 2020. [Google Scholar]
  5. Aseev, S.M.; Kryazhimskii, A.V. The Pontryagin maximum principle and optimal economic growth problems. Proc. Steklov Inst. Math. 2007, 257, 1–255. [Google Scholar] [CrossRef]
  6. Reeds, J.A.; Sheep, L.A. Optimal paths for a car that goes both forwards and backwards. Pac. J. Math. 1990, 145, 367–393. [Google Scholar] [CrossRef] [Green Version]
  7. Ledzewick, U.; Shattler, H. Optimal controls for a two compartment model for cancer chemoterapy. Optim. Theory Appl. JOTA 2002, 114, 241–246. [Google Scholar]
  8. Zamardzija, N. Qualitative and Control Behavior of a Class of Chemical and Biological Systems. IFAC Proceeding Vol. 1989, 22, 351–355. [Google Scholar] [CrossRef]
  9. Byrnes, C.; Isidori, A. On the Attitude Stabilization of Rigid Spacecraft. Automatica 1991, 27, 87–95. [Google Scholar] [CrossRef]
  10. El-Osery, A. Control and Systems Engineering A Report on Four Decades of Contributions. In Studies in Systems, Decision and Control; Springer International Publishing: Cham, Switzerland, 2015. [Google Scholar]
  11. Mittenhuber, D. Dubin’s Problem in the Hyperbolic Space. Geometric Control and Non-Holonomic Mechanics. In CMS Conference Proceedings; Jurdjevic, V., Sharpe, R.W., Eds.; American Mathematical Society: Providence, RI, USA, 1998. [Google Scholar]
  12. Sussmann, H.J.; Willems, J. Three Centuries of Curves Minimization: From the Brachistochrone to the Maximum Principle. IEEE Control Syst. Mag. 1997, 17, 32–44. [Google Scholar] [CrossRef] [Green Version]
  13. Noether, E. Invariant Variation Problems. Transp. Theory Stat. Phys. 1971, 1, 186–207. [Google Scholar] [CrossRef] [Green Version]
  14. Jouan, P. Equivalence of Control Systems with Linear Systems on Lie Groups and Homogeneous Spaces. ESAIM Control Optim. Calc. Var. 2010, 16, 956–973. [Google Scholar] [CrossRef]
  15. Ayala, V.; Silva, A.D. The control set of a linear control system on the two dimensional Lie group. J. Differ. 2020, 268, 6683–6701. [Google Scholar] [CrossRef]
  16. Ayala, V.; Silva, A.D. On the characterization of the controllability property for linear control systems on nonnilpotent, solvable three-dimensional Lie groups. J. Differ. Equ. 2019, 266, 8233–8257. [Google Scholar] [CrossRef] [Green Version]
  17. Ayala, V.; Silva, A.D.; Jouan, P.; Zsigmond, G. Control sets of linear systems on semi-simple Lie groups. J. Differ. Equ. 2020, 269, 449–466. [Google Scholar] [CrossRef] [Green Version]
  18. Ayala, V.; Silva, A.D. Controllability of Linear Control Systems on Lie Groups with Semisimple Finite Center. SIAM J. Control Optim. 2017, 55, 1332–1343. [Google Scholar] [CrossRef] [Green Version]
  19. Ayala, V.; Martín, L.S. Controllability Properties of a Class of Control Systems on Lie Groups. Lect. Notes Control Inf. Sci. 2001, 1, 83–92. [Google Scholar]
  20. Ayala, V.; Tirao, J. Linear control systems on Lie groups and Controllability. Am. Math. Soc. Ser. Pure Math. 1999, 64, 47–64. [Google Scholar]
  21. Ayala, V.; Todco, M.T. Boundedness of control sets of Linear control systems. Open Math. 2018, 2018, 1–10. [Google Scholar]
  22. Silva, A.D. Controllability of linear systems on solvable Lie groups. SIAM J. Control Optim. 2016, 54, 372–390. [Google Scholar] [CrossRef] [Green Version]
  23. Jouan, P. Controllability of linear systems on Lie groups. J. Dyn. Control Syst. 2011, 17, 591–616. [Google Scholar] [CrossRef]
  24. Jouan, P.; Dath, Ṁ. Controllability of Linear Systems on low dimensional Nilpotent and Solvable Lie groups. J. Dyn. Control Syst. 2016, 22, 207–225. [Google Scholar]
  25. Markus, L. Controllability of multi-trajectories on Lie groups. In Dynamical Systems and Turbulence, Warwick; Lecture Notes in Mathematics; Springer: Berlin/Heidelberg, Germany, 1980; Volume 898, pp. 250–265. [Google Scholar]
  26. Agrachev, A.A.; Sachkov, Y.L. Control Theory from the Geometric Viewpoint; Encyclopaedia of Mathematical Sciences; Control Theory and Optimization II; Springer: Berlin, Germany, 2004; Volume 87. [Google Scholar]
  27. Colonius, F.; Kliemann, W. The Dynamics of Control; Birkhauser: Basel, Switzerland, 2000. [Google Scholar]
  28. Ioffe, A.; Malanowsky, K.; Trolstzsch, F. “50 Years of Optimal Control”, Special Issue, of Control and Cybernetics, 2009/4. Available online: http://control.ibspan.waw.pl:3000/contents/list?year=2009 (accessed on 20 October 2020).
  29. Whonam, M. Linear Multivariable Control: A Geometric Approach; Springer: New York, NY, USA, 1979; Volume 29, pp. 321–331. [Google Scholar]
  30. Boothby, W. An Introduction to Differentiable Manifolds and Riemannian Geometry, 2nd ed.; ser. Pure and Applied Mathematics; Academic Press: Boston, FL, USA, 1986. [Google Scholar]
  31. Elliott, D.L. Bilinear Control Systems: Matrices in Action; Springer: Berlin/Heidelberg, Germany, 2009. [Google Scholar]
  32. Isidori, A. Nonlinear Control Systems; Springer: London, UK, 1989; ISBN 3-540-19916-0. [Google Scholar]
  33. Helgason, S. Differential Geometry, Lie Groups and Symmetric Spaces; Academic Press: Cambridge, MA, USA, 1978. [Google Scholar]
  34. Onishchik, A.L.; Vinberg, E.B. Lie Groups and Lie Algebras III—Structure of Lie Groups and Lie Algebras; Springer: Berlin, Germany, 1994. [Google Scholar]
  35. Martin, L.A.B.S. Algebras de Lie, 2nd ed.; Ed. Unicamp: Campinas, Brazil, 2010. [Google Scholar]
  36. Varadarajan, V. Lie Groups, Lie Algebras, and Their Representations; Springer: New York, NY, USA, 1984. [Google Scholar]
  37. Agrachev, A.A.; Boscain, U.; Charlot, G.; Ghezzi, R.; Sigalotti, M. Two-dimensional almost-Riemannian structures with tangency points. Ann. Inst. H. Poincare Anal. Non Lineaire 2010, 27, 793–807. [Google Scholar] [CrossRef] [Green Version]
  38. Sachkov, Y. Control Theory on Lie Groups. J. Math. Sci. 2009, 156, 381. [Google Scholar] [CrossRef]
  39. Sachkov, Y. Survey on Controllability of Invariant Control Systems on Solvable Lie Groups. AMS Proc. Symp. Pure Math. 1999, 64, 297–317. [Google Scholar]
  40. Pontryagin, L.S.; Boltyanskii, V.G.; Gamkrelidze, R.V.; Mishchenko, E.F. The Mathematical Theory of Optimal Processes; Interscience Publishers John Wiley & Sons, Inc.: New York, NY, USA; London, UK, 1962. [Google Scholar]
Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Share and Cite

MDPI and ACS Style

Ayala, V.; Torreblanca, M.; Valdivia, W. Toward Applications of Linear Control Systems on the Real World and Theoretical Challenges. Symmetry 2021, 13, 167. https://doi.org/10.3390/sym13020167

AMA Style

Ayala V, Torreblanca M, Valdivia W. Toward Applications of Linear Control Systems on the Real World and Theoretical Challenges. Symmetry. 2021; 13(2):167. https://doi.org/10.3390/sym13020167

Chicago/Turabian Style

Ayala, Víctor, María Torreblanca, and William Valdivia. 2021. "Toward Applications of Linear Control Systems on the Real World and Theoretical Challenges" Symmetry 13, no. 2: 167. https://doi.org/10.3390/sym13020167

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop