Name
Abstract | ||
|---|---|---|
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 and . 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 and the to solve the problem 2-dimensional and 3-dimensional configuration spaces respectively. Finally, we describe the extension of these ideas to arbitrary -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. |
Year | DOI | Venue |
|---|---|---|
2012 | 10.1007/s10514-012-9304-1 | Auton. Robots |
Keywords | Field | DocType |
Robot path planning,Topological constraints,Graph search,Homotopy,Homology | Motion planning,Topology,Computer science,Electromagnetism,Exploit,Euclidean geometry,Homotopy,Robot,CW complex,Manifold | Journal |
Volume | Issue | ISSN |
33 | 3 | 0929-5593 |
Citations | PageRank | References |
31 | 1.14 | 7 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Subhrajit Bhattacharya | 1 | 462 | 36.93 |
| Maxim Likhachev | 2 | 2103 | 157.03 |
| Vijay Kumar | 3 | 7086 | 693.29 |