Brunovsky Decomposition for Dynamic Interval Localization

IEEE TRANSACTIONS ON AUTOMATIC CONTROL(2023)

引用 0|浏览3
暂无评分
摘要
This article proposes a new set-membership method for estimating the trajectories of dynamical systems, when the states are completely unknown and only nonlinear observations are available. The first part of the proposed method is symbolic and follows the decomposition of Brunovsky, i.e., it decomposes the set of differential equations describing the dynamical system into two blocks of constraints: one block gathers nonlinear analytical equations that do not involve differential operators, while the other block is composed of linear chains of integrators. The second part of the method, which relies on the symbolic decomposition, is numerical and based on a contractor approach. It involves a specific optimal operator for narrowing the sets of feasible solutions. This approach is shown to be efficient on a difficult problem of dynamic localization of a mobile robot, without any prior knowledge about its states.
更多
查看译文
关键词
Brunovsky,constraint programming,differential equations,interval analysis,localization,nonlinear system.
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要