arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2406.01802cs.ROcs.SYeess.SY
收藏

混合动力系统的运动规划:框架、算法模板与一种基于采样的方法

Motion Planning for Hybrid Dynamical Systems: Framework, Algorithm Template, and a Sampling-based Approach

University of California, Santa Cruz(加州大学圣克鲁兹分校)

Nan Wang, Ricardo G. Sanfelice

AI总结:

本文研究混合动力系统的运动规划问题,提出通用算法模板及基于采样的HyRRT方法,通过流或跳跃扩展搜索树,并证明其具有概率完备性,应用于弹球和行走机器人系统验证了有效性。

摘要:

本文关注同时表现出连续和离散行为的系统的运动规划问题,我们将其称为混合动力系统。首先,使用混合方程框架对混合系统的运动规划问题进行建模,该框架具有通用性,能够描述大多数混合系统。其次,提出了一种传播算法模板,描述了解决混合系统运动规划问题的通用框架。第三,针对所提出的算法模板,设计了一种快速探索随机树(RRT)的实现,以解决混合系统的运动规划问题。在每次迭代中,所提出的算法(称为 HyRRT)随机选取一个状态样本,并通过流或跳跃来扩展搜索树,当两种状态机制均可行时,跳跃或流的选择也是随机的。通过定义在混合时间域上的函数拼接,我们证明了 HyRRT 具有概率完备性,即随着算法迭代次数的增加,无法找到运动规划方案的概率趋近于零。在定义运动规划的数据上施加温和条件即可保证此性质,这些条件包括对经典系统文献中通常施加的正向间隙假设的放宽。运动规划方案通过求解两个优化问题来计算得出,一个与系统的流相关,另一个与系统的跳跃相关。所提出的算法被应用于一个驱动弹球系统和一个行走机器人系统,以突出其通用性和计算特性。

英文摘要:

This paper focuses on the motion planning problem for the systems exhibiting both continuous and discrete behaviors, which we refer to as hybrid dynamical systems. Firstly, the motion planning problem for hybrid systems is formulated using the hybrid equation framework, which is general to capture most hybrid systems. Secondly, a propagation algorithm template is proposed that describes a general framework to solve the motion planning problem for hybrid systems. Thirdly, a rapidly-exploring random trees (RRT) implementation of the proposed algorithm template is designed to solve the motion planning problem for hybrid systems. At each iteration, the proposed algorithm, called HyRRT, randomly picks a state sample and extends the search tree by flow or jump, which is also chosen randomly when both regimes are possible. Through a definition of concatenation of functions defined on hybrid time domains, we show that HyRRT is probabilistically complete, namely, the probability of failing to find a motion plan approaches zero as the number of iterations of the algorithm increases. This property is guaranteed under mild conditions on the data defining the motion plan, which include a relaxation of the usual positive clearance assumption imposed in the literature of classical systems. The motion plan is computed through the solution of two optimization problems, one associated with the flow and the other with the jumps of the system. The proposed algorithm is applied to an actuated bouncing ball system and a walking robot system so as to highlight its generality and computational features.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑