<th id="5nh9l"></th><strike id="5nh9l"></strike><th id="5nh9l"><noframes id="5nh9l"><th id="5nh9l"></th><strike id="5nh9l"></strike>
<progress id="5nh9l"><noframes id="5nh9l"><th id="5nh9l"><noframes id="5nh9l">
<th id="5nh9l"></th> <strike id="5nh9l"><noframes id="5nh9l"><span id="5nh9l"></span>
<progress id="5nh9l"><noframes id="5nh9l"><span id="5nh9l"><noframes id="5nh9l"><span id="5nh9l"></span><strike id="5nh9l"><noframes id="5nh9l"><strike id="5nh9l"></strike>
<span id="5nh9l"><noframes id="5nh9l">
<span id="5nh9l"><noframes id="5nh9l">
<span id="5nh9l"></span><span id="5nh9l"><video id="5nh9l"></video></span>
<th id="5nh9l"><noframes id="5nh9l"><th id="5nh9l"></th>
<progress id="5nh9l"><noframes id="5nh9l">

基于改進鴿群優化和馬爾可夫鏈的多無人機協同搜索方法

Cooperative search for multi-UAVs via an improved pigeon-inspired optimization and Markov chain approach

  • 摘要: 針對多無人機在協同搜索過程中存在重復搜索、目標靜止、搜索效率低的問題,提出基于改進鴿群優化和馬爾可夫鏈的多無人機協同搜索方法.首先,建立類似傳感器探測范圍的蜂窩狀環境模型,降低對搜索區域的重復搜索;其次,建立滿足高斯分布的馬爾可夫鏈動態目標運動模型;然后,將柯西擾動引入基本鴿群優化算法的地圖和指南針算子,高斯擾動引入地標算子,同時利用模擬退火機制保留次優個體,進而有效緩減基本鴿群優化算法易陷入局部最優的問題.最后,通過仿真實驗將本文算法與其他群體智能算法進行比較,結果表明新型算法的合理性和有效性.

     

    Abstract: Compared with manned aircraft, unmanned aerial vehicles (UAVs) are affordable and convenient for high-risk missions. Therefore, UAVs are increasingly playing an important role in military and civilian fields. Today, UAVs have been exploited to perform special missions carrying some important equipment. However, influenced by the constraints of single UAV's performance and load, it has become a research hotspot that multi-UAVs perform search cooperatively. The process is to minimize the uncertainty of the unknown area and to find the target as much as possible. In terms of cooperation among UAVs, the more effective method based on search map is used. And search process optimization on the basis of distributed model predictive control (DMPC) or traditional swarm intelligence algorithms are adopted, but these methods have some limitations. Due to the behavior of swarm intelligent individual have the characteristics of the decentralization, distribution, and overall self-organization, which match with the requirements of the localization, distribution and robustness of the UAV cooperate search. Nevertheless, the traditional swarm intelligence algorithms have low search efficiency and are easy to fall into local optimum. To solve the problem of repeated search, static targets and low efficiency in cooperative search for multi-UAVs, a method based on improved pigeon-inspired optimization (PIO) and Markov chain was proposed. Firstly, a honeycomb environmental model similar to the sensor detect region was established to reduce repeated search for the area. Secondly, Markov chain with the Gaussian distribution was used to represent dynamic movement of targets. Thirdly, Cauchy mutation and Gaussian mutation were introduced into the map and compass operator and the landmark operator of PIO, respectively. Meanwhile, simulated annealing (SA) mechanism was exploited to reserve the worse individual, which effectively reduced the problem that PIO was easy to fall into local optimum. Finally, the algorithm was compared with other swarm intelligence algorithms through simulation experiments. The results show that the new method is effective and available.

     

/

返回文章
返回
<th id="5nh9l"></th><strike id="5nh9l"></strike><th id="5nh9l"><noframes id="5nh9l"><th id="5nh9l"></th><strike id="5nh9l"></strike>
<progress id="5nh9l"><noframes id="5nh9l"><th id="5nh9l"><noframes id="5nh9l">
<th id="5nh9l"></th> <strike id="5nh9l"><noframes id="5nh9l"><span id="5nh9l"></span>
<progress id="5nh9l"><noframes id="5nh9l"><span id="5nh9l"><noframes id="5nh9l"><span id="5nh9l"></span><strike id="5nh9l"><noframes id="5nh9l"><strike id="5nh9l"></strike>
<span id="5nh9l"><noframes id="5nh9l">
<span id="5nh9l"><noframes id="5nh9l">
<span id="5nh9l"></span><span id="5nh9l"><video id="5nh9l"></video></span>
<th id="5nh9l"><noframes id="5nh9l"><th id="5nh9l"></th>
<progress id="5nh9l"><noframes id="5nh9l">
259luxu-164