{"title":"基于蒙特卡罗树搜索的无人机自主制导系统设计","authors":"Apichart Vasutapituks, Edwin K P Chong","doi":"10.1109/ICBIR54589.2022.9786433","DOIUrl":null,"url":null,"abstract":"In this paper, we propose an online path-planning algorithm using a variation of Monte Carlo tree search (MCTS) for navigating intelligently unmanned aerial vehicles (UAVs) to track mobile ground targets, called the P-UAV algorithm. The proposed algorithm employs a non-myopic method applied to a partially observable Markov decision process (POMDP) model, accounting for long-term decision making. Our algorithm integrates a heuristic technique to efficiently generate paths. The algorithm yields to parallel processing methods to significantly enhance its computational performance, making it suitable for realtime implementation. Simulation experiments show that our path-planning algorithm is efficient and achieves good exploration-exploitation tradeoff in finding a near-optimal solution despite the very large search space.","PeriodicalId":216904,"journal":{"name":"2022 7th International Conference on Business and Industrial Research (ICBIR)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-05-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Design of Autonomous UAV Guidance System Using Monte Carlo Tree Search\",\"authors\":\"Apichart Vasutapituks, Edwin K P Chong\",\"doi\":\"10.1109/ICBIR54589.2022.9786433\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we propose an online path-planning algorithm using a variation of Monte Carlo tree search (MCTS) for navigating intelligently unmanned aerial vehicles (UAVs) to track mobile ground targets, called the P-UAV algorithm. The proposed algorithm employs a non-myopic method applied to a partially observable Markov decision process (POMDP) model, accounting for long-term decision making. Our algorithm integrates a heuristic technique to efficiently generate paths. The algorithm yields to parallel processing methods to significantly enhance its computational performance, making it suitable for realtime implementation. Simulation experiments show that our path-planning algorithm is efficient and achieves good exploration-exploitation tradeoff in finding a near-optimal solution despite the very large search space.\",\"PeriodicalId\":216904,\"journal\":{\"name\":\"2022 7th International Conference on Business and Industrial Research (ICBIR)\",\"volume\":\"6 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2022-05-19\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2022 7th International Conference on Business and Industrial Research (ICBIR)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICBIR54589.2022.9786433\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 7th International Conference on Business and Industrial Research (ICBIR)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICBIR54589.2022.9786433","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Design of Autonomous UAV Guidance System Using Monte Carlo Tree Search
In this paper, we propose an online path-planning algorithm using a variation of Monte Carlo tree search (MCTS) for navigating intelligently unmanned aerial vehicles (UAVs) to track mobile ground targets, called the P-UAV algorithm. The proposed algorithm employs a non-myopic method applied to a partially observable Markov decision process (POMDP) model, accounting for long-term decision making. Our algorithm integrates a heuristic technique to efficiently generate paths. The algorithm yields to parallel processing methods to significantly enhance its computational performance, making it suitable for realtime implementation. Simulation experiments show that our path-planning algorithm is efficient and achieves good exploration-exploitation tradeoff in finding a near-optimal solution despite the very large search space.