À la Une

Séminaire CUSO

CUSO seminar: Search problems, decentralized distributed control, and game theory

Date: Friday, May 20th 2016

Schedule:

  • 10h00-12h30 : Prof. Laurent Lefèvre (INP-Grenoble France)
  • 14h00-16h30 : Prof. Steve Alpern (University of Warwick, UK)

Place: Battelle building A - Room 404-407 (3rd floor)

Registration

Information: Pierre.Leone(at)unige.ch & Bastien.Chopard(at)unige.ch

An introduction to control theory for complex systems (Laurent Lefèvre)

 LL.jpg In this seminar, we will focus on some recent aspects of control theory specifically dedicated to complex dynamical systems. At first we will define these complex dynamical systems on their topological interconnection structures (graphs). Then we will investigate some of their structural system theoretic properties, such as stability, observability or controllability. The feedback idea for state estimation and control algorithms will be introduced, with some examples using graphs algorithms. Finally, we will go through model based predictive optimal control (MPC), and specifically trough decentralized and distributed algorithms (DMPC), to make connections with game theory.

Search Games: theory of hide-and-seek and rendezvous (Steve Alpern)

SA.jpg  In a search game, two players are placed in a dark search arena A and move about until the first time T that they meet. If A is a network, meeting is simply being at the same location; if A is a region of space, meeting is being sufficiently close. In a game of hide-and-seek, the Searcher wishes to minimize T while the Hider wishes to maximize T. In rendezvous search, both players are minimizers. Hide-and-seek comes in two flavors: the Hider can be mobile (e.g. search for Bin Laden) or immobile (search for a bomb). Rendezvous search also comes in two flavors, depending on whether or not the players can agree beforehand which roles they will take. For example if A is a circle the asymmetric version allows the strategy pair [clockwise, counter-clockwise], which is optimal. In the symmetric version, which is unsolved, this strategy pair is not available. The symmetric rendezvous problem on the line, with a known initial distance between the players, is also an unsolved problem. Recent work with P. Leone allows rendezvous to take place, in addition to when meeting, when one player finds a 'gift' left by the other (water bottle when lost in the desert).
27 avril 2016
  À la Une