Abstract
Here, the BGM that is suggested in the first part of this paper is used to construct a complete path planner for an agent of arbitrary shape that is operating in a totally unknown, multidimensional, stationary environment. The planner does not require any a priori knowledge about the environment to guarantee that a path to the target will be found. Any a priori information about the environment, regardless of its degree of fragmentation or sparsity, can be integrated into the planning process to accelerate convergence and enhance the quality of the path. Details for constructing the planner along with experiments to demonstrate its capabilities are supplied.
| Original language | English |
|---|---|
| Pages (from-to) | 2090-2096 |
| Number of pages | 7 |
| Journal | Proceedings - IEEE International Conference on Robotics and Automation |
| Volume | 3 |
| State | Published - 1997 |
| Externally published | Yes |
ASJC Scopus subject areas
- Software
- Control and Systems Engineering
- Electrical and Electronic Engineering
- Artificial Intelligence