A NEW PROBABILISTIC PATH PLANNER - For Mobile Robots Comparison with the Basic RRT Planner

Sofiane Ahmed Ali, Eric Vasselin, Alain Faure

2007

Abstract

the rapidly exploring random trees (RRTs) have generated a highly successful single query planner which solved difficult problems in many applications of motion planning in recent years. Even though RRT works well on many problems, they have weaknesses in environments that handle complicated geometries. Sampling narrow passages in a robot’s free configuration space remains a challenge for RRT planners indeed; the geometry of a narrow passage affects significantly the exploration property of the RRT when the sampling domain is not well adapted for the problem. In this paper we characterize the weaknesses of the RRT planners and propose a general framework to improve their behaviours in difficult environments. We simulate and test our new planner on mobile robots in many difficult static environments which are completely known, simulations show significant improvements over existing RRT based planner to reliably capture the narrow passages areas in the configuration space.

References

  1. J. H. Reif, “Complexity of the mover's problem and generalizations,” in Proceedings of the 20th IEEE Symposium on Foundations of Computer Science, 1979, pp. 421-427.
  2. P. Svestka, Robot motion planning using probabilistic roadmaps. Ph.D Thesis, Utrecht University, 1997.
  3. L. E.Kavraki, J.-C.Latombe, Randomized preprocessing of configuration space for fast path planning, In:IEEE Int Conf On Robotics and Automation,1994,pp.2138- 2145.
  4. S. M. La Valle Rapidly-exploring random trees: A new tool for path planning. TR 98-11, Computer Science Dept., Iowa State University, Oct. 1998.
  5. E. Ferré and J.-P. Laumond An iterative diffusion method for part disassembly. In IEEE Int.Conf .Robot.& Autom.,2004
  6. A. Yershova and S. M. LaValle. planning for closed chains without inverse kinematics, in: IEEE Conf On Robotics and Automation, 2007 to appear
  7. F. Lamiraux, E.Ferre, and E. Vallee. kinodynamic motion planning: connecting exploration trees using trajectory optimization methods. In IEEE In Conf Robot & Autom, pages 3987-3992, 2004.
  8. Sofiane Ahmed Ali, Eric Vasselin and Alain Faure. “A new Hybrid sampling strategy for PRM planners to address narrow passages problem”. In Proceedings 3rd International Conference on Informatics in Control, Automation and Robotics (ICINCO), 2006.
Download


Paper Citation


in Harvard Style

Ahmed Ali S., Vasselin E. and Faure A. (2007). A NEW PROBABILISTIC PATH PLANNER - For Mobile Robots Comparison with the Basic RRT Planner . In Proceedings of the Fourth International Conference on Informatics in Control, Automation and Robotics - Volume 4: ICINCO, ISBN 978-972-8865-83-2, pages 402-407. DOI: 10.5220/0001649504020407


in Bibtex Style

@conference{icinco07,
author={Sofiane Ahmed Ali and Eric Vasselin and Alain Faure},
title={A NEW PROBABILISTIC PATH PLANNER - For Mobile Robots Comparison with the Basic RRT Planner},
booktitle={Proceedings of the Fourth International Conference on Informatics in Control, Automation and Robotics - Volume 4: ICINCO,},
year={2007},
pages={402-407},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0001649504020407},
isbn={978-972-8865-83-2},
}


in EndNote Style

TY - CONF
JO - Proceedings of the Fourth International Conference on Informatics in Control, Automation and Robotics - Volume 4: ICINCO,
TI - A NEW PROBABILISTIC PATH PLANNER - For Mobile Robots Comparison with the Basic RRT Planner
SN - 978-972-8865-83-2
AU - Ahmed Ali S.
AU - Vasselin E.
AU - Faure A.
PY - 2007
SP - 402
EP - 407
DO - 10.5220/0001649504020407