CFP last date
20 January 2025
Reseach Article

Line based Geometrical Path Planning Algorithm for Extinguishing Forest Fires

by M. P. Sivaram Kumar, S. Rajasekaran
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 52 - Number 8
Year of Publication: 2012
Authors: M. P. Sivaram Kumar, S. Rajasekaran
10.5120/8222-1650

M. P. Sivaram Kumar, S. Rajasekaran . Line based Geometrical Path Planning Algorithm for Extinguishing Forest Fires. International Journal of Computer Applications. 52, 8 ( August 2012), 22-26. DOI=10.5120/8222-1650

@article{ 10.5120/8222-1650,
author = { M. P. Sivaram Kumar, S. Rajasekaran },
title = { Line based Geometrical Path Planning Algorithm for Extinguishing Forest Fires },
journal = { International Journal of Computer Applications },
issue_date = { August 2012 },
volume = { 52 },
number = { 8 },
month = { August },
year = { 2012 },
issn = { 0975-8887 },
pages = { 22-26 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume52/number8/8222-1650/ },
doi = { 10.5120/8222-1650 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T20:51:44.842476+05:30
%A M. P. Sivaram Kumar
%A S. Rajasekaran
%T Line based Geometrical Path Planning Algorithm for Extinguishing Forest Fires
%J International Journal of Computer Applications
%@ 0975-8887
%V 52
%N 8
%P 22-26
%D 2012
%I Foundation of Computer Science (FCS), NY, USA
Abstract

In this work a mathematical approach based path planning of actor which uses equation of a straight line passing through two points is proposed to extinguish forest fires. Forest domain is considered as a square area and is tessellated into n x n cells (small squares) of desired size. The Actor which performs actions similar to the actions performed by a robot is assumed to be available at one cell which is considered as one point and the cell in which fire occurs is considered as the second point. The equation of straight line is found out using these two points. Then using the straight line equation the sequence of intermediate cells between the cell where the Actor is available and the cell where the fire is occurred is computed and stored in memory. Then a check is made for presence of obstacle in the intermediate cells. If there are obstacles present then a cell without obstacle and also nearer to obstacle cell is found out and replaced in the memory. Integrity check is performed to make sure that successive points are incremental points. i. e. whether the next point can be reached in one move. Then the sequence of points stored in the memory is used by the Actor to move to the cell where fire is occurred and after reaching that cell the actor will start to extinguish fire. Computer simulation results shows that the algorithm works well in all aspects for environment with and without obstacles and it computes the path for the actor to extinguish Forest fire without collision with obstacles.

References
  1. M. P. Sivaram Kumar, S. Rajasekaran, "Detection and Extinguishing Forest Fires using Wireless Sensor and Actor Networks", International Journal of Computer Application,Vol. 24 (1), June 2011, pp. 31-35.
  2. 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.
  3. M. P. Sivaram Kumar, S. Rajasekaran, "Path Planning Algorithms for suppressing Forest Fires using Genetic Algorithm", CiiT –International Journal of Artificial Intelligent Systems and machine Learning", vol 4, No 4, April 2012, pp. 235-240
  4. M. P. Sivaram Kumar, S. Rajasekaran, "A Neural Network based Path Planning Algorithms for Extinguishing Forest Fires", IJCSI International Journal of Computer Science Issues, Vol. 9, Issue 2, No 2, March 2012, pp. 563-568
  5. Richard Fox, Antonio Garcia. Jr and Michael nelson, "A Two dimensional Path Planning Algorithm",Informal publication
Index Terms

Computer Science
Information Sciences

Keywords

Forest fires Path Planning Artificial Intelligence