Rashmi Ballamajalu, M. Li, F. Sahin, C. Hochgraf, R. Ptucha, M. Kuhl
{"title":"Turn and orientation Sensitive A* for Autonomous Vehicles in Intelligent Material Handling Systems","authors":"Rashmi Ballamajalu, M. Li, F. Sahin, C. Hochgraf, R. Ptucha, M. Kuhl","doi":"10.1109/CASE48305.2020.9216869","DOIUrl":null,"url":null,"abstract":"Autonomous mobile robots are taking on more tasks in warehouses, speeding up operations and reducing accidents that claim many lives each year. This paper proposes a dynamic path planning algorithm, based on $\\mathrm{A}^{*}$ search method for large autonomous mobile robots such as forklifts, and generates an optimized, time-efficient path. Simulation results of the proposed turn and orientation sensitive $\\mathrm{A}^{*}$ algorithm show that it has a 94% success rate of computing a better or similar path compared to that of default $\\mathrm{A}^{*}$. The generated paths are smoother, have fewer turns, resulting in faster execution of tasks. The method also robustly handles unexpected obstacles in the path.","PeriodicalId":212181,"journal":{"name":"2020 IEEE 16th International Conference on Automation Science and Engineering (CASE)","volume":"43 2 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2020 IEEE 16th International Conference on Automation Science and Engineering (CASE)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CASE48305.2020.9216869","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3
Abstract
Autonomous mobile robots are taking on more tasks in warehouses, speeding up operations and reducing accidents that claim many lives each year. This paper proposes a dynamic path planning algorithm, based on $\mathrm{A}^{*}$ search method for large autonomous mobile robots such as forklifts, and generates an optimized, time-efficient path. Simulation results of the proposed turn and orientation sensitive $\mathrm{A}^{*}$ algorithm show that it has a 94% success rate of computing a better or similar path compared to that of default $\mathrm{A}^{*}$. The generated paths are smoother, have fewer turns, resulting in faster execution of tasks. The method also robustly handles unexpected obstacles in the path.