In this article, we introduce an algorithm designed to address the problem of time-optimal formation reshaping in three-dimensional environments while preventing collisions between agents. The utility of the proposed approach is particularly evident in mobile robotics, where agents benefit from being organized and navigated in formation for a variety of real-world applications requiring frequent alterations in formation shape for efficient navigation or task completion. Given the constrained operational time inherent to battery-powered mobile robots, the time needed to complete the formation reshaping process is crucial for their efficient operation, especially in case of multi-rotor uncrewed aerial vehicles (UAVs). The proposed collision-aware time-optimal formation reshaping algorithm (CAT-ORA) builds upon the Hungarian algorithm for the solution of the robot-to-goal assignment implementing the interagent collision avoidance through direct constraints on mutually exclusive robot-goal pairs combined with a trajectory generation approach minimizing the duration of the reshaping process. Theoretical validations confirm the optimality of CAT-ORA, with its efficacy further showcased through simulations, and a real-world outdoor experiment involving 19 UAVs. Thorough numerical analysis shows the potential of CAT-ORA to decrease the time required to perform complex formation reshaping tasks by up to 49%, and 12% on average compared to commonly used methods in randomly generated scenarios.

This article surveys recent progress and discusses future opportunities for simultaneous localization and mapping (SLAM) in extreme underground environments. SLAM in subterranean environments, from tunnels, caves, and man-made underground structures on Earth, to lava tubes on Mars, is a key enabler for a range of applications, such as planetary exploration, search and rescue, disaster response, and automated mining, among others. SLAM in underground environments has recently received substantial attention, thanks to theDARPA Subterranean (SubT) Challenge, a global robotics competition aimed at assessing and pushing the state of the art in autonomous robotic exploration and mapping in complex underground environments. This article reports on the state of the art in underground SLAM by discussing different SLAM strategies and results across six teams that participated in the three-year-long SubT competition. In particular, the article has four main goals. First, we review the algorithms, architectures, and systems adopted by the teams; particular emphasis is put on light detection and ranging (LIDAR)-centric SLAM solutions (the go-to approach for virtually all teams in the competition), heterogeneous multirobot operation (including both aerial and ground robots), and real-world underground operation (from the presence of obscurants to the need to handle tight computational constraints). We do not shy away from discussing the “dirty details” behind the different SubT SLAM systems, which are often omitted from technical papers. Second, we discuss the maturity of the field by highlighting what is possible with the current SLAM systems and what we believe is within reach with some good systems engineering. Third, we outline what we believe are fundamental open problems, which are likely to require further research to break through. Finally, we provide a list of open-source SLAM implementations and datasets that have been produced during the SubT challenge and related efforts and constitute a useful resource for researchers and practitioners.

The compact flocking of relatively localized Un-manned Aerial Vehicles (UAVs) in high obstacle density areas is discussed in this paper. The presented work tackles realistic scenarios in which the environment map is not known apriori and the use of a global localization system and communication infrastructure is difficult due to the presence of obstacles. To achieve flocking in such a constrained environment, we propose a fully decentralized, bio-inspired control law that uses only onboard sensor data for safe flocking through the environment without any communication with other agents. In the proposed approach, each UAV agent uses onboard sensors to self-localize and estimate the relative position of other agents in its local reference frame. The usability and performance of the proposed approach were verified and evaluated using various experiments in a realistic robotic simulator and a natural forest. The presented experiments also validate the utility of onboard relative localization for autonomous multi-UAV applications in the absence of global localization information and communication.

The problem of safe interception of multiple intruder UAVs by a team of cooperating autonomous aerial vehicles is addressed in this paper. The presented work is motivated by the Mohamed Bin Zayed International Robotics Challenge (MBZIRC) 2020 where this task was simplified to an interaction with a set of static and dynamic objects (balloons and a UAV), and by a real autonomous aerial interception system of Eagle.One that our team has been working on. We propose a general control, perception, and coordination system for the fast and reliable interception of targets in a 3D environment relying only on onboard sensors and processing. The proposed methods and the entire complex multi-robot system were successfully verified in demanding desert conditions, with the main focus on reliability and fast deployment. In the MBZIRC competition, the proposed approach exhibited the greatest reliability and fastest solution. It was crucial to our team in winning the entire competition and achieving the second place in the intruder UAV interception scenario.

Cooperative carrying of large, cable-suspended payloads by a pair of cooperating unmanned aerial vehicles (UAVs) is tackled in this paper. The proposed system, involving a sampling-based motion planning algorithm and a model predictive control-based coordination of UAVs, aims to achieve a smooth and reliable flight performance in environments with obstacles. The motion planning is designed to satisfy constraints on relative positions of UAVs, which are defined from the cooperative transport task and by onboard mutual localization, which is used for real-time estimation of states of neighboring robots carrying the object. Besides, a guiding principle with a cost-driven expansion is employed to steer the growth of a Rapidly-exploring Random Tree (RRT) to keep the coupled system of UAVs and the object as close to desired mutual positions as possible. A significant deviation of the controlled system from the desired configuration, by increasing or decreasing the relative distance between UAVs carrying the cable-suspended object, is achieved only if it is required by environment constraints (e.g. in narrow passages), while the allowed limits are always satisfied. Using the guiding principle enables us to find feasible solutions of the problem in a reasonable short time using onboard computer even in environments with a complicated structure of obstacles. The proposed system was evaluated in numerous simulations, compared with state-of-the-art solutions using statistical sets of results, and its performance and reliability were verified in experiments in real-world conditions.

In the task of cooperative surveillance using Micro Aerial Vehicles (MAVs), MAVs cooperatively observe a given set of Areas of Interest (AoI). The missions are usually prepared in a decoupled manner: first, the sensing locations are found, followed by computations of the trajectories assuming GPS-based localization. The precision of GPS may, however, be insufficient to keep the MAVs in compact groups, which may lead to mutual collisions. To avoid the collisions between MAVs, a camera-based on-board localization has to be used. This however requires to maintain positions of the team members in the given range to enable reliable on-board localization (each MAV has to be visible from other ones). The task of the mission planning is to find an appropriate distribution of MAVs above AoIs together with feasible trajectories from a depot to reach these locations. The on-board localization constraints and MAV motion constraints have to be satisfied during the entire mission. We propose a modification of RRT (Rapidly Exploring Random Tree) for this mission planning. The algorithm first explores the state space to find suitable sensing locations together with feasible trajectories towards them. Then, the sensing locations are optimized using Particle Swarm optimization (PSO). The proposed method has been verified in numerous simulations and outdoor experiments. The achieved results exhibit significantly better performance in terms of lower computational power and complexity of solved scenarios than the state-of-the-art solutions.