Complete real-time path planning during sensor-based discovery

Sensor-based discovery path planning is problematic because the path needs to be continually recomputed as new information is discovered. A process-based client-server approach is presented that permits concurrent sensor-based map updates, robot localization corrections, as well as concurrent path computation and execution. A harmonic function is constantly recomputed using an iteration kernel on an occupancy-grid representation of what is known about the world at any current time. The path produced (i.e., by steepest gradient descent on the harmonic function) is optimal in the sense of minimizing the distance to the goal as well as minimizing the hitting probability. This helps alleviate the influence of uncertainty on path planning. In addition, the computation time for generating the path is insignificant provided that the harmonic function has converged. On a regular grid, the computation of the harmonic function is linear in the total number of grid elements. A quad-tree representation is proposed to help minimize the computation time by reducing the number of grid elements and minimally representing large spaces void of obstacles and goals. The computation time is found to be approximately reduced by a factor of n/sup 2/, where n is the ratio of grid elements in the regular grid divided by the number in the reduced quad representation.

[1]  Jean-Claude Latombe,et al.  Robot Motion Planning: A Distributed Representation Approach , 1991, Int. J. Robotics Res..

[2]  James U. Korein,et al.  Robotics , 2018, IBM Syst. J..

[3]  A. I. van de Vooren,et al.  On the 9-point difference formula for Laplace's equation , 1967 .

[4]  Gregory Dudek,et al.  Precise positioning using model-based maps , 1994, Proceedings of the 1994 IEEE International Conference on Robotics and Automation.

[5]  Peter G. Doyle,et al.  Random Walks and Electric Networks: REFERENCES , 1987 .

[6]  Anthony Stentz,et al.  The Focussed D* Algorithm for Real-Time Replanning , 1995, IJCAI.

[7]  Lydia E. Kavraki,et al.  A Random Sampling Scheme for Path Planning , 1997, Int. J. Robotics Res..

[8]  Jack Dongarra,et al.  Pvm 3 user's guide and reference manual , 1993 .

[9]  R.M. McElhaney,et al.  Algorithms for graphics and image processing , 1983, Proceedings of the IEEE.

[10]  O. Khatib,et al.  Real-Time Obstacle Avoidance for Manipulators and Mobile Robots , 1985, Proceedings. 1985 IEEE International Conference on Robotics and Automation.

[11]  Danny Ziyi Chen,et al.  A framed-quadtree approach for determining Euclidean shortest paths in a 2-D environment , 1997, IEEE Trans. Robotics Autom..

[12]  J. Snell,et al.  Random Walks and Electric Networks: THE CLASSICAL PROOFS OF PÓLYA'S THEOREM , 1984 .

[13]  Roderic A. Grupen,et al.  The applications of harmonic functions to robotics , 1993, J. Field Robotics.

[14]  Narendra Ahuja,et al.  Gross motion planning—a survey , 1992, CSUR.

[15]  John Beidler,et al.  Data Structures and Algorithms , 1996, Wiley Encyclopedia of Computer Science and Engineering.