Optimistic minimax search for noncooperative switched control with or without dwell time - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Automatica Année : 2020

Optimistic minimax search for noncooperative switched control with or without dwell time

Résumé

We consider adversarial problems in which two agents control two switching signals, the first agent aiming to maximize a discounted sum of rewards, and the second aiming to minimize it. Both signals may be subject to constraints on the dwell time after a switch. We search the tree of possible mode sequences with an algorithm called optimistic minimax search with dwell time (OMSd), showing that it obtains a solution close to the minimax-optimal one, and we characterize the rate at which the suboptimality goes to zero. The analysis is driven by a novel measure of problem complexity, and it is first given in the general dwell-time case, after which it is specialized to the unconstrained case. We exemplify the framework for networked control systems where the minimizer signal is a discrete time delay on the control channel, and we provide extensive simulations and a real-time experiment for nonlinear systems of this type.

Domaines

Automatique
Fichier principal
Vignette du fichier
minmax_final_v2.pdf (249.16 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-02390747 , version 1 (03-12-2019)

Identifiants

Citer

Lucian Busoniu, Jihene Ben Rejeb, Ioana Lal, Irinel-Constantin Morarescu, Jamal Daafouz. Optimistic minimax search for noncooperative switched control with or without dwell time. Automatica, 2020, 112, pp.108632. ⟨10.1016/j.automatica.2019.108632⟩. ⟨hal-02390747⟩
64 Consultations
161 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More