Improving defensive air battle management by solving a stochastic dynamic assignment problem via approximate dynamic programming

DOI10.1016/J.EJOR.2022.06.031MaRDI QIDQ2103047zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

Markov decision processapproximate dynamic programmingdynamic assignment problemOR in defenseair battle management

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Recommendations

• 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 missile defense interceptor fire control
• Approximate dynamic programming for the dispatch of military medical evacuation assets
• Approximate dynamic programming for military medical evacuation dispatching policies

Cites work

• scientific article; zbMATH DE number 3128787 (Why is no real title available?)
• scientific article; zbMATH DE number 3231692 (Why is no real title available?)
• A Stochastic Formulation of the Dynamic Assignment Problem, with an Application to Truckload Motor Carriers
• A survey of algorithms for the generalized assignment problem
• Active and passive defense against multiple attack facilities
• An approximate dynamic programming approach for comparing firing policies in a networked air defense environment
• Approximate dynamic programming for military medical evacuation dispatching policies
• Approximate dynamic programming for missile defense interceptor fire control
• Approximate dynamic programming for the dispatch of military medical evacuation assets
• Approximate dynamic programming for the military aeromedical evacuation dispatching, preemption-rerouting, and redeployment problem
• Approximate dynamic programming for the military inventory routing problem
• False targets efficiency in defense strategy
• Governments' and terrorists' defense and attack in a \(T\)-period game
• Linear least-squares algorithms for temporal difference learning
• Modeling and solving a crew assignment problem in air transportation
• Quadratic assignment problems
• Solving the dynamic ambulance relocation and dispatching problem using approximate dynamic programming
• Stochastic conditional and unconditional warfare
• The -assignment problems
• The bottleneck generalized assignment problem
• The quadratic assignment problem

Cited in

(7)

• Learning scalable task assignment with imperative-priori conflict resolution in multi-UAV adversarial swarm defense problem
• 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)