The seminar will be presented in French if everyone in the audience is francophone.
Ambush games involve invaders and defenders. The invader needs to reach his destination. Invaders set up ambushes to slow down or stop the invader. We examine the geometry of this zero-sum game from a path planning perspective. In particular we show that only a finite set of paths needs computing to provide a mixed solution to the game. We show the solution involves the solution to a min-cut/max-flow problem in a continuous environment. We compare our results with the solution to network interdiction games discussed for communication systems.
Biography: Eric Feron is a professor of aerospace engineering at the Georgia Institute of Technology. He has studied at Lycée Louis-le-Grand, Paris, Ecole Polytechnique (France), and Ecole Normale Supérieure (Paris). He has obtained his PhD from Stanford University. He applies computer science, operations research, and control theory to solve current problems in aerospace engineering.
Welcome to everyone!