Items related to On the Complexity of Motion Planning for Multiple Independen...

On the Complexity of Motion Planning for Multiple Independent Objects: Pspace Hardness of the "Warehouseman's Problem" (Classic Reprint) - Softcover

J. E. Hopcroft

 
9781333655167: On the Complexity of Motion Planning for Multiple Independent Objects: Pspace Hardness of the "Warehouseman's Problem" (Classic Reprint)

Synopsis

This book takes on the challenge of proving that the simple motion planning problem of moving a set of rectangular-shaped objects around in two dimensions is PSPACE-hard. PSPACE is a complexity class and this demonstration places this problem within this complexity class. The author establishes a foundational connection between rewritable systems, symbol manipulation, and the seemingly unrelated problem of moving objects around in two dimensions. By establishing these relationships, this book contributes a new perspective on motion planning that provides a framework for solving more complicated motion planning problems in computer science.

"synopsis" may belong to another edition of this title.