DeepRead
Cover of Planning Algorithms

Planning Algorithms

Steven M. LaValle · 2006

Programming and computer science › Algorithms and coding interviews

#7,282 most recommended

About the book

Planning Algorithms is a graduate-level textbook on algorithms that compute how a robot or other autonomous system should move or act to reach a goal while avoiding obstacles. It covers discrete and continuous state spaces, configuration spaces, motion constraints, and the sensing and uncertainty that a real system faces. Its scope extends beyond mobile robots to manipulators, animated characters, and computational biology. The book presents planning as one unified problem: a system's possible states and actions are modeled abstractly, so the same formal methods apply across robotics and related fields. It argues that planners should be judged by algorithmic criteria such as completeness, optimality, and computational complexity. It also contends that sampling-based methods make high-dimensional planning practical, and that when sensing is imperfect, the goal is a feedback policy mapping states to actions rather than a single fixed path.

Written by Claude from what it knows of this book.

What Hacker News says 60% recommend · 0% critical

024201620182020202220232016 peak · 1
This bookAverage book in Algorithms and coding interviews

In the commenters’ own words

What Open Library readers say

No Open Library reader has rated it yet.

  • 3 want to read
  • 0 reading
  • 0 have read

Open Library’s page for the book

What critics say, via Wikipedia

No Wikipedia article about this book yet, so no critics to quote.

Reddit communities — coming later

Details

First published
2006
ISBN
9780511240812
Editions known
8 at Open Library
Open Library
OL8332497W

AlgorithmsMotionPlanningRobots

Explore in the mosaic

Read next: its neighbours on the mosaic