Abstract
As is well known, military operation in a combat scenario is extremely intricate and often prone to optimal and real-time decisions. In this paper, we study task management and control problem for military operations with a dynamic game strategy. Toward this, the underlying problem is modeled by a matrix game scheme with performance index defined for both parties. Then, we proceed to present a fast and optimal search algorithm, inspired by graph theory and Kuhn-Munkres algorithm, to solve dimension explosion problem inherent with matrix game scheme and retrieve the optimal solution for each combat entities. Simulation results verified the effectiveness of the proposed scheme.
Sign-in/Register to access full text options 
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 callDisclaimer: 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.
