skip to main content


This content will become publicly available on May 13, 2025

Title: Flock-Formation Control of Multi-Agent Systems using Imperfect Relative Distance Measurements
We present distributed distance-based control (DDC), a novel approach for controlling a multi-agent system, such that it achieves a desired formation, in a resource-constrained setting. Our controller is fully distributed and only requires local state-estimation and scalar measurements of inter-agent distances. It does not require an external localization system or inter-agent exchange of state information. Our approach uses spatial- predictive control (SPC), to optimize a cost function given strictly in terms of inter-agent distances and the distance to the target location. In DDC, each agent continuously learns and updates a very abstract model of the actual system, in the form of a dictionary of three independent key-value pairs (~s, d), where d is the partial derivative of the distance measurements along a spatial direction ~s. This is sufficient for an agent to choose the best next action. We validate our approach by using DDC to control a collection of Crazyflie drones to achieve formation flight and reach a target while maintaining flock formation.  more » « less
Award ID(s):
1918225
PAR ID:
10556858
Author(s) / Creator(s):
; ; ; ;
Publisher / Repository:
IEEE International Conference on Robotics and Automation
Date Published:
Format(s):
Medium: X
Location:
Yokohama, Japan
Sponsoring Org:
National Science Foundation
More Like this
  1. Abstract. Lagrangian particle tracking schemes allow a wide range of flow and transport processes to be simulated accurately, but a major challenge is numerically implementing the inter-particle interactions in an efficient manner. This article develops a multi-dimensional, parallelized domain decomposition (DDC) strategy for mass-transfer particle tracking (MTPT) methods in which particles exchange mass dynamically. We show that this can be efficiently parallelized by employing large numbers of CPU cores to accelerate run times. In order to validate the approach and our theoretical predictions we focus our efforts on a well-known benchmark problem with pure diffusion, where analytical solutions in any number of dimensions are well established. In this work, we investigate different procedures for “tiling” the domain in two and three dimensions (2-D and 3-D), as this type of formal DDC construction is currently limited to 1-D. An optimal tiling is prescribed based on physical problem parameters and the number of available CPU cores, as each tiling provides distinct results in both accuracy and run time. We further extend the most efficient technique to 3-D for comparison, leading to an analytical discussion of the effect of dimensionality on strategies for implementing DDC schemes. Increasing computational resources (cores) within the DDC method produces a trade-off between inter-node communication and on-node work.For an optimally subdivided diffusion problem, the 2-D parallelized algorithm achieves nearly perfect linear speedup in comparison with the serial run-up to around 2700 cores, reducing a 5 h simulation to 8 s, while the 3-D algorithm maintains appreciable speedup up to 1700 cores. 
    more » « less
  2. Understanding and controlling the energy transfer between silicon nanocrystals is of significant importance for the design of efficient optoelectronic devices. However, previous studies on silicon nanocrystal energy transfer were limited because of the strict requirements to precisely control the inter-dot distance and to perform all measurements in air-free environments to preclude the effect of ambient oxygen. Here, we systematically investigate the distance-dependent resonance energy transfer in alkyl-terminated silicon nanocrystals for the first time. Silicon nanocrystal solids with inter-dot distances varying from 3 to 5 nm are fabricated by varying the length and surface coverage of alkyl ligands in solution-phase and gas-phase functionalized silicon nanocrystals. The inter-dot energy transfer rates are extracted from steady-state and time-resolved photoluminescence measurements, enabling a direct comparison to theoretical predictions. Our results reveal that the distance-dependent energy transfer rates in Si NCs decay faster than predicted by the Förster mechanism, suggesting higher-order multipole interactions.

     
    more » « less
  3. Avidan, S. ; Brostow, G. ; Cissé, M. ; Farinella, G.M. ; Hassner, T. (Ed.)
    Wen, S., Wang, H., Metaxas, D. (2022). Social ODE: Multi-agent Trajectory Forecasting with Neural Ordinary Differential Equations. In: Avidan, S., Brostow, G., Cissé, M., Farinella, G.M., Hassner, T. (eds) Computer Vision – ECCV 2022. ECCV 2022. Lecture Notes in Computer Science, vol 13682. Springer, Cham. https://doi.org/10.1007/978-3-031-20047-2_13 Multi-agent trajectory forecasting has recently attracted a lot of attention due to its widespread applications including autonomous driving. Most previous methods use RNNs or Transformers to model agent dynamics in the temporal dimension and social pooling or GNNs to model interactions with other agents; these approaches usually fail to learn the underlying continuous temporal dynamics and agent interactions explicitly. To address these problems, we propose Social ODE which explicitly models temporal agent dynamics and agent interactions. Our approach leverages Neural ODEs to model continuous temporal dynamics, and incorporates distance, interaction intensity, and aggressiveness estimation into agent interaction modeling in latent space. We show in extensive experiments that our Social ODE approach compares favorably with state-of-the-art, and more importantly, can successfully avoid sudden obstacles and effectively control the motion of the agent, while previous methods often fail in such cases. 
    more » « less
  4. Accurate distances to local molecular clouds are critical for understanding the star and planet formation process, yet distance measurements are often obtained inhomogeneously on a cloud-by-cloud basis. We have recently developed a method that combines stellar photometric data with Gaia DR2 parallax measurements in a Bayesian framework to infer the distances of nearby dust clouds to a typical accuracy of ∼5%. After refining the technique to target lower latitudes and incorporating deep optical data from DECam in the southern Galactic plane, we have derived a catalog of distances to molecular clouds in Reipurth (2008, Star Formation Handbook, Vols. I and II) which contains a large fraction of the molecular material in the solar neighborhood. Comparison with distances derived from maser parallax measurements towards the same clouds shows our method produces consistent distances with ≲10% scatter for clouds across our entire distance spectrum (150 pc−2.5 kpc). We hope this catalog of homogeneous distances will serve as a baseline for future work. 
    more » « less
  5. In order to achieve effective human-AI collaboration, it is necessary for an AI agent to align its behavior with the human's expectations. When the agent generates a task plan without such considerations, it may often result in inexplicable behavior from the human's point of view. This may have serious implications for the human, from increased cognitive load to more serious concerns of safety around the physical agent. In this work, we present an approach to generate explicable behavior by minimizing the distance between the agent's plan and the plan expected by the human. To this end, we learn a mapping between plan distances (distances between expected and agent plans) and human's plan scoring scheme. The plan generation process uses this learned model as a heuristic. We demonstrate the effectiveness of our approach in a delivery robot domain. 
    more » « less