236 research outputs found
Cooperative Pursuit with Multi-Pursuer and One Faster Free-moving Evader
This paper addresses a multi-pursuer single-evader pursuit-evasion game where
the free-moving evader moves faster than the pursuers. Most of the existing
works impose constraints on the faster evader such as limited moving area and
moving direction. When the faster evader is allowed to move freely without any
constraint, the main issues are how to form an encirclement to trap the evader
into the capture domain, how to balance between forming an encirclement and
approaching the faster evader, and what conditions make the capture possible.
In this paper, a distributed pursuit algorithm is proposed to enable pursuers
to form an encirclement and approach the faster evader. An algorithm that
balances between forming an encirclement and approaching the faster evader is
proposed. Moreover, sufficient capture conditions are derived based on the
initial spatial distribution and the speed ratios of the pursuers and the
evader. Simulation and experimental results on ground robots validate the
effectiveness and practicability of the proposed method
Swarm Coordination for Pursuit Evasion Games Using Sensor Networks
Abstract — In this work we consider the problem of pursuit evasion games (PEGs) where a group of pursuers is required to detect, chase and capture a group of evaders with the aid of a sensor network in minimum time. Differently from standards PEGs where the environment and the location of evaders is unknown and a probabilistic map is built based on the pursuer onboard sensors, here we consider a scenario where a sensor network, previously deployed in the region of concern, can detect the presence of moving vehicles and can relay this information to the pursuers. Here we propose a general framework for the design of a hierarchical control architecture that exploit the advantages of a sensor networks by combining both centralized and decentralized real-time control algorithms. We also propose a coordination scheme for the pursuers to minimize the time-to-capture of all evaders. In particular, we focus on PEGs with sensor networks orbiting in space for artificial space debris detection and removal. Index Terms — Sensor networks, pursuit evasion games, vehicle coordination, space vehicles, space debris over the area of interest. This constraint makes designing a cooperative pursuit algorithm harder because lack of complete observability only allows for suboptimal pursuit policies. See Figure 1(left). Furthermore, a smart evaders makes the map-building process dynamic since their location changes over time. The map-learning phase is, by itself, time-consuming and computationally intensive even for simple two-dimensional rectilinear environments [5]. Moreover, inaccurate sensors complicate this process and a probabilistic approach is often required [21]. I
Simultaneous Search and Monitoring by Unmanned Aerial Vehicles
Although robot search and monitoring are two problems which are normally addressed separately, this work conceives the idea that search and monitoring are both required in realistic applications. A problem of simultaneous search and monitoring (SSM) is studied, which innovatively combines two problems in a synergistic perspective. The single pursuer SSM of randomly moving or evasive targets are studied first, and are extended to the cases with multiple pursuers. The precise mathematical frameworks for this work are POMDP, POSG and Dec-POMDP. They are all intractable and non-scalable. Different approaches are taken in each scenario, to reduce computation cost and achieve online and distributed planning, without significantly undermining the performance. For the single pursuer SSM of randomly moving targets, a novel policy reconstruction method is combined with a heuristic branching rule, to generate a heuristic reactive policy. For the single pursuer SSM of evasive targets, an assumption is made and justified, which simplifies the search evasion game to a dynamic guaranteed search problem. For the multiple-pursuer SSM of randomly moving targets, the partial open-loop feedback control method is originally applied to achieve the cooperation implicitly. For the multiple-pursuer SSM of evasive targets, the assumption made in the single pursuer case also simplifies the cooperative search evasion game to a cooperative dynamic guaranteed search problem. In moderate scenarios, the proposed methods show better performance than baseline methods, and can have practical computation efficiency. The extreme scenarios when SSM does not work are also studied
On a test-bed application for the ART-WiSe framework
This report describes the development of a Test-bed Application for the ART-WiSe Framework with the aim
of providing a means of access, validate and demonstrate that architecture. The chosen application is a kind
of pursuit-evasion game where a remote controlled robot, navigating through an area covered by wireless
sensor network (WSN), is detected and continuously tracked by the WSN. Then a centralized control station
takes the appropriate actions for a pursuit robot to chase and “capture” the intruder one.
This kind of application imposes stringent timing requirements to the underlying communication
infrastructure. It also involves interesting research problems in WSNs like tracking, localization, cooperation
between nodes, energy concerns and mobility. Additionally, it can be easily ported into a real-world
application. Surveillance or search and rescue operations are two examples where this kind of functionality
can be applied.
This is still a first approach on the test-bed application and this development effort will be continuously
pushed forward until all the envisaged objectives for the Art-WiSe architecture become accomplished
Analysis of multi-agent systems under varying degrees of trust, cooperation, and competition
Multi-agent systems rely heavily on coordination and cooperation to achieve a variety of tasks. It is often assumed that these agents will be fully cooperative, or have reliable and equal performance among group members. Instead, we consider cooperation as a spectrum of possible interactions, ranging from performance variations within the group to adversarial agents. This thesis examines several scenarios where cooperation and performance are not guaranteed. Potential applications include sensor coverage, emergency response, wildlife management, tracking, and surveillance. We use geometric methods, such as Voronoi tessellations, for design insight and Lyapunov-based stability theory to analyze our proposed controllers. Performance is verified through simulations and experiments on a variety of ground and aerial robotic platforms. First, we consider the problem of Voronoi-based coverage control, where a group of robots must spread out over an environment to provide coverage. Our approach adapts online to sensing and actuation performance variations with the group. The robots have no prior knowledge of their relative performance, and in a distributed fashion, compensate by assigning weaker robots a smaller portion of the environment. Next, we consider the problem of multi-agent herding, akin to shepherding. Here, a group of dog-like robots must drive a herd of non-cooperative sheep-like agents around the environment. Our key insight in designing the control laws for the herders is to enforce geometrical relationships that allow for the combined system dynamics to reduce to a single nonholonomic vehicle. We also investigate the cooperative pursuit of an evader by a group of quadrotors in an environment with no-fly zones. While the pursuers cannot enter the no-fly zones, the evader moves freely through the zones to avoid capture. Using tools for Voronoi-based coverage control, we provide an algorithm to distribute the pursuers around the zone's boundary and minimize capture time once the evader emerges. Finally, we present an algorithm for the guaranteed capture of multiple evaders by one or more pursuers in a bounded, convex environment. The pursuers utilize properties of the evader's Voronoi cell to choose a control strategy that minimizes the safe-reachable area of the evader, which in turn leads to the evader's capture
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
Living IoT: A Flying Wireless Platform on Live Insects
Sensor networks with devices capable of moving could enable applications
ranging from precision irrigation to environmental sensing. Using mechanical
drones to move sensors, however, severely limits operation time since flight
time is limited by the energy density of current battery technology. We explore
an alternative, biology-based solution: integrate sensing, computing and
communication functionalities onto live flying insects to create a mobile IoT
platform.
Such an approach takes advantage of these tiny, highly efficient biological
insects which are ubiquitous in many outdoor ecosystems, to essentially provide
mobility for free. Doing so however requires addressing key technical
challenges of power, size, weight and self-localization in order for the
insects to perform location-dependent sensing operations as they carry our IoT
payload through the environment. We develop and deploy our platform on
bumblebees which includes backscatter communication, low-power
self-localization hardware, sensors, and a power source. We show that our
platform is capable of sensing, backscattering data at 1 kbps when the insects
are back at the hive, and localizing itself up to distances of 80 m from the
access points, all within a total weight budget of 102 mg.Comment: Co-primary authors: Vikram Iyer, Rajalakshmi Nandakumar, Anran Wang,
In Proceedings of Mobicom. ACM, New York, NY, USA, 15 pages, 201
- …