Planning Algorithms, by Steven M. LaValle (Author), Cambridge University Press, May 2006. ISBN-10: 0521862051 | ISBN-13: 9780521862059.

This book presents a unified treatment of many different kinds of planning algorithms. The subject lies at the crossroads between robotics, control theory, artificial intelligence, algorithms, and computer graphics. The particular subjects covered include motion planning, discrete planning, planning under uncertainty, sensor-based planning, visibility, decision-theoretic planning, game theory, information spaces, reinforcement learning, nonlinear systems, trajectory planning, nonholonomic planning, and kinodynamic planning.

"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

Download Planning Algorithms

Pdf format, 13.4mb. One page per one (larger print). May be easier for on-line viewing.

Visit Planning Algorithms Official Website

About the Author:

Steven M. LaValle is Associate Professor of Computer Science at the University of Illinois at 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.

Comments (0)

Name

Email

Comment

smaller | bigger

Add Comment