By Topic

A novel global optimal path planning and trajectory method based on adaptive dijkstra-immune approach for mobile robot

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Asadi, S. ; Sch. of Eng. Emerging Technol., Univ. of Tabriz, Tabriz, Iran ; Azimirad, V. ; Eslami, A. ; Ghanbari, A.

In this paper a new method to find global optimal path is obtained. Utilization of standard graph searching methods leads to eliminate uncertainness of heuristic algorithms. By using graph searching method a suboptimal solution is obtained, it causes to increase speed, precision and performance of heuristic algorithms. Firstly, the environment is defined with using a useful graph theory. Then by adaptive Dijkstra algorithm a suboptimal path is obtained. Finally, Continuous Clonal Selection Algorithm (CCSA) that is combined with negative selection algorithm, improves this suboptimal path and derives global optimal path. The simulation results show that this suggested method in compression with ant colony and elistic genetic algorithms, has more accuracy and precision, with competitive speed. Also, our suggested algorithm can be used for solving more complicated dynamic problems. Moreover, this proposed approach can be used as standard method in optimization problems especially in path planning and trajectory.

Published in:

Advanced Intelligent Mechatronics (AIM), 2011 IEEE/ASME International Conference on

Date of Conference:

3-7 July 2011