Skip to main content

Part of the book series: Springer Tracts in Advanced Robotics ((STAR,volume 57))

  • 2083 Accesses

Abstract

This paper explores a topological perspective of planning. A series of examples and theorems establishes a fundamental coupling between tasks on graphs and simplicial complexes. Planning under uncertainty is one application. The paper introduces strategy and loopback complexes. The paper’s main theorem shows that tasks specified by goal states in nondeterministic graphs have guaranteed solutions if and only if their loopback complexes are homotopic to spheres.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 169.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 219.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Barr, A., Cohen, P., Feigenbaum, E. (eds.): The Handbook of Artificial Intelligence. William Kaufmann, Inc., Los Altos (1981–1989)

    Google Scholar 

  2. Björner, A.: Topological methods. In: Graham, R., Grötschel, M., Lovász, L. (eds.) Handbook of Combinatorics, vol. V.II, pp. 1819–1872. North-Holland, Amsterdam (1995)

    Google Scholar 

  3. Björner, A., Welker, V.: Complexes of directed graphs. SIAM J. Discrete Math. 12(4), 413–424 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  4. de Silva, V., Ghrist, R.: Coordinate-free coverage in sensor networks with controlled boundaries via homology. Intl. J. Rob. Res. 25(12), 1205–1222 (2006)

    Article  Google Scholar 

  5. Erdmann, M.: On Probabilistic Strategies for Robot Tasks. PhD thesis, EECS, MIT, Cambridge, MA (1989), Also available as Technical Report AI-TR-1155

    Google Scholar 

  6. Erdmann, M.: Randomization in robot tasks. Intl. J. Rob. Res. 11(5), 399–436 (1992)

    Article  Google Scholar 

  7. Erdmann, M.: Randomization for robot tasks: Using dynamic programming in the space of knowledge states. Algorithmica 10(2-4), 248–291 (1993)

    Article  MATH  MathSciNet  Google Scholar 

  8. Erdmann, M., Mason, M.: An exploration of sensorless manipulation. IEEE J. Robotics and Automation 4(4), 369–379 (1988)

    Article  Google Scholar 

  9. Farber, M.: Topological complexity of motion planning. Discrete and Computational Geometry 29(2), 211–221 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  10. Ghrist, R., LaValle, S.: Nonpositive curvature and Pareto-optimal coordination of robots. SIAM J. Control & Opt. 45(5), 1697–1713 (2006)

    Article  MATH  MathSciNet  Google Scholar 

  11. Ghrist, R., O’Kane, J., LaValle, S.: Computing Pareto optimal coordinations on roadmaps. Intl. J. Robotics Research 24(11), 997–1010 (2005)

    Article  Google Scholar 

  12. Ghrist, R., Peterson, V.: The geometry and topology of reconfiguration. Adv. Appl. Math. 38, 302–323 (2007)

    Article  MATH  MathSciNet  Google Scholar 

  13. Guilamo, L., Tovar, B., LaValle, S.: Pursuit-evasion in an unknown environment using gap navigation trees. In: Proc. IEEE/RSJ Intl. Conference on Intelligent Robots and Systems, pp. 3456–3462 (2004)

    Google Scholar 

  14. Hatcher, A.: Algebraic Topology. Cambridge University Press, Cambridge (2002)

    MATH  Google Scholar 

  15. Herlihy, M., Shavit, N.: The topological structure of asynchronous computability. J. ACM 46(6), 858–923 (1999)

    MATH  MathSciNet  Google Scholar 

  16. Hultman, A.: Directed subgraph complexes. Elec. J. Combinatorics 11(1), R75 (2004)

    Google Scholar 

  17. Jonsson, J.: Simplicial Complexes of Graphs. PhD thesis, Department of Mathematics, KTH, Stockholm, Sweden (2005)

    Google Scholar 

  18. LaValle, S.: Planning Algorithms. Cambridge University Press, New York (2006)

    Book  MATH  Google Scholar 

  19. Lozano-Pérez, T., Mason, M., Taylor, R.: Automatic synthesis of fine-motion strategies for robots. Intl. J. Robotics Research 3(1), 3–24 (1984)

    Article  Google Scholar 

  20. Mackenzie, D.: ROBOTICS: Topologists and Roboticists Explore an ‘Inchoate World’. Science 301(5634), 756 (2003)

    Article  Google Scholar 

  21. Munkres, J.: Elements of Algebraic Topology. Addison-Wesley, Menlo Park (1984)

    MATH  Google Scholar 

  22. O’Kane, J., LaValle, S.: On comparing the power of robots. Intl. J. Robotics Research 27(1), 5–23 (2008)

    Article  Google Scholar 

  23. Tovar, B., Murrieta, R., LaValle, S.: Distance-optimal navigation in an unknown environment without sensing distances. IEEE Transactions on Robotics 23(3), 506–518 (2007)

    Article  Google Scholar 

  24. Tovar, B., Yershova, A., O’Kane, J., LaValle, S.: Information spaces for mobile robots. In: Proc. Intl. Workshop on Robot Motion and Control (2005)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Erdmann, M. (2009). On the Topology of Plans. In: Chirikjian, G.S., Choset, H., Morales, M., Murphey, T. (eds) Algorithmic Foundation of Robotics VIII. Springer Tracts in Advanced Robotics, vol 57. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-00312-7_17

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-00312-7_17

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-00311-0

  • Online ISBN: 978-3-642-00312-7

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics