Mover problems

4Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Leo Moser asked what is the region of largest area that can be moved around a right-angled corner in a corridor of unit width? Similarly, what is the region of largest area that can be reversed in a T junction made up of roads of unit width? Can a specific 3-dimensional object pass through a given door? Our survey aims at showing that mover problems are no less challenging even if there are no obstacles other than the objects themselves, but there are many objects to move. We survey some recent results on motion planning and reconfiguration for systems of multiple objects and for modular systems with applications in robotics, and collect some open problems coming out of this line of research.

Cite

CITATION STYLE

APA

Dumitrescu, A. (2013). Mover problems. In Thirty Essays on Geometric Graph Theory (Vol. 9781461401100, pp. 185–211). Springer New York. https://doi.org/10.1007/978-1-4614-0110-0_11

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free