Résumé
Probabilistic roadmap methods (PRM) have been successfully applied in motion planning for robots with many degrees of freedom. Many recent PRM approaches have demonstrated improved performance by concentrating samples in a nonuniform way. This work replace the random sampling by the deterministic one. We present several implementations of PRM-based planners (multiple-query, single-query and Lazy PRM) and lattice-based roadmaps. Deterministic sampling can be used in the same way than random sampling. Our work can be seen as an important part of the research in the uniform sampling field. Experimental results show performance advantages of our approach.