{"title":"一种基于车辆导航系统的类胶囊受限搜索区域路径规划算法","authors":"Xiaowei Ma, Lingjuan Miao, Qingqian Liu","doi":"10.1109/ICACI.2012.6463206","DOIUrl":null,"url":null,"abstract":"In order to further improve the efficiency and reliability of current path planning algorithms applied to embedded vehicle navigation systems, a novel path planning algorithm is proposed in this paper based on a concise topology electronic map. In the proposed algorithm, the traditional searching area is optimized by tackling the path planning problem in a capsule-like restricted area. Furthermore, the feasibility and reliability of the algorithm is guaranteed by setting the dynamic parameter. Simulation results verify that the proposed algorithm finds the optimal shortest path in a short time and performs better than conventional algorithms in terms of effectiveness and reliability.","PeriodicalId":404759,"journal":{"name":"2012 IEEE Fifth International Conference on Advanced Computational Intelligence (ICACI)","volume":"184 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"A path planning algorithm with a capsule-like restricted searching area based on vehicle navigation system\",\"authors\":\"Xiaowei Ma, Lingjuan Miao, Qingqian Liu\",\"doi\":\"10.1109/ICACI.2012.6463206\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In order to further improve the efficiency and reliability of current path planning algorithms applied to embedded vehicle navigation systems, a novel path planning algorithm is proposed in this paper based on a concise topology electronic map. In the proposed algorithm, the traditional searching area is optimized by tackling the path planning problem in a capsule-like restricted area. Furthermore, the feasibility and reliability of the algorithm is guaranteed by setting the dynamic parameter. Simulation results verify that the proposed algorithm finds the optimal shortest path in a short time and performs better than conventional algorithms in terms of effectiveness and reliability.\",\"PeriodicalId\":404759,\"journal\":{\"name\":\"2012 IEEE Fifth International Conference on Advanced Computational Intelligence (ICACI)\",\"volume\":\"184 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2012-10-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2012 IEEE Fifth International Conference on Advanced Computational Intelligence (ICACI)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICACI.2012.6463206\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2012 IEEE Fifth International Conference on Advanced Computational Intelligence (ICACI)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICACI.2012.6463206","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A path planning algorithm with a capsule-like restricted searching area based on vehicle navigation system
In order to further improve the efficiency and reliability of current path planning algorithms applied to embedded vehicle navigation systems, a novel path planning algorithm is proposed in this paper based on a concise topology electronic map. In the proposed algorithm, the traditional searching area is optimized by tackling the path planning problem in a capsule-like restricted area. Furthermore, the feasibility and reliability of the algorithm is guaranteed by setting the dynamic parameter. Simulation results verify that the proposed algorithm finds the optimal shortest path in a short time and performs better than conventional algorithms in terms of effectiveness and reliability.