DSpace Repository

A Realistic Shortest Path Considering Road Intersections

Show simple item record

dc.contributor.author Naeem, Md. Abu
dc.date.accessioned 2022-03-01T06:44:55Z
dc.date.available 2022-03-01T06:44:55Z
dc.date.issued 2021
dc.identifier.uri http://dspace.daffodilvarsity.edu.bd:8080/handle/123456789/7386
dc.description.abstract Finding shortest path plays an important role in many areas. Such as Robotics, Road maps, Network communications etc. There are some popular algorithms that can find the shortest path. In different environments, our conventional algorithm needs to be modified to solve a specific problem. In this paper we modified the conventional Dijkstra algorithm to find the shortest path considering intersections. We tested the performance of our improved algorithm on a real map which is collected from Google map. The algorithm is implemented using Visual C++14, and our analysis results showed that this algorithm is effective and more accurate in real life. en_US
dc.language.iso en_US en_US
dc.publisher Daffodil International University en_US
dc.subject Shortest path en_US
dc.subject Improved Dijkstra algorithm en_US
dc.subject Intersections en_US
dc.title A Realistic Shortest Path Considering Road Intersections en_US
dc.type Article en_US

Files in this item

This item appears in the following Collection(s)

Show simple item record

Search DSpace


My Account