M. Schmidt and D. Fey (Germany)
Parallel Algorithms, Path Planning, Marching Pixels, Mobile Robotics
Path planning is one of the most computation expen sive 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.
Important Links:
Go Back
