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

利用碰撞约束插值进行狭窄通道路径规划

Narrow Passage Path Planning using Collision Constraint Interpolation

Seoul National University(首尔大学)

Minji Lee, Jeongmin Lee, Dongjun Lee

AI总结:

针对狭窄通道路径规划中可行路径难找、计算开销大及深度穿透导致优化失败的问题,提出通过碰撞约束插值生成序列子问题的优化框架。

摘要:

狭窄通道路径规划是从工业场景到家庭场景中普遍存在的问题,往往面临难以找到可行路径或需要过多计算资源的困难。鉴于对环境的深度穿透可能导致优化失败,我们提出了一个框架,通过使用一系列为狭窄通道问题定制的子问题,在整个过程中确保可行性。我们首先将环境分解为凸对象,并使用这些对象的一个子集初始化碰撞约束。通过在按顺序引入其余对象的过程中持续对碰撞约束进行插值,我们提出的框架生成了一系列子问题,引导优化朝着解决狭窄通道问题的方向进行。文中给出了若干示例,以展示所提框架如何处理狭窄通道路径规划问题。

英文摘要:

Narrow passage path planning is a prevalent problem from industrial to household sites, often facing difficulties in finding feasible paths or requiring excessive computational resources. Given that deep penetration into the environment can cause optimization failure, we propose a framework to ensure feasibility throughout the process using a series of subproblems tailored for narrow passage problem. We begin by decomposing the environment into convex objects and initializing collision constraints with a subset of these objects. By continuously interpolating the collision constraints through the process of sequentially introducing remaining objects, our proposed framework generates subproblems that guide the optimization toward solving the narrow passage problem. Several examples are presented to demonstrate how the proposed framework addresses narrow passage path planning problems.

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

↑