Notice of Retraction: An improved Dijkstra algorithm used on vehicle optimization route planning

Fan, Yuezhen; Lu, Dunmin; Wang, Qingchun; Jiang, Fachao

doi:10.1109/iccet.2010.5485737

Cited by 8 publications

(5 citation statements)

References 1 publication

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Many methods and algorithms have been proposed for the navigation and the path planning from different prespectives, such as graph based models [5], [10], A-Star based algorithms [18], [27], behavior based models [24], [29], self-learning based methods [29], sensor fusion based methods [38], neural network approaches [20]- [22], [33], fuzzy logic algorithms [17], [24], etc. Reference [29] developed an improved algorithm for mobile robot path planning in unknown environments, where the proposed algorithm is associated with skinner operant conditioning and a bio-inspired neural dynamics.…”

Section: The Navigation Systems For the Path Planningmentioning

confidence: 99%

A Novel Vector-Based Dynamic Path Planning Method in Urban Road Network

Cai

Cui

et al. 2020

IEEE Access

View full text Add to dashboard Cite

The optimal path planning is one of the hot spots in the research of intelligence transportation and geographic information systems. There are many productions and applications in path planning and navigation, however due to the complexity of urban road networks, the difficulty of the traffic prediction increases. The optimal path means not only the shortest distance in geography, but also the shortest time, the lowest cost, the maximum road capacity, etc. In fast-paced modern cities, people tend to reach the destination with the shortest time. The corresponding paths are considered as the optimal paths. However, due to the high data sensing speed of GPS devices, it is different to collect or describe real traffic flows. To address this problem, we propose an innovative path planning method in this paper. Specially, we first introduce a crossroad link analysis algorithm to calculate the real-time traffic conditions of crossroads (i.e. the CrossRank values). Then, we adopt a CrossRank value based A-Star for the path planning by considering the real-time traffic conditions. To avoid the high volume update of CrossRank values, a R-Tree structure is proposed to dynamically update local CrossRank values from the multi-level subareas. In the optimization process, to achieve desired navigation results, we establish the traffic congestion coefficient to reflect different traffic congestion conditions. To verify the effectiveness of the proposed method, we use the actual traffic data of Beijing. The experimental results show that our method is able to generate the appropriate path plan in the peak and low dynamic traffic conditions as compared to online applications. INDEX TERMS CrossRank, path planning, vector, heuristic algorithm.

show abstract

Section: The Navigation Systems For the Path Planningmentioning

confidence: 99%

A Novel Vector-Based Dynamic Path Planning Method in Urban Road Network

Cai

Cui

et al. 2020

IEEE Access

View full text Add to dashboard Cite

show abstract

“…To deferent demands in practice, optimal path planning algorithm follows these rules: the shortest path, or the least time, or the lowest cost. No matter any rules above, optimal path planning algorithm comes down to optimal path in graph theory [5]. Supposed there is a weighted directed graph G=(V,{E}), here V is vertex set including {v(1), v(2),… ,v(n)}, and E is edge set including {e(1),e(2),…,e(m) }.…”

Section: Optimal Road Planning Based On Ndsmentioning

confidence: 99%

Optimal Path Planning Based on NDS

Kang

2012

AMR

View full text Add to dashboard Cite

show abstract

“…Otherwise, an adjacent matrix WIndex is used to describe the relationship between nodes by directed arcs. But different from a conventional adjacent matrix which stores the weights of all the arcs [11] , the matrix stores the pointers of all the arcs to locate the addresses of their adjacent tables in array Road.…”

Section: Data Structure For Our Improved Dijkstra Algorithmmentioning

confidence: 99%

“…Based on literature [11], to describe our improved Dijkstra algorithm, the following symbols and variables are introduced:…”

Section: The Improved Dijkstra Algorithmmentioning

confidence: 99%

A Simplified Time-Division Based on Road Network Model Considering Intersection Delay for Vehicle Navigation

Zhu

Wang

et al. 2011

AMM

View full text Add to dashboard Cite

How to model a dynamic road network has great practical significance in a vehicle navigation system. This paper has proposed a simplified time-division based on road network model which implicitly takes into account the delay time at various intersections, the degree of a road congestion and the different road quality, but avoids a complicated calculation and collection for these traffic data. An improved Dijkstra algorithm based on the new model has also been given. The simulation results show that the model can work well and the algorithm is efficient.

show abstract

Notice of Retraction: An improved Dijkstra algorithm used on vehicle optimization route planning

Cited by 8 publications

References 1 publication

A Novel Vector-Based Dynamic Path Planning Method in Urban Road Network

A Novel Vector-Based Dynamic Path Planning Method in Urban Road Network

Optimal Path Planning Based on NDS

A Simplified Time-Division Based on Road Network Model Considering Intersection Delay for Vehicle Navigation

Contact Info

Product

Resources

About