Evaluating Evolutionary and Gradient-Based Algorithms for Optimal Pathfinding
Doroshenko, O.
Show abstract
Pathfinding in complex topographies poses a challenge with applications extending from urban planning to autonomous navigation. While numerous algorithms offer potential solutions, their comparative efficiency and reliability when confronted with nonlinear terrains remain to be systematically evaluated. This study assesses three pathfinding algorithms--Genetic Algorithm (GA), Particle Swarm Optimization (PSO), and Sequential Quadratic Programming (SQP)--to establish a basis for comparison in terms of efficiency and computational speed. Results from twenty simulations indicate that SQP achieves lower path costs and reduced computational time than GA and PSO. In particular, SQP demonstrates reduced variability in path costs and quicker convergence to optimal paths, proving more effective in nonlinear environments. These results suggest gradient-based SQP as a preferable solution for complex pathfinding tasks. The study offers a framework for algorithm selection where efficiency and promptness are critical, potentially guiding decisions in operational strategies and system architecture.
Matching journals
The top 10 journals account for 50% of the predicted probability mass.
Similar papers in this journal
- Exploring Environmental Coverages of Species: A New Variable Selection Methodology for Rulesets from the Genetic Algorithm for Ruleset Prediction 93%
- Comparison of rule- and ordinary differential equation-based dynamic model of DARPP-32 signalling network 91%
- The energetic effect of hip flexion and retraction in walking at different speeds: a modeling study 90%
"Similar papers" are the closest papers from that journal in the model's embedding space. They show what the match is built on, but the ranking comes mostly from a classifier over the whole training set, not from these examples alone.