Cooperative trajectory planning for multi-UCAV using multiple traveling salesman problem

This paper studied the problem of cooperative trajectory planning integrated target assignment for multiple unmanned combat aerial vehicles, servicing multiple targets. The problem is formulated as a dynamics-constrained, multiple depot, multiple traveling salesman problem with neighborhoods (DC_MDM...

Full description

Saved in:
Bibliographic Details
Main Authors: Gu, Xueqiang, Cao, Xinqin, Xie, Yu, Chen, Jing, Sun, Xiaoqiang
Format: Conference Proceeding
Language:English
Subjects:
Algorithms
Asymmetry
Cooperative Trajectory Planning
Heuristic algorithms
IP networks
Linear programming
Multiple Traveling Salesman Problem
Noon-Bean transformation
Phase transformations
Planning
Preprocessing
Searching
Target Assignment
Trajectory
Trajectory planning
Traveling salesman problem
Traveling salesman problems
Vehicles
Citations: Items that cite this one
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:This paper studied the problem of cooperative trajectory planning integrated target assignment for multiple unmanned combat aerial vehicles, servicing multiple targets. The problem is formulated as a dynamics-constrained, multiple depot, multiple traveling salesman problem with neighborhoods (DC_MDMTSPN), which is a variant of the multiple traveling salesman problem (MTSP). Then, the entire process of solving the DC_MDMTSPN consists of two phases: 1) In the preprocessing phase, the directed graph is constructed and then the original problem is transformed to a standard asymmetric TSP (ATSP); 2) In the solving phase, the Lin-Kernighan Heuristic (LKH) searching algorithm is used to solve the ATSP. Finally, a typical scenario validates the proposed approach and experimental results demonstrate that the approach is feasible and effective.
ISSN:2161-2927
1934-1768
DOI:10.1109/ChiCC.2016.7553776