Communications of the ACM
Optimal parallel algorithm for visibility of a simple polygon from a point
SCG '89 Proceedings of the fifth annual symposium on Computational geometry
Optimal path analysis using a predator-prey neural network model
IEA/AIE '90 Proceedings of the 3rd international conference on Industrial and engineering applications of artificial intelligence and expert systems - Volume 2
Gross motion planning—a survey
ACM Computing Surveys (CSUR)
Robot motion planning: a distributed representation approach
International Journal of Robotics Research
Using genetic algorithms for robot motion planning
ECAI '92 Proceedings of the 10th European conference on Artificial intelligence
Highly parallelizable route planner based on cellular automata algorithms
IBM Journal of Research and Development
Robot Motion Planning
Using Genetic Algorithms for Robot Motion Planning
Selected Papers from the Workshop on Geometric Reasoning for Perception and Action
A Parallel Algorithm and Architecture for Robot Path Planning
Proceedings of the 8th International Symposium on Parallel Processing
A Reactive Robot Navigation System Based on a Fluid Dynamics Metaphor
PPSN I Proceedings of the 1st Workshop on Parallel Problem Solving from Nature
Homogeneous Neuronlike Structures for Optimization Variational Problem Solving
PARLE '93 Proceedings of the 5th International PARLE Conference on Parallel Architectures and Languages Europe
Parallel Robot Motion Planning in a Dynamic Environment
CONPAR '92/ VAPP V Proceedings of the Second Joint International Conference on Vector and Parallel Processing: Parallel Processing
Shortest Non-Synchronized Motions - Parallel Versions
Proceedings of the Second International ACPC Conference on Parallel Computation
Parallel Object Motion Prediction in a Robotic Navigational Environment
PaCT '09 Proceedings of the 10th International Conference on Parallel Computing Technologies
IROS'09 Proceedings of the 2009 IEEE/RSJ international conference on Intelligent robots and systems
ACM SRC poster: from days to seconds: scalable parallel algorithm for motion planning
Proceedings of the 2011 companion on High Performance Computing Networking, Storage and Analysis Companion
Optimal Robot Path Planning with Cellular Neural Network
International Journal of Intelligent Mechatronics and Robotics
Hi-index | 0.00 |
One of the many features needed to support the activities of autonomoussystems is the ability to plan motion. This enables robots to move in theirenvironment securely and to accomplish given tasks. Unfortunately, thecontrol loop comprising sensing, planning, and acting has not yet beenclosed for robots in dynamic environments. One reason involves the longexecution times of the motion planning component. A solution for thisproblem is offered by the use of highly parallel computation. Thus, animportant task is the parallelization of existing motion planning algorithmsfor robots so that they are suitable for highly parallel computation. Inseveral cases, completely new algorithms have to be designed, so that aparallelization is feasible. In this survey, we review recent approaches tomotion planning using parallel computation. As a classification scheme, weuse the structure given by the different approaches to the robot’smotion planning. For each approach, the available parallel processingmethods are discussed. Each approach is assigned a unique class. Finally,for each research work referenced, a list of keywords is given.