ON THE COMPLEXITY OF MOTION PLANNING FOR MULTIPLE INDEPENDENT OBJECTS - PSPACE-HARDNESS OF THE WAREHOUSEMANS PROBLEM

被引：235

作者：

HOPCROFT, JE

SCHWARTZ, JT

SHARIR, M

机构：

[1] NYU,COURANT INST MATH SCI,DEPT COMP SCI,NEW YORK,NY 10012

[2] TEL AVIV UNIV,SCH MATH SCI,IL-69978 TEL AVIV,ISRAEL

来源：

关键词：

D O I：

10.1177/027836498400300405

中图分类号：

TP24 [机器人技术];

学科分类号：

080202 ; 1405 ;

摘要：

引用

页码：76 / 88

页数：13

共 8 条

[1]

Garey Michael R., 1979, COMPUTERS INTRACTABI

[2]

HOPCROFT J, 1984, 84616 CORN U COMP SC

[3]

HOPCROFT J, 1982, 82575 CORN U COMP SC

[4]

Hopcroft J.E., 1979, INTRO AUTOMATA THEOR

[5]

Reif J. H., 1979, 20th Annual Symposium of Foundations of Computer Science, P421, DOI 10.1109/SFCS.1979.10

SCHWARTZ, JT ;

SHARIR, M .

[7]

SCHWARTZ JT, 1983, ADV APPL MATH, V4, P298

[8]

[No title captured]