Our systems are now restored following recent technical disruption, and we’re working hard to catch up on publishing. We apologise for the inconvenience caused. Find out more

Recommended product

Popular links

Popular links


Planning Algorithms

Planning Algorithms

Planning Algorithms

Steven M. LaValle , University of Illinois, Urbana-Champaign
May 2006
Available
Hardback
9780521862059

Looking for an examination copy?

This title is not currently available for examination. However, if you are interested in the title for your course we can consider offering an examination copy. To register your interest please contact collegesales@cambridge.org providing details of the course you are teaching.

$131.00
USD
Hardback
USD
eBook

    Planning algorithms are impacting technical disciplines and industries around the world, including robotics, computer-aided design, manufacturing, computer graphics, aerospace applications, drug design, and protein folding. Written for computer scientists and engineers with interests in artificial intelligence, robotics, or control theory, this is the only book on this topic that tightly integrates a vast body of literature from several fields into a coherent source for teaching and reference in a wide variety of applications. Difficult mathematical material is explained through hundreds of examples and illustrations.

    • The first broad unification of planning-related topics, drawn together under a clearly explained mathematical framework
    • Emphasizes the powerful concept of information spaces, critical in the development of better robotic systems
    • Clear explanations of difficult technical concepts, making it accessible to the broadest audience possible

    Reviews & endorsements

    "Motion planning is an important field of research with applications in such diverse terrains as robotics, molecular modeling, virtual environments, and games. Over the past two decades a huge number of techniques have been developed, all with their merits and shortcomings. The book by Steve LaValle gives an excellent overview of the current state of the art in the field. It should lie on the desk of everybody that is involved in motion planning research or the use of motion planning in applications."
    Professor Mark Overmars, Utrecht University

    "A great book at the junction where Robotics, Artificial Intelligence, and Control are crossing their paths. For many problems you will find in-depth discussion and algorithms; for virtually all others in the field, an intriguing introduction to make you at ease and entice you to further probing the matter."
    Professor Antonio Bicchi, della Università di Pisa

    "The book is a successful integration of algorithms developed in various fields into a comprehensive and well-updated reference and educational book."
    Valentin A. Nepomnyashchikh

    See more reviews

    Product details

    May 2006
    Hardback
    9780521862059
    844 pages
    262 × 182 × 43 mm
    1.59kg
    304 exercises
    Available

    Table of Contents

    • Part I. Introductory Material:
    • 1. Introduction
    • 2. Discrete planning
    • Part II. Motion Planning:
    • 3. Geometric representations and transformations
    • 4. The configuration space
    • 5. Sampling-based motion planning
    • 6. Combinatorial motion planning
    • 7. Extensions of basic motion planning
    • 8. Feedback motion planning
    • Part III. Decision-Theoretic Planning:
    • 9. Basic decision theory
    • 10. Sequential decision theory
    • 11. Information spaces
    • 12. Planning under sensing uncertainty
    • Part IV. Planning Under Differential Constraints:
    • 13. Differential models
    • 14. Sampling-based planning under differential constraints
    • 15. System theory and analytical techniques.
      Author
    • Steven M. LaValle , University of Illinois, Urbana-Champaign

      Steven M. LaValle is Associate Professor of Computer Science at the University of Illinois, Urbana-Champaign. He has worked in motion planning and robotics for over a decade and is a leading researcher who has published dozens of articles in the field. He is the main developer of the Rapidly-exploring Random Tree (RRT) algorithm, which has been used in numerous research labs and industrial products around the world. He has taught material on which the book is based at Stanford University, Iowa State University, the Tec de Monterrey, and the University of Illinois.