Multi-Robot Path Planning Based on an Improved Bag Spider Algorithm
An improved bag spider algorithm for coordinated robot path planning with an adaptive exploration–exploitation schedule that adjusts based on iteration progress and population diversity and an obstacle-aware repair operator that locally bypasses infeasible segments and smooths the resulting paths is introduced.