S. Anavatti, Sumana Biswas, Jedd T. Colvin, Mahardhika Pratama
{"title":"自主地面车辆高效路径规划的混合算法","authors":"S. Anavatti, Sumana Biswas, Jedd T. Colvin, Mahardhika Pratama","doi":"10.1109/ICARCV.2016.7838802","DOIUrl":null,"url":null,"abstract":"This paper discusses an overview on different path planning algorithms and analyzes their performance. Based on this, an efficient hybrid algorithm is proposed for path planning in both static and dynamic environments. The numerical results are presented to validate the proposed design. The method is compared to other heuristic algorithms in different scenarios. The proposed algorithm is shown to be more efficient computationally than the other comparable algorithms.","PeriodicalId":128828,"journal":{"name":"2016 14th International Conference on Control, Automation, Robotics and Vision (ICARCV)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"A hybrid algorithm for efficient path planning of autonomous ground vehicles\",\"authors\":\"S. Anavatti, Sumana Biswas, Jedd T. Colvin, Mahardhika Pratama\",\"doi\":\"10.1109/ICARCV.2016.7838802\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper discusses an overview on different path planning algorithms and analyzes their performance. Based on this, an efficient hybrid algorithm is proposed for path planning in both static and dynamic environments. The numerical results are presented to validate the proposed design. The method is compared to other heuristic algorithms in different scenarios. The proposed algorithm is shown to be more efficient computationally than the other comparable algorithms.\",\"PeriodicalId\":128828,\"journal\":{\"name\":\"2016 14th International Conference on Control, Automation, Robotics and Vision (ICARCV)\",\"volume\":\"12 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2016-11-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2016 14th International Conference on Control, Automation, Robotics and Vision (ICARCV)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICARCV.2016.7838802\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 14th International Conference on Control, Automation, Robotics and Vision (ICARCV)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICARCV.2016.7838802","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A hybrid algorithm for efficient path planning of autonomous ground vehicles
This paper discusses an overview on different path planning algorithms and analyzes their performance. Based on this, an efficient hybrid algorithm is proposed for path planning in both static and dynamic environments. The numerical results are presented to validate the proposed design. The method is compared to other heuristic algorithms in different scenarios. The proposed algorithm is shown to be more efficient computationally than the other comparable algorithms.