{"title":"三维移动目标拦截无人机动态路径规划","authors":"H. H. Triharminto, T. B. Adji, N. A. Setiawan","doi":"10.1109/ICA.2011.6130148","DOIUrl":null,"url":null,"abstract":"Dynamic path planning is one of the challenging research problems which is needed to guide UAV (Unmanned Aerial Vehicle) for moving target intercept. This research is to develop an algorithm for moving target intercept with obstacle avoidance in 3D. The algorithm which is called L+Dumo Algorithm integrate a modified Dubins Algorithm and Linear Algorithm. The simulation is conducted using one UAV and one moving target with an obstacle of cylindrical shape in between both objects. The result shows that the algorithm can guide UAV to approach the moving target with the accuracy of 67.417% L+Dumo algorithm will solve dynamic path planning problem for moving target intercept in 3D with minimum complexity of computation.","PeriodicalId":132474,"journal":{"name":"2011 2nd International Conference on Instrumentation Control and Automation","volume":"23 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":"{\"title\":\"Dynamic uav path planning for moving target intercept in 3D\",\"authors\":\"H. H. Triharminto, T. B. Adji, N. A. Setiawan\",\"doi\":\"10.1109/ICA.2011.6130148\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Dynamic path planning is one of the challenging research problems which is needed to guide UAV (Unmanned Aerial Vehicle) for moving target intercept. This research is to develop an algorithm for moving target intercept with obstacle avoidance in 3D. The algorithm which is called L+Dumo Algorithm integrate a modified Dubins Algorithm and Linear Algorithm. The simulation is conducted using one UAV and one moving target with an obstacle of cylindrical shape in between both objects. The result shows that the algorithm can guide UAV to approach the moving target with the accuracy of 67.417% L+Dumo algorithm will solve dynamic path planning problem for moving target intercept in 3D with minimum complexity of computation.\",\"PeriodicalId\":132474,\"journal\":{\"name\":\"2011 2nd International Conference on Instrumentation Control and Automation\",\"volume\":\"23 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2011-11-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"8\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2011 2nd International Conference on Instrumentation Control and Automation\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICA.2011.6130148\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 2nd International Conference on Instrumentation Control and Automation","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICA.2011.6130148","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Dynamic uav path planning for moving target intercept in 3D
Dynamic path planning is one of the challenging research problems which is needed to guide UAV (Unmanned Aerial Vehicle) for moving target intercept. This research is to develop an algorithm for moving target intercept with obstacle avoidance in 3D. The algorithm which is called L+Dumo Algorithm integrate a modified Dubins Algorithm and Linear Algorithm. The simulation is conducted using one UAV and one moving target with an obstacle of cylindrical shape in between both objects. The result shows that the algorithm can guide UAV to approach the moving target with the accuracy of 67.417% L+Dumo algorithm will solve dynamic path planning problem for moving target intercept in 3D with minimum complexity of computation.