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.
Original language | English |
---|---|
Title of host publication | 18th IEEE International Symposium on A World of Wireless, Mobile and Multimedia Networks, WoWMoM 2017 - Conference |
Publisher | IEEE |
ISBN (Electronic) | 9781538627228 |
DOIs | |
Publication status | Published - 10 Jul 2017 |
Event | 18th IEEE International Symposium on A World of Wireless, Mobile and Multimedia Networks, WoWMoM 2017 - Macao Polytechnic Institute Campus, Macau, China Duration: 12 Jun 2017 → 15 Jun 2017 |
Conference
Conference | 18th IEEE International Symposium on A World of Wireless, Mobile and Multimedia Networks, WoWMoM 2017 |
---|---|
Country/Territory | China |
City | Macau |
Period | 12/06/17 → 15/06/17 |
Keywords
- admissible
- consistent
- fastest path
- Heuristics
- mobility maps
ASJC Scopus subject areas
- Computer Networks and Communications
- Media Technology