Search Results (34)

With the large-scale deployment of 5G technology, the rationality of communication base station siting is crucial for network performance, construction costs, and operational efficiency. Traditional site selection methods rely heavily on manual experience, exhibiting strong subjectivity and difficulty in balancing multi-objective optimization. Existing heuristic algorithms suffer from slow convergence speeds and susceptibility to local optima. To address these challenges, this paper constructs a multi-objective base station site selection model that simultaneously minimizes costs, maximizes coverage contributions, and minimizes interference. It achieves quantitative balance among objectives through normalization and weight fusion, while introducing constraints to ensure engineering feasibility. Concurrently, the genetic algorithm underwent targeted optimization by introducing an adaptive migration strategy based on population diversity and a cosine-type parameter adjustment strategy. This approach was integrated with the particle swarm optimization algorithm to balance exploration and exploitation while mitigating premature convergence. Experimental validation demonstrates that the improved algorithm achieves faster convergence and greater stability compared to traditional genetic algorithms and particle swarm optimization, while satisfying engineering constraints such as base station quantity, coverage, and interference. This research provides an efficient and feasible solution for intelligent base station site planning. Full article

The increasing use of UAV swarms for collaborative autonomous missions presents significant challenges in coordination, safety, and scalability, especially during dynamic formation reconfigurations. This study introduces the Magnetic Swarm Reconfiguration (MSR) protocol, a fully distributed navigation method that enables UAV swarms to transition smoothly and safely between geometric formations. MSR achieves this by combining two main components: first, it employs the Hungarian algorithm to compute an optimal assignment of UAVs to target positions within the new formation, thereby minimizing trajectory overlap and interference; second, it utilizes virtual magnetic attraction and repulsion forces for real-time navigation, drawing each UAV toward its assigned destination while dynamically repelling nearby agents to avoid collisions. To evaluate the performance of the MSR protocol, six representative formation transitions were simulated across swarm sizes of up to 100 UAVs. Results show that MSR reduces reconfiguration time significantly compared to existing methods, maintains strict safety standards by achieving minimal to zero collisions, and supports fully decentralized and simultaneous maneuvering. The scalability and robustness of the MSR protocol make it suitable for complex, large-scale swarm operations requiring rapid and reliable formation changes. Full article

This paper investigates a swarming strength allocation Bayesian game approach under incomplete information to address the high-value targets protection problem of swarming unmanned systems. The swarming strength allocation Bayesian game model is established by analyzing the non-zero sum incomplete information game mechanism during the protection process, considering high-tech and low-tech interception players. The model incorporates a game benefit quantification method based on an improved Lanchester equation. The method regards massive swarm individuals as a collective unit for overall cost calculation, thus avoiding the curse of dimensionality from increasing numbers of individuals. Based on it, a Bayesian Nash equilibrium solving approach is presented to determine the optimal swarming strength allocation for the protection player. Finally, compared with random allocation, greedy heuristic, rule-based assignment, and Colonel Blotto game, the simulations demonstrate the proposed method’s robustness in large-scale strength allocation. Full article

The widespread adoption of Unmanned Aerial Vehicles (UAVs) in civilian domains, such as airport security and critical infrastructure protection, has introduced significant safety risks that necessitate effective countermeasures. High-Energy Laser Systems (HELSs) offer a promising defensive solution; however, when confronting large-scale malicious UAV swarms, the Dynamic Resource Target Assignment (DRTA) problem becomes critical. To address the challenges of complex combinatorial optimization problems, a method combining precise physical models with multi-agent reinforcement learning (MARL) is proposed. Firstly, an environment-dependent HELS damage model was developed. This model integrates atmospheric transmission effects and thermal effects to precisely quantify the required irradiation time to achieve the desired damage effect on a target. This forms the foundation of the HELS–UAV–DRTA model, which employs a two-stage dynamic assignment structure designed to maximize the target priority and defense benefit. An innovative MADDPG-IA (I: intrinsic reward, and A: attention mechanism) algorithm is proposed to meet the MARL challenges in the HELS–UAV–DRTA problem: an attention mechanism compresses variable-length target states into fixed-size encodings, while a Random Network Distillation (RND)-based intrinsic reward module delivers dense rewards that alleviate the extreme reward sparsity. Large-scale scenario simulations (100 independent runs per scenario) involving 50 UAVs and 5 HELS across diverse environments demonstrate the method’s superiority, achieving mean damage rates of 99.65% ± 0.32% vs. 72.64% ± 3.21% (rural), 79.37% ± 2.15% vs. 51.29% ± 4.87% (desert), and 91.25% ± 1.78% vs. 67.38% ± 3.95% (coastal). The method autonomously evolved effective strategies such as delaying decision-making to await the optimal timing and cross-region coordination. The ablation and comparison experiments further confirm MADDPG-IA’s superior convergence, stability, and exploration capabilities. This work bridges the gap between complex mathematical and physical mechanisms and real-time collaborative decision optimization. It provides an innovative theoretical and methodological basis for public-security applications. Full article

To enable distributed target searches by unmanned aerial vehicle (UAV) swarms, it is essential to collaboratively process multi-source sensing data and construct a globally consistent map. In response to the challenges posed by constrained communication and multi-hop transmission delays, this paper proposes a symmetry-oriented dynamic routing planning algorithm for reliable map fusion. The algorithm introduces a framework for the transmission and fusion of local perception maps, formulating routing tasks as an integer programming problem to determine latency-minimized transmission paths. When packet loss occurs, a dynamic re-routing strategy is triggered to ensure the continued reliability of the fusion process. The routing design preserves latency symmetry, aiming to keep transmission delays under packet loss conditions close to those under ideal, lossless scenarios. To improve scalability in large-scale UAV swarms, an approximate algorithm based on L-step forward prediction is further introduced to reduce computational complexity. The simulation results demonstrate that the proposed algorithm achieves low latency, strong robustness, and stable performance under varying communication conditions. Full article

Due to the limited endurance of UAVs, especially in scenarios involving large areas and dense target nodes, it is challenging for multiple UAVs to complete diverse tasks while ensuring timely execution. Toward this, we propose a cross-platform system consisting of an aircraft carrier (AC) and multiple UAVs, which makes unified task planning for included heterogeneous platforms to maximize the efficiency of the entire combat system. The carrier-based UAV swarm mission planning problem is formulated to minimize completion time and resource utilization, taking into account large-scale targets, multi-type tasks, and multi-obstacle environments. Since the problem is complex, we design a decoupled framework to simplify the solution by decomposing it into two levels: upper-level AC path planning and bottom-level multi-UAV cooperative mission planning. At the upper level, a drop point determination method and a discrete genetic algorithm incorporating improved A* (DGAIIA) are proposed to plan the AC’s path in the presence of no-fly zones and radar threats. At the bottom level, an improved differential evolution algorithm with a market mechanism (IDEMM) is proposed to minimize task completion time and maximize UAV utilization. Specifically, a dual-switching search strategy and a neighborhood-first buying-and-selling mechanism are developed to improve the search efficiency of the IDEMM. Simulation results validate the effectiveness of both the DGAIIA and IDEMM. An animation of the simulation results is available at simulation section. Full article

In recent years, wireless sensor networks (WSNs) have been employed across various domains, including military services, healthcare, disaster response, industrial automation, and smart infrastructure. Due to the absence of fixed communication infrastructure, WSNs rely on ad hoc connections between sensor nodes to transmit sensed data to target nodes. Within a WSN, a sensor node whose failure partitions the network into disconnected segments is referred to as a critical node or cut vertex. Identifying such nodes is a fundamental step toward ensuring the reliability of WSNs. The critical node detection problem (CNDP) focuses on determining the set of nodes whose removal most significantly affects the network’s connectivity, stability, functionality, robustness, and resilience. CNDP is a significant challenge in network analysis that involves identifying the nodes that have a significant influence on connectivity or centrality measures within a network. However, achieving an optimal solution for the CNDP is often hindered by its time-consuming and computationally intensive nature, especially when dealing with large-scale networks. In response to this challenge, we present a method based on particle swarm optimization (PSO) for the detection of critical nodes. We employ discrete PSO (DPSO) along with the modified position equation (MPE) to effectively solve the CNDP, making it applicable to various k-vertex variations of the problem. We examine the impact of population size on both execution time and result quality. Experimental analysisusing different neighborhood topologies—namely, the star topology and the dynamic topology—was conducted to analyze their impact on solution effectiveness and adaptability to diverse network configurations. We consistently observed better result quality with the dynamic topology compared to the star topology for the same population size, while the star topology exhibited better execution time. Our findings reveal the promising efficacy of the proposed solution in addressing the CNDP, achieving high-quality solutions compared to existing methods. Full article

With the large-scale integration of photovoltaic power plants—comprising power electronic devices—into power systems, electromagnetic transient simulation has become a key tool for ensuring power system security and stability. The accuracy of photovoltaic unit controller parameters is crucial for the reliability of such simulations. However, as the issue of sub/super-synchronous oscillations becomes increasingly prominent, existing parameter identification methods are primarily based on high/low voltage ride-through characteristics. This limits the applicability of the identification results to specific scenarios and lacks targeted simulation and parameter identification research for sub/super-synchronous oscillations. To address this gap, this study proposes a mathematical model tailored for sub/super-synchronous oscillations and performs sensitivity analysis of converter control parameters to identify dominant parameters across different frequency bands. A frequency-segmented parameter identification method is introduced, capable of fast convergence without relying on a specific optimization algorithm. Finally, the proposed method’s identification results are compared with actual values, voltage ride-through-based identification, particle swarm optimization results, and results under uncertain conditions. It was found that, compared with traditional identification methods, the proposed method reduced the maximum identification error from 7.67% to 4.3% and the identification time from 2 h to 1 h. The maximum identification error of other intelligent algorithms was 5%, with a difference of less than 1% compared to the proposed method. The identified parameters were applied under conditions of strong irradiation (1000 W/m²), weak irradiation (300 W/m²), rapidly varying oscillation frequency, and constant oscillation frequency, and the output characteristics were all close to those of the original parameters. The effectiveness and superiority of the proposed method have been validated, along with its broad applicability to different intelligent algorithms and its robustness under uncertain conditions such as environmental variations and grid frequency fluctuations. Full article

While the wavenumber-domain approach enables large-angle inverse synthetic aperture radar (ISAR) cross-range scaling, its practical application remains constrained by the target’s non-uniform rotation and scene center offset (SCO). In response to this issue, this paper introduces a novel large-angle ISAR cross-range scaling method through a joint estimation method based on the wavenumber domain. A non-uniform rotational wavenumber-domain signal model with SCO is developed. Utilizing this model and the sensitivity of wavenumber-domain imaging to SCO, a joint estimation algorithm that combines particle swarm optimization (PSO) and image entropy evaluation is proposed, achieving accurate parameter estimation. Leveraging the estimated parameters, the range and cross-range scaling factors in the wavenumber-domain imaging are derived, facilitating ISAR cross-range scaling with higher accuracy than the traditional method. The effectiveness and robustness of the proposed method are validated under various conditions, through scattering point and electromagnetic computing simulation. Full article

To address the unclear impacts of a planned path length and yaw cost on search performance in large-scale Unmanned Aerial Vehicle (UAV) swarm collaborative search scenarios under complex and dynamic environments, a path grid determination algorithm is proposed, transforming the path-planning problem into an optimal waypoint selection problem, enabling UAVs to make rapid decisions using the Particle Swarm Optimization (PSO) algorithm. Simulation experiments were conducted for different planned path lengths with or without the inclusion of the yaw cost, analyzing indicators such as the coverage rate, target capture rate, average capture time, and communication and decision-making consumption. This research was conducted through simulation experiments, and the results demonstrate that increasing the planned path length significantly reduces communication and decision-making consumption while having no notable impact on the coverage rate or search performance. Incorporating the yaw cost slightly improves target search performance but also leads to a minor increase in communication and decision-making consumption. Full article

The optimization of wireless sensor network (WSN) deployment is a current research hotspot, particularly significant in industrial applications. While some existing optimization methods focus more on balancing network coverage, connectivity, and deployment costs, aligning them with practical needs compared to single-performance optimization schemes, they still tend to be overly idealized. In practical applications, networks often face monitoring requirements for different data types, and some single-function sensors can be integrated into multifunctional sensors capable of monitoring multiple types of data. When encountering diverse data detection needs in a target area, this integration can be further considered to reduce deployment costs. Therefore, this paper designs a new multi-objective optimization problem aimed at optimizing heterogeneous-function wireless sensor networks, balancing coverage, connectivity, and cost, while introducing an additional cost dimension to meet the monitoring needs of different functional sensors in specific areas. This problem is a typical non-convex, multimodal, NP-hard problem. To address this, an improved Secretary Bird Optimization Algorithm (ISBOA) is proposed, incorporating Gaussian Cuckoo Mutation and a smooth exploitation mechanism. The algorithm is compared with the original SBOA, Particle Swarm Optimization (PSO), Whale Optimization Algorithm (WOA), and Northern Goshawk Optimization (NGO). Simulation results demonstrate that ISBOA exhibits a faster convergence speed and higher accuracy in both the 23 benchmark functions and the newly designed multi-objective optimization problem, significantly overcoming the shortcomings of the compared algorithms. Finally, for large-scale optimization problems, a minimum spanning tree domain reduction strategy is proposed, which significantly improves solving efficiency with a moderate sacrifice in accuracy. Full article

The performance of passive target localization is affected by the positions of unmanned aerial vehicles (UAVs) at a large scale. In this paper, to improve resource utilization efficiency and localization accuracy, the node selection problem and the path optimization problem are jointly investigated. Firstly, the target passive localization model is established and the Chan-based time difference of arrival (TDOA) localization method is introduced. Then, the Cramer–Rao lower bound (CRLB) for Chan-TDOA localization is derived, and the problems of node selection and path optimization are formulated. Secondly, a CRLB-based node selection method is proposed to properly divide the UAVs into several groups, localizing different targets, and a CRLB-based path optimization method is proposed to search for the optimal UAV position configuration at each time step. The proposed path optimization method also effectively handles no-fly-zone (NFZ) constraints, ensuring operational safety while maintaining optimal target tracking performance. Also, to improve the efficiency of path optimization, particle swarm algorithm (PSO) is applied to accelerate the searching process. Finally, numerical simulations are performed to verify the validity and effectiveness of the proposed methods in this paper. Full article

With the proposed “double carbon” target for the power system, large-scale distributed energy access poses a major challenge to the way the distribution grid operates. The rural distribution network (DN) will transform into a new local power system primarily driven by distributed renewable energy sources and energy storage, while also being interconnected with the larger power grid. The development of the rural DN will heavily rely on the construction and efficient planning of the microgrid (MG) within the agricultural park. Based on this, this paper proposes a two-stage optimal scheduling model and solution strategy for the microgrid distribution network with multi-source agricultural load aggregation. First, in the first stage, considering the flexible agricultural load and the market time-of-use electricity price, the economic optimization is realized by optimizing the operation of the schedulable resources of the park. The linear model in this stage is solved by the Lingo algorithm with fast solution speed and high accuracy. In the second stage, the power interaction between the MG and the DN in the agricultural park is considered. By optimising the output of the reactive power compensation device, the operating state of the DN is optimised. At this stage, the non-linear and convex optimization problems are solved by the particle swarm optimization algorithm. Finally, the example analysis shows that the proposed method can effectively improve the feasible region of safe operation of the distribution network in rural areas and improve the operating income of a multi-source agricultural load aggregation agricultural park. Full article

This paper introduces a swift method for intercepting the state trajectory of large-scale invading drone swarms using quadrotor drones. The research primarily concentrates on the design and computation of multi-target interception trajectories, with an analysis of the trajectory state constraints inherent to multi-target interception tasks. Utilizing Pontryagin’s principle of motion, we have designed computationally efficient motion primitives for multi-target interception scenarios. These motion primitives’ durations have informed the design of cost matrices for multi-target interception tasks. In contrast to static planar scenarios, the cost matrix in dynamic scenarios displays significant asymmetry, correlating with the speed and spatial distribution of the targets. We have proposed an algorithmic framework based on three genetic operators for solving multi-target interception trajectories, offering certain advantages in terms of solution accuracy and speed compared to other optimization algorithms. Simulation results from large-scale dynamic target interception scenarios indicate that for an interception task involving 50 targets, the average solution time for trajectories is a mere 3.7 s. Using the methods proposed in this paper, we conducted a comparative analysis of factors affecting the performance of interception trajectories in various target interception scenarios. This study represents the first instance in existing public research where precise evaluations have been made on the trajectories of drone interceptions against large-scale flying targets. This research lays the groundwork for further exploration into game-theoretic adversarial cluster interception methods. Full article

Target assignment and trajectory planning are two crucial components of mission planning for unmanned aerial vehicle (UAV) swarms. In large-scale missions, the significance of planning efficiency becomes more pronounced. However, existing planning algorithms based on evolutionary computation and swarm intelligence face formidable challenges in terms of both efficiency and effectiveness. Additionally, the extensive trajectory planning involved is a significant factor affecting efficiency. Therefore, this paper proposes a dedicated method for large-scale mission planning. Firstly, to avoid extensive trajectory planning operations, this paper suggests utilizing a machine learning algorithm to establish a predictive model of trajectory length. To ensure predictive accuracy, an ensemble algorithm based on Gaussian process regression (GPR) is proposed. Secondly, to ensure the efficiency and effectiveness of target assignments in large-scale missions, this paper draws inspiration from a greedy search and proposes a simple yet effective target assignment algorithm. This algorithm can effectively handle a large number of decision variables and constraints involved in large-scale missions. Finally, we validated the effectiveness of the proposed method through 15 simulated missions of different scales. Among the 10 medium- to large-scale missions, our method achieved the best results in 9 of them, demonstrating the competitive advantage of our method in large-scale missions. Comparative results demonstrate the advantage of the proposed methods from both prediction and mission planning perspectives. Full article