Underapproximating backward reachable sets by semialgebraic sets
Underapproximations (UAs) of backward reachable sets play an important role in controller synthesis and trajectory analysis for constrained nonlinear dynamical systems, but there are few methods available to compute them. Given a nonlinear system, a target region of simply connected compact type and...
Main Authors: | Xue, Bai, She, Zhikun, Easwaran, Arvind |
---|---|
Other Authors: | School of Computer Science and Engineering |
Format: | Journal Article |
Language: | English |
Published: |
2018
|
Subjects: | |
Online Access: | https://hdl.handle.net/10356/89488 http://hdl.handle.net/10220/44941 |
Similar Items
-
CONVEXITY OF REACHABLE SETS OF QUASILINEAR SYSTEMS
by: Ivan Osipov
Published: (2023-12-01) -
Efficient simplicial replacement of semialgebraic sets
by: Saugata Basu, et al.
Published: (2023-01-01) -
Rapid Construction of Aerocapture Attainability Sets Using Sequential Convex Programming
by: Rui Teng, et al.
Published: (2022-06-01) -
A Geometrical, Reachable Set Approach for Constrained Pursuit–Evasion Games with Multiple Pursuers and Evaders
by: Olli Jansson, et al.
Published: (2023-05-01) -
On semiconvexity of open sets with smooth boundary in the plane
by: Tetiana Osipchuk
Published: (2020-05-01)