53rd IEEE Conference on Decision and Control 2014
DOI: 10.1109/cdc.2014.7039612
|View full text |Cite
|
Sign up to set email alerts
|

Convex computation of the reachable set for controlled polynomial hybrid systems

Abstract: Abstract-This paper presents an approach to computing the time-limited backwards reachable set (BRS) of a semialgebraic target set for controlled polynomial hybrid systems with semialgebraic state and input constraints. By relying on the notion of occupation measures, the computation of the BRS of a target set that may be distributed across distinct subsystems of the hybrid system, is posed as an infinite dimensional linear program (LP). Computationally tractable approximations to this LP are constructed via a… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
32
0

Year Published

2016
2016
2020
2020

Publication Types

Select...
7
2
1

Relationship

4
6

Authors

Journals

citations
Cited by 38 publications
(32 citation statements)
references
References 15 publications
0
32
0
Order By: Relevance
“…Furthermore, a natural extension of this work would be to include elastic impacts, where many models exist which are amenable to complementarity formulations such as in [51]. Recent work on the computation of regions of attraction for polynomial systems has included convex, moment based approaches [16], with extensions to hybrid systems [46] and control design [30]. A similar approach here might eliminate the requirement for numerically challenging bilinear alternations and allow the problem to be posed as a single convex optimization program.…”
Section: Discussionmentioning
confidence: 99%
“…Furthermore, a natural extension of this work would be to include elastic impacts, where many models exist which are amenable to complementarity formulations such as in [51]. Recent work on the computation of regions of attraction for polynomial systems has included convex, moment based approaches [16], with extensions to hybrid systems [46] and control design [30]. A similar approach here might eliminate the requirement for numerically challenging bilinear alternations and allow the problem to be posed as a single convex optimization program.…”
Section: Discussionmentioning
confidence: 99%
“…This section describes a method to compute an indicator function on the set of times and points that the robot could reach (i.e. the FRS) using SOS programming based on [18], [22], [23]. We construct a time-varying FRS since we are concerned with dynamic environments.…”
Section: Relating Predictions To Trajectoriesmentioning
confidence: 99%
“…This approach uses semi-definite programming to identify the limits of safety in the state space of a system as well as associated controllers for a broad class of nonlinear [5], [6], [7] and hybrid systems [8], [9]. These safe sets can take the form of reachable sets (sets that can reach a known safe state) [10], [9], [5] or invariant sets (sets whose members can be controlled to remain in the set indefinitely) in state space [11], [8], [12]. However, the representation of each of these sets in state space severely restricts the size of the problem that can be tackled by these approaches.…”
Section: Introductionmentioning
confidence: 99%