Dogfight Search: A Swarm-Based Optimization Algorithm for Complex Engineering Optimization and Mountainous Terrain Path Planning

• URL: http://arxiv.org/abs/2603.28046v1
• Date: Mon, 30 Mar 2026 05:20:54 GMT
• Title: Dogfight Search: A Swarm-Based Optimization Algorithm for Complex Engineering Optimization and Mountainous Terrain Path Planning
• Abstract summary: This paper proposes a novel metaphor-free metaheuristic algorithm called Dogfight Search (DoS)<n>DoS draws algorithmic framework from the inspiration, but its search mechanism is constructed based on the displacement integration equations in kinematics.<n>DoS significantly outperforms 7 advanced competitors in overall performance and ranks first in the Friedman ranking.
• Score: 12.430120944942855
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Dogfight is a tactical behavior of cooperation between fighters. Inspired by this, this paper proposes a novel metaphor-free metaheuristic algorithm called Dogfight Search (DoS). Unlike traditional algorithms, DoS draws algorithmic framework from the inspiration, but its search mechanism is constructed based on the displacement integration equations in kinematics. Through experimental validation on CEC2017 and CEC2022 benchmark test functions, 10 real-world constrained optimization problems and mountainous terrain path planning tasks, DoS significantly outperforms 7 advanced competitors in overall performance and ranks first in the Friedman ranking. Furthermore, this paper compares the performance of DoS with 3 SOTA algorithms on the CEC2017 and CEC2022 benchmark test functions. The results show that DoS continues to maintain its lead, demonstrating strong competitiveness. The source code of DoS is available at https://ww2.mathworks.cn/matlabcentral/fileexchange/183519-dogfight-search.

Related papers

• optimize_anything: A Universal API for Optimizing any Text Parameter [98.42497715725356]
  We show a single AI-based optimization system-supporting single-task search, multi-task search with cross-problem transfer, and generalization to unseen inputs.<n>We show for the first time that text optimization with LLM-based search is a general-purpose problem-solving paradigm.
  arXiv  Detail & Related papers  (2026-05-19T10:18:12Z)
• SHS: Scorpion Hunting Strategy Swarm Algorithm [2.9863148950750737]
  We introduce the Scorpion Hunting Strategy (SHS), a novel population-based, nature-inspired optimisation algorithm. This work substantiates its effectiveness and versatility through rigorous benchmarking and real-world problem-solving scenarios.
  arXiv  Detail & Related papers  (2024-07-19T10:58:42Z)
• In Search of Excellence: SHOA as a Competitive Shrike Optimization Algorithm for Multimodal Problems [4.939986309170004]
  The main inspiration for the proposed algorithm is taken from the swarming behaviours of shrike birds in nature. Two parts of optimization exploration and exploitation are designed by modelling shrike breeding and searching for foods. This paper is a mathematical model for the SHOA to perform optimization.
  arXiv  Detail & Related papers  (2024-07-09T11:19:37Z)
• Stochastic Optimal Control Matching [53.156277491861985]
  Our work introduces Optimal Control Matching (SOCM), a novel Iterative Diffusion Optimization (IDO) technique for optimal control. The control is learned via a least squares problem by trying to fit a matching vector field. Experimentally, our algorithm achieves lower error than all the existing IDO techniques for optimal control.
  arXiv  Detail & Related papers  (2023-12-04T16:49:43Z)
• HARRIS: Hybrid Ranking and Regression Forests for Algorithm Selection [75.84584400866254]
  We propose a new algorithm selector leveraging special forests, combining the strengths of both approaches while alleviating their weaknesses. HARRIS' decisions are based on a forest model, whose trees are created based on optimized on a hybrid ranking and regression loss function.
  arXiv  Detail & Related papers  (2022-10-31T14:06:11Z)
• Battle royale optimizer with a new movement strategy [0.0]
  This paper proposes a modified BRO (M-BRO) in order to improve balance between exploration and exploitation. The complexity of this modified algorithm is the same as the original one. The results show that BRO with additional movement operator performs well to solve complex numerical optimization problems.
  arXiv  Detail & Related papers  (2022-01-19T16:36:13Z)
• Duck swarm algorithm: theory, numerical optimization, and applications [6.244015536594532]
  A swarm intelligence-based optimization algorithm, named Duck Swarm Algorithm (DSA), is proposed in this study. Two rules are modeled from the finding food and foraging of the duck, which corresponds to the exploration and exploitation phases of the proposed DSA. Results show that DSA is a high-performance optimization method in terms of convergence speed and exploration-exploitation balance.
  arXiv  Detail & Related papers  (2021-12-27T04:53:36Z)
• ZARTS: On Zero-order Optimization for Neural Architecture Search [94.41017048659664]
  Differentiable architecture search (DARTS) has been a popular one-shot paradigm for NAS due to its high efficiency. This work turns to zero-order optimization and proposes a novel NAS scheme, called ZARTS, to search without enforcing the above approximation. In particular, results on 12 benchmarks verify the outstanding robustness of ZARTS, where the performance of DARTS collapses due to its known instability issue.
  arXiv  Detail & Related papers  (2021-10-10T09:35:15Z)
• Waypoint Planning Networks [66.72790309889432]
  We propose a hybrid algorithm based on LSTMs with a local kernel - a classic algorithm such as A*, and a global kernel using a learned algorithm. We compare WPN against A*, as well as related works including motion planning networks (MPNet) and value networks (VIN) It is shown that WPN's search space is considerably less than A*, while being able to generate near optimal results.
  arXiv  Detail & Related papers  (2021-05-01T18:02:01Z)
• The Archerfish Hunting Optimizer: a novel metaheuristic algorithm for global optimization [0.8315801422499861]
  Global optimization solves real-world problems numerically or analytically by minimizing their objective functions. We propose a global metahistic algorithm based on the Archerfish Hunting (AHO)
  arXiv  Detail & Related papers  (2021-02-03T16:22:31Z)
• TREGO: a Trust-Region Framework for Efficient Global Optimization [63.995130144110156]
  We propose and analyze a trust-region-like EGO method (TREGO) TREGO alternates between regular EGO steps and local steps within a trust region. Our algorithm enjoys strong global convergence properties, while departing from EGO only for a subset of optimization steps.
  arXiv  Detail & Related papers  (2021-01-18T00:14:40Z)
• Cat Swarm Optimization Algorithm -- A Survey and Performance Evaluation [0.9990687944474739]
  Cat Swarm Optimization (CSO) algorithm is a robust and powerful metaheuristic swarm-based optimization approach. This paper presents an in-depth survey and performance evaluation of CSO algorithm.
  arXiv  Detail & Related papers  (2020-01-10T18:18:05Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.