A Discrete Harmonic Potential Field for Optimum Point-to-point Routing on a Weighted Graph

In this paper an attempt is made to adapt the harmonic potential field motion planning approach to operation in a discrete, sample-based mode. The strong relation between graph theory and electrical networks is utilized to suggest a discrete counterpart to the boundary value problem used to generate the continuous, harmonic, navigation potential. It is shown that a discrete potential field defined on each vertex of a weighted graph and made to satisfy the balance condition represented by Kirchhoff current law (KCL) is capable of generating a flow field that may be used to build algorithms for finding the minimum cost path between two vertices. Two algorithms of this type are suggested. Supporting definitions and propositions are also provided

[1]  Ahmad A. Masoud,et al.  Evolutionary action maps for navigating a robot in an unknown, multidimensional, stationary environment. II. Implementation and results , 1997, Proceedings of International Conference on Robotics and Automation.

[2]  Ahmad A. Masoud,et al.  An informationally-open, organizationally-closed control structure for navigating a robot in an unknown, stationary environment , 2003, Proceedings of the 2003 IEEE International Symposium on Intelligent Control.

[3]  Ahmad A. Masoud,et al.  Solving the Narrow Corridor Problem in Potential Field-Guided Autonomous Robots , 2005, Proceedings of the 2005 IEEE International Conference on Robotics and Automation.

[4]  Didier Keymeulen,et al.  The fluid dynamics applied to mobile robot motion: the stream field method , 1994, Proceedings of the 1994 IEEE International Conference on Robotics and Automation.

[5]  L. Bobrow.  Elementary Linear Circuit Analysis , 1981 .

[6]  Audra E. Kosh,et al.  Linear Algebra and its Applications , 1992 .

[7]  Kamal K. Gupta,et al.  An Incremental Harmonic Function-based Probabilistic Roadmap Approach to Robot Path Planning , 2005, Proceedings of the 2005 IEEE International Conference on Robotics and Automation.

[8]  S. Axler,et al.  Harmonic Function Theory , 1992 .

[9]  G. M.,et al.  Partial Differential Equations I , 2023, Applied Mathematical Sciences.

[10]  Ahmad A. Masoud,et al.  Motion planning in the presence of directional and obstacle avoidance constraints using nonlinear, anisotropic, harmonic potential fields , 2000, Proceedings 2000 ICRA. Millennium Conference. IEEE International Conference on Robotics and Automation. Symposia Proceedings (Cat. No.00CH37065).

[11]  Steven M. LaValle,et al.  Current Issues in Sampling-Based Motion Planning , 2005, ISRR.

[12]  Sundaram Seshu,et al.  Linear Graphs and Electrical Networks , 1961 .

[13]  K. B. Haley,et al.  Programming, Games and Transportation Networks , 1966 .

[14]  Danica Kragic,et al.  Artificial potential biased probabilistic roadmap method , 2004, IEEE International Conference on Robotics and Automation, 2004. Proceedings. ICRA '04. 2004.

[15]  Daniel E. Koditschek,et al.  Exact robot navigation using artificial potential functions , 1992, IEEE Trans. Robotics Autom..