Find a copy in the library
Finding libraries that hold this item...
|All Authors / Contributors:||
John E Hopcroft; Gordon Thomas Wilfong
|Description:||28 pages ; 28 cm.|
|Series Title:||Cornell University.; Department of Computer Science.; Technical report|
|Responsibility:||John E. Hopcroft, Gordon Wilfong.|
Searching the graph of vertices and edges of CONNECTED for a path has a prohibitive worse-case complexity because of the large number of vertices and edges. However, if the search generates edges and vertices only as they are needed, a practical and efficient algorithm may be possible using some effective heuristic.
From this result it is shown that motion planning for rectangles in a rectangular boundary is in PSPACE. Since it is known that the problem is PSPACE-hard we conclude it is a PSPACE-complete problem.