Optimization of the reachable set of a linear system with respect to another set

DOI10.1134/S0965542523050056MaRDI QIDQ6167989zbMATH OpenOpenAlexFDO

Authors Maxim V. Balashov

Publication date 10 July 2023

Published in Computational Mathematics and Mathematical Physics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1134/s0965542523050056

zbMATH Keywords

approximation in Hausdorff metriccondition of nonempty interiorlinear programmingmultivalued integralreachable setuniform convexity

Mathematics Subject Classification ID

Optimality conditions for problems involving ordinary differential equations (49K15) Linear programming (90C05) Attainable sets, reachability (93B03)

Recommendations

• One time-optimal problem for a set-valued linear control system
• ESTIMATES OF REACHABLE SETS FOR LINEAR SYSTEMS
• Algorithm for determining the reachability set of a linear control system
• The time-optimal problem with linear terminal set
• Strong convexity of reachable sets of linear systems

Cites work

• M-strongly convex subsets and their generating sets
• A Steepest-Ascent Method for Solving Optimum Programming Problems
• A Survey of Viability Theory
• Convexity properties of the minimum time function
• Covering a set by a convex compactum: error estimates and computation
• Dynamics and control of trajectory tubes. Theory and computation
• Elements of convex and strongly convex analysis
• Geometry of Banach spaces. Selected topics
• Gradient Theory of Optimal Flight Paths
• scientific article; zbMATH DE number 3855514 (Why is no real title available?)
• scientific article; zbMATH DE number 3256013 (Why is no real title available?)
• scientific article; zbMATH DE number 3338075 (Why is no real title available?)
• scientific article; zbMATH DE number 3039539 (Why is no real title available?)
• Integrals of set-valued functions
• Large deviations for non-zero initial conditions in linear systems
• On polyhedral approximations in an n-dimensional space
• Overapproximating Reachable Tubes of Linear Time-Varying Systems
• Polyhedral approximations of strictly convex compacta
• Reachability analysis of linear systems using support functions
• Strong convexity of reachable sets of linear systems
• Strongly convex analysis

Cited in

(3)

• Reachable set computation of linear systems with nonconvex constraints via convex optimization
• scientific article; zbMATH DE number 5488843 (Why is no real title available?)
• Interior of the integral of a set-valued mapping and problems with a linear control system

This page was built for publication: Optimization of the reachable set of a linear system with respect to another set

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6167989)