kth.sePublications
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Monte Carlo Tree Search and Convex Optimization for Decision Support in Beyond-Visual-Range Air Combat
KTH, School of Electrical Engineering and Computer Science (EECS), Intelligent systems, Robotics, Perception and Learning, RPL. SAAB Aeronautics, Aeronautical Solutions Division, Saab Aeronautics, Aeronautical Solutions Division.ORCID iD: 0000-0003-4662-441X
SAAB Aeronautics, Tactical Control and Data Fusion Division, Saab Aeronautics, Tactical Control and Data Fusion Division.
SAAB Aeronautics, Aeronautical Solutions Division, Saab Aeronautics, Aeronautical Solutions Division.
KTH, School of Electrical Engineering and Computer Science (EECS), Intelligent systems, Robotics, Perception and Learning, RPL.ORCID iD: 0000-0002-7714-928X
2023 (English)In: 2023 International Conference on Unmanned Aircraft Systems, ICUAS 2023, Institute of Electrical and Electronics Engineers (IEEE) , 2023, p. 48-55Conference paper, Published paper (Refereed)
Abstract [en]

Air combat is a high-risk activity where pilots must be aware of the surrounding situation to outperform the opposing team. The chances of beating the opposing team improve when the pilots have superior situation awareness, thus allowing them to act before the opposing team can do counteractions. In a highly dynamic environment, such as air combat, it can be difficult for pilots to track all adversarial units and their capabilities. In this work, we propose a combination of Monte Carlo Tree Search (MCTS) and Convex optimization to help pilots analyze the situation and be aware of any potential risks associated with missile guidance in Beyond Visual Range air combat. Our process uses MCTS to assess the best action from an opposing aircraft perspective. At the same time, the convex optimization problem searches available aircraft trajectories that enable missile guidance in relation to the opponent's potential actions. The proposed system is intended to support human decisions made by a pilot inside the aircraft or by a remote pilot operating an unmanned aerial system (UAS).

Place, publisher, year, edition, pages
Institute of Electrical and Electronics Engineers (IEEE) , 2023. p. 48-55
Keywords [en]
Air Combat, Convex optimization, Monte Carlo Tree Search
National Category
Computer graphics and computer vision
Identifiers
URN: urn:nbn:se:kth:diva-335092DOI: 10.1109/ICUAS57906.2023.10156124ISI: 001032475700007Scopus ID: 2-s2.0-85165617879OAI: oai:DiVA.org:kth-335092DiVA, id: diva2:1793222
Conference
2023 International Conference on Unmanned Aircraft Systems, ICUAS 2023, Warsaw, Poland, Jun 6 2023 - Jun 9 2023
Note

Part of ISBN 9798350310375

QC 20230831

Available from: 2023-08-31 Created: 2023-08-31 Last updated: 2025-02-07Bibliographically approved

Open Access in DiVA

No full text in DiVA

Other links

Publisher's full textScopus

Authority records

Scukins, EdvardsÖgren, Petter

Search in DiVA

By author/editor
Scukins, EdvardsÖgren, Petter
By organisation
Robotics, Perception and Learning, RPL
Computer graphics and computer vision

Search outside of DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetric score

doi
urn-nbn
Total: 88 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf