Topological complexity of collision free motion planning algorithms in the presence of multiple moving obstacles

We study motion planning algorithms for collision free control of multiple objects in the presence of moving obstacles. We compute the topological complexity of algorithms solving this problem. We apply topological tools and use information about cohomology algebras of configuration spaces. The results of the paper may potentially be used in systems of automatic traffic control.

[1]  Micha Sharir,et al.  Algorithmic motion planning , 2004, Handbook of Discrete and Computational Geometry, 2nd Ed..

[2]  Michael Farber,et al.  Topological robotics: motion planning in projective spaces , 2002, ArXiv.

[3]  Micha Sharir,et al.  Arrangements and their applications in robotics: recent developments , 1995 .

[4]  J. Schwartz,et al.  On the “piano movers” problem. II. General techniques for computing topological properties of real algebraic manifolds , 1983 .

[5]  Stephen Smale,et al.  On the topology of algorithms, I , 1987, J. Complex..

[6]  E. Fadell,et al.  Geometry and Topology of Configuration Spaces , 2000 .

[7]  J. T. Shwartz,et al.  On the Piano Movers' Problem : III , 1983 .

[8]  P. Orlik,et al.  Arrangements Of Hyperplanes , 1992 .

[9]  Michael Farber,et al.  Topological Robotics: Subspace Arrangements and Collision Free Motion Planning , 2002, ArXiv.

[10]  Michael Farber,et al.  Instabilities of Robot Motion , 2002, ArXiv.

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

[12]  Michael Farber.  Collision Free Motion Planning on Graphs , 2004, WAFR.

[13]  Daniel E. Koditschek,et al.  Safe Cooperative Robot Dynamics on Graphs , 2000, SIAM J. Control. Optim..

[14]  Michael Farber,et al.  TOPOLOGY OF ROBOT MOTION PLANNING , 2006 .

[15]  Jean-Claude Latombe,et al.  Robot motion planning , 1970, The Kluwer international series in engineering and computer science.

[16]  Michael Farber.  Topological Complexity of Motion Planning , 2003, Discret. Comput. Geom..

[17]  V. A. Vassil’ev.  Cohomology of Braid Groups and Complexity , 1993 .