Research on path planning for mobile robot among dynamic obstacles

Annual Conference of the North American Fuzzy Information Processing Society - NAFIPS

Volumn 2, Issue , 2001, Pages 763-767

  Wei, Wu ^a   Zhang, QiSen ^a   Mbede, J B ^b   Huang, Xinhan ^b  

^a Changsha Commun Univ   (China)

^b HUAZHONG UNIVERSITY OF SCIENCE AND TECHNOLOGY   (China)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; BOUNDARY CONDITIONS; COLLISION AVOIDANCE; COMPUTER SIMULATION; FUZZY SETS; HARMONIC ANALYSIS; INTELLIGENT ROBOTS; LAPLACE TRANSFORMS; MATHEMATICAL MODELS; MOTION PLANNING; PROBABILITY; ROBOTICS;

ARTIFICIAL POTENTIAL FIELDS; HARMONIC FUNCTION; INTELLIGENT REACTIVE PATH PLANNING; PROBABILISTIC PATH PLANNER;

MOBILE ROBOTS;

EID: 0035792264     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (15)

1. J. Barraquand and J.-C. Latombe, A monte-carlo algorithm for path planning with many degrees of freedom, in Proc. IEEE Internat. Conf. On Robotics and Automation, 1990, pp 1712-1717.
2. Y. K. Hwang and P. C. Chen, A heuristic and complete planner for the classical mover's problem, Proc. IEEE Internat. Conf. On Robotics and Automation, Nagoya, Japan, 1995, pp 729-736.
3. F. van der Stappen, Motion Planning a midst Fat Obstacles, Ph.D. thesis, Dept. Cmput. Sci., Utrecht Univ., Utrecht, the Netherlands, October 1994.
4. F. van der Stappen, D. Halperin, and M.H. Overmars, The complexity of the free space for a robot moving amidst fat obstacles, Comput. Geom. Theory Appl, 3, 1993, pp 353-373.
5. J. T. Schwartz and M. Sharir, Efficient motion planning algorithms in environments of bounded local complexity, Report 164, Dept. Comput. Sci., Courant Inst. Math. Sci., New York Univ., New York, NY, 1985.
6. P. Pignon, Structuration de l'Espace pour une Planification Hiérarchisée des Trajectorires de Robots Mobiles, Ph.D. thesis, LAAS-CNRS and Université Paul Sabatier de Toulouse, Toulouse, France, Report LAAS No. 93395, 1993.
7. C. I. Connolly, Harmonic Functions as a Basis for Motor Control and Planning, Ph.D. Dissertation, Department of Computer Science, University of Massachusetts Amherst, Massachusetts, USA. 1994.
8. L. Tarassenko, A. Blake, Analogue computation of collision-free path, Proc. IEEE Intern. Conf. On Robotics and automation, 1991, pp 540-545.
9. P. G. Doyle and J. L. Snell, Random walks and electric networks, The Mathematical Association of America, 1984.
10. J.M. Ahuactzin, Le Fil d'Ariadne: Une Méthode de Planification Générale, Application á la Planification Automatique de Trajectoire,. PhD. thesis, l'Institut National Polytechnique de Grenoble, Grenoble, France, 1994.
11. P. Bessière, J. M. Ahuactzin, E.-G. Talbi, and E. Mazer, The Ariadne's clew algorithm: Global planning with local methods, Proc. The Workshop on the Algorithmic Foundations of Robotics, 1995, pp 39-47.
12. P. Svestka, Robot motion planning using probabilistic road maps, Ph.D. Thesis, Dept. Computer Sci., Utrecht Univ., The Netherlands, 1997.
13. P. Svestka, A probabilistic approach to motion planning for car-like robots, Master's Thesis, Dept. Computer Sci., Utrecht Univ., The Netherlands, 1993.
14. P. Svestka, On probabilistic completeness and expected complexity of probabilistic path planning, Technical Report UU-CS-96-20, Dept. Computer Sci., Utrecht Univ., The Netherlands, 1996.
15. P. Svestka and M. Overmars, Probabilistic path planning, in Robot motion planning and control, J. P. Laumond (Ed.), Lecture Notes in Control and Information Sciences, Springer-Verlag, 1998.