Based on uncertainty theory, this paper studies the problem of unmanned aerial vehicle (UAV) combat mission assignment under an uncertain environment. First, considering both the target value, which is the combat mission benefit gained from attacking the target, and the unit fuel consumption of UAV as uncertain variables, an uncertain UAV combat mission assignment model is established. And according to decisions under the realization of uncertain variables, the first stage generates an initial mission allocation scheme corresponding to the realization of target value, while the second stage dynamically adjusts the scheme according to the realization of unit fuel consumption; a two-stage uncertain UAV combat mission assignment (TUCMA) model is obtained. Then, because of the difficulty of obtaining analytical solutions due to uncertainty and the complexity of solving the second stage, the TUCMA model is transformed into an expected value-effective deterministic model of the two-stage uncertain UAV combat mission assignment (ETUCMA). A modified particle swarm optimization (PSO) algorithm is designed to solve the ETUCMA model to get the expected value-effective solution of the TUCMA model. Finally, experimental simulations of multiple UAV combat task allocation scenarios demonstrate that the proposed modified PSO algorithm yields an optimal decision with maximum combat mission benefits under a maximum iteration limit, which are significantly greater benefits than those for the mission assignment achieved by the original PSO algorithm. The proposed modified PSO exhibits superior performance compared with the ant colony optimization algorithm, enabling the acquisition of an optimal allocation scheme with greater benefits. This verifies the effectiveness and superiority of the proposed model and algorithm in maximizing combat mission benefits.

Addressing prevalent challenges in current cooperative task assignment methods for cross-domain unmanned swarm, such as the disconnection between decision-making and execution processes, and the inadequate incorporation of platform kinematic constraints, this study introduces an integrated decision-control cooperative task assignment approach based on a bi-level optimization framework. The proposed framework formulates a bi-level programming model that tightly couples upper-level task assignment with lower-level optimal control. The upper-level model aims to minimize the maximum task completion time by optimizing the assignment and visitation sequences of diverse target types across heterogeneous unmanned platforms. The lower-level model, given the task sequences from the upper level, addresses a minimum-time optimal control problem based on a comprehensive nonlinear kinematic model. This approach enables precise computation of task execution times, which are subsequently fed back to the decision-making layer, thereby establishing a closed-loop optimization mechanism. To solve this complex model efficiently, the lower-level employs differential flatness transformation to eliminate trigonometric functions in the kinematic equations and discretizes the continuous-time optimal control problem into a nonlinear programming problem via the Radau pseudospectral method. For the upper-level combinatorial optimization, an improved genetic algorithm is developed, integrating hybrid encoding, dual-archive elitism preservation, adaptive crossover and mutation strategies, and periodic local search. Simulation results demonstrate that, compared with traditional Euclidean-distance-based assignment methods, the proposed approach generates kinematically feasible and smooth trajectories while thoroughly accounting for the kinematic constraints of heterogeneous platforms, thereby demonstrating its effectiveness and superiority in improving the comprehensive mission performance of cross-domain unmanned swarms.

This paper addresses the cooperative task assignment problem for heterogeneous unmanned aerial vehicles with time windows considering uncertain fuel consumption. In the scenario where probabilistic fuel consumption exists and its distribution needs to be estimated from historical data samples, we first formulate the problem as a chance-constrained combinatorial optimization problem and utilize the sample average approximation method to solve it. Further, to address the issue of ambiguous distribution, we introduce distributionally robust chance constraints, which consider a set of probability distributions that are contained within a 1-Wasserstein ball centered around the empirical distribution of field data. We approximate the distributionally robust chance-constrained cooperative task assignment problem by applying a CVaR-based tractable approximation such that the problem can be transformed into a deterministic mixed-integer linear programming problem, which can be efficiently solved by state-of-the-art optimization solvers. Finally, we conduct a series of numerical experiments, which not only verify the computational efficiency of the distributionally robust chance-constrainted models but also reduce the degree of constraint violation in out-of-sample tests compared with a sample average approximation method.

To address the challenge of stable tracking of moving maritime targets by unmanned aerial vehicle(UAV) swarm in environments with threat zones and platform failure risks, this paper proposes a cooperative tracking and guidance strategy integrating Distributed Model Predictive Control (DMPC) with Sequential Quadratic Programming (SQP). A cooperative tracking model is developed incorporating UAV kinematics, environmental threats, stereo-vision positioning, and field-of-view constraints. Two original strategies are introduced within the DMPC framework: an altitude-cooperative target recapture strategy reduces target total loss duration by approximately 7 s compared to fixed-altitude baselines, while a distributed formation reconfiguration strategy restores stable tracking within 10 s after member failure and ensures safe inter-UAV separation. A multi-constraint trajectory tracking controller based on DMPC-SQP achieves real-time co-optimization of threat avoidance, formation maintenance, and tracking accuracy. Simulation results in dense threat environments demonstrate a 93.4% Quadratic Programming feasibility rate, with mean tracking error reduced by 25.4% over fixed-altitude DMPC and 48.7% over methods based on the Linear Quadratic Regulator (LQR), while maintaining robust performance under 300 ms communication delay, sensor noise, and moderate wind disturbance.

This paper presents a method for determining weight coefficients in multi-objective UAV task assignment under a competitive data-collection setting, where two UAV companies independently visit each other’s sensor nodes. In this setting, each company expresses operational intent through weights for data value, distance utility, and flight safety. Our own weights are prescribed by higher-level planning, whereas the competitor’s latent weights must be estimated from observed visit assignments. To estimate these weights, we apply Approximate Bayesian-Inspired Inference, which also provides a measure of the associated inference uncertainty. Subsequently, a purpose-built fuzzy rule base translates the inferred weights into response weights, while the fuzziness of this mapping is quantified as a second source of uncertainty. From these two uncertainty measures, an adaptive coefficient is derived that blends the planning and response weights into the final task assignment. Under controlled synthetic settings, numerical experiments demonstrate that the inference procedure outperforms direct loss-minimization baselines in both accuracy and speed, and that the adaptive fusion effectively balances planning adherence with responsiveness to competitor behavior.

Emergency response missions employing heterogeneous multi-UAVs are challenged by both the tight coupling between task assignment and motion control and the inherent difficulty in obtaining full probability distributions of stochastic disturbances. In practice, only partial moment information—typically the mean, covariance, and support set—can be estimated. To address this, the paper proposes a distributionally robust integrated “decision–control” framework. A bi-level optimization model is established: the upper level minimizes the maximum mission completion time across all platforms, while the lower level solves minimum-time optimal control problems under kinematic constraints, with the two levels coupled through task execution times. Given only the mean, covariance, and support set of disturbances, an ambiguity set is constructed, and by leveraging duality theory and semidefinite programming, the distributionally robust chance constraints on site reachability are equivalently transformed into deterministic safety margins. A two-stage trajectory planning method is further designed to decouple accumulated time estimation from robust constraint enforcement, ensuring computational tractability. Simulation results across multiple disturbance configurations show that, whereas deterministic planning yields an overall mission success rate of only about 0.7%, the proposed framework consistently achieves success rates above 99.9% and effectively balances workload among multiple UAVs. These results validate the practical benefit of the framework in providing reliable emergency response plans under limited distributional information.