.png){kind=icon}
.png){kind=icon}
Return
Multiresolution Hierarchical Path-Planning for Small UAVs Using Wavelet Decompositions
.png){kind=icon}
PRE
AI
DOI：10.1007/s10846-011-9631-z.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
We present an algorithm for solving the shortest (collision-free) path planning problem for an agent (e.g., a small UAV) with limited on-board computational resources. The agent has detailed knowledge of the environment and the obstacles only in the vicinity of its current position. Far away obstacles are only partially known and may even change dynamically. The algorithm makes use of the wavelet transform to construct an approximation of the environment at different levels of resolution. We associate with this multiresolution representation of the environment a graph, whose dimension can be made commensurate to the on-board computational resources of the agent. The adjacency list of the graph can be efficiently constructed directly from the approximation and detail wavelet coefficients, thus further speeding up the whole process. Simulations are presented to test the efficiency of the algorithm using non-trivial scenarios.
Keywords:
Path-planning
Wavelets
Multiresolution
UAV
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
J
IF:
2.8
Papers:
3.8K
Citations:
6.9K