Improved particle swarm optimization algorithm: multi-target trajectory optimization for swarm drones
Pith reviewed 2026-05-19 04:52 UTC · model grok-4.3
The pith
PE-PSO adds persistent exploration and entropy-based tuning to PSO for real-time multi-UAV trajectory planning.
A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.
Core claim
The authors establish that PE-PSO, by combining a persistent exploration mechanism to maintain swarm diversity with an entropy-driven parameter adjustment rule applied to B-spline parameterized trajectories inside a distributed multi-agent framework that uses genetic algorithms for task allocation, produces higher-quality, smoother, and more efficient real-time trajectories for UAV swarms than conventional PSO and other swarm planners.
What carries the argument
PE-PSO algorithm that uses a persistent exploration mechanism to preserve swarm diversity together with entropy-based parameter adjustment on B-spline curves, embedded in a distributed multi-agent architecture with genetic algorithm task allocation.
If this is right
- Real-time performance becomes feasible through parallel computation across agents.
- Energy efficiency improves because trajectories are optimized for lower consumption.
- Obstacle avoidance strengthens in dynamic settings due to faster adaptation.
- Computation time drops, allowing more frequent replanning during flight.
- Scalable coordination emerges among multiple UAVs without centralized bottlenecks.
Where Pith is reading between the lines
- The same structure could extend to ground or water vehicles that face similar real-time constraints.
- Sensor noise and model mismatch in hardware would likely require targeted robustness checks beyond the simulations shown.
- Decentralized control might reduce single-point failures in large swarms compared with fully centralized planners.
Load-bearing premise
The simulation environments and performance metrics accurately predict how the algorithm behaves on physical UAVs in real dynamic conditions without major retuning or hardware adjustments.
What would settle it
Running the planner on physical UAVs in a test area containing moving obstacles and verifying that measured energy use, collision avoidance rates, and replanning times match or exceed the reported simulation results.
Figures
read the original abstract
Real-time trajectory planning for unmanned aerial vehicles (UAVs) in dynamic environments remains a key challenge due to high computational demands and the need for fast, adaptive responses. Traditional Particle Swarm Optimization (PSO) methods, while effective for offline planning, often struggle with premature convergence and latency in real-time scenarios. To overcome these limitations, we propose PE-PSO, an enhanced PSO-based online trajectory planner. The method introduces a persistent exploration mechanism to preserve swarm diversity and an entropy-based parameter adjustment strategy to dynamically adapt optimization behavior. UAV trajectories are modeled using B-spline curves, which ensure path smoothness while reducing optimization complexity. To extend this capability to UAV swarms, we develop a multi-agent framework that combines genetic algorithm (GA)-based task allocation with distributed PE-PSO, supporting scalable and coordinated trajectory generation. The distributed architecture allows for parallel computation and decentralized control, enabling effective cooperation among agents while maintaining real-time performance. Comprehensive simulations demonstrate that the proposed framework outperforms conventional PSO and other swarm-based planners across several metrics, including trajectory quality, energy efficiency, obstacle avoidance, and computation time. These results confirm the effectiveness and applicability of PE-PSO in real-time multi-UAV operations under complex environmental conditions.
Editorial analysis
A structured set of objections, weighed in public.
Referee Report
Summary. The manuscript proposes PE-PSO, an enhanced PSO algorithm for real-time multi-target trajectory optimization in swarm drones. It adds a persistent exploration mechanism to preserve diversity, an entropy-based parameter adjustment strategy, B-spline curve modeling for smooth trajectories, GA-based task allocation, and a distributed multi-agent execution framework. Comprehensive simulations are reported to show outperformance versus conventional PSO and other swarm planners on trajectory quality, energy efficiency, obstacle avoidance, and computation time, supporting claims of effectiveness for real-time multi-UAV operations in complex environments.
Significance. If the simulation-based outperformance claims hold under scrutiny, the work could advance online planning for UAV swarms by mitigating premature convergence and latency issues in standard PSO. The distributed architecture and B-spline representation are constructive elements for scalability and smoothness. The approach offers a plausible path toward adaptive, coordinated drone operations, though its impact hinges on stronger empirical grounding beyond simulations.
major comments (3)
- [Abstract] Abstract: the central claim that 'comprehensive simulations demonstrate that the proposed framework outperforms conventional PSO and other swarm-based planners across several metrics' is asserted without any quantitative values, statistical tests, baseline algorithm names, or ablation results. This directly weakens support for the outperformance conclusion that the paper treats as load-bearing.
- [Conclusions] Simulation results and conclusions: the assertion that results 'confirm the effectiveness and applicability of PE-PSO in real-time multi-UAV operations under complex environmental conditions' rests on the unexamined assumption that simulation metrics (trajectory quality, energy, avoidance, time) predict physical UAV behavior. No modeling of sensor noise, actuator lag, communication delays, or sim-to-real degradation analysis is provided, making the applicability claim unsupported.
- [Proposed Method] Method description (persistent exploration and entropy adjustment): the two free parameters (exploration persistence coefficient and entropy adjustment rate) are introduced as independent enhancements, yet no derivation shows how claimed performance gains reduce directly to these quantities rather than to other implementation choices or tuning.
minor comments (2)
- [Figures and Tables] Figure captions and tables should explicitly list all compared algorithms, environment parameters, and run counts to allow reproducibility assessment.
- [Notation] Notation for B-spline control points and the distributed execution protocol could be clarified with a short pseudocode block or explicit equation references.
Simulated Author's Rebuttal
We thank the referee for the constructive and detailed comments on our manuscript. We address each major comment point by point below, indicating where revisions will be made to strengthen the work.
read point-by-point responses
-
Referee: [Abstract] Abstract: the central claim that 'comprehensive simulations demonstrate that the proposed framework outperforms conventional PSO and other swarm-based planners across several metrics' is asserted without any quantitative values, statistical tests, baseline algorithm names, or ablation results. This directly weakens support for the outperformance conclusion that the paper treats as load-bearing.
Authors: We agree that the abstract would be strengthened by greater specificity. In the revised manuscript, we will incorporate key quantitative results from the simulations, including average percentage improvements in trajectory quality, energy consumption, and computation time relative to standard PSO, along with the names of the other swarm-based planners used as baselines. We will also note that results were averaged over multiple independent runs with statistical significance assessed via paired t-tests. revision: yes
-
Referee: [Conclusions] Simulation results and conclusions: the assertion that results 'confirm the effectiveness and applicability of PE-PSO in real-time multi-UAV operations under complex environmental conditions' rests on the unexamined assumption that simulation metrics (trajectory quality, energy, avoidance, time) predict physical UAV behavior. No modeling of sensor noise, actuator lag, communication delays, or sim-to-real degradation analysis is provided, making the applicability claim unsupported.
Authors: This is a fair criticism. The current work relies on simulation results, and we do not claim direct equivalence to physical UAV performance. In the revision, we will moderate the language in the conclusions and abstract to emphasize simulation-based performance while adding a brief discussion of potential sim-to-real gaps, such as the effects of sensor noise and communication delays. A full degradation analysis would require new hardware experiments that are outside the scope of this study. revision: partial
-
Referee: [Proposed Method] Method description (persistent exploration and entropy adjustment): the two free parameters (exploration persistence coefficient and entropy adjustment rate) are introduced as independent enhancements, yet no derivation shows how claimed performance gains reduce directly to these quantities rather than to other implementation choices or tuning.
Authors: We acknowledge the need for clearer justification of these parameters. They were selected through systematic empirical tuning guided by prior adaptive PSO studies to balance exploration and convergence. In the revised method section, we will add an explanation of their roles together with a parameter sensitivity study demonstrating their specific contributions to swarm diversity and optimization stability, separate from other implementation details. revision: yes
- Full sim-to-real degradation analysis including explicit modeling of sensor noise, actuator lag, and communication delays, as this would require physical UAV experiments not performed in the present simulation-focused study.
Circularity Check
No circularity: enhancements and simulation metrics are independent additions
full rationale
The paper defines PE-PSO via explicit new mechanisms (persistent exploration to preserve diversity, entropy-based adaptation, B-spline trajectory modeling, GA task allocation, distributed execution) and evaluates them through external simulation metrics (trajectory quality, energy, obstacle avoidance, computation time) against conventional PSO baselines. No equation reduces a claimed gain to a quantity defined by the paper's own fitted parameters or prior self-citations; the performance claims rest on comparative simulation runs rather than tautological re-derivations. The derivation chain is therefore self-contained against the stated benchmarks.
Axiom & Free-Parameter Ledger
free parameters (2)
- exploration persistence coefficient
- entropy adjustment rate
axioms (2)
- domain assumption B-spline curves maintain smoothness while lowering optimization dimensionality
- domain assumption Distributed GA-plus-PE-PSO architecture scales with swarm size while preserving real-time performance
invented entities (1)
-
PE-PSO variant
no independent evidence
Lean theorems connected to this paper
-
IndisputableMonolith/Cost/FunctionalEquation.leanwashburn_uniqueness_aczel unclear?
unclearRelation between the paper passage and the cited Recognition theorem.
PE-PSO incorporates ... persistent exploration mechanism ... entropy-based parameter adjustment ... B-spline curves ... GA-based task allocation with distributed PE-PSO
-
IndisputableMonolith/Foundation/RealityFromDistinction.leanreality_from_one_distinction unclear?
unclearRelation between the paper passage and the cited Recognition theorem.
Comprehensive simulations demonstrate that the proposed framework outperforms conventional PSO ... trajectory quality, energy efficiency, obstacle avoidance, and computation time
What do these tags mean?
- matches
- The paper's claim is directly supported by a theorem in the formal canon.
- supports
- The theorem supports part of the paper's argument, but the paper may add assumptions or extra steps.
- extends
- The paper goes beyond the formal theorem; the theorem is a base layer rather than the whole result.
- uses
- The paper appears to rely on the theorem as machinery.
- contradicts
- The paper's claim conflicts with a theorem or certificate in the canon.
- unclear
- Pith found a possible connection, but the passage is too broad, indirect, or ambiguous to say the theorem truly supports the claim.
Reference graph
Works this paper leans on
-
[1]
UA V Path Planning Using an Adaptive Strategy for the Particle Swarm Optimization Algorithm,
A. S. Rosas-Carrillo, A. Sol ´ıs-Santom´e, C. Silva-S ´anchez, and O. Camacho-Nieto, “UA V Path Planning Using an Adaptive Strategy for the Particle Swarm Optimization Algorithm,” Drones, vol. 9, no. 3, p. 170, Feb. 2025, doi: 10.3390/drones9030170
-
[2]
S. Lin, J. Wang, B. Huang, X. Kong, and H. Yang, “Bio particle swarm optimization and reinforcement learning algorithm for path planning of automated guided vehicles in dynamic industrial environments,” Sci Rep, vol. 15, no. 1, p. 463, Jan. 2025, doi: 10.1038/s41598-024-84821-2
-
[3]
D. Gong, “Path Planning of Mobile Robot With Improved Ant Colony Algorithm and MDP to Produce Smooth Trajectory in Grid-Based Environment”
-
[4]
Y . Liu, H. Zhang, H. Zheng, Q. Li, and Q. Tian, “A spherical vector- based adaptive evolutionary particle swarm optimization for UA V path planning under threat conditions,” Sci Rep, vol. 15, no. 1, p. 2116, Jan. 2025, doi: 10.1038/s41598-025-85912-4
-
[5]
A hybrid differential evolution particle swarm optimization algorithm based on dynamic strategies,
H. Xu, Q. Deng, Z. Zhang, and S. Lin, “A hybrid differential evolution particle swarm optimization algorithm based on dynamic strategies,” Sci Rep, vol. 15, no. 1, p. 4518, Feb. 2025, doi: 10.1038/s41598-024-82648- 5
-
[6]
Z. Yang, N. Li, Y . Zhang, and J. Li, “Mobile Robot Path Planning Based on Improved Particle Swarm Optimization and Improved Dynamic Window Approach,” Journal of Robotics, vol. 2023, pp. 1–16, May 2023, doi: 10.1155/2023/6619841
-
[7]
An explicit formula for the A-polynomial of twist knots
R. Mesquita and P. D. Gaspar, “A Path Planning Optimization Algorithm Based on Particle Swarm Optimization for UA Vs for Bird Monitoring and Repelling – Simulation Results,” in 2020 International Conference on Decision Aid Sciences and Application (DASA), Sakheer, Bahrain, Nov. 2020. doi: 10.1109/dasa51403.2020.9317271
work page internal anchor Pith review Pith/arXiv arXiv doi:10.1109/dasa51403.2020.9317271 2020
-
[8]
T. T. N. Duong, D.-N. Bui, and M. D. Phung, “Navigation variable-based multi-objective particle swarm optimization for UA V path planning with kinematic constraints,” Neural Comput & Applic, vol. 37, no. 7, pp. 5683–5697, Mar. 2025, doi: 10.1007/s00521-024-10945-1
-
[9]
N. Ahmed, C. J. Pawase, and K. Chang, “Distributed 3-D Path Planning for Multi-UA Vs with Full Area Surveillance Based on Particle Swarm Optimization,” Applied Sciences, vol. 11, no. 8, p. 3417, Apr. 2021, doi: 10.3390/app11083417
-
[10]
Y . Qi, H. Jiang, G. Huang, L. Yang, F. Wang, and Y . Xu, “Multi- UA V path planning considering multiple energy consumptions via an improved bee foraging learning particle swarm optimization algorithm,” Sci Rep, vol. 15, no. 1, p. 14755, Apr. 2025, doi: 10.1038/s41598-025- 99001-z
-
[11]
M. Yan, H. Yuan, J. Xu, Y . Yu, and L. Jin, “Task allocation and route planning of multiple UA Vs in a marine environment based on an improved particle swarm optimization algorithm,” EURASIP J. Adv. Signal Process., vol. 2021, no. 1, p. 94, Dec. 2021, doi: 10.1186/s13634- 021-00804-9
-
[12]
Modeling and Nonlinear Control of a Quadcopter for Stabilization and Trajectory Tracking,
A. Abdulkareem, V . Oguntosin, O. M. Popoola, and A. A. Idowu, “Modeling and Nonlinear Control of a Quadcopter for Stabilization and Trajectory Tracking,” Journal of Engineering, vol. 2022, pp. 1–19, Oct. 2022, doi: 10.1155/2022/2449901
-
[13]
A Mathematical Model for a Conceptual Design and Analyses of UA V Stabilization Systems,
V . Kramar, A. Kabanov, and S. Dudnikov, “A Mathematical Model for a Conceptual Design and Analyses of UA V Stabilization Systems,” Fluids, vol. 6, no. 5, p. 172, Apr. 2021, doi: 10.3390/fluids6050172
-
[14]
Mathematical analy- sis of drone flight path,
R. Barna, K. Solymosi, and E. Stettner, “Mathematical analy- sis of drone flight path,” JAI, vol. 10, no. 2, Dec. 2019, doi: 10.17700/jai.2019.10.2.533
-
[15]
Task assignment algorithms for unmanned aerial vehicle networks: A comprehensive survey,
S. Poudel and S. Moh, “Task assignment algorithms for unmanned aerial vehicle networks: A comprehensive survey,” Vehicular Communications, vol. 35, p. 100469, Jun. 2022, doi: 10.1016/j.vehcom.2022.100469
-
[16]
Multi-UA V cooperative task assignment based on multi-strategy improved DBO,
R. Zhang, X. Chen, and M. Li, “Multi-UA V cooperative task assignment based on multi-strategy improved DBO,” Cluster Comput, vol. 28, no. 3, p. 195, Jun. 2025, doi: 10.1007/s10586-024-04912-7
-
[17]
Z. Zhang, J. Jiang, H. Xu, and W.-A. Zhang, “Distributed dynamic task allocation for unmanned aerial vehicle swarm systems: A networked evolutionary game-theoretic approach,” Chinese Journal of Aeronautics, vol. 37, no. 6, pp. 182–204, Jun. 2024, doi: 10.1016/j.cja.2023.12.027
-
[18]
A Review of Task Allocation Methods for UA Vs,
G. M. Skaltsis, H.-S. Shin, and A. Tsourdos, “A Review of Task Allocation Methods for UA Vs,” J Intell Robot Syst, vol. 109, no. 4, p. 76, Dec. 2023, doi: 10.1007/s10846-023-02011-0
-
[19]
Cooperative task assignment of multi-UA V system,
J. Zhang and J. Xing, “Cooperative task assignment of multi-UA V system,” Chinese Journal of Aeronautics, vol. 33, no. 11, pp. 2825–2827, Nov. 2020, doi: 10.1016/j.cja.2020.02.009
-
[20]
V . Marguet, C. K. Dinh, I. Prodan, and F. Stoican, “Constrained PSO-Splines Trajectory Generation for an Indoor Nanodrone,” in 2024 International Conference on Unmanned Aircraft Systems (ICUAS), Chania - Crete, Greece: IEEE, Jun. 2024, pp. 113–120. doi: 10.1109/ICUAS60882.2024.10556977
-
[21]
D. De Jager, Y . Zweiri, and D. Makris, “A particle swarm optimization approach using adaptive entropy-based fitness quantification of expert knowledge for high-level, real-time cognitive robotic control,” SN Appl. Sci., vol. 1, no. 12, p. 1684, Dec. 2019, doi: 10.1007/s42452-019-1697- 4
-
[22]
S. Xiao, Y . Wang, H. Yu, and S. Nie, “An Entropy-Based Adaptive Hybrid Particle Swarm Optimization for Disassembly Line Balanc- ing Problems,” Entropy, vol. 19, no. 11, p. 596, Nov. 2017, doi: 10.3390/e19110596
-
[23]
J. Wang, X. Wang, X. Li, and J. Yi, “A Hybrid Particle Swarm Optimiza- tion Algorithm with Dynamic Adjustment of Inertia Weight Based on a New Feature Selection Method to Optimize SVM Parameters,” Entropy, vol. 25, no. 3, p. 531, Mar. 2023, doi: 10.3390/e25030531
-
[24]
Chaos Particle Swarm Optimization En- hancement Algorithm for UA V Safe Path Planning,
H. Chu, J. Yi, and F. Yang, “Chaos Particle Swarm Optimization En- hancement Algorithm for UA V Safe Path Planning,” Applied Sciences, vol. 12, no. 18, p. 8977, Sep. 2022, doi: 10.3390/app12188977
-
[25]
A Dynamic Neighborhood-Based Switching Particle Swarm Optimization Algorithm,
N. Zeng, Z. Wang, W. Liu, H. Zhang, K. Hone, and X. Liu, “A Dynamic Neighborhood-Based Switching Particle Swarm Optimization Algorithm,” IEEE Trans. Cybern., vol. 52, no. 9, pp. 9290–9301, Sep. 2022, doi: 10.1109/TCYB.2020.3029748
-
[26]
Y . Sun and Y . Gao, “An improved composite particle swarm optimiza- tion algorithm for solving constrained optimization problems and its engineering applications,” MATH, vol. 9, no. 4, pp. 7917–7944, 2024, doi: 10.3934/math.2024385
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.