skip to main content


Title: Distributed Control for Flocking Maneuvers via Acceleration-Weighted Neighborhooding
We introduce the concept of Distributed Model Predictive Control (DMPC) with Acceleration-Weighted Neighborhooding (AWN) in order to synthesize a distributed and symmetric controller for high-speed flocking maneuvers (angular turns in general). Acceleration-Weighted Neighborhooding exploits the imbalance in agent accelerations during a turning maneuver to ensure that actively turning agents are prioritized. We show that with our approach, a flocking maneuver can be achieved without it being a global objective. Only a small subset of the agents, called initiators, need to be aware of the maneuver objective. Our AWN-DMPC controller ensures this local information is propagated throughout the flock in a scale-free manner with linear delays. Our experimental evaluation conclusively demonstrates the maneuvering capabilities of a distributed flocking controller based on AWN-DMPC.  more » « less
Award ID(s):
1954837
NSF-PAR ID:
10327761
Author(s) / Creator(s):
; ; ; ; ;
Date Published:
Journal Name:
Proceedings of the 2021 American Control Conference (ACC)
Page Range / eLocation ID:
2745-2750
Format(s):
Medium: X
Sponsoring Org:
National Science Foundation
More Like this
  1. We introduce Spatial Predictive Control (SPC), a technique for solving the following problem: given a collection of robotic agents with black-box positional low-level controllers (PLLCs) and a mission-specific distributed cost function, how can a distributed controller achieve and maintain cost-function minimization without a plant model and only positional observations of the environment? Our fully distributed SPC controller is based strictly on the position of the agent itself and on those of its neighboring agents. This information is used in every time step to compute the gradient of the cost function and to perform a spatial look-ahead to predict the best next target position for the PLLC. Using a simulation environment, we show that SPC outperforms Potential Field Controllers, a related class of controllers, on the drone flocking problem. We also show that SPC works on real hardware, and is therefore able to cope with the potential sim-to-real transfer gap. We demonstrate its performance using as many as 16 Crazyflie 2.1 drones in a number of scenarios, including obstacle avoidance. 
    more » « less
  2. The problem of air-to-surface trajectory optimization for a low-altitude skid-to-turn vehicle is considered. The objective is for the vehicle to move level at a low altitude for as long as possible and perform a rapid bunt (negative sensed-acceleration load) maneuver near the final time in order to attain terminal target conditions. The vehicle is modeled as a point mass in motion over a flat Earth, and the vehicle is controlled using thrust magnitude, angle of attack, and sideslip angle. The trajectory optimization problem is posed as a two-phase optimal control problem using a weighted objective function. The work described in this paper is the first part of a two-part sequence on trajectory optimization and guidance of a skid-to-turn vehicle. In both cases, the objective is to minimize the time taken by the vehicle to complete a bunt maneuver subject to the following constraints: dynamic, boundary, state, path, and interior-point event constraints. In the first part of this two-part study, the performance of thevehicle is assessed. In particular, the key features of the optimal reference trajectories and controls are provided. The results of this study identify that as greater weight is placed on minimizing the height of the bunt maneuver or as the maximum altitude constraint is raised, the time of the bunt maneuver decreases and the time of the problem solution increases. Also, the results of this study identify that as the allowable crossrange of the vehicle is reduced, the time and height of the bunt maneuver increases and the time of the problem solution decrease 
    more » « less
  3. We propose a new algorithm to simplify the controller development for distributed robotic systems subject to external observations, disturbances, and communication delays. Unlike prior approaches that propose specialized solutions to handling communication latency for specific robotic applications, our algorithm uses an arbitrary centralized controller as the specification and automatically generates distributed controllers with communication management and delay compensation. We formulate our goal as nonlinear optimal control— using a regret minimizing objective that measures how much the distributed agents behave differently from the delay-free centralized response—and solve for optimal actions w.r.t. local estimations of this objective using gradient-based optimization. We analyze our proposed algorithm’s behavior under a linear time-invariant special case and prove that the closed-loop dynamics satisfy a form of input-to-state stability w.r.t. unexpected disturbances and observations. Our experimental results on both simulated and real-world robotic tasks demonstrate the practical usefulness of our approach and show significant improvement over several baseline approaches. 
    more » « less
  4. We propose a new algorithm to simplify the controller development for distributed robotic systems subject to external observations, disturbances, and communication delays. Unlike prior approaches that propose specialized solutions to handling communication latency for specific robotic applications, our algorithm uses an arbitrary centralized controller as the specification and automatically generates distributed controllers with communication management and delay compensation. We formulate our goal as nonlinear optimal control— using a regret minimizing objective that measures how much the distributed agents behave differently from the delay-free centralized response—and solve for optimal actions w.r.t. local estimations of this objective using gradient-based optimization. We analyze our proposed algorithm’s behavior under a linear time-invariant special case and prove that the closed-loop dynamics satisfy a form of input-to-state stability w.r.t. unexpected disturbances and observations. Our experimental results on both simulated and real-world robotic tasks demonstrate the practical usefulness of our approach and show significant improvement over several baseline approaches. 
    more » « less
  5. Agent-based models of “flocking” and “schooling” have shown that a weighted average of neighbor velocities, with weights that decay gradually with distance, yields emergent collective motion. Weighted averaging thus offers a potential mechanism of self-organization that recruits an increasing, but self-limiting, number of individuals into collective motion. Previously, we identified and modeled such a ‘soft metric’ neighborhood of interaction in human crowds that decays exponentially to zero at a distance of 4–5 m. Here we investigate the limits of weighted averaging in humans and find that it is surprisingly robust: pedestrians align with the mean heading direction in their neighborhood, despite high levels of noise and diverging motions in the crowd, as predicted by the model. In three Virtual Reality experiments, participants were immersed in a crowd of virtual humans in a mobile head-mounted display and were instructed to walk with the crowd. By perturbing the heading (walking direction) of virtual neighbors and measuring the participant’s trajectory, we probed the limits of weighted averaging. 1) In the “Noisy Neighbors” experiment, the neighbor headings were randomized (range 0–90°) about the crowd’s mean direction (±10° or ±20°, left or right); 2) in the “Splitting Crowd” experiment, the crowd split into two groups (heading difference = 10–40°) and the proportion of the crowd in one group was varied (50–84%); 3) in the “Coherent Subgroup” experiment, a perturbed subgroup varied in its coherence (heading SD = 0–20°) about a mean direction (±10° or ±20°) within a noisy crowd (heading range = 180°), and the proportion of the crowd in the subgroup was varied. In each scenario, the results were predicted by the weighted averaging model, and attraction strength (turning rate) increased with the participant’s deviation from the mean heading direction, not with group coherence. However, the results indicate that humans ignore highly discrepant headings (45–90°). These findings reveal that weighted averaging in humans is highly robust and generates a common heading direction that acts as a positive feedback to recruit more individuals into collective motion, in a self-reinforcing cascade. Therefore, this “soft” metric neighborhood serves as a mechanism of self-organization in human crowds. 
    more » « less