Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/67396
Title: A consistent heuristic for efficient path planning on mobility maps
Authors: Yuan, WM
Ganganath, N
Cheng, CT 
Qing, G
Lau, CM 
Keywords: Heuristics
Consistent
Admissible
Fastest path
Mobility maps
Issue Date: 2017
Publisher: Institute of Electrical and Electronics Engineers
Source: 2017 IEEE 18th International Symposium on A World of Wireless, Mobile and Multimedia Networks (WoWMoM), Macau, China, 12-15 June 2017, p. 1-5 How to cite?
Abstract: Efficient path planning has an utmost importance in the domain of autonomous navigation. Even though shortest path planning has been well discussed in the past, the same techniques might not always be used to find the fastest path in outdoor environments due to the inability of mobile agents to travel at their peak speed everywhere in irregular terrains. Mobility maps are an effective way for dealing with such irregularities. In this paper, we first introduce a grid-based mobility maps for representing speed limitations in outdoor terrains. Then, we propose a heuristic for finding the fastest path on such maps. The proposed heuristic is proven to be both admissible and consistent. Therefore, it can be used with A∗-like heuristic search algorithms for obtaining fastest paths efficiently. Simulation results provided in this paper verify the optimality of paths that are found with the help of the proposed heuristic.
URI: http://hdl.handle.net/10397/67396
ISBN: 978-1-5386-2723-5 (electronic)
978-1-5386-2724-2 (print on demand(PoD))
DOI: 10.1109/WoWMoM.2017.7974356
Appears in Collections:Conference Paper

Access
View full-text via PolyU eLinks SFX Query
Show full item record

Google ScholarTM

Check

Altmetric



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.