• FATHIMA NIJIYA K
• JINI RAJU

Recent advancement in research and technology has led to the development of various self-adaptive systems like unmanned ground vehicles, unmanned aerial vehicles and robots. The autonomous navigation of these systems is an important area of concern. There exists various node based path planning algorithms that can find a collision free path from an initial location to a destination location avoiding obstacles. In this paper, we provide a comparative study of some node based algorithms based on the time efficiency, solution quality and type of data structure used. In addition, we conduct an applicable analysis of the studied algorithms after considering the merits and demerits.

Path planning, Heuristic search, incremental search, Multi-objective path planning and Directed acyclic state expansion graph (DAG)

"A SURVEY ON NODE BASED PATH PLANNING ALGORITHMS", International Journal of Emerging Technologies and Innovative Research (www.jetir.org), ISSN:2349-5162, Vol.6, Issue 6, page no.557-561, June 2019, Available :http://www.jetir.org/papers/JETIR1907835.pdf

"A SURVEY ON NODE BASED PATH PLANNING ALGORITHMS", International Journal of Emerging Technologies and Innovative Research (www.jetir.org | UGC and issn Approved), ISSN:2349-5162, Vol.6, Issue 6, page no. pp557-561, June 2019, Available at : http://www.jetir.org/papers/JETIR1907835.pdf