{"title":"两段半扫算术平均法的谐波路径规划","authors":"A. Saudi, J. Sulaiman","doi":"10.20967/JCSCM.2019.02.002","DOIUrl":null,"url":null,"abstract":"This paper presents the application of a two-stage HalfSweep Arithmetic Mean (HSAM) iterative method for computing the solution of Laplace's equation (also known as harmonic functions) in two-dimensional space to solve the path planning problem in indoor environment. Several path planning simulations in a known indoor environment were conducted to examine the effectiveness of the proposed method. It is shown that the designed path planning algorithm is capable of generating smooth paths from various start and goal positions. Also, numerical results show that the proposed HSAM method converges much faster than the existing iterative methods, thus it drastically improves the overall performance of the path planning algorithm.","PeriodicalId":374608,"journal":{"name":"Journal of Computer Science & Computational Mathematics","volume":"53 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Harmonic Path Planning using Two-Stage Half- Sweep Arithmetic Mean Method\",\"authors\":\"A. Saudi, J. Sulaiman\",\"doi\":\"10.20967/JCSCM.2019.02.002\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper presents the application of a two-stage HalfSweep Arithmetic Mean (HSAM) iterative method for computing the solution of Laplace's equation (also known as harmonic functions) in two-dimensional space to solve the path planning problem in indoor environment. Several path planning simulations in a known indoor environment were conducted to examine the effectiveness of the proposed method. It is shown that the designed path planning algorithm is capable of generating smooth paths from various start and goal positions. Also, numerical results show that the proposed HSAM method converges much faster than the existing iterative methods, thus it drastically improves the overall performance of the path planning algorithm.\",\"PeriodicalId\":374608,\"journal\":{\"name\":\"Journal of Computer Science & Computational Mathematics\",\"volume\":\"53 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-06-30\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of Computer Science & Computational Mathematics\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.20967/JCSCM.2019.02.002\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Computer Science & Computational Mathematics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.20967/JCSCM.2019.02.002","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Harmonic Path Planning using Two-Stage Half- Sweep Arithmetic Mean Method
This paper presents the application of a two-stage HalfSweep Arithmetic Mean (HSAM) iterative method for computing the solution of Laplace's equation (also known as harmonic functions) in two-dimensional space to solve the path planning problem in indoor environment. Several path planning simulations in a known indoor environment were conducted to examine the effectiveness of the proposed method. It is shown that the designed path planning algorithm is capable of generating smooth paths from various start and goal positions. Also, numerical results show that the proposed HSAM method converges much faster than the existing iterative methods, thus it drastically improves the overall performance of the path planning algorithm.