论文信息 - Strong NP-Hardness of Moving Many Discs

Strong NP-Hardness of Moving Many Discs

Le probleme de calcul du mouvement de gestion pour un systeme robotise simple a ete etudie plus recemment a partir d'un point de vue algorithmique. Le but de cet article est de montrer que le «probleme de nombreux disques» est NP-dur au sens fort

Paul G. Spirakis | Chee-Keng Yap | C. Yap | P. Spirakis

[1] J. Schwartz,et al. On the “piano movers” problem. II. General techniques for computing topological properties of real algebraic manifolds , 1983 .

[2] Nils J. Nilsson,et al. A mobius automation: an application of artificial intelligence techniques , 1969, IJCAI 1969.

[3] Micha Sharir,et al. Retraction: A new approach to motion-planning , 1983, STOC.

[4] J. Schwartz,et al. On the Piano Movers' Problem: III. Coordinating the Motion of Several Independent Bodies: The Special Case of Circular Bodies Moving Amidst Polygonal Barriers , 1983 .

[5] Tomás Lozano-Pérez,et al. An algorithm for planning collision-free paths among polyhedral obstacles , 1979, CACM.

[6] P. Schönemann. On artificial intelligence , 1985, Behavioral and Brain Sciences.

[7] John E. Hopcroft,et al. On the movement of robot arms in 2-dimensional bounded regions , 1982, FOCS 1982.

[8] Hans P. Moravec. Robot Rover Visual Navigation , 1981 .