Evolutionary Biparty Multiobjective UAV Path Planning: Problems and Empirical Comparisons
Unmanned aerial vehicle (UAV) path planning traditionally treats efficiency and safety objectives as a single multiobjective optimization problem. This paper proposes a biparty multiobjective formulation with separate decision-makers for efficiency and safety, adapting immune algorithms (NNIA, HEIA, AIMA) into BPNNIA, BPHEIA, and BPAIMA to find common Pareto optimal solutions. The work addresses the practical scenario where regulatory and operational departments have independent criteria.
The paper presents a technically sound but incremental contribution. It adapts existing multiparty multiobjective optimization theory to UAV path planning and extends immune algorithms with MPNDS2 sorting. While the experimental results favor BPAIMA, the lack of statistical significance testing and limited baseline comparison weaken the empirical claims. The core idea of separating efficiency and safety decision-makers is well-motivated, but the algorithmic contribution amounts to applying existing MPNDS2 dominance ranking within an immune algorithm framework rather than fundamental advances in either field.
The biparty modeling of UAV path planning is well-motivated for urban operations involving separate efficiency and safety departments. The mathematical formulation clearly separates objectives between the efficiency DM ($F_{eff}$) and safety DM ($F_{safe}$), with the former minimizing path length, energy consumption, height variation, and hover point distance while the latter minimizes fatality risk, property risk, and noise pollution. The use of meanHV (averaging hypervolume across decision-makers) provides a balanced evaluation metric for multiparty solutions, and the paper provides detailed parameter settings for reproduction.
The novelty claim of being "the first time" is overstated since the paper applies existing multiparty frameworks rather than inventing new theory. The comparison is limited to only two multiparty algorithms (OptMPNDS and OptMPNDS2) and omits recent decomposition-based MPMOEAs or other clonal selection variants. Table III shows performance differences without statistical significance tests (p-values or confidence intervals), making it impossible to judge if BPAIMA's meanHV of 0.1852 versus BPHEIA's 0.1685 in Case 1 represents a statistically significant improvement. The complexity analysis in Section V-C claims equivalence with NSGA-II by assuming $K \leq m$, but MPNDS2 involves $K+1$ nondominated sorting passes which may incur practical overhead not captured by asymptotic notation.
The evidence demonstrates that standard NSGA-II fails to find common Pareto solutions in BPMOPs, which aligns with expectations given its single-DM design. However, the comparison between the proposed BP variants and OptMPNDS/OptMPNDS2 shows diminishing returns—BPAIMA's improvements over OptMPNDS2 are marginal in Cases 4-6 (0.1979 vs 0.1900, 0.1924 vs 0.1857, 0.1908 vs 0.1841). The paper does not establish whether the adaptive DE strategies in BPAIMA are the decisive factor or simply the immune algorithm framework itself. Furthermore, the paper claims the solution set from single-DM models "is not guaranteed to be Pareto optimal from the perspectives of the efficiency DM and safety DM," but does not quantify how often this theoretical concern manifests in practice.
Experimental parameters are detailed in Section V-A including crossover rates ($CR_1=0.9, CR_2=0.5, CR_3=0.1$), population size 105, and 80,000 evaluations. The code is claimed to be available at a GitHub repository (https://github.com/MiLab-HITSZ/2023ChenMPUAV). However, reproducibility is hampered by the lack of specified random seeds for the urban environment generation—building heights are drawn from lognormal distributions ($\mu=3.04670, \sigma=0.76023$) and population density uses a radial basis model, but the paper does not provide the specific random seeds or instance identifiers needed to regenerate identical test cases. The mission hover point locations (25,30), (34,20), and (40,35) appear arbitrarily selected without justification for these coordinates.
Unmanned aerial vehicles (UAVs) have been widely used in urban missions, and proper planning of UAV paths can improve mission efficiency while reducing the risk of potential third-party impact. Existing work has considered all efficiency and safety objectives for a single decision-maker (DM) and regarded this as a multiobjective optimization problem (MOP). However, there is usually not a single DM but two DMs, i.e., an efficiency DM and a safety DM, and the DMs are only concerned with their respective objectives. The final decision is made based on the solutions of both DMs. In this paper, for the first time, biparty multiobjective UAV path planning (BPMO-UAVPP) problems involving both efficiency and safety departments are modeled. The existing multiobjective immune algorithm with nondominated neighbor-based selection (NNIA), the hybrid evolutionary framework for the multiobjective immune algorithm (HEIA), and the adaptive immune-inspired multiobjective algorithm (AIMA) are modified for solving the BPMO-UAVPP problem, and then biparty multiobjective optimization algorithms, including the BPNNIA, BPHEIA, and BPAIMA, are proposed and comprehensively compared with traditional multiobjective evolutionary algorithms and typical multiparty multiobjective evolutionary algorithms (i.e., OptMPNDS and OptMPNDS2). The experimental results show that BPAIMA performs better than ordinary multiobjective evolutionary algorithms such as NSGA-II and multiparty multiobjective evolutionary algorithms such as OptMPNDS, OptMPNDS2, BPNNIA and BPHEIA.
Pick a starting point or write your own. Challenges run in the background, so you can keep reading while the AI investigates.
No challenges yet. Disagree with the review? Ask the AI to revisit a specific claim.