首页 /研究 /Finding narrow passages with probabilistic roadmaps: the small step retraction method
OTHER

Finding narrow passages with probabilistic roadmaps: the small step retraction method

Mitul Saha, J.-C. Latombe

发表年份
2005
引用次数
51

摘要

The efficiency of probabilistic roadmap (PRM) planners drops dramatically in spaces with narrow passages. This paper presents a new method - small-step retraction - that helps PRM planners find paths through such passages. The method consists of slightly fattening the robot's free space, constructing a roadmap in the fattened free space, and repairing colliding portions of this roadmap by retracting them out of collision. The fattened free space is not explicitly computed. Instead, the robot links and/or obstacles are thinned around their medial axis. A robot configuration lies in fattened free space if the thinned objects do not collide at this configuration. Two repair strategies are used. The "optimist" strategy waits until a complete path has been found in fattened free space before repairing it. The "pessimist" strategy repairs the roadmap as it is being built. The former is faster, but the latter is more reliable. A simple combination yields an integrated planner that is both fast and reliable.

关键词

Probabilistic roadmapFree spaceRobotPlannerPath (computing)Probabilistic logicSpace (punctuation)Motion planningConfiguration spaceComputer science

相关论文

查看 OTHER 分类全部论文