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

基于栅格的角度约束路径规划

Grid-based angle-constrained path planning

Institute for Systems Analysis of Russian Academy of Sciences(俄罗斯科学院系统分析研究所)

Konstantin Yakovlev, Egor Baskin, Ivan Hramoin

摘要:

正方形网格通常用于机器人和游戏开发中作为空间模型,并且在AI社区的启发式搜索算法(例如A*,JPS,Theta* 等)中众所周知。广泛用于网格上的路径规划。大量的研究集中在寻找最短的(在几何意义上)路径,而在许多应用中,寻找平滑的路径(而不是最短的,但包含急转弯)是更可取的。本文研究了光滑路径的生成问题,重点研究了角度约束的路径规划问题。将角度约束路径规划问题形式化,提出了一种新的求解算法-- LIAN算法。我们从理论和实证两个方面对LIAN进行了研究。我们证明它是健全的和完整的(在一定的限制下)。我们还表明,LIAN在解决城市户外导航场景中的众多路径规划任务时优于类似物。

英文摘要:

Square grids are commonly used in robotics and game development as spatial models and well known in AI community heuristic search algorithms (such as A*, JPS, Theta* etc.) are widely used for path planning on grids. A lot of research is concentrated on finding the shortest (in geometrical sense) paths while in many applications finding smooth paths (rather than the shortest ones but containing sharp turns) is preferable. In this paper we study the problem of generating smooth paths and concentrate on angle constrained path planning. We put angle-constrained path planning problem formally and present a new algorithm tailored to solve it - LIAN. We examine LIAN both theoretically and empirically. We show that it is sound and complete (under some restrictions). We also show that LIAN outperforms the analogues when solving numerous path planning tasks within urban outdoor navigation scenarios.

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

↑