T. Ikeda, Min-Yao Hsu, H. Imai, S. Nishimura, H. Shimoura, T. Hashimoto, K. Tenmoku, K. Mitoh
{"title":"一种利用人工智能搜索技术寻找更好路线的快速算法","authors":"T. Ikeda, Min-Yao Hsu, H. Imai, S. Nishimura, H. Shimoura, T. Hashimoto, K. Tenmoku, K. Mitoh","doi":"10.1109/VNIS.1994.396824","DOIUrl":null,"url":null,"abstract":"The shortest path problem is one of the most fundamental problems applicable in various fields, and has close relation to route navigation systems. This paper surveys algorithms for the two-terminal shortest path problem and proposes bidirectional A* algorithm based on a new approach. This algorithm is suitable for finding not only the shortest route but also better routes. The efficiency and the property of these algorithms are discussed through experiments applying them to an actual road network.<<ETX>>","PeriodicalId":338322,"journal":{"name":"Proceedings of VNIS'94 - 1994 Vehicle Navigation and Information Systems Conference","volume":"18 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1994-08-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"123","resultStr":"{\"title\":\"A fast algorithm for finding better routes by AI search techniques\",\"authors\":\"T. Ikeda, Min-Yao Hsu, H. Imai, S. Nishimura, H. Shimoura, T. Hashimoto, K. Tenmoku, K. Mitoh\",\"doi\":\"10.1109/VNIS.1994.396824\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The shortest path problem is one of the most fundamental problems applicable in various fields, and has close relation to route navigation systems. This paper surveys algorithms for the two-terminal shortest path problem and proposes bidirectional A* algorithm based on a new approach. This algorithm is suitable for finding not only the shortest route but also better routes. The efficiency and the property of these algorithms are discussed through experiments applying them to an actual road network.<<ETX>>\",\"PeriodicalId\":338322,\"journal\":{\"name\":\"Proceedings of VNIS'94 - 1994 Vehicle Navigation and Information Systems Conference\",\"volume\":\"18 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1994-08-31\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"123\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of VNIS'94 - 1994 Vehicle Navigation and Information Systems Conference\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/VNIS.1994.396824\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of VNIS'94 - 1994 Vehicle Navigation and Information Systems Conference","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/VNIS.1994.396824","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A fast algorithm for finding better routes by AI search techniques
The shortest path problem is one of the most fundamental problems applicable in various fields, and has close relation to route navigation systems. This paper surveys algorithms for the two-terminal shortest path problem and proposes bidirectional A* algorithm based on a new approach. This algorithm is suitable for finding not only the shortest route but also better routes. The efficiency and the property of these algorithms are discussed through experiments applying them to an actual road network.<>