Collision-aware Task Assignment for Multi-Robot Systems

We propose a novel formulation of the collision-aware task assignment (CATA) problem and a decentralized auction-based algorithm to solve the problem with optimality bound. Using a collision cone, we predict potential collisions and introduce a binary decision variable into the local reward function for task bidding. We further improve CATA by implementing a receding collision horizon to address the stopping robot scenario, i.e. when robots are confined to their task location and become static obstacles to other moving robots. The auction-based algorithm encourages the robots to bid for tasks with collision mitigation considerations. We validate the improved task assignment solution with both simulation and experimental results, which show significant reduction of overlapping paths as well as deadlocks

Collision avoidance effects on the mobility of a UAV swarm using chaotic ant colony with model predictive control.

The recent development of compact and economic small Unmanned Aerial Vehicles (UAVs) permits the development of new UAV swarm applications. In order to enhance the area coverage of such UAV swarms, a novel mobility model has been presented in previous work, combining an Ant Colony algorithm with chaotic dynamics (CACOC). This work is extending CACOC by a Collision Avoidance (CA) mechanism and testing its efficiency in terms of area coverage by the UAV swarm. For this purpose, CACOC is used to compute UAV target waypoints which are tracked by model predictively controlled UAVs. The UAVs are represented by realistic motion models within the virtual robot experimentation platform (V-Rep). This environment is used to evaluate the performance of the proposed CACOC with CA algorithm in an area exploration scenario with 3 UAVs. Finally, its performance is analyzed using metrics

Guaranteeing Motion Safety for Robots

International audienceSpecial Issue Guest Editoria

Decentralized 3D Collision Avoidance for Multiple UAVs in Outdoor Environments

The use of multiple aerial vehicles for autonomous missions is turning into commonplace. In many of these applications, the Unmanned Aerial Vehicles (UAVs) have to cooperate and navigate in a shared airspace, becoming 3D collision avoidance a relevant issue. Outdoor scenarios impose additional challenges: (i) accurate positioning systems are costly; (ii) communication can be unreliable or delayed; and (iii) external conditions like wind gusts affect UAVs’ maneuverability. In this paper, we present 3D-SWAP, a decentralized algorithm for 3D collision avoidance with multiple UAVs. 3D-SWAP operates reactively without high computational requirements and allows UAVs to integrate measurements from their local sensors with positions of other teammates within communication range. We tested 3D-SWAP with our team of custom-designed UAVs. First, we used a Software-In-The-Loop simulator for system integration and evaluation. Second, we run field experiments with up to three UAVs in an outdoor scenario with uncontrolled conditions (i.e., noisy positioning systems, wind gusts, etc). We report our results and our procedures for this field experimentation.European Union’s Horizon 2020 research and innovation programme No 731667 (MULTIDRONE

Using collision cones to assess biological deconfliction methods

Biological systems consistently outperform autonomous systems governed by engineered algorithms in their ability to reactively avoid collisions. To better understand this discrepancy, a collision avoidance algorithm was applied to frames of digitized video trajectory data from bats, swallows and fish (Myotis velifer, Petrochelidon pyrrhonota and Danio aequipinnatus). Information available from visual cues, specifically relative position and velocity, was provided to the algorithm which used this information to define collision cones that allowed the algorithm to find a safe velocity requiring minimal deviation from the original velocity. The subset of obstacles provided to the algorithm was determined by the animal's sensing range in terms of metric and topological distance. The algorithmic calculated velocities showed good agreement with observed biological velocities, indicating that the algorithm was an informative basis for comparison with the three species and could potentially be improved for engineered applications with further study