Optimal Control of Interacting Agents on Sparse Random Graph
Centre for Networked Intelligence, IISc via YouTube
-
25
-
- Write review
AI, Data Science & Business Certificates from Google, IBM & Microsoft
The Private Equity Associate Certification
Overview
Google, IBM & Meta Certificates — All 10,000+ Courses at 40% Off
One annual plan covers every course and certificate on Coursera. 40% off for a limited time.
Get Full Access
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.
Syllabus
Optimal Control of Interacting Agents on Sparse Random Graph by Janaky Murthy
Taught by
Centre for Networked Intelligence, IISc