Optimal path planning using an improved A * algorithm for homeland security applications

  • Authors:

  • Anand Veeraswamy;Bala Amavasai

  • Affiliations:

  • Microsystems and Machine Vision Laboratory, Materials and Engineering Research Institute, Faculty of Arts, Computing, Engineering and Sciences, Sheffield Hallam University, Sheffield, United Kingd ...;Microsystems and Machine Vision Laboratory, Materials and Engineering Research Institute, Faculty of Arts, Computing, Engineering and Sciences, Sheffield Hallam University, Sheffield, United Kingd ...

  • Venue:
  • AIA'06 Proceedings of the 24th IASTED international conference on Artificial intelligence and applications
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

Path finding is an important sub task in mobile robotics and Homeland Security applications and has been subjected to extensive research. This paper analyses a variety of search algorithms used for path finding and planning. Using the Breve simulation environment, a general search algorithm and then the A* algorithm have been implemented. An improvement to the A* algorithm is introduced and presented. In this paper it has been proved through experimental results that the performance of the A* algorithm improves considerably after adding an additional heuristic. Dynamic path planning has also been implemented in this paper by allowing the vehicle to check for changes in the environment at every simulation time step and recalculate paths if there is a change in the environment. In the past ad-hoc sensor networks have been used in homeland security. In this paper ad-hoc sensor networks have been modeled using the patch class in the Breve simulation tool and path finding techniques have been used in this environment. Time and space complexity analysis of the various algorithms implemented in this paper have been presented.