D. Nieuwenhuisen and M. Overmars, Useful cycles in probabilistic roadmap graphs, IEEE International Conference on Robotics and Automation, 2004. Proceedings. ICRA '04. 2004, pp.446-452, 2004.
DOI : 10.1109/ROBOT.2004.1307190

S. Karaman and E. Frazzoli, Sampling-based algorithms for optimal motion planning, The International Journal of Robotics Research, vol.23, issue.7, pp.846-894, 2011.
DOI : 10.1017/CBO9780511546877

S. Karaman, M. Walter, A. Perez, E. Frazzoli, and S. Teller, Anytime Motion Planning using the RRT*, 2011 IEEE International Conference on Robotics and Automation, pp.1478-1483, 2011.
DOI : 10.1109/ICRA.2011.5980479

J. Marble and K. Bekris, Asymptotically Near-Optimal Planning With Probabilistic Roadmap Spanners, IEEE Transactions on Robotics, vol.29, issue.2, pp.432-444, 2013.
DOI : 10.1109/TRO.2012.2234312

A. Dobson and K. Bekris, Sparse roadmap spanners for asymptotically near-optimal motion planning, The International Journal of Robotics Research, vol.19, issue.4, pp.18-47, 2014.
DOI : 10.1017/CBO9780511546877

D. Ferguson and A. Stentz, Anytime RRTs, 2006 IEEE/RSJ International Conference on Intelligent Robots and Systems, pp.5369-5375, 2006.
DOI : 10.1109/IROS.2006.282100

L. Jaillet, J. Cortés, and T. Siméon, Sampling-Based Path Planning on Configuration-Space Costmaps, IEEE Transactions on Robotics, vol.26, issue.4, pp.635-646, 2010.
DOI : 10.1109/TRO.2010.2049527

D. Devaurs, T. Siméon, and J. Cortés, Enhancing the transition-based RRT to deal with complex cost spaces, 2013 IEEE International Conference on Robotics and Automation, pp.4105-4110, 2013.
DOI : 10.1109/ICRA.2013.6631158

URL : https://hal.archives-ouvertes.fr/hal-00872224

D. Berenson, T. Siméon, and S. Srinivasa, Addressing cost-space chasms in manipulation planning, 2011 IEEE International Conference on Robotics and Automation, pp.4561-4568, 2011.
DOI : 10.1109/ICRA.2011.5979797

M. Manubens, D. Devaurs, L. Ros, and J. Cortés, Motion Planning for 6-D Manipulation with Aerial Towed-cable Systems, Robotics: Science and Systems IX, 2013.
DOI : 10.15607/RSS.2013.IX.028

URL : https://hal.archives-ouvertes.fr/hal-00872234

L. Jaillet, F. Corcho, J. Pérez, and J. Cortés, Randomized tree construction algorithm to explore energy landscapes, Journal of Computational Chemistry, vol.319, issue.16, pp.3464-3474, 2011.
DOI : 10.1002/jcc.21931

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.589.7111

A. Stentz, Optimal and efficient path planning for partially-known environments, IEEE ICRA, pp.3310-3317, 1994.

S. Lavalle and J. Kuffner, Rapidly-exploring random trees: progress and prospects, Algorithmic and Computational Robotics: New Directions. A. K. Peters, pp.293-308, 2001.

R. Geraerts and M. Overmars, Creating High-quality Paths for Motion Planning, The International Journal of Robotics Research, vol.26, issue.8, pp.845-863, 2007.
DOI : 10.1177/0278364907079280

J. Jeon, S. Karaman, and E. Frazzoli, Anytime computation of timeoptimal off-road vehicle maneuvers using the RRT*, IEEE CDC, pp.3276-3282, 2011.

R. Geraerts and M. Overmars, Creating High-quality Roadmaps for Motion Planning in Virtual Environments, 2006 IEEE/RSJ International Conference on Intelligent Robots and Systems, pp.4355-4361, 2006.
DOI : 10.1109/IROS.2006.282009

Q. Zhu, Y. Wu, G. Wu, and X. Wang, An Improved Anytime RRTs Algorithm, 2009 International Conference on Artificial Intelligence and Computational Intelligence, pp.268-272, 2009.
DOI : 10.1109/AICI.2009.162

]. Y. Abbasi-yadkori, J. Modayil, and C. Szepesvári, Extending rapidlyexploring random trees for asymptotically optimal anytime motion planning, IEEE/RSJ IROS, pp.127-132, 2010.

R. Alterovitz, S. Patil, and A. Derbakova, Rapidly-exploring roadmaps: Weighing exploration vs. refinement in optimal motion planning, 2011 IEEE International Conference on Robotics and Automation, pp.3706-3712, 2011.
DOI : 10.1109/ICRA.2011.5980286

URL : http://www.ncbi.nlm.nih.gov/pmc/articles/PMC3268134

R. Luna, I. S. ¸-ucan, M. Moll, and L. Kavraki, Anytime solution optimization for sampling-based motion planning, 2013 IEEE International Conference on Robotics and Automation, pp.5068-5074, 2013.
DOI : 10.1109/ICRA.2013.6631301

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.299.3713

D. Devaurs, T. Siméon, and J. Cortés, Efficient Sampling-Based Approaches to Optimal Path Planning in Complex Cost Spaces, WAFR, 2014.
DOI : 10.1007/978-3-319-16595-0_9

URL : https://hal.archives-ouvertes.fr/hal-01062970

T. Siméon, J. Laumond, and F. Lamiraux, Move3D: A generic platform for path planning, Proceedings of the 2001 IEEE International Symposium on Assembly and Task Planning (ISATP2001). Assembly and Disassembly in the Twenty-first Century. (Cat. No.01TH8560), pp.25-30, 2001.
DOI : 10.1109/ISATP.2001.928961

D. Devaurs, T. Siméon, and J. Cortés, A multi-tree extension of the transition-based RRT: Application to ordering-and-pathfinding problems in continuous cost spaces, 2014 IEEE/RSJ International Conference on Intelligent Robots and Systems, pp.2991-2996, 2014.
DOI : 10.1109/IROS.2014.6942975

URL : https://hal.archives-ouvertes.fr/hal-01057030