Numerical streamline path planning based on log-space harmonic potential function: A simulation study

Chou, Han-Jung; Kuo, Pei-Li; Liu, Jing‐Sin

doi:10.1109/rcar.2017.8311918

Cited by 4 publications

(1 citation statement)

References 19 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The application of BVP for path planning was demonstrated by Prestesy and Idiartz (2010). In the work by Wray et al (2016) and Chou et al (2017), path planning based on log-space harmonic potential was applied. More recently, a harmonic-based solution was also applied to deal with the autonomous robot exploration problem (Grontas et al, 2020).…”

Section: Introductionmentioning

confidence: 99%

Agent Navigation based on Boundary Value Problem using Iterative Methods

Musli,

Saudi

2023

JSML

View full text Add to dashboard Cite

This paper presents the simulation of numerical solutions to the navigational problem of an agent traveling safely in its environment. The approach is based on the numeric solutions of the boundary value problem (BVP) that generate harmonic potential fields through a differential equation whose gradient represents navigation routes to the destination. Two methods, namely KSOR and KAOR, were tested to solve the BVP. KSOR and KAOR are variants of the standard SOR and AOR methods, respectively. In this work, the KSOR and KAOR methods were used to solve the BVP by applying Laplace's equation to obtain harmonic functions. The generated harmonic functions are then utilized by the searching algorithm to find a smooth navigational route for an agent to travel in its environment without colliding with any obstacles. The numerical results from the solutions of BVP demonstrate that the KAOR provides a faster execution time with fewer iterations compared to the KSOR method.

show abstract