Deschide documentul
|
Informaţii generale |
| Autor |
Habib, Durdana; Jamal, Habibullah; Khan, Shoab A. |
| Publicat |
InTech Open Access Publisher, 2013
|
| Ediţie |
|
| Detaliază |
|
| ISBN |
|
| Abstract |
In this paper, we work to develop a path planning
solution for a group of Unmanned Aerial Vehicles (UAVs)
using a Mixed Integer Linear Programming (MILP)
approach. Co‐operation among team members not only
helps reduce mission time, it makes the execution more
robust in dynamic environments. However, the problem
becomes more challenging as it requires optimal resource
allocation and is NP‐hard. Since UAVs may be lost or may
suffer significant damage during the course of the mission,
plans may need to be modified in real‐time as the mission
proceeds. Therefore, multiple UAVs have a better chance
of completing a mission in the face of failures. Such
military operations can be treated as a variant of the
Multiple Depot Vehicle Routing Problem (MDVRP). The
proposed solution must be such that m UAVs start from
multiple source locations to visit n targets and return to a
set of destination locations such that (1) each target is
visited exactly by one of the chosen UAVs (2) the total
distance travelled by the group is minimized and (3) the
number of targets that each UAV visits may not be less
than K or greater than L. |
|
| |
|
International Journal of Advanced Robotic Systems
Autor: Ottaviano, Erika; Ceccarelli, Marco; Husty, Manfred; Yu, Sung-Hoon; Kim, Yong-Tae; Park, Chang-Woo; Hyun, Chang-Ho; Chen, Xiulong; Feng, Weiming; Sun, Xianyang; Gao, Qing; Grigorescu, Sorin M.; Pozna, Claudiu; Liu, Wanli; Zhankui, Wang; Guo, Meng; Fu, Guoyu; Zhang, Jin; Chen, Wenyuan; Peng, Fengchao; Yang, Pei; Chen, Chunlin; Ding, Rui; Yu, Junzhi; Yang, Qinghai; Tan, Min; Polden, Joseph; Pan, [...]
Publicat: 2004
|
|
Newsletter
DMG-Lib
Europeana
PDF
Univ. Cassino
