https://hal-ensta-paris.archives-ouvertes.fr/hal-01228523Aubin, Jean-PierreJean-PierreAubinLASTRE - Laboratoire d'Applications des Systèmes Tychastiques Régulés - VIMADESChen, LuxiLuxiChenVIMADES - VIMADESDesilles, AnnaAnnaDesillesOC - Optimisation et commande - UMA - Unité de Mathématiques Appliquées - ENSTA Paris - École Nationale Supérieure de Techniques AvancéesCournot Maps for Intercepting Evader Evolutionsby a PursuerHAL CCSD2015Pursuer–Evader interception games · Variable temporal windows · Agestructured dynamical systemsViability constraintIntertemporal optimalityCournot–McKendrick valuation functions[MATH.MATH-OC] Mathematics [math]/Optimization and Control [math.OC][MATH.MATH-DS] Mathematics [math]/Dynamical Systems [math.DS]Desilles, AnnaAccompagnement Spécifique de Travaux de Recherches et d'Innovation Défense - VIabilité et AuTonomie des systèmes en environnement Incertain et Contraint - - VIATIC2011 - ANR-11-ASTR-0041 - ASTRID - VALID - 2015-11-13 11:42:092022-05-11 12:06:062015-11-13 11:42:09enJournal articles10.1007/s13235-014-0133-z1Instead of studying evolutions governed by an evolutionary system starting at agiven initial state on a prescribed future time interval, finite or infinite, we tackle the problemof looking both for a past interval [T − D, T ] of duration D and for the viable evolutionsarriving at a prescribed terminal state at the end of the temporal window (and thus telescopingif more than one such evolutions exist). Hence, given time-duration dependent evolutionarysystem and viability constraints, as well as time dependent departure constraints, the Cournotmap associates with any terminal time T and state x the durations D(T, x) of the intervals[T − D(T, x), T ], the starting (or initial) states at the beginning of the temporal window fromwhich at least one viable evolution will reach the given terminal state x at T . Cournot mapscan be used by a Pursuer to intercept an evader’s evolution in dynamic game theory. Afterproviding some properties of Cournot maps are next investigated, above all, the regulationmap piloting the viable evolutions at each time and for each duration from the beginningof the temporal window up to terminal time. The next question investigated is the selectionof controls or regulons in the regulation map whenever several of them exist. Selectionprocesses are either time dependent, when the selection operates at each time, duration,and state for selecting a regulon satisfying required properties (for instance, minimal norm,minimal speed), orintertemporal. In this case, viable evolutions are required to optimize someprescribed intertemporal functional, as in optimal control. This generates value functions,the topics of the second part of this study. An example is provided: the Pursuer is a securityvehicle making the rounds along a predetermined path, the departure tube, for reaching any network location where and when alarms sound to signal the location (of the evader). Thesoftware of the Cournot algorithm computes the minimal duration and the moment when thePursuer leaves its round to reach the detected location as soon as possible and how to proceedby embedding in the Pursuer system the graph of the feedback map governing the evolutionof the Pursuer vehicle.