Parameterized complexity analysis in robot motion planning

A series of previous PSPACE- and NP-hardness results suggest that no general algorithm for robot motion planning can be polynomial in all of its input parameters, i.e., at least one parameter x must be exponential relative to a constant, e.g., 2/sup x/, or another parameter of the problem, e.g., y/sup x/. However, they have not answered the more relevant question posed by some FP space-based algorithms-namely, whether there is a general algorithm that is polynomial in all input parameters except k, in which k may yet be exponential relative to a constant or itself. In this paper, using the theory of parameterized computational complexity developed by Downey and Fellows (1992), the authors establish that the answer to this question is probably "no". The authors give an overview of this theory and derive their main result. Finally, they briefly discuss the implications for robotics of both these results and the parameterized complexity framework.

[1]  Geetha Ramanathan.  Algorithmic motion planning in robotics , 1985 .

[2]  Deborah A. Joseph,et al.  On the complexity of reachability and motion planning questions (extended abstract) , 1985, SCG '85.

[3]  Michael T. Hallett,et al.  The Parameterized Complexity of Some Problems in Logic and Linguistics , 1994, LFCS.

[4]  ReifJohn,et al.  Motion planning in the presence of moving obstacles , 1994 .

[5]  Michael R. Fellows,et al.  Finite automata, bounded treewidth, and well-quasiordering , 1991, Graph Structure Theory.

[6]  Michael T. Hallett,et al.  A compendium of parameterized complexity results , 1994, SIGA.

[7]  J. Reif.  Complexity of the Generalized Mover's Problem. , 1985 .

[8]  Christos H. Papadimitriou,et al.  Computational complexity , 1993 .

[9]  Michael R. Fellows,et al.  Fixed-parameter intractability , 1992, [1992] Proceedings of the Seventh Annual Structure in Complexity Theory Conference.

[10]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[11]  R. Downey,et al.  Parameterized Computational Feasibility , 1995 .

[12]  J. Schwartz,et al.  On the Complexity of Motion Planning for Multiple Independent Objects; PSPACE- Hardness of the "Warehouseman's Problem" , 1984 .

[13]  Michael R. Fellows,et al.  Parameterized complexity analysis in computational biology , 1995, Comput. Appl. Biosci..

[14]  Jean-Claude Latombe,et al.  Motion planning in the presence of moving obstacles , 1992 .

[15]  Christos H. Papadimitriou,et al.  Symmetric Space-Bounded Computation , 1982, Theor. Comput. Sci..

[16]  Michael R. Fellows,et al.  Fixed-Parameter Tractability and Completeness II: On Completeness for W[1] , 1995, Theor. Comput. Sci..

[17]  John Canny,et al.  The complexity of robot motion planning , 1988 .

[18]  Michael R. Fellows,et al.  Fixed-Parameter Intractability II (Extended Abstract) , 1993, STACS.

[19]  Michael R. Fellows,et al.  Fixed-parameter tractability and completeness III: some structural aspects of the W hierarchy , 1993 .

[20]  Jeffrey D. Ullman,et al.  Introduction to Automata Theory, Languages and Computation , 1979 .

[21]  Micha Sharir,et al.  Planning, geometry, and complexity of robot motion , 1986 .

[22]  Michael R. Fellows,et al.  On Well-Partial-Order Theory and its Application to Combinatorial Problems of VLSI Design , 1989, SIAM J. Discret. Math..

[23]  Micha Sharir,et al.  Algorithmic motion planning in robotics , 1991, Computer.