A. Ma’arif, Wahyu Rahmaniar, M. A. M. Vera, Aninditya Anggari Nuryono, Rania Majdoubi, Abdullah Çakan
{"title":"动态环境下无人机四旋翼避障的人工势场算法","authors":"A. Ma’arif, Wahyu Rahmaniar, M. A. M. Vera, Aninditya Anggari Nuryono, Rania Majdoubi, Abdullah Çakan","doi":"10.1109/COMNETSAT53002.2021.9530803","DOIUrl":null,"url":null,"abstract":"Artificial potential field (APF) is the effective real-time guide, navigation, and obstacle avoidance for UAV Quadrotor. The main problem in APF is local minima in an obstacle or multiple obstacles. In this paper, some modifications and improvements of APF will be introduced to solve one-obstacle local minima, two-obstacle local minima, Goal Not Reachable Near Obstacle (GNRON) and dynamic obstacle. The result shows that the improved APF gave the best result because it made the system reach the goal position in all of the examinations. Meanwhile, the APF with virtual force has the fastest time to reach the goal; however, it still has a problem in GNRON. It can be concluded that the APF needs to be modified in its algorithm to pass all of the local minima problems.","PeriodicalId":148136,"journal":{"name":"2021 IEEE International Conference on Communication, Networks and Satellite (COMNETSAT)","volume":"201 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-07-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"12","resultStr":"{\"title\":\"Artificial Potential Field Algorithm for Obstacle Avoidance in UAV Quadrotor for Dynamic Environment\",\"authors\":\"A. Ma’arif, Wahyu Rahmaniar, M. A. M. Vera, Aninditya Anggari Nuryono, Rania Majdoubi, Abdullah Çakan\",\"doi\":\"10.1109/COMNETSAT53002.2021.9530803\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Artificial potential field (APF) is the effective real-time guide, navigation, and obstacle avoidance for UAV Quadrotor. The main problem in APF is local minima in an obstacle or multiple obstacles. In this paper, some modifications and improvements of APF will be introduced to solve one-obstacle local minima, two-obstacle local minima, Goal Not Reachable Near Obstacle (GNRON) and dynamic obstacle. The result shows that the improved APF gave the best result because it made the system reach the goal position in all of the examinations. Meanwhile, the APF with virtual force has the fastest time to reach the goal; however, it still has a problem in GNRON. It can be concluded that the APF needs to be modified in its algorithm to pass all of the local minima problems.\",\"PeriodicalId\":148136,\"journal\":{\"name\":\"2021 IEEE International Conference on Communication, Networks and Satellite (COMNETSAT)\",\"volume\":\"201 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2021-07-17\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"12\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2021 IEEE International Conference on Communication, Networks and Satellite (COMNETSAT)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/COMNETSAT53002.2021.9530803\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2021 IEEE International Conference on Communication, Networks and Satellite (COMNETSAT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/COMNETSAT53002.2021.9530803","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Artificial Potential Field Algorithm for Obstacle Avoidance in UAV Quadrotor for Dynamic Environment
Artificial potential field (APF) is the effective real-time guide, navigation, and obstacle avoidance for UAV Quadrotor. The main problem in APF is local minima in an obstacle or multiple obstacles. In this paper, some modifications and improvements of APF will be introduced to solve one-obstacle local minima, two-obstacle local minima, Goal Not Reachable Near Obstacle (GNRON) and dynamic obstacle. The result shows that the improved APF gave the best result because it made the system reach the goal position in all of the examinations. Meanwhile, the APF with virtual force has the fastest time to reach the goal; however, it still has a problem in GNRON. It can be concluded that the APF needs to be modified in its algorithm to pass all of the local minima problems.