期刊
AUTONOMOUS ROBOTS
卷 33, 期 3, 页码 273-290出版社
SPRINGER
DOI: 10.1007/s10514-012-9304-1
关键词
Robot path planning; Topological constraints; Graph search; Homotopy; Homology
资金
- ONR Antidote MURI project [N00014-09-1-1031]
- ONR [N00014-08-1-0696, N00014-09-1-1052]
- NSF [IIP-0742304]
There are many applications in motion planning where it is important to consider and distinguish between different topological classes of trajectories. The two important, but related, topological concepts for classifying manifolds that are of importance to us are those of homotopy and homology. In this paper we consider the problem of robot exploration and planning in Euclidean configuration spaces with obstaclees to (a) identify and represent different homology classes of trajectories; (b) plan trajectories constrained to certain homology classes or avoiding specified homology classes; and (c) explore different homotopy classes of trajectories in an environment and determine the least cost trajectories in each class. We exploit theorems from complex analysis and the theory of electromagnetism to solve the problem 2-dimensional and 3-dimensional configuration spaces respectively. Finally, we describe the extension of these ideas to arbitrary D-dimensional configuration spaces. We incorporate these basic concepts to develop a practical graph-search based planning tool with theoretical guarantees by combining integration theory with search techniques, and illustrate it with several examples.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据