{"title":"基于AI的城市区域最优路径确定算法","authors":"Wei Yu-wei, Mo Chun-liu","doi":"10.1109/WMWA.2009.47","DOIUrl":null,"url":null,"abstract":"An optimized Dijkstra algorithm is put forward on the basis of the theory of GIS and artificial intelligence to improve the efficiency of conventional Dijkstra algorithm. At first traffic network topologic graph is created according to the characteristics of urban traffic network. The concepts of position node and traffic node are presented. And a reasonable data structure is adopted to store the network. Then a heuristic function is adopted to improve searching efficiency in order that optimized Dijkstra algorithm can fit for complicated traffic networks.","PeriodicalId":375180,"journal":{"name":"2009 Second Pacific-Asia Conference on Web Mining and Web-based Application","volume":"281 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-06-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"Determination of Optimal Path Algorithm in Urban Area Based on AI\",\"authors\":\"Wei Yu-wei, Mo Chun-liu\",\"doi\":\"10.1109/WMWA.2009.47\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"An optimized Dijkstra algorithm is put forward on the basis of the theory of GIS and artificial intelligence to improve the efficiency of conventional Dijkstra algorithm. At first traffic network topologic graph is created according to the characteristics of urban traffic network. The concepts of position node and traffic node are presented. And a reasonable data structure is adopted to store the network. Then a heuristic function is adopted to improve searching efficiency in order that optimized Dijkstra algorithm can fit for complicated traffic networks.\",\"PeriodicalId\":375180,\"journal\":{\"name\":\"2009 Second Pacific-Asia Conference on Web Mining and Web-based Application\",\"volume\":\"281 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2009-06-06\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2009 Second Pacific-Asia Conference on Web Mining and Web-based Application\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/WMWA.2009.47\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 Second Pacific-Asia Conference on Web Mining and Web-based Application","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/WMWA.2009.47","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Determination of Optimal Path Algorithm in Urban Area Based on AI
An optimized Dijkstra algorithm is put forward on the basis of the theory of GIS and artificial intelligence to improve the efficiency of conventional Dijkstra algorithm. At first traffic network topologic graph is created according to the characteristics of urban traffic network. The concepts of position node and traffic node are presented. And a reasonable data structure is adopted to store the network. Then a heuristic function is adopted to improve searching efficiency in order that optimized Dijkstra algorithm can fit for complicated traffic networks.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
