mlsanityData to 7 Oct 2026

Multi-Dimensional AGV Path Planning in 3D Warehouses Using Ant Colony Optimization and Advanced Neural Networks

arXiv 2504.01985 ↗First posted 30 Mar 2025cs.RO cs.AIcited by 0

Not on the map. Why?

Abstract (arXiv)

Within modern warehouse scenarios, the rapid expansion of e-commerce and increasingly complex, multi-level storage environments have exposed the limitations of traditional AGV (Automated Guided Vehicle) path planning methods--often reliant on static 2D models and expert-tuned heuristics that struggle to handle dynamic traffic and congestion. Addressing these limitations, this paper introduces a novel AGV path planning approach for 3D warehouse environments that leverages a hybrid framework combining ACO (Ant Colony Optimization) with deep learning models, called NAHACO (Neural Adaptive Heuristic Ant Colony Optimization). NAHACO integrates three key innovations: first, an innovative heuristic algorithm for 3D warehouse cargo modeling using multidimensional tensors, which addresses the challenge of achieving superior heuristic accuracy; second, integration of a congestion-aware loss function within the ACO framework to adjust path costs based on traffic and capacity constraints, called CARL (Congestion-Aware Reinforce Loss), enabling dynamic heuristic calibration for optimizing ACO-based path planning; and third, an adaptive attention mechanism that captures multi-scale spatial features, thereby addressing dynamic heuristic calibration for further optimization of ACO-based path planning and AGV navigation. NAHACO significantly boosts path planning efficiency, yielding faster computation times and superior performance over both vanilla and state-of-the-art methods, while automatically adapting to warehouse constraints for real-time optimization. NAHACO outperforms state-of-the-art methods, lowering the total cost by up to 24.7% on TSP benchmarks. In warehouse tests, NAHACO cuts cost by up to 41.5% and congestion by up to 56.1% compared to previous methods.

Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 16 of its 35 references that are in the map. First posted on arXiv 30 Mar 2025.

Builds on

16 of 35 references.

References · 16

  1. 2015Pointer Networkscited by 882
  2. 2016Neural Combinatorial Optimization with Reinforcement Learningcited by 600
  3. 2018Reinforcement Learning for Solving the Vehicle Routing Problemcited by 327
  4. 2023DIFUSCO: Graph-based Diffusion Solvers for Combinatorial Optimizationcited by 216
  5. 2023Neural Combinatorial Optimization with Heavy Decoder: Toward Large Scale Generalizationcited by 140
  6. 2022DIMES: A Differentiable Meta Solver for Combinatorial Optimization Problemscited by 127
  7. 2020Multi-Decoder Attention Model with Embedding Glimpse for Solving Vehicle Routing Problemscited by 100
  8. 2022Simulation-guided Beam Search for Neural Combinatorial Optimizationcited by 84
  9. 2023DeepACO: Neural-enhanced Ant Systems for Combinatorial Optimizationcited by 77
  10. 2021The Transformer Network for the Traveling Salesman Problemcited by 59
  11. 2023Pointerformer: Deep Reinforced Multi-Pointer Transformer for the Traveling Salesman Problemcited by 49
  12. 2024Self-Improved Learning for Scalable Neural Combinatorial Optimizationcited by 29
4 more
  1. 2022How Good Is Neural Combinatorial Optimization? A Systematic Evaluation on the Traveling Salesman Problemcited by 27
  2. 2023ASP: Learn a Universal Neural Solver!cited by 27
  3. 2022Neural Combinatorial Optimization: a New Player in the Fieldcited by 6
  4. 2024Scaling Combinatorial Optimization Neural Improvement Heuristics with Online Search and Adaptationcited by 2

Built on by

Not cited yet.