An analytically tractable potential field model of free space and its application in obstacle avoidance

An analytically tractable potential field model of free space is presented. The model assumes that the border of every two dimensional (2D) region is uniformly charged. It is shown that the potential and the resulting repulsion (force and torque) between polygonal regions can he calculated in closed form. By using the Newtonian potential function, collision avoidance between object and obstacle thus modeled is guaranteed in a path planning problem. A local planner is developed for finding object paths going through narrow areas of free space where the obstacle avoidance is most important. Simulation results show that not only does individual object configuration of a path obtained with the proposed approach avoid obstacles effectively, the configurations also connect smoothly into a path.

[1]  J. Brian Burns,et al.  Path planning using Laplace's equation , 1990, Proceedings., IEEE International Conference on Robotics and Automation.

[2]  Elmer G. Gilbert,et al.  Distance functions and their application to robot path planning in the presence of obstacles , 1985, IEEE J. Robotics Autom..

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

[4]  Meghanad D. Wagh,et al.  Robot path planning using intersecting convex shapes , 1986, Proceedings. 1986 IEEE International Conference on Robotics and Automation.

[5]  J. Schwartz,et al.  On the “piano movers'” problem I. The case of a two‐dimensional rigid polygonal body moving amidst polygonal barriers , 1983 .

[6]  David G. Kirkpatrick,et al.  Efficient computation of continuous skeletons , 1979, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979).

[7]  Osamu Takahashi,et al.  Motion planning in a plane using generalized Voronoi diagrams , 1989, IEEE Trans. Robotics Autom..

[8]  Martin Herman,et al.  Fast, three-dimensional, collision-free motion planning , 1986, Proceedings. 1986 IEEE International Conference on Robotics and Automation.

[9]  Hermann A. Haus,et al.  Electromagnetic fields, energy, and waves , 1972 .

[10]  Charles E. Thorpe,et al.  Path Relaxation: Path Planning for a Mobile Robot , 1984, AAAI.

[11]  J. T. Shwartz,et al.  On the Piano Movers' Problem : III , 1983 .

[12]  S. Maddila.  Decomposition algorithm for moving a ladder among rectangular obstacles , 1986, Proceedings. 1986 IEEE International Conference on Robotics and Automation.

[13]  H. B. Dwight,et al.  Tables of Integrals and Other Mathematical Data , 1934 .

[14]  C. cohen-tannoudji,et al.  Quantum Mechanics: , 2020, Fundamentals of Physics II.

[15]  Paul M. Griffin,et al.  Path planning for a mobile robot , 1992, IEEE Trans. Syst. Man Cybern..

[16]  Jean-Claude Latombe,et al.  Numerical potential field techniques for robot path planning , 1991, Fifth International Conference on Advanced Robotics 'Robots in Unstructured Environments.

[17]  J. Bladel,et al.  Electromagnetic Fields , 1985 .

[18]  Rodney A. Brooks,et al.  A subdivision algorithm in configuration space for findpath with rotation , 1983, IEEE Transactions on Systems, Man, and Cybernetics.

[19]  Pradeep K. Khosla,et al.  Superquadric artificial potentials for obstacle avoidance and approach , 1988, Proceedings. 1988 IEEE International Conference on Robotics and Automation.

[20]  Kamal K. Gupta,et al.  Fast collision avoidance for manipulator arms: a sequential search strategy , 1990, Proceedings., IEEE International Conference on Robotics and Automation.

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

[22]  Narendra Ahuja,et al.  A potential field approach to path planning , 1992, IEEE Trans. Robotics Autom..

[23]  D. Wilton,et al.  Potential integrals for uniform and linear source distributions on polygonal and polyhedral domains , 1984 .

[24]  Rodney A. Brooks,et al.  Natural decomposition of free space for path planning , 1985, Proceedings. 1985 IEEE International Conference on Robotics and Automation.