The massive inherent parallelism of the basic PRM algorithm enables to reach a significant speedup, even with simple parallelization strategies, especially on shared-memory architectures. In this approach, computation time is minimized by having several processes cooperatively building the road map. Another Star Student Project simple approach is known as the or parallel paradigm. It was first applied to theorem proving, before providing a parallel formulation for the randomized path planner (RPP). Its principle is to have several processes running the same sequential randomized algorithm, where each one tries to build its own solution. The first Star Student Project process to reach a solution reports it and broadcasts a termination message.
Project Support for : Ph.D/M.E/M.Tech/B.E/B.Tech/MCA/Msc/BCA/Diplomo
Department : Computer Science/ Information Technology/ Electronics
Star Student Project
The massive inherent parallelism of the basic PRM algorithm enables to reach a significant speedup, even with simple parallelization strategies, especially on shared-memory architectures. In this approach, computation time is minimized by having several processes cooperatively building the road map. Another Star Student Project simple approach is known as the or parallel paradigm. It was first applied to theorem proving, before providing a parallel formulation for the randomized path planner (RPP). Its principle is to have several processes running the same sequential randomized algorithm, where each one tries to build its own solution. The first Star Student Project process to reach a solution reports it and broadcasts a termination message.