An approximate dynamic programming approach for comparing firing policies in a networked air defense environment
DOI10.1016/J.COR.2020.104890zbMATH Open1458.90460OpenAlexW2912070449WikidataQ126360285 ScholiaQ126360285MaRDI QIDQ2297577FDOQ2297577
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
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
Markov decision processesapproximate dynamic programmingmilitaryair and missile defensedynamic weapon target assignment problem
Dynamic programming (90C39) Markov and semi-Markov decision processes (90C40) Discrete location and assignment (90B80)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Approximate dynamic programming. Solving the curses of dimensionality
- 10.1162/1532443041827907
- Linear least-squares algorithms for temporal difference learning
- Approximate dynamic programming for the dispatch of military medical evacuation assets
- What you should know about approximate dynamic programming
- The weapon-target assignment problem
- A Target-Assignment Problem
- Air defense missile-target allocation models for a naval task group
- Approximate dynamic programming for missile defense interceptor fire control
- A game theoretic model for the optimal location of integrated air defense system missile batteries
- Heuristics for the stochastic dynamic task-resource allocation problem with retry opportunities
- A unified framework for stochastic optimization
- Approximate Dynamic Programming for Military Medical Evacuation Dispatching Policies
Cited In (8)
- 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
- On efficient algorithms for finding efficient salvo policies
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)