A fast path planning algorithm for route guidance system

Selamat, Ali; Zolfpour-Arokhlo, Mortaza; Hashim, Siti Zaiton Mohd; Selamat, Hafiz

doi:10.1109/icsmc.2011.6084092

Cited by 12 publications

(4 citation statements)

References 5 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The local is used in an unknown environment while the global is a prior knowledge of the work environment. In this classification, path or route planning [16] is defined as a problem in which an agent moves from a start to an endpoint by avoiding the obstacles in order to reach the target with minimum cost. The starting and the endpoints could be the same (loop closure) or even different.…”

Section: A Path Planning Problemmentioning

confidence: 99%

Comparison of Path Planning between Improved Informed and Uninformed Algorithms for Mobile Robot

Amr,

Bahgat,

Rashad

et al. 2022

IJACSA

View full text Add to dashboard Cite

This work is concerned with the Path Planning Algorithms (PPA), which hold an important place in Robotics navigation. Navigation has become indispensable to most modern inventions. Mobile robots have to move to a relevant task point in order to achieve the tasks assigned to them. The actions, which are planned in a structure, may restrict the task duration and even in some situations, the mission tends to be accomplished. This paper aims to study and compare six commonly used informed and uninformed algorithms. Three different maps have been created with gradually increasing difficulty levels related to a number of obstacles in the tested maps. The paper provides a detailed comparison between the algorithms under investigation of several parameters such as: Total steps, straight steps, rotation steps, and search time. The promised results were obtained when the proposed algorithms were applied to a case study.

show abstract

Section: A Path Planning Problemmentioning

confidence: 99%

Comparison of Path Planning between Improved Informed and Uninformed Algorithms for Mobile Robot

Amr,

Bahgat,

Rashad

et al. 2022

IJACSA

View full text Add to dashboard Cite

show abstract

“…Reference [19] proposed a fast path algorithm of finding the best shortest paths in the road network to solve the path planning problem in route guidance systems in terms of accuracy and speed. Reference [20] proposed an adaptive fastest path algorithm capable of efficiently accounting for important driving and speed patterns mined from a large set of traffic data.…”

Section: Related Workmentioning

confidence: 99%

Discovering Congested Routes Using Vehicle Trajectories in Road Networks

Bok

Lim

et al. 2015

Advances in Multimedia

View full text Add to dashboard Cite

The popular route recommendation and traffic monitoring over the road networks have become important in the location-based services. The schemes to find out the congested routes were proposed by considering the number of vehicles in a road segment. However, the existing schemes do not consider the features of each road segment such as width, length, and direction in a road network. Furthermore, the existing schemes fail to consider the average moving speed of vehicles. Therefore, they can detect the incorrect density routes. To overcome such problems, we propose a new discovering scheme of congested routes through the analysis of vehicle trajectories in a road network. The proposed scheme divides each road into segments with different width and length in a road network. And then, the congested road segment is detected through the saturation degree of the road segment and the average moving speed of vehicles in the road segment. Finally, we compute the final congested routes by using a clustering scheme. The experimental results have shown that the proposed scheme can efficiently discover the congested routes in the different directions of the roads.

show abstract

“…Single Source Shortest Path (SSSP) problem is to find shortest paths from the source vertex to all other vertices such that the sum of the weights of constituent edges of every path is minimized. It plays an important role in a variety of applications like Intelligent Transportation Systems (ITS) [1], Route Guidance Systems (RGS) [2], path planning in telecommunication systems, Automated Vehicle Dispatching Systems (AVDS), etc. In large networks, the shortest path is a vital problem to find betweenness centrality and closeness centrality [3,4].…”

Section: Introductionmentioning

confidence: 99%

MapReduce Algorithm for Single Source Shortest Path Problem

Kumar¹,

Csed²,

Singh³

2020

IJCNIS

View full text Add to dashboard Cite

Computing single source shortest path is a popular problem in graph theory, extensively applied in many areas like computer networks, operation research and complex network analysis. SSSP is difficult to parallelize efficiently as more parallelization leads to more work done by any algorithm. MapReduce is a popular programming framework for large data processing in distributed and cloud environments. In this paper, we have proposed MR-DSMR, a Map reduce version of Dijkstra Strip-mined Relaxation (DSMR) algorithm and MR3-BFS algorithms. We have compared the performance of both the algorithms with BFS. It is observed that MR-DSMR takes lesser communication and computation time compared to existing algorithms.

show abstract

A fast path planning algorithm for route guidance system

Cited by 12 publications

References 5 publications

Comparison of Path Planning between Improved Informed and Uninformed Algorithms for Mobile Robot

Comparison of Path Planning between Improved Informed and Uninformed Algorithms for Mobile Robot

Discovering Congested Routes Using Vehicle Trajectories in Road Networks

MapReduce Algorithm for Single Source Shortest Path Problem

Contact Info

Product

Resources

About