CFP last date
20 May 2024
Call for Paper
June Edition
IJCA solicits high quality original research papers for the upcoming June edition of the journal. The last date of research paper submission is 20 May 2024

Submit your paper
Know more
The week's pick
Responsive image
Enhancing Privacy Preservation: Multi-Attribute Protection with P-Sensitive K-Anonymity

Twinkle Patel Kiran Amin
Random Articles
Reseach Article

Efficient ABC Algorithm for Dynamic Path Planning

by Priyanka Goel, Devendra Singh
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 88 - Number 2
Year of Publication: 2014
Authors: Priyanka Goel, Devendra Singh
10.5120/15322-3634

Priyanka Goel, Devendra Singh . Efficient ABC Algorithm for Dynamic Path Planning. International Journal of Computer Applications. 88, 2 ( February 2014), 15-18. DOI=10.5120/15322-3634

@article{ 10.5120/15322-3634,
author = { Priyanka Goel, Devendra Singh },
title = { Efficient ABC Algorithm for Dynamic Path Planning },
journal = { International Journal of Computer Applications },
issue_date = { February 2014 },
volume = { 88 },
number = { 2 },
month = { February },
year = { 2014 },
issn = { 0975-8887 },
pages = { 15-18 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume88/number2/15322-3634/ },
doi = { 10.5120/15322-3634 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T22:06:33.996185+05:30
%A Priyanka Goel
%A Devendra Singh
%T Efficient ABC Algorithm for Dynamic Path Planning
%J International Journal of Computer Applications
%@ 0975-8887
%V 88
%N 2
%P 15-18
%D 2014
%I Foundation of Computer Science (FCS), NY, USA
Abstract

The path planning of mobile robot is an important issue in the field of robotics. Many algorithms have been designed to solve the path planning problem, including classical as well as intelligent approaches. The main aim of path planning is to construct collision free path from a specified start position to the target position. Moreover, the path should be optimal in some context such as distance, time or processing. This paper presents an efficient algorithm which is a variation of artificial bee colony algorithm. The environment modelled is in the form of grid consisting of obstacles. The algorithm works on two problems- the first problem is to find collision free path in the presence of static obstacles and the second problem is to determine shortest collision free path in the presence of dynamic obstacles.

References
  1. Buniyamin N. , Wan Ngah W. A. J. , Sariff N. , Mohamad Z. , "A Simple Local Path Planning Algorithm for Autonomous Mobile Robots", International Journal Of Systems Applications,Engineering & Development, Issue 2, Volume 5, 2011
  2. Ananya Das, Priyadarshini Mohapatra, Prakrti Mishra, Pradipta K. Das and Subash C. Mandhata, "Improved real time A* algorithm for Path Planning of Mobile Robot in Quadrant Based Environment", International Journal on Advanced Computer Theory and Engineering (IJACTE), Volume-1, Issue-1, 2012
  3. Santiago Garrido, Luis Moreno, Dolores Blanco and Piotr Jurewicz ?Path Planning for Mobile Robot Navigation using Voronoi Diagram and Fast Marching?, International Journal of Robotics and Automation (IJRA), Volume (2) : Issue (1) : 2011
  4. Pradipta kumar Das, Amit Konar, Romesh Laishram, ?Path Planning of Mobile Robot in Unknown Environment?, Special Issue of IJCCT Vol. 1 Issue 2, 3, 4; 2010 for International Conference [ACCTA-2010], 3-5 August 2010
  5. O. Hachour, "The proposed path finding strategy in static unknown environments", INTERNATIONAL JOURNAL OF SYSTEMS APPLICATIONS, ENGINEERING & DEVELOPMENT Issue 4, Volume 3, 2009
  6. Luciano C. A. Pimenta, Alexandre R. Fonseca, Guilherme A. S. Pereira, Renato C. Mesquita, Elson J. Silva, Walmir M. Caminhas and Mario F. M. Campos, ?Robot Navigation Based on Electrostatic Field Computation?, IEEE TRANSACTIONS ON MAGNETICS, VOL. 42, NO. 4, APRIL 2006
  7. Danny Z. Chen, Robert J. Szczerba, and John J. Uhran, Jr. ,"A Framed-Quadtree Approach for Determining Euclidean Shortest Paths in a 2-D Environment", IEEE TRANSACTIONS ON ROBOTICS AND AUTOMATION, VOL. 13, NO. 5, OCTOBER 1997
  8. Yi Shen and Mingxin Yuan, ?A Novel Poly-clone Particle Swarm Optimization Algorithm and Its Application in Mobile Robot Path Planning?, Chinese Control and Decision Conference 2010
  9. Song-Hiang Chia, Kuo-Lan Su, Jr-Hung Guo and Cheng-Yun Chung, "Ant Colony System Based Mobile Robot Path Planning", 2010 Fourth International Conference on Genetic and Evolutionary Computing
  10. M. H. Saffari and M. J. Mahjoob, "Bee Colony Algorithm for Real –Time Optimal Path Planning of Mobile Robots", IEEE 2009
  11. Gihan NAGIB, W. GHARIEB, "PATH PLANNING FOR A MOBILE ROBOTUSING GENETIC ALGORITHMS", IEEE 2004
  12. Jiann-Horng Lin and Li-Ren Huang, "Chaotic Bee Swarm Optimization Algorithm for Path Planning of Mobile Robots", Proceedings of the 10th WSEAS International Conference on EVOLUTIONARY COMPUTING
  13. P. V. Savsani, R. L. Jhala, ?Optimal Path Planning for a Robot Arm by using Artificial Bee Colony(ABC) Algorithm?, International Journal of Modern Engineering Research(IJMER) , Volume No. 2, Issue 5 Sep-Oct 2012,pp 4434-4438
  14. Joon-Woo Lee, Byoung-Suk Choi, Kyoung-Taik Park and Ju-Jang Lee, "Comparison between Heterogeneous Ant Colony Optimization Algorithm and Genetic Algorithm for Global Path Planning of Mobile Robot", IEEE 2011
  15. Li gao-liang, Shi xu-hua," An improved IGA based path planning of mobile robot in dynamic environment", 2011 Seventh International Conference on Natural Computation
  16. Christos Alexopoulos and Paul M. Griffin, "Path planning for Mobile Robot",IEEE Transactions for Man, System and Cybernetics, Volume 22, No. 2 , March/April 1992
  17. G Pampara and AP Engelbrecht, "Binary Artificial Bee Colony Optimization", IEEE 2011
Index Terms

Computer Science
Information Sciences

Keywords

Path planning efficient dynamic optimal

Powered by PhDFocusTM