2013
DOI: 10.1007/978-3-642-53703-5_36
|View full text |Cite
|
Sign up to set email alerts
|

Regional Road Network Shortest Path Algorithm in Vehicle Navigation Systems

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2020
2020
2020
2020

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(1 citation statement)
references
References 6 publications
0
1
0
Order By: Relevance
“…On the basis of the road network shown in Fig. 1 and Floyd shortest path algorithm [35, 36], the shortest distance between two intersections where a vehicle is successively detected on the road network can be calculated. The travel distance of the vehicle on one day can be estimated by combining the shortest distances between all the intersection pairs where the vehicle is successively detected on the day; (iv) origin–centre distance, which denotes the shortest distance from the most frequent origin intersection of a vehicle to the city centre.…”
Section: Datamentioning
confidence: 99%
“…On the basis of the road network shown in Fig. 1 and Floyd shortest path algorithm [35, 36], the shortest distance between two intersections where a vehicle is successively detected on the road network can be calculated. The travel distance of the vehicle on one day can be estimated by combining the shortest distances between all the intersection pairs where the vehicle is successively detected on the day; (iv) origin–centre distance, which denotes the shortest distance from the most frequent origin intersection of a vehicle to the city centre.…”
Section: Datamentioning
confidence: 99%