Abstract
Recently proposed Dynamic Z∗ heuristic search algorithm enables mobile robots navigating on uneven terrains to replan energy-efficient paths using previous search results whenever an obstacle is encountered. This paper proposes some vital improvements to Dynamic Z∗ by optimizing the use of previous search results in replanning. Simulation results show that the proposed improvements can significantly reduce the computational cost of replanning in Dynamic Z∗ while producing equally energy-efficient paths.
Original language | English |
---|---|
Title of host publication | Proceedings - 2015 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery, CyberC 2015 |
Publisher | IEEE |
Pages | 395-398 |
Number of pages | 4 |
ISBN (Electronic) | 9781467391993 |
DOIs | |
Publication status | Published - 26 Oct 2015 |
Event | 7th International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery, CyberC 2015 - Xi'an, China Duration: 17 Sept 2015 → 19 Sept 2015 |
Conference
Conference | 7th International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery, CyberC 2015 |
---|---|
Country/Territory | China |
City | Xi'an |
Period | 17/09/15 → 19/09/15 |
Keywords
- energy-efficient
- Mobile robot
- path planning
- replanning
- Uneven terrain
ASJC Scopus subject areas
- Computational Theory and Mathematics
- Computer Networks and Communications
- Artificial Intelligence