期刊文献+

带有运行成本函数的Hamilton-Jacobi可达性分析

Hamilton-Jacobi reachability analysis with running cost function
下载PDF
导出
摘要 水平集方法将可达集表示为Hamilton-Jacobi方程解的零水平集,保存多个不同时间范围的可达集则需要保存Hamilton-Jacobi方程在多个时刻的解,这不仅需要消耗大量的存储空间还为控制律的设计造成了困难.针对这些局限性,提出了一种改进的基于Hamilton-Jacobi方程的可达集表示方法.该方法在Hamilton-Jacobi方程中加入了一项运行成本函数,可以用同一个时刻的解的多个非零水平集表示多个不同时间范围的可达集,极大地节省了存储空间并为控制律的设计提供了便利.为了求解所构造的带有运行成本函数的Hamilton-Jacobi方程,采用了一种基于递归和插值的方法.最后,通过一些数值算例验证了所提出的方法的精确性、在存储空间方面的优越性以及设计的控制律的有效性. The level set method represents the reachable set as the zero level set of the solution to a Hamilton-Jacobi equation.Saving reachable sets with different time horizons requires saving the Hamilton-Jacobi equation solution at different moments.This not only consumes a lot of storage space but also creates difficulties in the design of the control law.To address these limitations,an improved representation of the reachable set based on the Hamilton-Jacobi equation is proposed.The method adds a running cost function to the Hamilton-Jacobi equation so that multiple reachable sets of different time horizons can be represented by multiple non-zero level sets of solutions at the same moment,which greatly saves storage space and facilitates the design of control laws.To solve the constructed Hamilton-Jacobi equation with a running cost function,a recursive and interpolation-based method is used.Finally,some numerical examples are provided to verify not only the accuracy of our method and its superiority in terms of storage space,but also the effectiveness of the designed control law.
作者 廖玮 梁涛涛 魏小辉 LIAO Wei;LIANG Tao-tao;WEI Xiao-hui(State Key Laboratory of Mechanics and Control of Mechanical Structures,Nanjing University of Aeronautics and Astronautics,Nanjing Jiangsu 210016,China;Key laboratory of Fundamental Science for National Defense-Advanced Design Technology of Flight Vehicle,Nanjing University of Aeronautics and Astronautics,Nanjing Jiangsu 210016,China)
出处 《控制理论与应用》 EI CAS CSCD 北大核心 2022年第6期986-994,共9页 Control Theory & Applications
基金 国家自然科学基金项目(51905264) 国防科技卓越青年科学基金项目(2018-JCJQ-ZQ-053) 中央高校基本科研业务费专项资金项目(NP2018001)资助.
关键词 可达集 水平集方法 HAMILTON-JACOBI方程 最优控制 reachable set level set method Hamilton-Jacobi equation optimal control
  • 相关文献

参考文献4

二级参考文献28

  • 1张苗苗,谢剑英.切换连续系统的可达性分析[J].上海交通大学学报,2000,34(12):1641-1644. 被引量:1
  • 2MAYNE D Q, SERON M M, RAKOVI'C S V. Robust model pre- dictive control of constrained linear systems with bounded distur- bances [J]. Automatica, 2005, 41(2): 219 - 224.
  • 3LANGSON W, CHRYSSOCHOOS I, RAKOVI'C S V, et al. Robust model predictive control using tube [J]. Automatica, 2004, 40(1): 125 - 133.
  • 4RAKOVI'C S V, MAYNE D Q. A simple tube controller for efficient robust model predictive control of constrained linear discrete time systems subjective to bounded disturbances [C] //Proceedings of the 16th IFAC World Congress. Prague: IFAC, 2005.
  • 5RAKOVI'C S V, TEEL A R, MAYNE D Q, et al. Simple robust con- trol invariant tubes for some classes of nonlinear discrete time sys- tems [C]//Proceedings of the 45th IEEE Conference on Decision & Control. San Diego: IEEE, 2006:6397 - 6402.
  • 6LIMON D, ALVARADO I, ALAMO T, et al. Robust tube-based on MPC for tracking of constrained linear system with additive distur- bances [J]. Journal of Process Control, 2010, 20(3): 248 - 260.
  • 7RAKOVI'C S V, KERRIGAN E C, KOURAMAS K I, et al. lnvariant approximation of the minimal robust positively invariant set [J]. IEEE Transactions on Automatic Control, 2005, 50(3): 406 - 410.
  • 8BRAVO J M, ALAMO T, CAMACHO E F. Robust MPC of con- strained discrete-time nonlinear systems based on approximated reachable sets [J]. Automatica, 2006, 42(10): 1745 - 1751.
  • 9RAISSI T, RAMDANI N, CANDAU Y. Set membership state and parameter estimation for systems described by nonlinear differential equations [J]. Automatica, 2004, 40(10): 1771 - 1777.
  • 10WAN Z Y, KOTHARE M V. An effective off-line formulation of ro- bust constrained model predictive control using LMI [J]. Automatica, 2003, 39(5): 827 - 846.

共引文献25

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部