Beamlet-like Data Processing for Accelerated Path-Planning Using Multiscale Information of the Environment
Loading...
Author(s)
Advisor(s)
Editor(s)
Collections
Supplementary to:
Permanent Link
Abstract
We consider the deterministic path-planning problem
dealing with the single-pair shortest path on a given graph.
We propose a multiscale version of the well known A* algorithm
(m-A*), which utilizes information of the environment at
distinct scales. This information is collected via a bottom-up
fusion method. Comparing with existing algorithms such as
Dijkstra’s or A*, the use of multiscale information leads to an
improvement in terms of computational complexity.
Sponsor
Date
2010-12
Extent
Resource Type
Text
Resource Subtype
Post-print
Proceedings
Proceedings