Find the path for mobile Robot using RRT and PSO technique
Corressponding author's email:
trungtt@hcmute.edu.vnKeywords:
mobile robot, path planning, RRT algorithm, Particle Swarm OptimizationAbstract
RRT (Rapidly-exploring Random Tree) is a random data structure, designed for efficient search in the multi-dimensional space. RRT can be regarded as a technique to create random points in nonlinear systems, especially suited for problems of path planning for mobile robot with nonholonomic and kinodynamic constraints. Particle Swarm Optimization is an efficient algorithm for optimization problems.
This paper presents the application of RRT combining with PSO algorithm to find a path for mobile robots in a known environment. PSO is used to search for the optimal angular and linear velocities so that the robot can move from one position to the next one on the tree. Simulation results in Matlab show that the proposed method is efficient for finding the path for mobile robot in a known environment.
Downloads: 0
References
Latombe, J.C, Robot Motion Planning. Norwood, MA, Kluwer Academic Publishers, 1991.
“Learn about Robots Includes Information on Research, Commercial and Military Robot Applications,” http://robotics.nasa.gov/links/ resources.php
Batavia, P., Nourbakhsh, I., “Path Planning for the Cye Robot,” in Proceedings of the IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS’00), Takamatsu, Japan, November, 2000.
Dr. Jizhong Xiao, Introduction to Robotics, Department of Electrical Engineering City College of New york,jxiao@ccny.cuny.edu
http://www.mauriceclerc.net 29 February 2000.
Lagoudakis, Michail G., Mobile Robot Local Navigation with a Polar Neural Map, MSc Thesis, University of Southwestern Louisiana, 1998.
Maurice Clerc (Maurice.Clerc@WriteMe. com), Discrete Particle Swarm Optimization illustrated by the Traveling Salesman Problem.
Roland Siegwart and Illah R. Nourbakhsh, Introduction to Autonomous Mobile Robots, 2004.
Russell, S., Norvig, P., Artificial Intelligence, a Modern Approach. Prentice Hall International, 1995.
Steven M. LaValle, Rapidly-Exploring Random Trees: A New Tool for Path Planning, Department of Computer Science Iowa State University Ames, IA 50011 USA, lavalle©cs. iastate.edu.
Downloads
Published
How to Cite
License
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.
Copyright © JTE.
