{"title":"半扫描Kaudd逐次过松弛(HSKSOR)方法中基于谐波电位的Agent导航","authors":"F. A. Musli, A. Saudi","doi":"10.1109/ISCAIE.2019.8744002","DOIUrl":null,"url":null,"abstract":"Navigation problems of an agent in a virtual environment had been widely studied by many researchers. This paper presents a combination method based on Half-Sweep (HS) iteration and Kaudd Successive Over Relaxation (KSOR) to solve agent navigation problem in a simulated virtual environment. The proposed method, namely Half-Sweep Kaudd Successive Over Relaxation (HSKSOR), is used to obtain the solutions of Laplace’s equation known as harmonic functions which then be applied in the search algorithm to generate collision-free path for an agent to navigate from a specified start point to a target point. The results found that the HSKSOR offers faster computational approach with less computational time compared to the existing iterative methods.","PeriodicalId":369098,"journal":{"name":"2019 IEEE 9th Symposium on Computer Applications & Industrial Electronics (ISCAIE)","volume":"147 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Agent Navigation via Harmonic Potentials with Half-Sweep Kaudd Successive Over Relaxation (HSKSOR) Method\",\"authors\":\"F. A. Musli, A. Saudi\",\"doi\":\"10.1109/ISCAIE.2019.8744002\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Navigation problems of an agent in a virtual environment had been widely studied by many researchers. This paper presents a combination method based on Half-Sweep (HS) iteration and Kaudd Successive Over Relaxation (KSOR) to solve agent navigation problem in a simulated virtual environment. The proposed method, namely Half-Sweep Kaudd Successive Over Relaxation (HSKSOR), is used to obtain the solutions of Laplace’s equation known as harmonic functions which then be applied in the search algorithm to generate collision-free path for an agent to navigate from a specified start point to a target point. The results found that the HSKSOR offers faster computational approach with less computational time compared to the existing iterative methods.\",\"PeriodicalId\":369098,\"journal\":{\"name\":\"2019 IEEE 9th Symposium on Computer Applications & Industrial Electronics (ISCAIE)\",\"volume\":\"147 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-04-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2019 IEEE 9th Symposium on Computer Applications & Industrial Electronics (ISCAIE)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISCAIE.2019.8744002\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 IEEE 9th Symposium on Computer Applications & Industrial Electronics (ISCAIE)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISCAIE.2019.8744002","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Agent Navigation via Harmonic Potentials with Half-Sweep Kaudd Successive Over Relaxation (HSKSOR) Method
Navigation problems of an agent in a virtual environment had been widely studied by many researchers. This paper presents a combination method based on Half-Sweep (HS) iteration and Kaudd Successive Over Relaxation (KSOR) to solve agent navigation problem in a simulated virtual environment. The proposed method, namely Half-Sweep Kaudd Successive Over Relaxation (HSKSOR), is used to obtain the solutions of Laplace’s equation known as harmonic functions which then be applied in the search algorithm to generate collision-free path for an agent to navigate from a specified start point to a target point. The results found that the HSKSOR offers faster computational approach with less computational time compared to the existing iterative methods.