检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:杨惠珍[1,2] 李建国 吴天宇 王子江 杨钧 YANG Huizhen;LI Jianguo;WU Tianyu;WANG Zijiang;YANG Jun(School of Marine Science and Technology,Northwestern PolytechnicalUniversity,Xi’an710072,China;Underwater Information and Control Laboratory,Xi’an 710072,China)
机构地区:[1]西北工业大学航海学院,陕西西安710072 [2]水下信息与控制重点实验室,陕西西安710072
出 处:《水下无人系统学报》2024年第4期730-738,共9页Journal of Unmanned Undersea Systems
基 金:水下信息与控制重点实验室基金项目资助(2021-JCJQ-LB-030-03).
摘 要:针对多个自主水面航行器(ASV)围捕单个主动逃逸的对抗性目标问题,利用微分博弈理论建立了多ASV协同围捕问题博弈模型,在含有距离项的支付函数中引入由逃逸角构成的合围项,从而降低目标中途逃逸的概率;然后将围捕问题转换为求解可实现策略的优化问题,利用粒子群优化(PSO)算法求解满足纳什均衡的最优策略,仿真和湖上试验结果均证明了基于PSO的微分博弈围捕算法的有效性。In the scenario where multi-autonomous surface vehicles(ASVs)round up an actively escaped adversarial target,a game model of the multi-ASV cooperative hunting problem was established using differential game theory.A surround term consisting of the escape angle was introduced into the payment function which included the distance cost so that the escape probability of the target was reduced.At the same time,the hunting problem was converted into an optimization problem for solving achievable strategies,and the particle swarm optimization(PSO)algorithm was used to solve the optimal strategy that satisfied the Nash equilibrium.The simulation and lake test results show the effectiveness of the hunting algorithm based on differential game and PSO.
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.49