A Realistic Shortest Path Considering Road Intersections

Simple item page
dc.contributor.authorNaeem, Md. Abu
dc.date.accessioned2022-03-01T06:44:55Z
dc.date.available2022-03-01T06:44:55Z
dc.date.issued2021
dc.description.abstractFinding 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.
dc.identifier.otherhttp://dspace.daffodilvarsity.edu.bd:8080/handle/123456789/7386
dc.identifier.urihttp://dspace.daffodilvarsity.edu.bd:8080/handle/123456789/7386
dc.language.isoen_US
dc.publisherDaffodil International University
dc.sourceDIU Institutional Repository
dc.subjectShortest path
dc.subjectImproved Dijkstra algorithm
dc.subjectIntersections
dc.titleA Realistic Shortest Path Considering Road Intersections
dc.typeArticle

Files

Original bundle

Now showing 1 - 1 of 1
No Thumbnail Available
Name:
171-35-1868 (19%) clearence.pdf.txt
Size:
27.49 KB
Format:
Adobe Portable Document Format
Download

Collections

Thesis Report