Exact robot navigation by means of potential functions: Some topological considerations

The limits in global navigation capability of potential function based robot control algorithms are explored. Elementary tools of algebraic and differential topology are used to advance arguments suggesting the existence of potential functions over a bounded planar region with arbitrary fixed obstacles possessed of a unique local minimum. A class of such potential functions is constructed for certain cases of a planar disk region with an arbitrary number of smaller disks removed.

[1]  John H. Reif,et al.  Complexity of the mover's problem and generalizations , 1979, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979).

[2]  J. Y. S. Luh,et al.  Resolved-acceleration control of mechanical manipulators , 1980 .

[3]  Suguru Arimoto,et al.  A New Feedback Method for Dynamic Control of Manipulators , 1981 .

[4]  E. Freund.  Fast Nonlinear Control with Arbitrary Pole-Placement for Industrial Robots and Manipulators , 1982 .

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

[6]  A. Isidori,et al.  Nonlinear feedback in robot arm control , 1984, The 23rd IEEE Conference on Decision and Control.

[7]  Dan Koditschek,et al.  Natural motion for robot arms , 1984, The 23rd IEEE Conference on Decision and Control.

[8]  Neville Hogan,et al.  Impedance Control: An Approach to Manipulation , 1984, 1984 American Control Conference.

[9]  Neville Hogan,et al.  Impedance Control: An Approach to Manipulation: Part I—Theory , 1985 .

[10]  V. Lumelsky,et al.  Continuous Robot Motion Planning In Unknown Environment , 1986 .

[11]  A. J. Schaft,et al.  Stabilization of Hamiltonian systems , 1986 .

[12]  Daniel E. Koditschek,et al.  Automatic Planning and Control of Robot Natural Motion Via Feedback , 1986 .

[13]  E. J.,et al.  ON THE COMPLEXITY OF MOTION PLANNING FOR MULTIPLE INDEPENDENT OBJECTS ; PSPACE HARDNESS OF THE " WAREHOUSEMAN ' S PROBLEM " . * * ) , 2022 .