RUS  ENG
Full version
JOURNALS // Trudy Instituta Matematiki i Mekhaniki UrO RAN // Archive

Trudy Inst. Mat. i Mekh. UrO RAN, 2025 Volume 31, Number 2, Pages 244–261 (Mi timm2187)

On the construction of suboptimal trajectories for a linear control system with state constraints on part of variables

P. A. Tochilin, M. V. Parshikov

Lomonosov Moscow State University, Faculty of Computational Mathematics and Cybernetics

Abstract: The article considers the problem of controlling a linear system of differential equations under state constraints and pointwise restrictions on control parameters. Such problems are often found in applications from robotics, in the field of controlling autonomous movement on a plane or in space. As a rule, it is not possible to obtain an exact mathematical solution to such problems, and traditional numerical methods may be ineffective due to their slow speed. In recent years, methods for approximating solutions of control problems with state constraints using random graphs have become widespread. They have shown high efficiency in the case of trivial dynamics of a controlled object when it is possible to move without inertia along broken lines. However, problems with so-called kinodynamic constraints (when dynamics are described by nontrivial differential equations) have remained unsolved until recently. Significant progress in this area has been achieved by combining the ideas of constructing random graphs and ellipsoidal estimation techniques developed earlier by academician A. B. Kurzhanski and his students. This article continues the research in this area. The authors propose a new modification of the previously developed methods, which increases its effectiveness and makes it suitable for solving specific applied problems. The improvement of the method's characteristics was achieved by allocating the variables responsible for state constraints and separately processing such variables and the remaining part of the state vector.

Keywords: optimal control, state constraints, random graph, ellipsoidal calculus, ellipsoidal synthesis, reachability set.

UDC: 517.977, 519.6, 004.02

MSC: 9B03, 93B40, 93B52, 49M30, 49N05

Received: 29.01.2025
Revised: 26.02.2025
Accepted: 03.03.2025

DOI: 10.21538/0134-4889-2025-31-2-fon-03



Bibliographic databases:


© Steklov Math. Inst. of RAS, 2026