• Open Daily: 10am - 10pm
    Alley-side Pickup: 10am - 7pm

    3038 Hennepin Ave Minneapolis, MN
    612-822-4611

Open Daily: 10am - 10pm | Alley-side Pickup: 10am - 7pm
3038 Hennepin Ave Minneapolis, MN
612-822-4611
On the Complexity of Motion Planning for Multiple Independent Objects; Pspace Hardness of the "warehouseman's Problem"

On the Complexity of Motion Planning for Multiple Independent Objects; Pspace Hardness of the "warehouseman's Problem"

Paperback

General MathematicsPhysicsProgramming

ISBN10: 1024204863
ISBN13: 9781024204865
Publisher: Hutson Street Press
Published: May 22 2025
Pages: 22
Weight: 0.10
Height: 0.05 Width: 6.14 Depth: 9.21
Language: English

This technical report examines the computational complexity of motion planning algorithms, specifically focusing on the scenario involving multiple independent objects. The central result demonstrates the Pspace hardness of the warehouseman's problem, a classic challenge in robotics and computational geometry. On the Complexity of Motion Planning for Multiple Independent Objects provides a detailed analysis of the algorithmic challenges inherent in coordinating the movement of multiple objects through a constrained space. This report is essential reading for researchers and practitioners in robotics, artificial intelligence, and theoretical computer science, offering foundational insights into the limits of efficient motion planning.

1 different editions

Also available

Also from

Hopcroft, J. E.

Also in

Programming