Optimal Control of Interacting Agents on Sparse Random Graph

Learn about optimal control strategies for multi-agent systems operating on sparse random graph networks in this 15-minute research presentation. Explore the mathematical frameworks and theoretical foundations for controlling interacting agents when their connections follow sparse random graph topologies. Discover how network structure influences control design, examine the challenges posed by limited connectivity in sparse graphs, and understand the implications for distributed control systems. Gain insights into the intersection of graph theory, control theory, and multi-agent systems through rigorous mathematical analysis and practical applications in networked systems.