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

저자
정보 없음
출판사
Hutson Street Press
출판일
20250522
ISBN
9781024200393
ISBN 등록 지역
영어권 (ISBN 978-1)

소개

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.