Sampling-based approximation of the viability kernel for high-dimensional linear sampled-data systems

HSCC 2014 - Proceedings of the 17th International Conference on Hybrid Systems: Computation and Control (Part of CPS Week)

Volumn , Issue , 2014, Pages 173-182

  Gillula, Jeremy H ^a   Kaynama, Shahab ^a   Tomlin, Claire J ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Constrained sampled data systems; Sampling based algorithms; Viability kernel approximations

Indexed keywords

EMBEDDED SYSTEMS; HYBRID SYSTEMS; SAMPLED DATA CONTROL SYSTEMS;

CONVERGENCE PROPERTIES; CYBER PHYSICAL SYSTEMS (CPSS); HIGH-DIMENSIONAL; INPUT AND STATE CONSTRAINTS; KERNEL APPROXIMATION; SAMPLED DATA SYSTEMS; SAMPLING-BASED ALGORITHMS; SPACE CONSTRAINTS;

APPROXIMATION ALGORITHMS;

EID: 84899705681     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2562059.2562117     Document Type: Conference Paper

References (35)

1. M. Althoff, O. Stursberg, and M. Buss. Reachability analysis of linear systems with uncertain parameters and inputs. In Proc. IEEE Conf. Decis. Contr., pages 726-732, 2007.
2. J.-P. Aubin. Viability Theory. Systems and Control: Foundations and Applications. Birkhäuser, Boston, 1991.
3. I. Bárány and Z. Füredi. Computing the volume is difficult. Discrete Comput. Geom., 2(1):319-326, 1987.
4. F. Blanchini and S. Miani. Set-Theoretic Methods in Control. Springer, 2008.
5. G. E. Bredon. Topology and Geometry, volume 139. Springer, 1993.
6. P.-A. Coquelin, S. Martin, and R. Munos. A dynamic programming approach to viability problems. In Proc. IEEE Symp. Adapt. Dyn. Program. Reinf. Learn., pages 178-184, 2007.
7. M. Dyer. Computing the volume of convex bodies: a case where randomness provably helps. Probabilistic combinatorics and its applications, 44:123-170, 1991.
8. M. Ghomi. The problem of optimal smoothing for convex functions. Proc. Am. Math. Soc., 130(8):2255-2260, 2002.
9. M. Ghomi. Optimal Smoothing for Convex Polytopes. Bull. London Math. Soc., 36(4):483-492, July 2004.
10. A. Girard and C. Le Guernic. Efficient reachability analysis for linear systems using support functions. In Proc. IFAC World Congr., Seoul, Korea, July 2008.
11. A. Girard, C. Le Guernic, and O. Maler. Efficient computation of reachable sets of linear time-invariant systems with inputs. In J. Hespanha and A. Tiwari, editors, Proc. Hybrid Syst.: Comput. Contr., pages 257-271. Springer-Verlag, 2006.
12. G. Goodwin, J. Aguero, M. Cea Garridos, M. Salgado, and J. Yuz. Sampling and sampled-data models: The interface between the continuous world and digital algorithms. IEEE Contr. Syst. Mag., 33(5):34-53, 2013.
13. Z. Han and B. H. Krogh. Reachability analysis of nonlinear systems using trajectory piecewise linearized models. In Proc. Am. Contr. Conf., pages 1505-1510, Minneapolis, MN, 2006.
14. D. Henrion and M. Korda. Convex computation of the region of attraction of polynomial control systems. preprint arXiv:1208.1751, 2012.
15. S. Kaynama, J. Maidens, M. Oishi, I. M. Mitchell, and G. A. Dumont. Computing the viability kernel using maximal reachable sets. In Proc. Hybrid Syst.: Comput. Contr., pages 55-63, Beijing, 2012.
16. S. Kaynama and M. Oishi. A modified Riccati transformation for decentralized computation of the viability kernel under LTI dynamics. IEEE Trans. Autom. Contr., 58(11):2878-2892, 2013.
17. A. B. Kurzhanski and P. Varaiya. Ellipsoidal techniques for reachability analysis: internal approximation. Syst. Contr. Lett., 41:201-211, 2000.
18. M. Kvasnica, P. Grieder, M. Baotić, and M. Morari. Multi-Parametric Toolbox (MPT). In R. Alur and G. J. Pappas, editors, Proc. Hybrid Syst.: Comput. Contr., LNCS 2993, pages 448-462, Berlin, Germany, 2004. Springer.
19. M. Liou. A novel method of evaluating transient response. Proceedings of the IEEE, 54(1):20-23, 1966.
20. J. Löfberg. YALMIP: a toolbox for modeling and optimization in MATLAB. In Proc. Comput. Aided Contr. Syst. Des., pages 284-289, 2004.
21. J. Maidens, S. Kaynama, I. M. Mitchell, M. Oishi, and G. A. Dumont. Lagrangian methods for approximating the viability kernel in high-dimensional systems. Automatica, 49(7):2017-2029, 2013.
22. A. Majumdar and R. Tedrake. Robust online motion planning with regions of finite time invariance. In E. Frazzoli, T. Lozano-Perez, N. Roy, and D. Rus, editors, Algorithmic Found. Robot. X, pages 543-558. Springer Berlin Heidelberg, 2013.
23. A. Majumdar, R. Vasudevan, M. M. Tobenkin, and R. Tedrake. Technical report: Convex optimization of nonlinear feedback controllers via occupation measures. preprint arXiv:1305.7484, 2013.
24. I. M. Mitchell. Scalable calculation of reach sets and tubes for nonlinear systems with terminal integrators: a mixed implicit explicit formulation. In Proc. Hybrid Syst.: Comput. Contr., pages 103-112, Chicago, IL, 2011. ACM.
25. I. M. Mitchell, A. M. Bayen, and C. J. Tomlin. A time-dependent Hamilton-Jacobi formulation of reachable sets for continuous dynamic games. IEEE Trans. Autom. Contr., 50(7):947-957, July 2005.
26. I. M. Mitchell, S. Kaynama, M. Chen, and M. Oishi. Safety preserving control synthesis for sampled data systems. Nonlinear Anal.: Hybrid Syst., 10:63-82, 2013.
27. J. Pitman. Probability. Springer-Verlag, New York, 1993.
28. S. Prajna and A. Jadbabaie. Safety verification of hybrid systems using barrier certificates. In Proc. Hybrid Syst.: Comput. Contr., pages 477-492, 2004.
29. P. Saint-Pierre. Approximation of the viability kernel. Appl. Math. Optim., 29(2):187-209, Mar 1994.
30. C. Schütt and E. Werner. Polytopes with Vertices Chosen Randomly from the Boundary of a Convex Body. In V. Milman and G. Schechtman, editors, Geom. Aspects Funct. Anal., volume 1807 of Lect. Notes Math., pages 241-422. Springer Berlin, 2003.
31. C. Standish. Truncated Taylor series approximation to the state transition matrix of a continuous parameter finite Markov chain. Linear Algebra Appl., 12(2):179-183, 1975.
32. W. Tan and A. Packard. Searching for control lyapunov functions using sums of squares programming. In Annual Allerton Conf., pages 210-219, 2004.
33. R. Tedrake, I. R. Manchester, M. Tobenkin, and J. W. Roberts. LQR-trees: Feedback motion planning via sums-of-squares verification. Int. J. Robot. Res., 29(8):1038-1052, 2010.
34. M. Tobenkin, I. Manchester, and R. Tedrake. Invariant funnels around trajectories using sum-of-squares programming. In Proc. IFAC World Congr., volume 18, pages 9218-9223, Milano, Italy, 2011.
35. U. Topcu, A. Packard, and P. Seiler. Local stability analysis using simulations and sum-of-squares programming. Automatica, 44(10):2669-2675, 2008.