本文選題：無人機巡邏 + 模擬退火�。� 參考：《鐵道科學與工程學報》2017年11期

【摘要】：針對危險品集裝箱堆場的巡邏問題,提出使用無人機進行危險品集裝箱堆場巡邏的方法,通過和車輛路徑CVRP問題的類比,得到優(yōu)化后的無人機路徑。該方法是在傳統(tǒng)掃描算法的基礎之上,提出一種全掃描的方法,使用模擬退火算法不斷求出無人機當前階段的飛行距離,再將該距離與無人機的額定航程進行對比,直到求得的距離大于無人機航程時,掃描停止,并將該點除去,保留之前的點和路徑,形成一條無人機的飛行路徑。最后通過和傳統(tǒng)方式的比較,得出使用無人機巡邏可以比人工巡邏節(jié)省73.33%的時間,節(jié)約66.21%運營成本。
[Abstract]:Aiming at the patrol problem of dangerous goods container yard, the method of using UAV to patrol dangerous goods container yard is put forward. The optimized UAV path is obtained by analogy with CVRP problem of vehicle path. Based on the traditional scanning algorithm, a full scan method is proposed in this paper. The simulated annealing algorithm is used to continuously calculate the flying distance of UAV at present stage, and then the distance is compared with the rated range of UAV. When the distance obtained is larger than the range of the UAV, the scan stops and the point is removed, and the previous points and paths are retained to form a flight path of the UAV. Finally, by comparing with the traditional method, it is concluded that using UAV patrol can save 73.33% of time and 66.21% of operating cost than manual patrol.
【作者單位】： 上海海事大學物流研究中心;工業(yè)互聯(lián)網(wǎng)創(chuàng)新中心(上海)有限公司;
【基金】：國家自然科學基金資助項目(71471109) 2017年上海海事大學研究生創(chuàng)新基金資助項目(2017YCX025) 工業(yè)互聯(lián)網(wǎng)綜合實驗床平臺基金資助項目(ZN2016020109)
【分類號】：U698.5
，

本文編號：1857394