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

Symmetry ◽  
2021 ◽  
Vol 13 (2) ◽  
pp. 167
Author(s):  
Víctor Ayala ◽  
María Torreblanca ◽  
William Valdivia
Keyword(s):  
Maximum Principle ◽  
Control Systems ◽  
Lie Group ◽  
Real World ◽  
Pontryagin Maximum Principle ◽  
Optimization Problems ◽  
Linear Control ◽  
Linear Control Systems ◽  
Open Problems ◽  
The Pontryagin Maximum Principle

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 Rn. 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.

A numerical method for the approximation of reachable sets of linear control systems

2017 ◽  
Vol 36 (2) ◽  
pp. 423-441 ◽  
Author(s):  
Lizhen Shao ◽  
Fangyuan Zhao ◽  
Guangda Hu
Keyword(s):  
Numerical Method ◽  
Control Systems ◽  
Optimization Problems ◽  
Approximation Error ◽  
Outer Approximation ◽  
Reachable Sets ◽  
Linear Control ◽  
Superior Performance ◽  
Linear Control Systems ◽  
Inner Approximation

Abstract In this article, a numerical method for the approximation of reachable sets of linear control systems is discussed. First a continuous system is transformed into a discrete one with Runge–Kutta methods. Then based on Benson’s outer approximation algorithm for solving multiobjective optimization problems, we propose a variant of Benson’s algorithm to sandwich the reachable set of the discrete system with an inner approximation and an outer approximation. By specifying an approximation error, the quality of the approximations measured in Hausdorff distance can be directly controlled. Furthermore, we use an illustrative example to demonstrate the working of the algorithm. Finally, computational experiments illustrate the superior performance of our proposed algorithm compared to a recent algorithm in the literature.

scholarly journals Regularized classical optimality conditions in iterative form for convex optimization problems for distributed Volterra-type systems

2021 ◽  
Vol 31 (2) ◽  
pp. 265-284
Author(s):  
V.I. Sumin ◽  
M.I. Sumin
Keyword(s):  
Optimal Control ◽  
Maximum Principle ◽  
Optimal Control Problem ◽  
Control Problem ◽  
Optimality Conditions ◽  
Pontryagin Maximum Principle ◽  
Optimization Problems ◽  
Approximate Solutions ◽  
Lagrange Principle ◽  
The Pontryagin Maximum Principle

We consider the regularization of the classical optimality conditions (COCs) — the Lagrange principle and the Pontryagin maximum principle — in a convex optimal control problem with functional constraints of equality and inequality type. The system to be controlled is given by a general linear functional-operator equation of the second kind in the space $L^m_2$, the main operator of the right-hand side of the equation is assumed to be quasinilpotent. The objective functional of the problem is strongly convex. Obtaining regularized COCs in iterative form is based on the use of the iterative dual regularization method. The main purpose of the regularized Lagrange principle and the Pontryagin maximum principle obtained in the work in iterative form is stable generation of minimizing approximate solutions in the sense of J. Warga. Regularized COCs in iterative form are formulated as existence theorems in the original problem of minimizing approximate solutions. They “overcome” the ill-posedness properties of the COCs and are regularizing algorithms for solving optimization problems. As an illustrative example, we consider an optimal control problem associated with a hyperbolic system of first-order differential equations.

scholarly journals Observability and Symmetries of Linear Control Systems

Symmetry ◽  
2020 ◽  
Vol 12 (6) ◽  
pp. 953
Author(s):  
Víctor Ayala ◽  
Heriberto Román-Flores ◽  
María Torreblanca Todco ◽  
Erika Zapana
Keyword(s):  
Euclidean Space ◽  
Control Systems ◽  
Lie Groups ◽  
Lie Group ◽  
Linear Control ◽  
Linear Control Systems ◽  
Euclidean Spaces ◽  
General Setup ◽  
Connected Lie Group

The goal of this article is to compare the observability properties of the class of linear control systems in two different manifolds: on the Euclidean space R n and, in a more general setup, on a connected Lie group G. For that, we establish well-known results. The symmetries involved in this theory allow characterizing the observability property on Euclidean spaces and the local observability property on Lie groups.

Fractional Vector-Order h-Realisation of the Impulse Response Function

2020 ◽  
Vol 14 (2) ◽  
pp. 108-113
Author(s):  
Ewa Pawłuszewicz
Keyword(s):  
Control Systems ◽  
Impulse Response ◽  
Response Function ◽  
Impulse Response Function ◽  
Linear Control ◽  
Linear Control Systems

AbstractThe problem of realisation of linear control systems with the h–difference of Caputo-, Riemann–Liouville- and Grünwald–Letnikov-type fractional vector-order operators is studied. The problem of existing minimal realisation is discussed.

Sign in / Sign up

Export Citation Format

Share Document