Hussein M. Fawzy, Hisham M. El-Sherif, Gerd Baumann
{"title":"基于增强流体势动力学模型的机器人路径规划框架","authors":"Hussein M. Fawzy, Hisham M. El-Sherif, Gerd Baumann","doi":"10.1109/ICMRE54455.2022.9734096","DOIUrl":null,"url":null,"abstract":"Path planning is one of the main sectors of robotics that deals with path calculations from a starting point to a goal in a defined field. Physical algorithms that rely on artificial potential fields and fluid fields have been developed to solve the path planning task. The main problem for the former is the creation of local minima in the field which requires extra algorithms to solve with increased path cost and added inefficiencies, while for the latter, the problem is the computational cost. This paper proposes an enhanced computational-physical path planning algorithm based on fluid stream equations and mechanics – named the Stream Field Navigation (SFN) – with modifications on how the residuals are calculated to improve the computational efficiency by introducing the Directional Residuals. SFN also introduces the Stream Reversal approach to represent a navigation field with no local minima. A comparison between the SFN algorithm and the Artificial Potential Field method is carried out to show the fundamental differences between the two methods and the results include empirical comparisons between the execution times of multiple algorithms which show that the SFN algorithm is at least 75% faster than PRM while A* is the fastest approach.","PeriodicalId":419108,"journal":{"name":"2022 8th International Conference on Mechatronics and Robotics Engineering (ICMRE)","volume":"4 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-02-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"A Framework for Robotic Path Planning Based on Enhanced Fluid Potential Dynamical Models\",\"authors\":\"Hussein M. Fawzy, Hisham M. El-Sherif, Gerd Baumann\",\"doi\":\"10.1109/ICMRE54455.2022.9734096\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Path planning is one of the main sectors of robotics that deals with path calculations from a starting point to a goal in a defined field. Physical algorithms that rely on artificial potential fields and fluid fields have been developed to solve the path planning task. The main problem for the former is the creation of local minima in the field which requires extra algorithms to solve with increased path cost and added inefficiencies, while for the latter, the problem is the computational cost. This paper proposes an enhanced computational-physical path planning algorithm based on fluid stream equations and mechanics – named the Stream Field Navigation (SFN) – with modifications on how the residuals are calculated to improve the computational efficiency by introducing the Directional Residuals. SFN also introduces the Stream Reversal approach to represent a navigation field with no local minima. A comparison between the SFN algorithm and the Artificial Potential Field method is carried out to show the fundamental differences between the two methods and the results include empirical comparisons between the execution times of multiple algorithms which show that the SFN algorithm is at least 75% faster than PRM while A* is the fastest approach.\",\"PeriodicalId\":419108,\"journal\":{\"name\":\"2022 8th International Conference on Mechatronics and Robotics Engineering (ICMRE)\",\"volume\":\"4 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2022-02-10\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2022 8th International Conference on Mechatronics and Robotics Engineering (ICMRE)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICMRE54455.2022.9734096\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 8th International Conference on Mechatronics and Robotics Engineering (ICMRE)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICMRE54455.2022.9734096","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1
摘要
路径规划是机器人技术的主要领域之一,它处理从起点到目标的路径计算。基于人工势场和流体场的物理算法已经被开发出来解决路径规划问题。前者的主要问题是该领域的局部最小值的产生,这需要额外的算法来解决,增加了路径成本和增加的低效率,而后者的问题是计算成本。本文提出了一种基于流体流方程和力学的增强计算物理路径规划算法——流场导航(stream Field Navigation, SFN),并对残差的计算方法进行了修改,通过引入定向残差来提高计算效率。SFN还引入了流反转方法来表示没有局部最小值的导航场。通过对SFN算法和人工势场法的比较,揭示了两种方法的根本区别,并对多个算法的执行时间进行了实证比较,结果表明SFN算法比PRM算法至少快75%,而A*是最快的方法。
A Framework for Robotic Path Planning Based on Enhanced Fluid Potential Dynamical Models
Path planning is one of the main sectors of robotics that deals with path calculations from a starting point to a goal in a defined field. Physical algorithms that rely on artificial potential fields and fluid fields have been developed to solve the path planning task. The main problem for the former is the creation of local minima in the field which requires extra algorithms to solve with increased path cost and added inefficiencies, while for the latter, the problem is the computational cost. This paper proposes an enhanced computational-physical path planning algorithm based on fluid stream equations and mechanics – named the Stream Field Navigation (SFN) – with modifications on how the residuals are calculated to improve the computational efficiency by introducing the Directional Residuals. SFN also introduces the Stream Reversal approach to represent a navigation field with no local minima. A comparison between the SFN algorithm and the Artificial Potential Field method is carried out to show the fundamental differences between the two methods and the results include empirical comparisons between the execution times of multiple algorithms which show that the SFN algorithm is at least 75% faster than PRM while A* is the fastest approach.