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

基于混合整数线性规划的刚体路径规划

Rigid Body Path Planning using Mixed-Integer Linear Programming

Massachusetts Institute of Technology(麻省理工学院)

Mingxin Yu, Chuchu Fan

AI总结:

针对现有刚体路径规划方法可扩展性不足的问题,提出一种三阶段MILP算法,通过凸多面体图分解自由空间并求解小型MILP子问题,实现了更短的在线计算时间和更优的扩展性能。

摘要:

在拥挤环境中为刚体对象导航颇具挑战性,尤其是存在狭窄通道时。现有的基于采样的规划器以及混合整数线性规划(MILP)公式等基于优化的方法,在工作空间规模或障碍物数量方面的可扩展性有限。为解决该可扩展性问题,我们提出一种三阶段算法:首先在工作空间的无碰撞区域生成凸多面体图,随后构建大量小型MILP问题以生成多面体之间的可行路径,最后针对起始与目标构型对在线查询可行路径。凸多面体图作为自由工作空间的一种分解形式,通过将子问题限制在2到3个自由多面体(而非整个自由区域)内,控制了每个MILP的决策变量数量。仿真结果表明,与基线方法相比,该方法的在线计算时间更短;在2D和3D环境中,其随环境规模和通道宽度的扩展性能均优于基于采样的规划器。

英文摘要:

Navigating rigid body objects through crowded environments can be challenging, especially when narrow passages are presented. Existing sampling-based planners and optimization-based methods like mixed integer linear programming (MILP) formulations, suffer from limited scalability with respect to either the size of the workspace or the number of obstacles. In order to address the scalability issue, we propose a three-stage algorithm that first generates a graph of convex polytopes in the workspace free of collision, then poses a large set of small MILPs to generate viable paths between polytopes, and finally queries a pair of start and end configurations for a feasible path online. The graph of convex polytopes serves as a decomposition of the free workspace and the number of decision variables in each MILP is limited by restricting the subproblem within two or three free polytopes rather than the entire free region. Our simulation results demonstrate shorter online computation time compared to baseline methods and scales better with the size of the environment and tunnel width than sampling-based planners in both 2D and 3D environments.

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

↑