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

^*此作品的通讯作者

科研成果: 书/报告/会议事项章节 › 会议稿件 › 同行评审

2 引用（Scopus）

摘要

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.

源语言	英语
主期刊名	ICCASM 2010 - 2010 International Conference on Computer Application and System Modeling, Proceedings
页	V813-V817
DOI	https://doi.org/10.1109/ICCASM.2010.5619214
出版状态	已出版 - 2010
活动	2010 International Conference on Computer Application and System Modeling, ICCASM 2010 - Shanxi, Taiyuan, 中国期限: 22 10月 2010 → 24 10月 2010

丛书

姓名	ICCASM 2010 - 2010 International Conference on Computer Application and System Modeling, Proceedings
卷	8

会议

会议	2010 International Conference on Computer Application and System Modeling, ICCASM 2010
国家/地区	中国
市	Shanxi, Taiyuan
时期	22/10/10 → 24/10/10

联合国可持续发展目标

此成果有助于实现下列可持续发展目标：

可持续发展目标 11 可持续城市和社区

访问文件

10.1109/ICCASM.2010.5619214

其它文件与链接

链接到 Scopus 的出版物

引用此

Cheng, L., & Wang, M. (2010). A new path planning algorithm based on partitioned urban transportation network. 在 ICCASM 2010 - 2010 International Conference on Computer Application and System Modeling, Proceedings (页码 V813-V817). 期刊论文 5619214 (ICCASM 2010 - 2010 International Conference on Computer Application and System Modeling, Proceedings; 卷 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. 在 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, 卷 8, 页码 V813-V817, 2010 International Conference on Computer Application and System Modeling, ICCASM 2010, Shanxi, Taiyuan, 中国, 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. 页码 V813-V817 5619214 (ICCASM 2010 - 2010 International Conference on Computer Application and System Modeling, Proceedings; 卷 8).

科研成果: 书/报告/会议事项章节 › 会议稿件 › 同行评审

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 -

Cheng L , Wang M. A new path planning algorithm based on partitioned urban transportation network. 在 ICCASM 2010 - 2010 International Conference on Computer Application and System Modeling, Proceedings. 2010. 页码 V813-V817. 5619214. (ICCASM 2010 - 2010 International Conference on Computer Application and System Modeling, Proceedings). doi: 10.1109/ICCASM.2010.5619214

A new path planning algorithm based on partitioned urban transportation network

摘要

丛书

会议

联合国可持续发展目标

访问文件

其它文件与链接

学术指纹

引用此