Professional Documents
Culture Documents
Swarming Strategies
Swarming Strategies
http://ieeexplore.ieee.org/document/1501638/?arnumber=1501638&tag=1
Abstract:
We have previously reported on a project involving the control of a swarm of unmanned air vehicles
(UAVs) carrying out search or search-and-destroy missions. We developed and tested (in simulation) a
number of strategies for swarm control, and proposed systematic evaluation techniques and
performance metrics. In this paper we report some additional results in which we evolved some of the
swarm control parameters using a genetic algorithm (GA). While the improvements were modest, the
results show how evolutionary computing algorithms can be used to facilitate the design of swarm
control algorithms.
as many opportunities as possible, while avoiding as many hazards as possible. To enable cooperation,
the UAVs are constrained to stay within communication range of one another. Collision avoidance is also
required. Algorithms for team-optimal and individually-optimal/team-suboptimal solutions are
developed and their computational complexity compared. Simulation results demonstrating the
feasibility of the cooperative search algorithms are presented.
Conclusion:
The problem of cooperative search by a team of UAVs with collision-avoidance and communicationrange constraints has been considered. An algorithm for Ending team-optimal paths by considering
feasible paths for neighboring UAVs was developed. Two suboptimal, but computationally efcient
approaches were developed: the best leader and optimal best path cooperative search algorithms.
These algorithms were tested on an example cooperative search problems. Depending on the
characteristics of a search problem (such as the number of vehicles, the number of stages, and the
number of possible paths considered) and the computational resources available, these algorithms
provide a spectrum of solutions with potential for real-time implementation.
This paper addresses the problem of trajectory planning and tracking control of groups of unmanned
vehicles. The trajectory planner is aimed at satisfying the dynamic equations and constraints. The
planner builds on two features of the group: (1) state equations for each member are differentially flat,
and (2) inequality constraints have special structures due to proximity constraints between members.
Under these assumptions, formations are made so that the dynamic equations and constraints are
satisfied. Illustrative simulations of groups of unmanned ground vehicles in formations are presented.
The results are also implemented on a laboratory facility with three unmanned ground vehicles.
Conclusion:
This paper has addressed the problem of trajectory planning and tracking control of groups of
unmanned ve-hicles. Our method utilizes the differential flatness of the vehicle dynamics and proper
formation constraints to achieve flatness of the entire group of vehicles. This enables one to plan
formation movements in terms of the flat outputs of the system and significantly reduce the
computational complexity of the planning problem. Changes in formation can be produced through
properly embedding the desired inter-vehicle dynamics within the formation constraints.
Implementation were successfully shown using model predictive control and linear quadratic tracking
with periodic recomputation of formation trajectories