Decomposition of differential games with multiple targets

From MaRDI portal
Publication:301720

DOI10.1007/S10957-016-0908-ZzbMATH Open1342.49058arXiv1409.4624OpenAlexW2294265454MaRDI QIDQ301720FDOQ301720

Richard B. Vinter, Adriano Festa

Publication date: 1 July 2016

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Abstract: This paper provides a decomposition technique for the purpose of simplifying the solution of certain zero-sum differential games. The games considered terminate when the state reaches a target, which can be expressed as the union of a collection of target subsets; the decomposition consists of replacing the original target by each of the target subsets. The value of the original game is then obtained as the lower envelope of the values of the collection of games resulting from the decomposition, which can be much easier to solve than the original game. Criteria are given for the validity of the decomposition. The paper includes examples, illustrating the application of the technique to pursuit/evasion games, where the decomposition arises from considering the interaction of individual pursuer/evader pairs.


Full work available at URL: https://arxiv.org/abs/1409.4624





Cites Work


Cited In (5)


   Recommendations





This page was built for publication: Decomposition of differential games with multiple targets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q301720)