Related Experiment Video
Updated: Feb 28, 2026

Large-scale Reconstructions and Independent, Unbiased Clustering Based on Morphological Metrics to Classify Neurons in Selective Populations
Published on: February 15, 2017
A Metaheuristic Optimization Algorithm for Task Clustering in Collaborative Multi-Cluster Systems
Meixuan Li1, Yongping Hao1, Hui Zhang1
1School of Equipment Engineering, Shenyang Ligong University, Shenyang 110159, China.
None:
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.
Related Concept Videos
Cluster Sampling Method
To choose a cluster sample, divide the population into clusters (groups) and then randomly select some of the clusters. All the members from these clusters are in the cluster sample. For example, if you randomly sample four departments from your...
Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving
In individual population analyses, different algorithms are employed, such as Cauchy's method, which uses a...
Distributed Loads: Problem Solving
Optimization Problems
Collisions in Multiple Dimensions: Problem Solving
A small car of mass 1,200 kg traveling east at 60 km/h collides at an intersection with a truck of mass 3,000 kg traveling due north at 40 km/h. The two vehicles are locked together. What is the...
Heuristics
People often rely on heuristics when faced with an overload of information, limited time, low importance of the decision, limited information, or when a heuristic readily comes to mind. For...

