A Heuristic Fast Task Allocation Algorithm for War Game Simulation Scenarios

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

Wargame simulations often involve complex battlefield scenarios with various tasks such as reconnaissance, attack, and support, each with different urgency levels and priorities. Effective task allocation requires considering task urgency, robot capabilities, and inter-task relationships to ensure critical tasks are addressed promptly. In this paper, a heuristic fast task assignment algorithm for war game simulation scenarios is proposed. The approach considers various factors, such as task urgency, robot capabilities, and spatial constraints, to ensure a balanced and timely execution of tasks. By applying a heuristic search strategy, the algorithm significantly reduces the computational complexity compared to traditional methods, while maintaining high-quality solutions. Experimental results demonstrate the effectiveness of the proposed algorithm in terms of task completion time, load balancing, and overall system performance in war game simulations.

Original languageEnglish
Title of host publicationProceedings of the 44th Chinese Control Conference, CCC 2025
EditorsJian Sun, Hongpeng Yin
PublisherIEEE Computer Society
Pages2328-2333
Number of pages6
ISBN (Electronic)9789887581611
DOIs
Publication statusPublished - 2025
Externally publishedYes
Event44th Chinese Control Conference, CCC 2025 - Chongqing, China
Duration: 28 Jul 202530 Jul 2025

Publication series

NameChinese Control Conference, CCC
ISSN (Print)1934-1768
ISSN (Electronic)2161-2927

Conference

Conference44th Chinese Control Conference, CCC 2025
Country/TerritoryChina
CityChongqing
Period28/07/2530/07/25

Keywords

  • Heuristic Algorithm
  • Optimization
  • Task Allocation
  • Wargame Simulation

Fingerprint

Dive into the research topics of 'A Heuristic Fast Task Allocation Algorithm for War Game Simulation Scenarios'. Together they form a unique fingerprint.

Cite this