科研之友
微信
新浪微博
Facebook
分享链接
摘要
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.
- 出版日期2012-6
