Decomposition of Reachable Sets and Tubes for a Class of Nonlinear Systems

@article{Chen2018DecompositionOR,
  title={Decomposition of Reachable Sets and Tubes for a Class of Nonlinear Systems},
  author={Mo Chen and Sylvia L. Herbert and Mahesh S. Vashishtha and Somil Bansal and Claire J. Tomlin},
  journal={IEEE Transactions on Automatic Control},
  year={2018},
  volume={63},
  pages={3675-3688}
}
Reachability analysis provides formal guarantees for performance and safety properties of nonlinear control systems. Here, one aims to compute the backward reachable set (BRS) or tube (BRT)—the set of states from which the system can be driven into a target set at a particular time or within a time interval, respectively. The computational complexity of current approaches scales poorly, making application to high-dimensional systems intractable. We propose a technique that decomposes the… Expand
Guaranteed-Safe Approximate Reachability via State Dependency-Based Decomposition
  • Anjian Li, Mo Chen
  • Computer Science, Mathematics
  • 2020 American Control Conference (ACC)
  • 2020
TLDR
A State Dependency Graph is proposed to represent the system dynamics, and decompose the full system where only dependent states are included in each subsystem, and "missing" states are treated as bounded disturbance so that BRTs can be quickly approximated in lower-dimensional chained subsystems with the guaranteed-safety property preserved. Expand
A Classification-based Approach for Approximate Reachability
TLDR
This paper presents a new method for approximating the optimal controller of the HJ reachability problem for control-affine systems, and explicitly avoid storing a representation of the reachability value function, and instead learn a controller as a sequence of simple binary classifiers. Expand
DeepReach: A Deep Learning Approach to High-Dimensional Reachability
  • Somil Bansal, C. Tomlin
  • Computer Science, Engineering
  • 2021 IEEE International Conference on Robotics and Automation (ICRA)
  • 2021
TLDR
DeepReach is proposed, a method that leverages new developments in sinusoidal networks to develop a neural PDE solver for high-dimensional reachability problems, and achieves comparable results to the state-of-the-art reachability methods. Expand
On the distributed backward reachability problem for large scale systems
Backward reachability (also termed controllability) has been extensively studied in control theory, and tools for a wide class of systems have been developed. Nevertheless, assessing a backwardExpand
On-The-Fly Control of Unknown Systems: From Side Information to Performance Guarantees through Reachability
TLDR
Two data-driven algorithms are developed to over-approximate the reachable set and design control signals for the system on the fly and theoretically show that the resulting algorithm achieves tighter suboptimality bounds with an increasing amount of data and richer side information. Expand
Onthedistributedbackward reachability problem for large scale systems ⋆
Backward reachability (also termed controllability) has been extensively studied in control theory, and tools for a wide class of systems have been developed. Nevertheless, assessing a backwardExpand
Fast Funnel Computation Using Multivariate Bernstein Polynomial
TLDR
A tractable algorithm for computing the funnel of nonlinear systems that are polynomial of state and disturbance that conservatively approximate the value function of the Hamilton-Jacobi-Bellman equation so that the funnel certainly contains the forward reachable set of the system. Expand
Reachability-Based Safety Guarantees using Efficient Initializations
TLDR
It is proved that warm-starting will result in guaranteed conservative solutions by over-approximating the states that must be avoided to maintain safety, and it is also proved that for many common problem formulations, warm-start will results in exact solutions. Expand
Hamilton-Jacobi reachability: A brief overview and recent advances
TLDR
This tutorial presents an overview of basic HJ reachability theory and provides instructions for using the most recent numerical tools, including an efficient GPU-parallelized implementation of a Level Set Toolbox for computing reachable sets. Expand
Verifying Contracts for Perturbed Control Systems using Linear Programming
TLDR
This paper first considers the problem of verifying contracts defined by time-invariant inequalities for unperturbed systems, and uses kinduction to show that contract verification can be achieved by considering a collection of implications between inequalities, which are then recast as linear programs. Expand
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 63 REFERENCES
Exact and efficient Hamilton-Jacobi guaranteed safety analysis via system decomposition
TLDR
Even when the resulting subsystems are coupled, relatively high-dimensional BRSs that were previously intractable or expensive to compute can now be quickly and exactly computed in lower-dimensional subspaces, and the curse of dimensionality is alleviated to a large degree without sacrificing optimality. Expand
Fast reachable set approximations via state decoupling disturbances
TLDR
A flexible method to trade off optimality with computation complexity in HJ reachability analysis by treating state variables as disturbances is proposed, and it is proved that the resulting approximation is conservative in the desired direction. Expand
Exact and Efficient Hamilton-Jacobi-based Guaranteed Safety Analysis via System Decomposition
Hamilton-Jacobi (HJ) reachability is a method that provides rigorous analyses of the safety properties of dynamical systems. This method has been successfully applied to many low-dimensionalExpand
Convex optimization of nonlinear feedback controllers via occupation measures
TLDR
This paper presents a method for designing feedback controllers for polynomial systems that maximize the size of the time-limited backwards reachable set (BRS) and relies on the notion of occupation measures to pose this problem as an infinite-dimensional linear program which can be approximated in finite dimension via semidefinite programs (SDPs). Expand
Overapproximating Reachable Sets by Hamilton-Jacobi Projections
TLDR
This paper devise and implement a method that projects the true reachable set of a high dimensional system into a collection of lower dimensional subspaces where computation is less expensive. Expand
Lagrangian methods for approximating the viability kernel in high-dimensional systems
TLDR
A connection between reachability and viability that enables us to compute the viability kernel using reach sets is described, which is used to construct three viability kernel approximation algorithms for linear systems with convex input and state constraint sets. Expand
A Modified Riccati Transformation for Decentralized Computation of the Viability Kernel Under LTI Dynamics
  • S. Kaynama, M. Oishi
  • Mathematics, Computer Science
  • IEEE Transactions on Automatic Control
  • 2013
TLDR
Conditions under which a linear time-invariant (LTI) system can be suitably decomposed into lower dimensional subsystems so as to admit a conservative computation of the viability kernel in a decentralized fashion in subspaces are studied. Expand
Scalable calculation of reach sets and tubes for nonlinear systems with terminal integrators: a mixed implicit explicit formulation
TLDR
This paper describes a new formulation of mixed implicit explicit (MIE) scheme for reach sets and tubes of systems where some states are terminal integrators: states whose evolution can be written as an integration over time of the other states. Expand
On Ellipsoidal Techniques for Reachability Analysis. Part II: Internal Approximations Box-valued Constraints
TLDR
It appears that the proposed technique may well work for nonellipsoidal, box-valued constraints and this broadens the range of applications of the approach and opens new routes to the arrangement of efficient numerical algorithms. Expand
Minimal Time Problems with Moving Targets and Obstacles
We consider minimal time problems governed by nonlinear systems under general time dependant state constraints and in the two-player games setting. In general, it is known that the characterizationExpand
...
1
2
3
4
5
...