ICUAS'17 Paper Abstract

Close

Paper WeC3.5

Hafez, Ahmed Taimour Kamaleldin (Military Technical College), Kamel, Mohamed A. (Military Technical College), Givigi, Sidney (Royal Military College of Canada), Jardine, Peter Travis (Royal Military College of Canada)

Task Assignment/Trajectory Planning for Unmanned Vehicles Via HFLC and PSO

Scheduled for presentation during the "Control Architecture - III" (WeC3), Wednesday, June 14, 2017, 18:00−18:20, Salon CD

2017 International Conference on Unmanned Aircraft Systems, June 13-16, 2017, Miami Marriott Biscayne Bay, Miami, FL,

This information is tentative and subject to change. Compiled on April 12, 2021

Keywords Control Architectures, Networked Swarms, Path Planning

Abstract

This paper investigates the problems of task assignment and trajectory planning for teams of cooperative unmanned aerial vehicles (UAVs). A novel approach of hierarchical fuzzy logic controller (HFLC) and particle swarm optimization is proposed. Initially, teams of UAVs are moving in a pre-determined formation covering a specified area. When one or more targets are detected, the teams send a package of information to the ground station (GS) including the targetís degree of threat, degree of importance, and the separating distance between each team and each detected target. First, the ground station assigns the teams to the targets based on the gathered information. HFLC is implemented in the GS to solve the assignment problem ensuring that each team is assigned to a unique target. Then, each team plans its own path by formulating the path planning problem as an optimization problem, while the objective is to minimize the time to reach their destination considering the UAVs dynamic constraints and the collision avoidance between teams. A hybrid approach of control parametrization and time discretization (CPTD) and PSO is proposed to solve the optimization problem. Finally, numerical simulations demonstrate the effectiveness of the proposed algorithm.

 

 

All Content © PaperCept, Inc.

This site is protected by copyright and trademark laws under US and International law.
All rights reserved. © 2002-2021 PaperCept, Inc.
Page generated 2021-04-12  05:21:16 PST  Terms of use