Safe Returning FaSTrack with Robust Control Lyapunov-Value Functions (2404.02472v1)
Abstract: Real-time navigation in a priori unknown environment remains a challenging task, especially when an unexpected (unmodeled) disturbance occurs. In this paper, we propose the framework Safe Returning Fast and Safe Tracking (SR-F) that merges concepts from 1) Robust Control Lyapunov-Value Functions (R-CLVF), and 2) the Fast and Safe Tracking (FaSTrack) framework. The SR-F computes an R-CLVF offline between a model of the true system and a simplified planning model. Online, a planning algorithm is used to generate a trajectory in the simplified planning space, and the R-CLVF is used to provide a tracking controller that exponentially stabilizes to the planning model. When an unexpected disturbance occurs, the proposed SR-F algorithm provides a means for the true system to recover to the planning model. We take advantage of this mechanism to induce an artificial disturbance by ``jumping'' the planning model in open environments, forcing faster navigation. Therefore, this algorithm can both reject unexpected true disturbances and accelerate navigation speed. We validate our framework using a 10D quadrotor system and show that SR-F is empirically 20\% faster than the original FaSTrack while maintaining safety.
- Z. Gong and S. Herbert, “Robust control lyapunov-value functions for nonlinear disturbed systems,” https://arxiv.org/abs/2403.03455, 2024.
- M. Chen*, S. Herbert*, H. Hu, Y. Pu, J. Fisac, S. Bansal, S. Han, and C. Tomlin, “Fastrack: a modular framework for real-time motion planning and guaranteed safe tracking,” in Trans. on Automatic Control. IEEE, 2020.
- E. W. Dijkstra, “A note on two problems in connection with graphs,” in Edsger Wybe Dijkstra: His Life, Work, and Legacy, 2022.
- P. E. Hart, N. J. Nilsson, and B. Raphael, “A formal basis for the heuristic determination of minimum cost paths,” Trans. on Systems Science and Cybernetics, 1968.
- J. Bruce and M. Veloso, “Real-time randomized path planning for robot navigation,” in International Conference on Intelligent Robots and Systems. IEEE, 2002.
- A. Stentz et al., “The focused D^* algorithm for real-time replanning,” in International Joint Conferences on Artificial Intelligence, 1995.
- M. Likhachev, D. I. Ferguson, G. J. Gordon, A. Stentz, and S. Thrun, “Anytime dynamic a*: An anytime, replanning algorithm,” in International Conference on Automated Planning and Scheduling, 2005.
- P. Bouffard, “On-board model predictive control of a quadrotor helicopter: Design, implementation, and experiments,” Master’s thesis, EECS Department, University of California, Berkeley, Dec 2012.
- J. M. Bravo, T. Alamo, and E. F. Camacho, “Robust mpc of constrained discrete-time nonlinear systems based on approximated reachable sets,” Automatica, 2006.
- K. K. Hassan et al., “Nonlinear systems,” Departement of Electrical and Computer Engineering, Michigan State University, 2002.
- Z. Artstein, “Stabilization with relaxed controls,” Nonlinear Analysis: Theory, Methods & Applications, 1983.
- E. D. Sontag, “A ‘universal’ construction of Artstein’s theorem on nonlinear stabilization,” Systems & control letters, 1989.
- A. D. Ames, S. Coogan, M. Egerstedt, G. Notomista, K. Sreenath, and P. Tabuada, “Control barrier functions: Theory and applications,” in European Control Conf. IEEE, 2019.
- L. C. Evans and P. E. Souganidis, “Differential games and representation formulas for solutions of Hamilton-Jacobi-Isaacs equations,” Indiana University Mathematics Journal, 1984.
- S. Bansal, M. Chen, S. Herbert, and C. J. Tomlin, “Hamilton-jacobi reachability: A brief overview and recent advances,” in Conference on Decision and Control. IEEE, 2017.
- J. F. Fisac, M. Chen, C. J. Tomlin, and S. S. Sastry, “Reach-avoid problems with time-varying dynamics, targets and constraints,” in Hybrid Systems: Computation and Control. ACM, 2015.
- F. S. Barbosa, L. Lindemann, D. V. Dimarogonas, and J. Tumova, “Provably safe control of lagrangian systems in obstacle-scattered environments,” in Conference on Decision and Control. IEEE, 2020.
- A. Manjunath and Q. Nguyen, “Safe and robust motion planning for dynamic robotics via control barrier functions,” in Conference on Decision and Control. IEEE, 2021.
- Z. Li and N. Atanasov, “Governor-parameterized barrier function for safe output tracking with locally sensed constraints,” Automatica, 2023.
- D. Fridovich-Keil, S. L. Herbert, J. F. Fisac, S. Deglurkar, and C. J. Tomlin, “Planning, fast and slow: A framework for adaptive real-time safe trajectory planning,” in International Conference on Robotics and Automation. IEEE, 2018.
- A. Sahraeekhanghah and M. Chen, “Pa-fastrack: Planner-aware real-time guaranteed safe planning,” in Conference on Decision and Control. IEEE, 2021.
- Gavin, “Multiple rapidly-exploring random tree (rrt),” https://www.mathworks.com/matlabcentral/fileexchange/21443-multiple-rapidly-exploring-random-tree-rrt, 2024.
- C. He, Z. Gong, M. Chen, and S. Herbert, “Efficient and guaranteed hamilton–jacobi reachability via self-contained subsystem decomposition and admissible control sets,” Control Systems Letters, 2023.