@inbook {IOPORT.05715531,
    author       = {Jaillet, L\'eonard and Sim\'eon, Thierry},
    title        = {Path deformation roadmaps.},
    year         = {2008},
    booktitle    = {Algorithmic foundation of robotics VII. Selected contributions of the seventh international workshop on the algorithmic foundations of robotics (WAFR 2006), New York, NJ, USA, July 16--18, 2006},
    isbn         = {978-3-540-68404-6},
    pages        = {19-34},
    publisher    = {Berlin: Springer},
    doi          = {10.1007/978-3-540-68405-3_2},
    abstract     = {Summary: This paper describes a new approach to sampling-based motion planning with Probabilistic RoadMap (PRM) methods. Our aim is to compute good quality roadmaps that encode the multiple connectedness of the Cspace inside small but yet representative graphs, that capture well the different varieties of free paths. The proposed approach relies on a notion of path deformability indicating whether or not a given path can be continuously deformed into another existing one. By considering a simpler form of deformation than the one allowed between homotopic paths, we propose a method that extends the visibility-PRM technique [{\it T. Sim\'eon, J.-P. Laumond} and {\it C. Nissoux}, ``Visibility-based probabilistic roadmaps for motion planning'', Adv. Robot. J. 14, No.~6, 477-494 (2000)] to constructing compact roadmaps that encode a richer and more suitable information than representative paths of the homotopy classes. The path deformation roadmaps also contain additional useful cycles between paths in the same homotopy class that can be hardly deformed into each other. First experiments presented in the paper show that our technique enables small roadmaps to reliably and efficiently capture the multiple connectedness of the space in various problems.},
    identifier   = {05715531},
}