Topological constraints in search-based robot path planning

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.

[1]  Yves Talpaert.  Differential geometry with applications to mechanics and physics , 2000 .

[2]  Luis Rueda,et al.  Advances in Image and Video Technology, Second Pacific Rim Symposium, PSIVT 2007, Santiago, Chile, December 17-19, 2007, Proceedings , 2007, PSIVT.

[3]  Subhrajit Bhattacharya,et al.  Search-Based Path Planning with Homotopy Class Constraints in 3D , 2010, AAAI.

[4]  Nils J. Nilsson,et al.  A Formal Basis for the Heuristic Determination of Minimum Cost Paths , 1968, IEEE Trans. Syst. Sci. Cybern..

[5]  Loring W. Tu,et al.  Differential forms in algebraic topology , 1982, Graduate texts in mathematics.

[6]  A. Glisson,et al.  Introduction to electrodynamics, 3rd edition [Book Review] , 2001, IEEE Antennas and Propagation Magazine.

[7]  J. Rotman.  An Introduction to Algebraic Topology , 1957 .

[8]  Alexei Makarenko,et al.  Information based adaptive robotic exploration , 2002, IEEE/RSJ International Conference on Intelligent Robots and Systems.

[9]  N. Hitchin.  Global Differential Geometry , 2001 .

[10]  D. Griffiths.  Introduction to Electrodynamics , 2017 .

[11]  H. Flanders.  Differential Forms with Applications to the Physical Sciences , 1964 .

[12]  K. Brown,et al.  Graduate Texts in Mathematics , 1982 .

[13]  Mac Schwager.  Multi-Robot Mapping and Exploration of Environments with Hazards , 2011 .

[14]  Dima Grigoriev,et al.  Polytime algorithm for the shortest path in a homotopy class amidst semi-algebraic obstacles in the plane , 1998, ISSAC '98.

[15]  Didier Wolf,et al.  Capture of homotopy classes with probabilistic road map , 2002, IEEE/RSJ International Conference on Intelligent Robots and Systems.

[16]  R. Brubaker.  Models for the perception of speech and visual form: Weiant Wathen-Dunn, ed.: Cambridge, Mass., The M.I.T. Press, I–X, 470 pages , 1968 .

[17]  Subhrajit Bhattacharya,et al.  A Homotopy-like Class Invariant for Sub-manifolds of Punctured Euclidean Spaces , 2011 .

[18]  John Hershberger,et al.  Computing Minimum Length Paths of a Given Homotopy Class (Extended Abstract) , 1991, WADS.

[19]  Alois Švec.  Methods of global differential geometry , 1981 .

[20]  Bo Hu,et al.  Occlusion Detection and Tracking Method Based on Bayesian Decision Theory , 2006, PSIVT.

[21]  Michael Buro,et al.  Efficient Triangulation-Based Pathfinding , 2006, AAAI.

[22]  R. Ho.  Algebraic Topology , 2022 .

[23]  P. Abbeel,et al.  Identification and Representation of Homotopy Classes of Trajectories for Search-Based Path Planning in 3D , 2012 .

[24]  Anil K. Jain.  Fundamentals of Digital Image Processing , 2018, Control of Color Imaging Systems.