期刊
IEEE TRANSACTIONS ON AUTOMATIC CONTROL
卷 63, 期 11, 页码 3675-3688出版社
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/TAC.2018.2797194
关键词
Autonomous systems; computational efficiency; control theory; reachability analysis; scalability; system verification
资金
- CPS Frontiers VehiCal project [CNS-1545126]
- ONR [N00014-09-1-1051, N00014-16-1-2206]
- UC-Philippine-California Advanced Research Institute [IIID-2016-005]
- NSERC PGS-D Program
- NSF Graduate Fellowship
Reachability analysis provides formal guarantees for performance and safety properties of nonlinear control systems. Here, one aims to compute the backward reachable set (BPS) 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 dynamics of a general class of nonlinear systems into subsystems which may be coupled through common states, controls, and disturbances. Despite this coupling, BRSs and BRTs can be computed efficiently using our technique without incurring additional approximation errors and without the need for linearizing dynamics or approximating sets as polytopes. Computations of BRSs and BRTs now become orders of magnitude faster, and for the first time BRSs and BRTs for many high-dimensional nonlinear control systems can be computed using the Hamilton-Jacobi formulation. In situations involving bounded adversarial disturbances, our proposed method can obtain slightly conservative results. We demonstrate our theory by numerically computing BRSs and BRTs for several systems, including the six-dimensional Acrobatic Quadrotor using the HJ formulation.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据