Algorithms based on randomized sampling proved to be the only viable algorithmic tool for quickly solving motion planning problems involving many degrees of freedom. Information on the configuration space is acquired by generating samples and finding simple paths among them. Paths and samples are stored in a suitable data structure. According to this paradigm, in the recent years a wide number of algorithmic techniques have been proposed and some approaches are now widely used. This survey reviews the main algorithms, outlining their advantages and drawbacks, as well as the knowledge recently acquired in the field. © Springer-Verlag Berlin Heidelberg 2006.
CITATION STYLE
Carpin, S. (2006). Algorithmic motion planning: The randomized approach. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4123 LNCS, pp. 740–768). https://doi.org/10.1007/11889342_48
Mendeley helps you to discover research relevant for your work.