Abstract

Dynamic game theory has received considerable attention as a possible technology for formulating control actions for agents in an extended complex enterprise that involves an adversary. Examples of such enterprises are very common in military operations, decentralized electric energy systems, and competitive manufacturing processes. Enterprises of this typed typically involve two teams of decision agents each with a different objective function and possibly with a different hierarchy of decision-making Because of the complexity of such systems, traditional solutions from dynamic game theory are computationally extremely difficult, if not impossible, to derive. We discuss a solution approach where at each step the control agents limit the computation of their actions to a short time horizon that may involve only the next few time steps. This moving horizon solution, although suboptimal in the global sense, is very useful in taking into account the possible near-term control actions of the adversary. We illustrate this solution methodology using an example of an air military operation that involves two opposing forces.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.