An approximate dynamic programming approach for comparing firing policies in a networked air defense environment

DOI10.1016/J.COR.2020.104890MaRDI QIDQ2297577zbMATH OpenOpenAlexWikidataFDO

Authors D. Summers, Matthew J. Robbins, Brian J. Lunday

Publication date 20 February 2020

Published in Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.cor.2020.104890

zbMATH Keywords

Markov decision processesapproximate dynamic programmingmilitaryair and missile defensedynamic weapon target assignment problem

Mathematics Subject Classification ID

Dynamic programming (90C39) Markov and semi-Markov decision processes (90C40) Discrete location and assignment (90B80)

Recommendations

• Approximate dynamic programming for missile defense interceptor fire control
• Tractable approximations to multistage decisions in air defence scenarios
• Air defense missile-target allocation models for a naval task group
• Approximate dynamic programming for military medical evacuation dispatching policies
• scientific article; zbMATH DE number 1560349

Cites work

• scientific article; zbMATH DE number 1321699 (Why is no real title available?)
• scientific article; zbMATH DE number 700091 (Why is no real title available?)
• 10.1162/1532443041827907
• A game theoretic model for the optimal location of integrated air defense system missile batteries
• A target-assignment problem
• A unified framework for stochastic optimization
• Air defense missile-target allocation models for a naval task group
• 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. Solving the curses of dimensionality
• Heuristics for the stochastic dynamic task-resource allocation problem with retry opportunities
• Linear least-squares algorithms for temporal difference learning
• The weapon-target assignment problem
• What you should know about approximate dynamic programming

Cited in

(8)

• On efficient algorithms for finding efficient salvo policies
• Missile battery placement for air defense: A dynamic programming approach
• Bi-objective dynamic weapon-target assignment problem with stability measure
• Approximate dynamic programming for missile defense interceptor fire control
• Naval air defense planning problem: a novel formulation and heuristics
• Poisoning finite-horizon Markov decision processes at design time
• Tractable approximations to multistage decisions in air defence scenarios
• Improving defensive air battle management by solving a stochastic dynamic assignment problem via approximate dynamic programming

This page was built for publication: An approximate dynamic programming approach for comparing firing policies in a networked air defense environment

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