skip to main content
US FlagAn official website of the United States government
dot gov icon
Official websites use .gov
A .gov website belongs to an official government organization in the United States.
https lock icon
Secure .gov websites use HTTPS
A lock ( lock ) or https:// means you've safely connected to the .gov website. Share sensitive information only on official, secure websites.

Explore Research Products in the PAR
It may take a few hours for recently added research products to appear in PAR search results.


Title: Density Stabilization Strategies for Nonholonomic Agents on Compact Manifolds
In this article, we consider the problem of stabilizing a class of degenerate stochastic processes, which are constrained to a bounded Euclidean domain or a compact smooth manifold, to a given target probability density. This stabilization problem arises in the field of swarm robotics, for example, in applications where a swarm of robots is required to cover an area according to a target probability density. Most existing works on modeling and control of robotic swarms that use partial differential equation (PDE) models assume that the robots' dynamics are holonomic and, hence, the associated stochastic processes have generators that are elliptic. We relax this assumption on the ellipticity of the generator of the stochastic processes, and consider the more practical case of the stabilization problem for a swarm of agents whose dynamics are given by a controllable driftless control-affine system. We construct state-feedback control laws that exponentially stabilize a swarm of nonholonomic agents to a target probability density that is sufficiently regular. State-feedback laws can stabilize a swarm only to target probability densities that are positive everywhere. To stabilize the swarm to probability densities that possibly have disconnected supports, we introduce a semilinear PDE model of a collection of interacting agents governed by a hybrid switching diffusion process. The interaction between the agents is modeled using a (mean-field) feedback law that is a function of the local density of the swarm, with the switching parameters as the control inputs. We show that under the action of this feedback law, the semilinear PDE system is globally asymptotically stable about the given target probability density. The stabilization strategies with and without agent interactions are verified numerically for agents that evolve according to the Brockett integrator; the strategy with interactions is additionally verified for agents that evolve according to an underactuated s...  more » « less
Award ID(s):
1828010
PAR ID:
10514437
Author(s) / Creator(s):
;
Publisher / Repository:
IEEE
Date Published:
Journal Name:
IEEE Transactions on Automatic Control
Volume:
69
Issue:
3
ISSN:
0018-9286
Page Range / eLocation ID:
1448 to 1463
Format(s):
Medium: X
Sponsoring Org:
National Science Foundation
More Like this
  1. ; ; (, 2022 American Control Conference (ACC))
    In this paper, we investigate how the self-synchronization property of a swarm of Kuramoto oscillators can be controlled and exploited to achieve target densities and target phase coherence. In the limit of an infinite number of oscillators, the collective dynamics of the agents’ density is described by a mean-field model in the form of a nonlocal PDE, where the nonlocality arises from the synchronization mechanism. In this mean-field setting, we introduce two space-time dependent control inputs to affect the density of the oscillators: an angular velocity field that corresponds to a state feedback law for individual agents, and a control parameter that modulates the strength of agent interactions over space and time, i.e., a multiplicative control with respect to the integral nonlocal term. We frame the density tracking problem as a PDE-constrained optimization problem. The controlled synchronization and phase-locking are measured with classical polar order metrics. After establishing the mass conservation property of the mean-field model and bounds on its nonlocal term, a system of first-order necessary conditions for optimality is recovered using a Lagrangian method. The optimality system, comprising a nonlocal PDE for the state dynamics equation, the respective nonlocal adjoint dynamics, and the Euler equation, is solved iteratively following a standard Optimize-then-Discretize approach and an efficient numerical solver based on spectral methods. We demonstrate our approach for each of the two control inputs in simulation. 
    more » « less
  2. ; (, Springer Nature Switzerland)
    This paper compares different distributed control approaches which enable a team of robots search for and track an unknown number of targets. The robots are equipped with sensors which have a limited field of view (FoV) and they are required to explore the environment. The team uses a distributed formulation of the Probability Hypothesis Density (PHD) filter to estimate the number and the position of the targets. The resulting target estimate is used to select the subsequent search locations for each robot. This paper compares Lloyd’s algorithm, a traditional method for distributed search, with two typical stochastic optimization methods: Particle Swarm Optimization (PSO) and Simulated Annealing (SA). This paper presents novel formulations of PSO and SA to solve the multi-target tracking problem, which more effectively trade off between exploration and exploitation. Simulations demonstrate that the use of these stochastic optimization techniques improves coverage of the search space and reduces the error in the target estimates compared to the baseline approach. 
    more » « less
  3. ; (, IEEE)
    In this paper, a density-driven multi-agent swarm control problem is investigated. Robot swarms can provide a great benefit, especially for applications where a single robot cannot effectively achieve a given task. For large spatial-scale applications such as search and rescue, environmental monitoring, and surveillance, a new multi-agent swarm control strategy is necessary because of physical constraints including a robot number and operation time. This paper provides a novel density-driven swarm control strategy for multi-agent systems based on the Optimal Transport theory, to cover a spacious domain with limited resources. In such a scenario, \textit{efficiency} will likely be a key point in achieving an efficient robot swarm behavior rather than uniform coverage that might be infeasible. With the given reference density, pre-constructed from available information, the proposed swarm control method will drive the multi-agent system such that their time-averaged behavior becomes similar to the reference density. In this way, density-driven swarm control will enable the multiple agents to spend most of their time on high-priority regions that are reflected in the reference density, leading to efficiency. To protect the agents from collisions, the Artificial Potential Field method is employed and combined with the proposed density-driven swarm control scheme. Simulations are conducted to validate density-driven swarm control as well as to test collision avoidance. Also, the swarm performance is analyzed by varying the agent number in the simulation. 
    more » « less
  4. ; ; (, IEEE)
    Deploying decentralized control strategies for outdoor multi-agent Uncrewed Aircraft Systems (UASs) is challenging due to timing variations, packet loss, and computing resource limitations. In this work we address robustness to these conditions through a novel co-regulated control strategy that varies the periodicity of control inputs and communication with other agents. Co-regulation is applied to a decentralized hierarchical controller consisting of a global component governing inter-group coordination to multiple targets while a local component governs intra-group coordination of the agents as they progress to the target of interest. The control gains are “gain scheduled” according to current conditions while a cyber controller schedules the control and communication tasks for execution based on swarm performance. The control gains are found via reinforcement learning and the entire algorithm is deployed on a swarm consisting of 7 custom agents. Our results show the impact of rethinking swarming algorithms with computation and communication resource limitations in mind and indicate we can provide exceptional swarm control utilizing fewer resources while also improving the quality of service for an onboard, anytime collision avoidance algorithm. 
    more » « less
  5. ; ; ; (, Reshaping Particle Configurations by Collisions with Rigid Objects)
    This paper investigates motion planning for one or more robot(s) that attempt to harvest agents from a moving swarm. Generating motion paths that maximize the number of agents harvested differs from many traditional coverage problems because the agents move. This movement allows previously cleared areas to become recontaminated. We assume that the swarm agents prefer certain regions over others, and that we can represent the swarm by a Markov Process that encodes the agents' preferred regions and their speed of motion. We exploit this model to design and simulate robotic coverage paths that maximize the number of agents harvested by a fleet of robots in a given time budget. 
    more » « less
  • Citation Formats
  • MLA
  • APA
  • Chicago
  • BibTeX
  • Save / Share this Record
  • Send to Email