Approximate dynamic programming for missile defense interceptor fire control
DOI10.1016/J.EJOR.2016.11.023zbMATH Open1402.90203OpenAlexW2554837895MaRDI QIDQ1751900FDOQ1751900
Authors: Michael T. Davis, Matthew J. Robbins, Brian J. Lunday 
Publication date: 25 May 2018
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2016.11.023
Recommendations
- An approximate dynamic programming approach for comparing firing policies in a networked air defense environment
- Missile battery placement for air defense: A dynamic programming approach
- Finite-horizon differential games for missile–target interception system using adaptive dynamic programming with input constraints
- Improving defensive air battle management by solving a stochastic dynamic assignment problem via approximate dynamic programming
- Backstepping-based adaptive dynamic programming for missile-target guidance systems with state and input constraints
- Optimal multi-stage allocation of weapons to targets using adaptive dynamic programming
- scientific article
- An overview on the adaptive dynamic programming based missile guidance law
- Optimal control of an interceptor retargeting maneuver
Markov decision processesapproximate dynamic programmingleast squares temporal differencesmilitary applicationsweapon target assignment problem
Applications of mathematical programming (90C90) Case-oriented studies in operations research (90B90) Dynamic programming (90C39) Markov and semi-Markov decision processes (90C40)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Approximate dynamic programming. Solving the curses of dimensionality
- Approximate policy iteration: a survey and some new methods
- 10.1162/1532443041827907
- Linear least-squares algorithms for temporal difference learning
- What you should know about approximate dynamic programming
- A tabu search heuristic for resource management in naval warfare
- Survey of the research on dynamic weapon-target assignment problem
- Exact and Heuristic Algorithms for the Weapon-Target Assignment Problem
- Title not available (Why is that?)
- A branch-and-price algorithm for a targeting problem
- A target-assignment problem
- On Optimum Target Assignments
- Air defense missile-target allocation models for a naval task group
- Dynamic WTA optimization model of air defense operation of warships' formation
- A Neural Network-Based Optimization Algorithm for the Static Weapon-Target Assignment Problem
- Discrete Markov ballistic missile defense system modeling
- Weapon target assignment problem satisfying expected damage probabilities based on ant colony algorithm
- Title not available (Why is that?)
- Optimal multi-stage allocation of weapons to targets using adaptive dynamic programming
- A new efficient algorithm for optimal assignment of smart weapons to targets
- A game theoretic model for the optimal location of integrated air defense system missile batteries
Cited In (17)
- A simulation-based approximate dynamic programming approach to dynamic and stochastic resource-constrained multi-project scheduling problem
- Approximate dynamic programming for the military aeromedical evacuation dispatching, preemption-rerouting, and redeployment problem
- Heuristics for the stochastic dynamic task-resource allocation problem with retry opportunities
- Discrete Markov ballistic missile defense system modeling
- A new heuristic algorithm for laser antimissile strategy optimization
- Counterfactual regret minimization for integrated cyber and air defense resource allocation
- Approximate dynamic programming for the military inventory routing problem
- Finite-horizon differential games for missile–target interception system using adaptive dynamic programming with input constraints
- Missile battery placement for air defense: A dynamic programming approach
- Bi-objective dynamic weapon-target assignment problem with stability measure
- Naval air defense planning problem: a novel formulation and heuristics
- 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
- An approximate dynamic programming approach for comparing firing policies in a networked air defense environment
- Resource allocation in <scp>two‐layered cyber‐defense</scp>
- Title not available (Why is that?)
- On efficient algorithms for finding efficient salvo policies
This page was built for publication: Approximate dynamic programming for missile defense interceptor fire control
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1751900)
