Schmidt M, Fey D (2008)
Publication Type: Conference contribution
Publication year: 2008
Edited Volumes: Proceedings of the IASTED International Conference on Parallel and Distributed Computing and Systems
Pages Range: 176-181
Conference Proceedings Title: Proc. of the 20th IASTED Intern. Conf. on Parallel and Distributed Computing and Systems
Event location: Orlando, USA
Path planning is one of the most computation expensive tasks in the field of mobile robotics especially in dynamically changing environments. It is difficult to meet realtime requirements with serial path planning algorithms. This would require a high speed processor. Particularly in small autonomous robot systems, this is inefficient due to the energy consumption and space requirement. In contrast, we propose a parallel path planning approach based on Marching Pixels which is a new innovative Organic Computing principle. It can be used as coarse global path planner in dynamically changing environments because the algorithm is very fast and only requires few resources.
APA:
Schmidt, M., & Fey, D. (2008). A Parallel Path Planning Approach Based on Organic Computing Principles. In Proc. of the 20th IASTED Intern. Conf. on Parallel and Distributed Computing and Systems (pp. 176-181). Orlando, USA.
MLA:
Schmidt, Michael, and Dietmar Fey. "A Parallel Path Planning Approach Based on Organic Computing Principles." Proceedings of the (IASTED), Orlando, USA 2008. 176-181.
BibTeX: Download