Improving defensive air battle management by solving a stochastic dynamic assignment problem via approximate dynamic programming
DOI10.1016/J.EJOR.2022.06.031OpenAlexW4283163786MaRDI QIDQ2103047FDOQ2103047
Authors: Joseph M. Liles, Matthew J. Robbins, Brian J. Lunday 
Publication date: 12 December 2022
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2022.06.031
Markov decision processapproximate dynamic programmingdynamic assignment problemOR in defenseair battle management
Cites Work
- Title not available (Why is that?)
- A survey of algorithms for the generalized assignment problem
- The bottleneck generalized assignment problem
- Governments' and Terrorists' Defense and Attack in a T-Period Game
- Linear least-squares algorithms for temporal difference learning
- Title not available (Why is that?)
- Solving the dynamic ambulance relocation and dispatching problem using approximate dynamic programming
- The quadratic assignment problem
- Approximate dynamic programming for the dispatch of military medical evacuation assets
- A Stochastic Formulation of the Dynamic Assignment Problem, with an Application to Truckload Motor Carriers
- Quadratic assignment problems
- Modeling and solving a crew assignment problem in air transportation
- Stochastic conditional and unconditional warfare
- The \(\beta\)-assignment problems
- False targets efficiency in defense strategy
- Approximate dynamic programming for missile defense interceptor fire control
- An approximate dynamic programming approach for comparing firing policies in a networked air defense environment
- Approximate dynamic programming for the military aeromedical evacuation dispatching, preemption-rerouting, and redeployment problem
- Approximate dynamic programming for the military inventory routing problem
- Approximate Dynamic Programming for Military Medical Evacuation Dispatching Policies
- Active and passive defense against multiple attack facilities
Cited In (6)
- Lookahead approximate dynamic programming for stochastic aircraft maintenance check scheduling optimization
- Approximate dynamic programming for the military aeromedical evacuation dispatching, preemption-rerouting, and redeployment problem
- Missile battery placement for air defense: A dynamic programming approach
- Approximate dynamic programming for missile defense interceptor fire control
- Tractable approximations to multistage decisions in air defence scenarios
- Generalized Bomber and Fighter Problems: Offline Optimal Allocation of a Discrete Asset
This page was built for publication: Improving defensive air battle management by solving a stochastic dynamic assignment problem via approximate dynamic programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2103047)
