Artificial Intelligence in Robot Path Planning
Yogita Gigras1, Kusum Gupta2

1Yogita Gigras, Computer Science and information technology, ITM University, Gurgaon, India.
2Kusum Gupta, Computer Science, Banasthali Vidyapith, Banasthali, India.

Manuscript received on April 11, 2012. | Revised Manuscript received on April 14, 2012. | Manuscript published on May 05, 2012. | PP: 471-474 | Volume-2 Issue-2, May 2012 . | Retrieval Number: B0569042212/2012©BEIESP
Open Access | Ethics and Policies | Cite 
© The Authors. Published By: Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open access article under the CC BY-NC-ND license (

Abstract: Mobile robot path planning problem is an important combinational content of artificial intelligence and robotics. Its mission is to be independently movement from the starting point to the target point make robots in their work environment while satisfying certain constraints. Constraint conditions are as follows: not a collision with known and unknown obstacles, as far as possible away from the obstacle, sports the shortest path, the shortest time, robot-consuming energy minimization and so on. In essence, the mobile robot path planning problem can be seen as a conditional constraint optimization problem. To overcome this problem, ant colony optimization algorithm is used.

Keywords: Particle Swarm Optimization (PSO), Genetic Algorithm(GA), Tabu Search, Simulated Annealing (SA), Reactive Search Optimization (RSO), proportional–integral–derivative(PID).