运动规划
约束(计算机辅助设计)
插值(计算机图形学)
路径(计算)
数学优化
代表(政治)
碰撞检测
数学
碰撞
序列(生物学)
算法
机器人
同伦
计算机科学
任意角度路径规划
线性插值
拓扑(电路)
避碰
系列(地层学)
正多边形
同伦提升性质
抽象
理论计算机科学
作者
Minji Lee,Jeongmin Lee,Dongjun Lee
标识
DOI:10.1109/tro.2025.3641759
摘要
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. We propose a Homotopy Optimization Method (HOM) tailored for the narrow passage problem, utilizing a novel collision constraint interpolation method using signed distance functions (SDF). The framework begins by decomposing the environment into convex objects and representing it as a simplicial complex based on their connectivity. This representation enables topological analysis to induce a easy-to-hard sequence of collision constraint interpolation that preserves homotopy equivalence. Using this collision constraint interpolation, the optimization proceeds through a series of subproblems, gradually guiding the path to the final solution. Several examples are presented to demonstrate how the proposed framework addresses narrow passage path planning problems.
科研通智能强力驱动
Strongly Powered by AbleSci AI