Answers are grounded in this paper and cite their sources.
Coordinated motion planning for a large number af three-di mensional objects in the presence of obstacles is a computa tional problem whose complexity is important to calibrate. In this paper we show that even the restricted two-dimensional problem for arbitrarily many rectangles in a rectangular region is PSPACE-hard. This result should be viewed as a guide to the difficulty, of the general problem and should lead researchers to consider more tractable restricted classes of motion problems of practical interest.
No takes yet. Share an insight, caveat, or question.
Hopcroft et al. (1984) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: