> Details

Brocken, Thomas [Author]; van der Heijden, G. Wessel [Author]; Kostitsyna, Irina [Author]; Lo-Wong, Lloyd E. [Author]; Surtel, Remco J. A. [Author] ; Thomas Brocken and G. Wessel van der Heijden and Irina Kostitsyna and Lloyd E. Lo-Wong and Remco J. A. Surtel [Contributor]

Multi-Robot Motion Planning of k-Colored Discs Is PSPACE-Hard

Reference
management

Bookmarks

Remove from
bookmarks

Share this on Whatsapp

Close

Bookmarks



You can manage bookmarks using lists, please log in to your user account for this.
  • Media type: Text; E-Article; Electronic Conference Proceeding
  • Title: Multi-Robot Motion Planning of k-Colored Discs Is PSPACE-Hard
  • Contributor: Brocken, Thomas [Author]; van der Heijden, G. Wessel [Author]; Kostitsyna, Irina [Author]; Lo-Wong, Lloyd E. [Author]; Surtel, Remco J. A. [Author]
  • Published: Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2020
  • Language: English
  • DOI: https://doi.org/10.4230/LIPIcs.FUN.2021.15
  • Keywords: Disc-robot motion planning ; PSPACE-hard ; algorithmic complexity
  • Origination:
  • Footnote: Diese Datenquelle enthält auch Bestandsnachweise, die nicht zu einem Volltext führen.
  • Description: In the problem of multi-robot motion planning, a group of robots, placed in a polygonal domain with obstacles, must be moved from their starting positions to a set of target positions. We consider the specific case of unlabeled disc robots of two different sizes. That is, within one class of robots, where a class is given by the robots' size, any robot can be moved to any of the corresponding target positions. We prove that the decision problem of whether there exists a schedule moving the robots to the target positions is PSPACE-hard.
  • Access State: Open Access