e/Pebble motion problems

Information
has gloss	eng: The pebble motion problems are a set of related problems in algorithimic graph theory dealing with the movement of multiple objects (pebbles) from vertex to vertex in a graph with a constraint on the number of pebbles that can occupy a vertex at any time. Pebble motion problems occur in domains such as multi-robot motion planning (in which the pebbles are robots) and network routing (in which the pebbles are packets of data). The best-known example of a pebble motion problem is Sam Loyd's famous 15-puzzle.
lexicalization	eng: Pebble motion problems
instance of	c/Computational problems in graph theory