Date of this Version
2013 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS)
Path finding is a fundamental, yet computationally expensive problem in robotics navigation. Often times, it is necessary to sacrifice optimality to find a feasible plan given a time constraint due to the search complexity. Dynamic environments may further invalidate current computed plans, requiring an efficient planning strategy that can repair existing solutions. This paper presents a massively parallelized wavefront-based approach to path planning, running on the GPU, that can efficiently repair plans to accommodate world changes and agent movement, without having to restart the wavefront propagation process. In addition, we introduce a termination condition which ensures the minimum number of GPU iterations while maintaining strict optimality constraints on search graphs with non-uniform costs/
© 2013 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.
Kapadia, M., Garcia, F., Boatright, C., & Badler, N. I. (2013). Dynamic Search on the GPU. 2013 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS), 3332-3337. http://dx.doi.org/10.1109/IROS.2013.6696830
Date Posted: 13 January 2016