Path Exploration in Unknown Environments Using Fokker-Planck Equation on Graph
Lists
Only you see this
Abstract
This paper introduces a graph-based, potential-guided method for path planning problems in unknown environments, where obstacles are unknown until the robots are in close proximity to the obstacle locations. Inspired by the Fokker-Planck equation and the intermittent diffusion process, the proposed method generates a tree connecting the initial and target configurations, and then finds a path on it using the available environmental information. The tree and path are updated iteratively when newly encountered obstacle information becomes available. The resulting method is a deterministic procedure proven to be complete, i.e., it is guaranteed to find a feasible path, when one exists, in a finite number of iterations. The method is scalable to high-dimensional problems. In addition, our method does not search the entire domain for the path, instead, the algorithm only explores a sub-region that can be described by the evolution of the Fokker-Planck equation on graph with a changing of diffusion coefficient intermittently. We demonstrate the performance of our algorithm via several numerical examples with different environments and dimensions, including high-dimensional cases.
BibTeX
@article{zhai2022path,
author = {Haoyan Zhai and Magnus Egerstedt and Haomin Zhou},
title = {{Path Exploration in Unknown Environments Using Fokker-Planck Equation on Graph}},
journal = {J. Intell. Robotic Syst.},
year = {2022},
url = {https://openreview.net/forum?id=SjDGKHEeoxu},
}Loading related content...