skip to main content

Title: Scheduling Multiple Agents in a Persistent Monitoring Task Using Reachability Analysis
We consider the problem of controlling the dynamic state of each of a finite collection of targets distributed in physical space using a much smaller collection of mobile agents. Each agent can attend to no more than one target at a given time, thus agents must move between targets to control the collective state, implying that the states of each of the individual targets are only controlled intermittently. We assume that the state dynamics of each of the targets are given by a linear, timeinvariant, controllable system and develop conditions on the visiting schedules of the agents to ensure that the property of controllability is maintained in the face of the intermittent control. We then introduce constraints on the magnitude of the control input and a bounded disturbance into the target dynamics and develop a method to evaluate system performance under this scenario. Finally, we use this method to determine how the amount of time the agents spend at a given target before switching to the next in its sequence influences
; ; ;
Award ID(s):
1509084 1562031 1645681
Publication Date:
Journal Name:
IEEE Transactions on Automatic Control
Page Range or eLocation-ID:
1 to 1
Sponsoring Org:
National Science Foundation
More Like this
  1. We present a closed-loop multi-arm motion planner that is scalable and flexible with team size. Traditional multi-arm robotic systems have relied on centralized motion planners, whose run times often scale exponentially with team size, and thus, fail to handle dynamic environments with open-loop control. In this paper, we tackle this problem with multi-agent reinforcement learning, where a shared policy network is trained to control each individual robot arm to reach its target end-effector pose given observations of its workspace state and target end-effector pose. The policy is trained using Soft Actor-Critic with expert demonstrations from a sampling-based motion planning algorithmmore »(i.e., BiRRT). By leveraging classical planning algorithms, we can improve the learning efficiency of the reinforcement learning algorithm while retaining the fast inference time of neural networks. The resulting policy scales sub-linearly and can be deployed on multi-arm systems with variable team sizes. Thanks to the closed-loop and decentralized formulation, our approach generalizes to 5-10 multiarm systems and dynamic moving targets (>90% success rate for a 10-arm system), despite being trained on only 1-4 arm planning tasks with static targets.« less
  2. In this paper, we present a compositional condition for ensuring safety of a collection of interacting systems modeled by inter-triggering hybrid automata (ITHA). ITHA is a modeling formalism for representing multi-agent systems in which each agent is governed by individual dynamics but can also interact with other agents through triggering actions. These triggering actions result in a jump/reset in the state of other agents according to a global resolution function. A sufficient condition for safety of the collection, inspired by responsibility-sensitive safety, is developed in two parts: self-safety relating to the individual dynamics, and responsibility relating to the triggering actions.more »The condition relies on having an over-approximation method for the resolution function. We further show how such over-approximations can be obtained and improved via communication. We use two examples, a job scheduling task on parallel processors and a highway driving example, throughout the paper to illustrate the concepts. Finally, we provide a comprehensive evaluation on how the proposed condition can be leveraged for several multi-agent control and supervision examples.« less
  3. We consider the optimal multi-agent persistent monitoring problem defined by a team of cooperating agents visiting a set of nodes (targets) on a graph with the objective of minimizing a measure of overall node state uncertainty. The solution to this problem involves agent trajectories defined both by the sequence of nodes to be visited by each agent and the amount of time spent at each node. We propose a class of distributed threshold-based parametric controllers through which agent transitions from one node to the next are controlled by thresholds on the node uncertainty. The resulting behavior of the agent-target systemmore »is described by a hybrid dynamic system. This enables the use of Infinitesimal Perturbation Analysis (IPA) to determine on-line optimal threshold parameters through gradient descent and thus obtain optimal controllers within this family of threshold-based policies. Simulations are included to illustrate our results and compare them to optimal solutions derived through dynamic programming.« less
  4. The impact of next-generation biorecognition elements (ligands) will be determined by the ability to remotely control their binding activity for a target biomolecule in complex environments. Compared to conventional mechanisms for regulating binding affinity (pH, ionic strength, or chaotropic agents), light provides higher accuracy and rapidity, and is particularly suited for labile targets. In this study, we demonstrate a general method to develop azobenzene-cyclized peptide ligands with light-controlled affinity for target proteins. Light triggers a cis/trans isomerization of the azobenzene, which results in a major structural rearrangement of the cyclic peptide from a non-binding to a binding configuration. Critical tomore »this goal are the abiliy to achieve efficient photo-isomerization under low light dosage and the temporal stability of both cis and trans isomers. We demonstrated our method by designing photo-switchable peptides targeting vascular cell adhesion marker 1 (VCAM1), a cell marker implicated in stem cell function. Starting from a known VCAM1-binding linear peptide, an ensemble of azobenzene-cyclized variants with selective light-controlled binding were identified by combining in silico design with experimental characterization via spectroscopy and surface plasmon resonance. Variant cycloAZOB[G-VHAKQHRN-K] featured rapid, light-controlled binding of VCAM1 (KD,Trans/KD,Cis ~ 130). Biotin-cycloAZOB[G-VHAKQHRN-K] was utilized to label brain microvascular endothelial cells (BMECs), showing co-localization with anti-VCAM1 antibodies in cis configuration and negligible binding in trans configuration.« less
  5. Abstract In this article, the recently discovered phenomenon of delayed Hopf bifurcations (DHB) in reaction–diffusion partial differential equations (PDEs) is analysed in the cubic Complex Ginzburg–Landau equation, as an equation in its own right, with a slowly varying parameter. We begin by using the classical asymptotic methods of stationary phase and steepest descents on the linearized PDE to show that solutions, which have approached the attracting quasi-steady state (QSS) before the Hopf bifurcation remain near that state for long times after the instantaneous Hopf bifurcation and the QSS has become repelling. In the complex time plane, the phase function ofmore »the linearized PDE has a saddle point, and the Stokes and anti-Stokes lines are central to the asymptotics. The non-linear terms are treated by applying an iterative method to the mild form of the PDE given by perturbations about the linear particular solution. This tracks the closeness of solutions near the attracting and repelling QSS in the full, non-linear PDE. Next, we show that beyond a key Stokes line through the saddle there is a curve in the space-time plane along which the particular solution of the linear PDE ceases to be exponentially small, causing the solution of the non-linear PDE to diverge from the repelling QSS and exhibit large-amplitude oscillations. This curve is called the space–time buffer curve. The homogeneous solution also stops being exponentially small in a spatially dependent manner, as determined also by the initial data and time. Hence, a competition arises between these two solutions, as to which one ceases to be exponentially small first, and this competition governs spatial dependence of the DHB. We find four different cases of DHB, depending on the outcomes of the competition, and we quantify to leading order how these depend on the main system parameters, including the Hopf frequency, initial time, initial data, source terms, and diffusivity. Examples are presented for each case, with source terms that are a uni-modal function, a smooth step function, a spatially periodic function and an algebraically growing function. Also, rich spatio-temporal dynamics are observed in the post-DHB oscillations. Finally, it is shown that large-amplitude source terms can be designed so that solutions spend substantially longer times near the repelling QSS, and hence, region-specific control over the delayed onset of oscillations can be achieved.« less