A new path planning algorithm based on partitioned urban transportation network

Lin Cheng; Meiling Wang

doi:10.1109/ICCASM.2010.5619214

A new path planning algorithm based on partitioned urban transportation network

Lin Cheng^*
, Meiling Wang

^*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

2 Citations (Scopus)

Abstract

To meet the requirement of real-time vehicle navigation, a new path planning algorithm based on partitioned urban transportation network is proposed in this paper. The foundation of the algorithm is that an actual road network has its particular spatial distribution features, and GIS has strong visual editing functions for transportation network. According to the size of the transportation network, with the GIS platform SuperMap, we partition the network into a certain amount of rectangular blocks, and then according to the starting node and the destination node, the searching area of the algorithm is restricted reasonably. With the actual example given, the experimental results prove the high operational efficiency and strong practicality of the new algorithm.

Original language	English
Title of host publication	ICCASM 2010 - 2010 International Conference on Computer Application and System Modeling, Proceedings
Pages	V813-V817
DOIs	https://doi.org/10.1109/ICCASM.2010.5619214
Publication status	Published - 2010
Event	2010 International Conference on Computer Application and System Modeling, ICCASM 2010 - Shanxi, Taiyuan, China Duration: 22 Oct 2010 → 24 Oct 2010

Publication series

Name	ICCASM 2010 - 2010 International Conference on Computer Application and System Modeling, Proceedings
Volume	8

Conference

Conference	2010 International Conference on Computer Application and System Modeling, ICCASM 2010
Country/Territory	China
City	Shanxi, Taiyuan
Period	22/10/10 → 24/10/10

UN SDGs

This output contributes to the following UN Sustainable Development Goals (SDGs)

SDG 11 Sustainable Cities and Communities

Keywords

Dijkstra algorithm
Path planning
Restricted searching area
SuperMap GIS
Urban transportation network

Access to Document

10.1109/ICCASM.2010.5619214

Cite this

Cheng, L., & Wang, M. (2010). A new path planning algorithm based on partitioned urban transportation network. In ICCASM 2010 - 2010 International Conference on Computer Application and System Modeling, Proceedings (pp. V813-V817). Article 5619214 (ICCASM 2010 - 2010 International Conference on Computer Application and System Modeling, Proceedings; Vol. 8). https://doi.org/10.1109/ICCASM.2010.5619214

@inproceedings{27d983c83f184bfdb5248731fd8b86ed,

title = "A new path planning algorithm based on partitioned urban transportation network",

abstract = "To meet the requirement of real-time vehicle navigation, a new path planning algorithm based on partitioned urban transportation network is proposed in this paper. The foundation of the algorithm is that an actual road network has its particular spatial distribution features, and GIS has strong visual editing functions for transportation network. According to the size of the transportation network, with the GIS platform SuperMap, we partition the network into a certain amount of rectangular blocks, and then according to the starting node and the destination node, the searching area of the algorithm is restricted reasonably. With the actual example given, the experimental results prove the high operational efficiency and strong practicality of the new algorithm.",

keywords = "Dijkstra algorithm, Path planning, Restricted searching area, SuperMap GIS, Urban transportation network",

author = "Lin Cheng and Meiling Wang",

year = "2010",

doi = "10.1109/ICCASM.2010.5619214",

language = "English",

isbn = "9781424472369",

series = "ICCASM 2010 - 2010 International Conference on Computer Application and System Modeling, Proceedings",

pages = "V813--V817",

booktitle = "ICCASM 2010 - 2010 International Conference on Computer Application and System Modeling, Proceedings",

note = "2010 International Conference on Computer Application and System Modeling, ICCASM 2010 ; Conference date: 22-10-2010 Through 24-10-2010",

}

Cheng, L & Wang, M 2010, A new path planning algorithm based on partitioned urban transportation network. in ICCASM 2010 - 2010 International Conference on Computer Application and System Modeling, Proceedings., 5619214, ICCASM 2010 - 2010 International Conference on Computer Application and System Modeling, Proceedings, vol. 8, pp. V813-V817, 2010 International Conference on Computer Application and System Modeling, ICCASM 2010, Shanxi, Taiyuan, China, 22/10/10. https://doi.org/10.1109/ICCASM.2010.5619214

A new path planning algorithm based on partitioned urban transportation network. / Cheng, Lin ; Wang, Meiling.
ICCASM 2010 - 2010 International Conference on Computer Application and System Modeling, Proceedings. 2010. p. V813-V817 5619214 (ICCASM 2010 - 2010 International Conference on Computer Application and System Modeling, Proceedings; Vol. 8).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - A new path planning algorithm based on partitioned urban transportation network

AU - Cheng, Lin

AU - Wang, Meiling

PY - 2010

Y1 - 2010

N2 - To meet the requirement of real-time vehicle navigation, a new path planning algorithm based on partitioned urban transportation network is proposed in this paper. The foundation of the algorithm is that an actual road network has its particular spatial distribution features, and GIS has strong visual editing functions for transportation network. According to the size of the transportation network, with the GIS platform SuperMap, we partition the network into a certain amount of rectangular blocks, and then according to the starting node and the destination node, the searching area of the algorithm is restricted reasonably. With the actual example given, the experimental results prove the high operational efficiency and strong practicality of the new algorithm.

AB - To meet the requirement of real-time vehicle navigation, a new path planning algorithm based on partitioned urban transportation network is proposed in this paper. The foundation of the algorithm is that an actual road network has its particular spatial distribution features, and GIS has strong visual editing functions for transportation network. According to the size of the transportation network, with the GIS platform SuperMap, we partition the network into a certain amount of rectangular blocks, and then according to the starting node and the destination node, the searching area of the algorithm is restricted reasonably. With the actual example given, the experimental results prove the high operational efficiency and strong practicality of the new algorithm.

KW - Dijkstra algorithm

KW - Path planning

KW - Restricted searching area

KW - SuperMap GIS

KW - Urban transportation network

UR - https://www.scopus.com/pages/publications/78649604937

U2 - 10.1109/ICCASM.2010.5619214

DO - 10.1109/ICCASM.2010.5619214

M3 - Conference contribution

AN - SCOPUS:78649604937

SN - 9781424472369

T3 - ICCASM 2010 - 2010 International Conference on Computer Application and System Modeling, Proceedings

SP - V813-V817

BT - ICCASM 2010 - 2010 International Conference on Computer Application and System Modeling, Proceedings

T2 - 2010 International Conference on Computer Application and System Modeling, ICCASM 2010

Y2 - 22 October 2010 through 24 October 2010

ER -

A new path planning algorithm based on partitioned urban transportation network

Abstract

Publication series

Conference

UN SDGs

Keywords

Access to Document

Other files and links

Fingerprint

Cite this