Multi-robot motion planning of \(k\)-colored discs is PSPACE-hard

DOI10.4230/lipics.fun.2021.15zbMath1515.68332MaRDI QIDQ6487587

Lloyd E. Lo-Wong, Thomas Brocken, Remco J. A. Surtel, G. Wessel van der Heijden, Irina Kostitsyna

Publication date: 7 February 2023

zbMATH Keywords

algorithmic complexityPSPACE-hardnessdisc-robot motion planning

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Artificial intelligence for robotics (68T40)

This page was built for publication: Multi-robot motion planning of \(k\)-colored discs is PSPACE-hard