两段半扫算术平均法的谐波路径规划

A. Saudi, J. Sulaiman
{"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}
引用次数: 2

摘要

本文应用两阶段半扫算术平均(half - sweep Arithmetic Mean, HSAM)迭代法计算二维空间拉普拉斯方程(又称谐波函数)的解,以解决室内环境下的路径规划问题。在已知的室内环境中进行了多个路径规划仿真,验证了所提方法的有效性。仿真结果表明,所设计的路径规划算法能够从不同的起始位置和目标位置生成平滑路径。数值结果表明,该方法的收敛速度比现有的迭代方法快得多,从而大大提高了路径规划算法的整体性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
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.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信