dc.contributor.author |
Viswanathan, Sangeetha |
|
dc.date.accessioned |
2024-10-28T05:38:15Z |
|
dc.date.available |
2024-10-28T05:38:15Z |
|
dc.date.issued |
2019-04 |
|
dc.identifier.uri |
https://link.springer.com/chapter/10.1007/978-3-030-16660-1_9 |
|
dc.identifier.uri |
http://dspace.bits-pilani.ac.in:8080/jspui/handle/123456789/16237 |
|
dc.description.abstract |
With the development of many autonomous systems, the need for efficient and robust path planners are increasing every day. Inspired by the intelligence of the heuristic, a normalized rank-based A* algorithm has been proposed in this paper to find the optimal path between a start and destination point on a classified image. The input image is classified and a normalized rank value based on the priority of traversal on each class is associated with each point on the image. Using the modified A* algorithm, the final optimal path is obtained. The obtained results are compared with the traditional method and results are found to be far better than existing method. |
en_US |
dc.language.iso |
en |
en_US |
dc.publisher |
Springer |
en_US |
dc.subject |
Computer Science |
en_US |
dc.subject |
Algorithms |
en_US |
dc.subject |
A* algorithm |
en_US |
dc.title |
A Normalized Rank Based A* Algorithm for Region Based Path Planning on an Image |
en_US |
dc.type |
Article |
en_US |