The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Air-Combat Strategy Using Approximate Dynamic Programming
Open accessAbstract
Unmanned Aircraft Systems (UAS) have the potential to perform many of the dangerous missions currently own by manned aircraft. Yet, the complexity of some tasks, such as air combat, have precluded UAS from successfully carrying out these missions autonomously. This paper presents a formulation of a level flight, fixed velocity, one-on-one air combat maneuvering problem and an approximate dynamic programming (ADP) approach for computing an efficient approximation of the optimal policy. In the version of the problem formulation considered, the aircraft learning the optimal policy is given a slight performance advantage. This ADP approach provides a fast response to a rapidly changing tactical situation, long planning horizons, and good performance without explicit coding of air combat tactics. The method's success is due to extensive feature development, reward shaping and trajectory sampling. An accompanying fast and e ffective rollout-based policy extraction method is used to accomplish on-line implementation. Simulation results are provided that demonstrate the robustness of the method against an opponent beginning from both off ensive and defensive situations. Flight results are also presented using micro-UAS own at MIT's Real-time indoor Autonomous Vehicle test ENvironment (RAVEN).
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Temporal difference learning and TD-Gammon
Tesauro, G. (1995) · Communications of the ACM · doi:10.1145/203330.203343 · Cited by 1,618 · cited 1×
“Rollout [14] was introduced as a Monte Carlo policy evaluation technique, and the literature includes subsequent examples of using rollout to improve upon an existing policy [15] or heuristic [16].”
MethodOn the theory of dynamic programming
Bellman, R. (1952) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.38.8.716 · Cited by 998
Cited by
Performance and Lyapunov Stability of a Nonlinear Path Following Guidance Method
Park, S., Deyst, J., & How, J. P. (2007) · Journal of Guidance, Control, and Dynamics · doi:10.2514/1.28957 · Cited by 437
Self-citation
Metadata
- Authors
- McGrew, J. S., How, J. P., Williams, B., & Roy, N.
- Venue
- Journal of Guidance, Control, and Dynamics
- Published
- 2010-09
- Volume
- 33
- Issue
- 5
- Pages
- 1641-1654
- ISSN
- 0731-5090 (ISSN-L)
- 1533-3884
- OpenAlex
- W2075110355
- Cited by
- 238
- References
- 2
- FWCI
- 1.94
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Air-Combat Strategy Using Approximate Dynamic Programming. https://app.cochat.ai/papers/10.2514/1.46815
- The paper
- McGrew, J. S., How, J. P., Williams, B., & Roy, N. (2010). Air-Combat Strategy Using Approximate Dynamic Programming. Journal of Guidance, Control, and Dynamics. https://doi.org/10.2514/1.46815
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.