Sign in to use this feature.

Years

Between: -

Subjects

remove_circle_outline
remove_circle_outline

Journals

Article Types

Countries / Regions

Search Results (1)

Search Parameters:
Keywords = three-dimensional battlespace

Order results
Result details
Results per page
Select all
Export citation of selected articles as:
24 pages, 78909 KB  
Article
A Metaheuristic Optimization Algorithm for Task Clustering in Collaborative Multi-Cluster Systems
by Meixuan Li, Yongping Hao, Hui Zhang and Jiulong Xu
Sensors 2026, 26(4), 1364; https://doi.org/10.3390/s26041364 - 20 Feb 2026
Viewed by 452
Abstract
To address the task-grouping problem for air–ground integrated Unmanned Aerial Vehicle (UAV) swarm missions in three-dimensional (3D) environments, this study proposes a data-preprocessing and hybrid initialization clustering method based on 3D spatial features. A dual-modal prototype meta-heuristic optimization model, Dual-Prototype Metaheuristic K-Means (DPM-Kmeans), [...] Read more.
To address the task-grouping problem for air–ground integrated Unmanned Aerial Vehicle (UAV) swarm missions in three-dimensional (3D) environments, this study proposes a data-preprocessing and hybrid initialization clustering method based on 3D spatial features. A dual-modal prototype meta-heuristic optimization model, Dual-Prototype Metaheuristic K-Means (DPM-Kmeans), is constructed accordingly. First, to overcome spatial information loss in high-dimensional task allocation, a 3D spatial task data preprocessing technique and a hybrid initialization strategy based on the golden spiral distribution are designed. This ensures the diversity and environmental adaptability of the initial solutions. Second, a dual-modal prototype optimization framework incorporating row prototypes (local refinement) and column prototypes (global combination) was constructed using meta-heuristics and clustering algorithms. The prototype-driven replacement update mechanism simultaneously performs global and local search, balancing the algorithm’s exploration and exploitation capabilities while expanding the solution space. This effectively addresses premature convergence issues in complex search spaces. Simultaneously, a collaborative multi-constraint, dynamically weighted optimization model was constructed, incorporating task requirements and flight distance constraints to ensure that the grouping scheme approximates the global optimum. Simulation results demonstrate that compared to traditional K-means and mainstream meta-heuristic optimization algorithms, DPM-Kmeans achieves an overall improvement of 2–10% in Sum of Squared Errors (SSE), Silhouette Coefficient (SC), and Davies–Bouldin Index (DB) metrics. It exhibits superior convergence speed and solution quality, proving the method’s excellent scalability and robustness in multi-constraint, large-scale 3D scenarios. Full article
(This article belongs to the Section Sensors and Robotics)
Show Figures

Figure 1

Back to TopTop