A Survey on Aerial Swarm Robotics

The use of aerial swarms to solve real-world problems has been increasing steadily, accompanied by falling prices and improving performance of communication, sensing, and processing hardware. The commoditization of hardware has reduced unit costs, thereby lowering the barriers to entry to the field of aerial swarm robotics. A key enabling technology for swarms is the family of algorithms that allow the individual members of the swarm to communicate and allocate tasks amongst themselves, plan their trajectories, and coordinate their flight in such a way that the overall objectives of the swarm are achieved efficiently. These algorithms, often organized in a hierarchical fashion, endow the swarm with autonomy at every level, and the role of a human operator can be reduced, in principle, to interactions at a higher level without direct intervention. This technology depends on the clever and innovative application of theoretical tools from control and estimation. This paper reviews the state of the art of these theoretical tools, specifically focusing on how they have been developed for, and applied to, aerial swarms. Aerial swarms differ from swarms of ground-based vehicles in two respects: they operate in a three-dimensional space and the dynamics of individual vehicles adds an extra layer of complexity. We review dynamic modeling and conditions for stability and controllability that are essential in order to achieve cooperative flight and distributed sensing. The main sections of this paper focus on major results covering trajectory generation, task allocation, adversarial control, distributed sensing, monitoring, and mapping. Wherever possible, we indicate how the physics and subsystem technologies of aerial robots are brought to bear on these individual areas

Decentralized UAV guidance using modified boid algorithms

Decentralized guidance of Unoccupied Air Vehicles (UAVs) is a very challenging problem. Such technology can lead to improved safety, reduced cost, and improved mission efficiency. Only a few ideas for achieving decentralized guidance exist, the most effective being the boid algorithm. Boid algorithms are rule-based guidance methods derived from observations of animal swarms. In this paper, boid rules are used to autonomously control a group of UAVs in high-level transit simulations. This paper differs from previous work in that, as an alternative to using exponentially scaled behavior weightings, the weightings are computed off-line and scheduled according to a contingency management system. The motivation for this technique is to reduce the amount of on-line computation required by the flight system. Many modifications to the basic boid algorithm are required in order to achieve a flightworthy design. These modifications include the ability to define flight areas, limit turning maneuvers in accordance with the aircraft dynamics, and produce intelligent waypoint paths. The use of a contingency management system is also a major modification to the boid algorithm. A Simple Genetic Algorithm is used to partially optimize the behavior weightings of the boid algorithm. While a full optimization of all contingencies is not performed due to computation requirements, the framework for such a process is developed. Wolfram\u27s Matlab software is used to develop and simulate the boid guidance algorithm. The algorithm is interfaced with Cloud Cap Technology\u27s Piccolo autopilot system for Hardware-in-the-Loop simulations. These high-fidelity simulations prove this technology is both feasible and practical. They also prove the boid guidance system developed herein is suitable for comprehensive flight testing

Self-organized UAV Traffic in Realistic Environments

We investigated different dense multirotor UAV traffic simulation scenarios in open 2D and 3D space, under realistic environments with the presence of sensor noise, communication delay, limited communication range, limited sensor update rate and finite inertia.We implemented two fundamental self-organized algorithms: one with constant direction and one with constant velocity preference to reach a desired target. We performed evolutionary optimization on both algorithms in five basic traffic scenarios and tested the optimized algorithms under different vehicle densities. We provide optimal algorithm and parameter selection criteria and compare the maximal flux and collision risk of each solution and situation. We found that i) different scenarios and densities require different algorithmic approaches, i.e., UAVs have to behave differently in sparse and dense environments or when they have common or different targets; ii) a slower-is-faster effect is implicitly present in our models, i.e., the maximal flux is achieved at densities where the average speed is far from maximal; iii) communication delay is the most severe destabilizing environmental condition that has a fundamental effect on performance and needs to be taken into account when designing algorithms to be used in real lif