Abstract-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 (3-D) 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 the 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.
Target tracking is a fundamental problem in robotics research and has been the subject of detailed studies over the years. In this paper, we generate a data-driven target model from a real-world dataset of taxi motions. This model includes target motion, appearance, and disappearance from the search area. Using this target model, we introduce a new formulation of the mobile target tracking problem based on the mathematical concept of random finite sets. This formulation allows for tracking an unknown and dynamic number of mobile targets with a team of robots. We show how to employ the probability hypothesis density filter to simultaneously estimate the number of targets and their positions. Next, we present a greedy algorithm for assigning trajectories to the robots to allow them to actively track the targets. We prove that the greedy algorithm is a two-approximation for maximizing submodular tracking objective functions. We examine two such functions: the mutual information between the estimated target positions and future measurements from the robots and a new objective that maximizes the expected number of targets detected by the robot team. We provide extensive simulation evaluations to validate the performance of our data-driven motion model and to compare the behavior and tracking performance of robots using our objective functions.
This paper considers situations in which a team of mobile sensor platforms autonomously explores an environment to detect and localize an unknown number of targets. Individual sensors may be unreliable, failing to detect objects within the field-of-view, returning false positive measurements to clutter objects, and being unable to disambiguate true targets. In this setting, data association is difficult. We utilize the PHD filter for multitarget localization, simultaneously estimating the number of objects and their locations within the environment without the need to explicitly consider data association. Using sets of potential actions generated at multiple length scales for each robot, the team selects the joint action that maximizes the expected information gain over a finite time horizon. This is computed as the mutual information between the set of targets and the binary events of receiving no detections, effectively hedging against uninformative actions in a computationally tractable manner. We frame the controller as a receding-horizon problem. We demonstrate the real-world applicability of the proposed autonomous exploration strategy through hardware experiments, exploring an office environment with a team of ground robots. We also conduct a series of simulated experiments, varying the planning method, target cardinality, environment, and sensor modality.Note to Practitioners-Teams of small robots have the potential to automate many information gathering tasks, relaying data back to a base station or human operator from multiple vantage points within an environment. The information gathering tasks we consider in this work are those in which the number of objects being sought is not known at the onset of exploration. Such tasks are Manuscript
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.
hi@scite.ai
10624 S. Eastern Ave., Ste. A-614
Henderson, NV 89052, USA
Copyright © 2024 scite LLC. All rights reserved.
Made with 💙 for researchers
Part of the Research Solutions Family.