Minimum driver node sets (MDSs) play an important role in studying the structural controllability of complex networks. Recent research has shown that MDSs tend to avoid high-degree nodes. However, this observation is based on the analysis of a small number of MDSs, because enumerating all of the MDSs of a network is a #P problem. Therefore, past research has not been sufficient to arrive at a convincing conclusion. In this paper, first, we propose a preferential matching algorithm to find MDSs that have a specific degree property. Then, we show that the MDSs obtained by preferential matching can be composed of high- and medium-degree nodes. Moreover, the experimental results also show that the average degree of the MDSs of some networks tends to be greater than that of the overall network, even when the MDSs are obtained using previous research method. Further analysis shows that whether the driver nodes tend to be high-degree nodes or not is closely related to the edge direction of the network.

UAV mission planning is one of the core problems in the field of UAV applications. Currently, mission planning needs to simultaneously optimize multiple conflicting objectives and take into account multiple mutually coupled constraints, and traditional optimization algorithms struggle to effectively address these difficulties. Constrained multi-objective evolutionary algorithms have been proven to be effective methods for solving complex constrained multi-objective optimization problems and have been gradually applied to UAV mission planning. However, recent advances in this area have not been summarized. Therefore, this paper provides a comprehensive overview of this topic, first introducing the basic classification of UAV mission planning and its applications in different fields, proposing a new classification method based on the priorities of objectives and constraints, and describing the constraints of UAV mission planning from the perspectives of mathematical models and planning algorithms. Then, the importance of constraint handling techniques in UAV mission planning and their advantages and disadvantages are analyzed in detail, and the methods for determining individual settings in multiple populations and improvement strategies in constraint evolution algorithms are discussed. Finally, the method from the related literature is presented to compare in detail the application weights of constrained multi-objective evolutionary algorithms in UAV mission planning and provide directions and references for future research.

With the increase in UAV scale and mission diversity, trajectory planning systems faces more and more complex constraints, which are often conflicting and strongly coupled, placing higher demands on the real-time and response capabilities of the system. At the same time, conflicts and strong coupling pose challenges the autonomous decision-making capability of the system, affecting the accuracy and efficiency of the planning system in complex environments. However, recent research advances addressing these issues have not been fully summarized. An in-depth exploration of constraint handling techniques and autonomous decision-making issues will be of great significance to the development of large-scale UAV systems. Therefore, this paper aims to provide a comprehensive overview of this topic. Firstly, the functions and application scenarios of large-scale UAV trajectory planning are introduced and classified in detail according to the planning method, realization function and the presence or absence of constraints. Then, the constraint handling techniques are described in detail, focusing on the priority ranking of constraints and the principles of their fusion and transformation methods. Then, the importance of autonomous decision-making in large-scale UAV trajectory planning is described in depth, and related dynamic adjustment algorithms are introduced. Finally, the future research directions and challenges of large-scale UAV trajectory planning are outlooked, providing directions and references for future research in the fields of UAV clustering and UAV cooperative flight.

Multi-satellite imaging mission planning has been difficult in various scenarios due to the complex constraints of multi-satellite imaging, the wide area covered by target points, and the difficulty of achieving different mission requirements in a short period of time with limited satellite resources. In addressing this challenge, this work investigates multi-satellite imaging mission planning based on the Unified Plan Model and Improved Adaptive Differential Evolution algorithm (UPM-IADE). First, a unified model is built based on two scenarios: a large-scale imaging mission and an emergency support mission, and then a mission assignment framework is adaptively selected based on mission priority. Second, a monorail task synthesis method based on visible time windows is created to clarify the execution relationship between the satellite and the target point. Finally, an individual weight ranking rule is developed, and the weight is used to combine the fitness value ranking and diversity ranking into a final fitness value ranking, which is used to select individuals that satisfy the mutation requirements into the mutation strategy pool for adaptive mutation strategy selection. Experiments 1, 2, 3, and 4 have demonstrated that UPM-IADE can successfully resolve the imaging satellite mission planning for both scenarios while providing remarkable performance in terms of high mission benefit and rapid response.

With the increasing complexity of unmanned aerial vehicle (UAV) missions, single-objective optimization for UAV trajectory planning proves inadequate in handling multiple conflicting objectives. There is a notable absence of research on multi-objective optimization for UAV trajectory planning. This study introduces a novel two-stage co-evolutionary multi-objective evolutionary algorithm for UAV trajectory planning (TSCEA). Firstly, two primary optimization objectives were defined: minimizing total UAV flight distance and obstacle threats. Five constraints were defined: safe distances between UAV trajectory and obstacles, maximum flight altitude, speed, flight slope, and flight corner limitations. In order to effectively cope with UAV constraints on object space limitations, the evolution of the TSCEA algorithm is divided into an exploration phase and an exploitation phase. The exploration phase employs a two-population strategy where the main population ignores UAV constraints while an auxiliary population treats them as an additional objective. This approach enhances the algorithm’s ability to explore constrained solutions. In contrast, the exploitation phase aims to converge towards the Pareto frontier by leveraging effective population information, resulting in multiple sets of key UAV trajectory points. Three experimental scenarios were designed to validate the effectiveness of TSCEA. Results demonstrate that the proposed algorithm not only successfully navigates UAVs around obstacles but also generates multiple sets of Pareto-optimal solutions that are well-distributed across objectives. Therefore, compared to single-objective optimization, TSCEA integrates the UAV mathematical model comprehensively and delivers multiple high-quality, non-dominated trajectory planning solutions.