Distributed and Constrained Optimal Transport of Large-scale, Heterogenous, Multi-agent Systems

About This Grant

Advances in sensing, artificial intelligence, computation and communication are enabling the deployment of large networks of autonomous systems, such as drones, ground robots, and other mobile agents, across diverse applications including search and rescue, environmental monitoring, precision agriculture, and transportation. The research funded by this grant aims to create new mathematical tools and algorithms that allow large groups of autonomous agents to operate safely, efficiently, and collaboratively, even under physical constraints, communication limitations, and local decision-making. The central idea of this research is to model large groups of autonomous agents not individually, but as evolving spatial distributions like densities or concentrations over a region. This macroscopic perspective looks to enable the design of scalable, tractable algorithms that guide the collective behavior of many agents, while still accounting for each agent’s physical limitations, local interactions, asynchronous timing, and safety constraints. By linking these global objectives with local decision-making through new optimization techniques, the project seeks to create algorithms that are both theoretically grounded and practically applicable. The research will be complemented by educational and outreach activities that include the development of new curriculum for undergraduate and graduate education, research experiences for students through high-fidelity simulations, and opportunities to engage in algorithm development and visualization at the multiagent robotics (MURO) Lab at the University of California, San Diego. Findings will be disseminated through academic publications, conference sessions, and public engagement efforts. This project aims to develop new tractable, robust, safe and distributed transport algorithms for large-scale multi-agent (autonomous) systems modeled by probability distributions. The theoretical foundation relies on the design of new macroscopic proximal gradient algorithms that account for individual agent limitations as well as approximation errors arising from the use of a finite number of agents. The research is organized around three main thrusts: (i) the development of robust transport algorithms for large-scale homogeneous populations, with robustness characterized via Input-to-State (ISS) stability properties; (ii) the design of safe-proximal gradient algorithms for homogeneous agents incorporating feedback control for macroscopic proximal gradient optimizations; and (iii) the formulation of distributed safe proximal gradients for heterogeneous populations, coordinated by a higher-level network of operators. This award reflects NSF's statutory mission and has been deemed worthy of support through evaluation using the Foundation's intellectual merit and broader impacts review criteria.