期刊
UNMANNED SYSTEMS
卷 3, 期 3, 页码 205-219出版社
WORLD SCI PUBL CO INC
DOI: 10.1142/S2301385015500132
关键词
Mission planning; heterogeneous UAVs; VRP; MILP; heuristic
资金
- TDSI, Singapore [R-265-000-377-592/232/422]
This paper investigates the unmanned aerial vehicle (UAV)-mission planning problem (MPP) in which one needs to quickly find a good plan/schedule to carry out various tasks of different time windows at various locations using a fleet of fixed-winged heterogeneous UAVs. Such a realistic and complex UAV-MPP is decomposed into two sub-problems: flight path planning and task scheduling. A graph construction and search algorithm is developed for the flight path generation. For the task scheduling problem, a new hybrid algorithm based on heuristic has been proposed: (1) small-to-medium sized problem-heuristics for task assignment and all permutations for sequencing, and (2) large sized problem - heuristics for both task assignment and sequencing. The proposed algorithms have been implemented and tested. Numerical experimental results show that the proposed algorithm is very efficient and can effectively solve relatively big problems.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据