车辆导航系统的快速路径规划算法

Third International Conference on Natural Computation (ICNC 2007) Pub Date : 2007-08-24 DOI:10.1109/ICNC.2007.26

Bi Jun, Guang-yu Zhu, Zheng-yu Xie

{"title":"车辆导航系统的快速路径规划算法","authors":"Bi Jun, Guang-yu Zhu, Zheng-yu Xie","doi":"10.1109/ICNC.2007.26","DOIUrl":null,"url":null,"abstract":"This paper proposes an algorithm for seeking the shortest path between two nodes in city's road net according to the characteristics of the net. The algorithm takes advantage of the theories of bidirectional search, projection, minimum angle and binary tree. According to the algorithm analysis , the algorithm can reduce seeking space and raise seeking speed greatly, and its time complexity can not exceed 0(N), while N is the number of road network nodes. The application results show that the algorithm has good practicability.","PeriodicalId":250881,"journal":{"name":"Third International Conference on Natural Computation (ICNC 2007)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-08-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"A Fast Path Planning Algorithm for Vehicle Navigation System\",\"authors\":\"Bi Jun, Guang-yu Zhu, Zheng-yu Xie\",\"doi\":\"10.1109/ICNC.2007.26\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper proposes an algorithm for seeking the shortest path between two nodes in city's road net according to the characteristics of the net. The algorithm takes advantage of the theories of bidirectional search, projection, minimum angle and binary tree. According to the algorithm analysis , the algorithm can reduce seeking space and raise seeking speed greatly, and its time complexity can not exceed 0(N), while N is the number of road network nodes. The application results show that the algorithm has good practicability.\",\"PeriodicalId\":250881,\"journal\":{\"name\":\"Third International Conference on Natural Computation (ICNC 2007)\",\"volume\":\"11 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2007-08-24\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Third International Conference on Natural Computation (ICNC 2007)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICNC.2007.26\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Third International Conference on Natural Computation (ICNC 2007)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICNC.2007.26","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 2

摘要

根据城市道路网络的特点，提出了一种寻找城市道路网络中两个节点之间最短路径的算法。该算法利用了双向搜索、投影、最小角度和二叉树等理论。通过算法分析，该算法可以大大减少搜索空间，提高搜索速度，时间复杂度不超过0(N)， N为路网节点数。应用结果表明，该算法具有良好的实用性。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

A Fast Path Planning Algorithm for Vehicle Navigation System

This paper proposes an algorithm for seeking the shortest path between two nodes in city's road net according to the characteristics of the net. The algorithm takes advantage of the theories of bidirectional search, projection, minimum angle and binary tree. According to the algorithm analysis , the algorithm can reduce seeking space and raise seeking speed greatly, and its time complexity can not exceed 0(N), while N is the number of road network nodes. The application results show that the algorithm has good practicability.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Third International Conference on Natural Computation (ICNC 2007)

自引率

0.00%

发文量