BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:Towards Scale-Free Control of large-scale traffic networks - Carlo
 s Canudas-de-Wit\, CNRS\, Grenoble
DTSTART:20171123T140000Z
DTEND:20171123T150000Z
UID:TALK95449@talks.cam.ac.uk
CONTACT:Tim Hughes
DESCRIPTION:The talk discuss new research lines addressing the optimal con
 trol of time-varying dynamic large-scale traffic networks. The driving ide
 a consists in aggregating the whole network in sub-networks having some su
 itable control properties\, allowing the optimal games to be more tractabl
 e. The talk starts with a recall of controllability and observability prop
 erties in 1-D traffic networks and provide a detailed example of how to pa
 rtition the systems and how to solve the associated time-varying optimal g
 ames [1]. Then we discuss recent work on how such ideas can be extended to
  2-D graphs in relation with the problem of games played over networks and
  focus our attention on the importance of the topology of communication be
 tween nodes. We analyze the topology of the graph and its importance in th
 e structure of the game. We show that\, by condensing the strongly connect
 ed components of the control graph into super-nodes\, it is possible to gi
 ve a hierarchical interpretation to the network game. According to this an
 alysis\, we assign to each node a level of priority and define a sequentia
 l procedure to steer the response of the network to a Nash equilibrium. Gi
 ven a certain topology\, this equilibrium is unique and it depends on the 
 particular topology and the set of local cost function (Ref.2). The talk f
 inishes by discussing new avenues for organizing such large-scale complex 
 networks\, by proposing a new aggregation procedure that combines\, comple
 xity reduction (scale-free graph structure)\, physical preservation proper
 ties\, and control targets [3]. In connection with this goal\, some prelim
 inary results [3] will be presented. \n\n[1] D. Pisarski and C. Canudas-de
 -Wit. “Nash Game Based Distributed Control Design for Balancing of Traff
 ic Density over Freeway Networks. IEEE Transactions on Control of Network 
 Systems\, IEEE\, 2016\, 3 (2)\, pp.149-161.\n\n[2] G. Casadei\, C. Canudas
  De-Wit. Networks Games: Condensation of the Graph as a Hierarchical inter
 pretation of the Game\, IFAC WC’17. Toulouse\, France.\n\n[3] N. Martin\
 , C. Canudas-de-Wit\, and P. Frasca. “Large-scale network reduction towa
 rds scale-free structure”. To be presented at the 6th Int. Conference on
  Complex Networs and their applications\, Lyon\, Dec. 2017.
LOCATION:Cambridge University Engineering Department\, Lecture Room number
  LR11
END:VEVENT
END:VCALENDAR