Skip to main content
Springer Nature Link
Log in

Pledge's Algorithm - How to Escape from a Dark Maze

  • Chapter
Algorithms Unplugged

Abstract

This chapter considers labyrinths where the only tool available is a compass. The authors present a very elegant solution – Pledge’s algorithm. This algorithm can be used, for example, by a robot to find its way out of an arbitrary planar labyrinth caused by an arbitrary layout of obstacles.

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

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

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.

Similar content being viewed by others

Author information

Authors and Affiliations

  1. Rheinische Friedrich-Wilhelms-Universität Bonn, Bonn, Germany

    Rolf Klein

  2. Technische Universität Braunschweig, Braunschweig, Germany

    Tom Kamphans

Authors
  1. Rolf Klein
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Tom Kamphans
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Lehrstuhl für Informatik I, Algorithmen und Komplexität, RWTH Aachen, Ahornstr. 55, Aachen, 52074, Germany

    Berthold Vöcking

  2. Institut für Informatik, Freie Universität Berlin, Takustr. 9, Berlin, 14195, Germany

    Helmut Alt

  3. Institut für Theoretische Informatik, Fakultät für Informatik, Technische Universität Ilmenau, Helmholtzplatz 1, Ilmenau, 98693, Germany

    Martin Dietzfelbinger

  4. Institut für Theoretische Informatik, Universität zu Lübeck, Ratzeburger Allee 160, Lübeck, 23538, Germany

    Rüdiger Reischuk

  5. Institut für Informatik, Universität Paderborn, Fürstenallee 11, Paderborn, 33102, Germany

    Christian Scheideler

  6. Institut für Theoretische Informatik, Leibniz Universität Hannover, Appelstr. 4, Hannover, 30167, Germany

    Heribert Vollmer

  7. Institut für Theoretische Informatik, Karlsruhe Institute of Technology (KIT), Am Fasanengarten 5, Karlsruhe, 76131, Germany

    Dorothea Wagner

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Klein, R., Kamphans, T. (2011). Pledge's Algorithm - How to Escape from a Dark Maze. In: Vöcking, B., et al. Algorithms Unplugged. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-15328-0_8

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-15328-0_8

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-15327-3

  • Online ISBN: 978-3-642-15328-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics