Research Article
Comparison of Path Planning Algorithms for Extinguishing Forest Fires with A* Algorithm
|
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
|
| Volume 59 - Issue 13 |
| Published: December 2012 |
| Authors: M. P. Sivaram Kumar, S. Rajasekaran |
10.5120/9606-4236
|
M. P. Sivaram Kumar, S. Rajasekaran . Comparison of Path Planning Algorithms for Extinguishing Forest Fires with A* Algorithm. International Journal of Computer Applications. 59, 13 (December 2012), 9-12. DOI=10.5120/9606-4236
@article{ 10.5120/9606-4236,
author = { M. P. Sivaram Kumar,S. Rajasekaran },
title = { Comparison of Path Planning Algorithms for Extinguishing Forest Fires with A* Algorithm },
journal = { International Journal of Computer Applications },
year = { 2012 },
volume = { 59 },
number = { 13 },
pages = { 9-12 },
doi = { 10.5120/9606-4236 },
publisher = { Foundation of Computer Science (FCS), NY, USA }
}
%0 Journal Article
%D 2012
%A M. P. Sivaram Kumar
%A S. Rajasekaran
%T Comparison of Path Planning Algorithms for Extinguishing Forest Fires with A* Algorithm%T
%J International Journal of Computer Applications
%V 59
%N 13
%P 9-12
%R 10.5120/9606-4236
%I Foundation of Computer Science (FCS), NY, USA
Abstract
The scope of this paper is to simulate, analyze and compare path planning algorithms for mobile robots to move smoothly in a collision free grid based static environment for extinguishing forest fires with A* Algorithm. The algorithms are compared in terms of parameters such as cost of the path, execution time of the algorithm, obstacle position and number of obstacles. We have taken two algorithms for comparison with A* algorithm and the simulation is carried out using MATLAB . The results obtained indicate that path planning algorithms for Extinguishing forest fires are better choice than A* Algorithm as time taken for executing (i. e. finding Paths) these algorithms is less than the time taken by the A* Algorithm in the same configuration space . Further more distance based algorithm produces path, the cost of which is less or same as A* in most of the cases and line based algorithm produced path the cost of which is more in eighty percent of the cases for the samples we have taken.
References
- S. M. Lavalle,Planning Algorithms,Cambridge University Press,2004.
- R. Siegwart and I. R. Nourbaksh,Introduction to autonomous Mobile Robots,MIT Press,2004.
- F. Haro and M. Torres, " A comparison of Path Planning Algorithms for Omni-Directional Robots in Dynamic Environments ",
- M. P. Sivaram Kumar, S. Rajasekaran, "Path Planning Algorithms for Extinguishing Forest Fires using", Journal of Computing", Volume 4, issue 2, February 2012, ISSN 2151-9617, pp. 108-113.
- Ting-Kai Wang, Quan Dang, Pei-Yuan Pan, "Path Planning Approach in Unknown Environment", International Journal of Automation and Computing", 7(3), August 2010, pp. 310-316.
- M Seda and T Brezina, "Robot Motion Planning in Eight Directions", Proceedings of the World Congress on Engineering and Computer Science 2009 Vol II WCECS 2009, October 2009, San Francisco, USA
- M. P. Sivaram Kumar, S. Rajasekaran, "Line based Geometrical Path Planning Algorithm for extinguishing Forest fires", International Journal of Computer Applications", Volume 52, Issue 8, August 2012, pp. 22-26.
- Richard Fox, Antonio Garcia. Jr and Michael nelson, "A Two dimensional Path Planning Algorithm, Informal Publication.
- http://intelligence. worldofcomputing. net/ai-search/a-star-algorithm. html
- N. J. Nilson, Artificial Intelligence: A New Synthesis, Morgan Kauffman 1998.
Index Terms
Keywords