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

蚁群优化算法 路径(计算) 运动规划 人工神经网络 计算机科学 蚁群 人工智能 运筹学 机器人 工程类 计算机网络
作者
Bo Zhang,Xiubo Liang,Wei Song,Yulu Chen
出处
期刊:Cornell University - arXiv
标识
DOI:10.48550/arxiv.2504.01985
摘要

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.
最长约 10秒,即可获得该文献文件

科研通智能强力驱动
Strongly Powered by AbleSci AI
科研通是完全免费的文献互助平台,具备全网最快的应助速度,最高的求助完成率。 对每一个文献求助,科研通都将尽心尽力,给求助人一个满意的交代。
实时播报
Pwg完成签到,获得积分10
1秒前
Sampson完成签到,获得积分10
1秒前
小吴完成签到,获得积分10
1秒前
1秒前
实验室的篮球运动员完成签到,获得积分10
1秒前
2秒前
xiaominza完成签到,获得积分10
2秒前
年轻的路人完成签到,获得积分10
2秒前
勤奋花瓣完成签到 ,获得积分10
2秒前
3秒前
不必要再讨论适合与否完成签到,获得积分0
3秒前
234445完成签到,获得积分10
4秒前
山南栀发布了新的文献求助10
5秒前
wy完成签到,获得积分10
5秒前
0_o完成签到,获得积分10
5秒前
一条咸瑜完成签到 ,获得积分10
5秒前
愉快涵阳完成签到,获得积分20
6秒前
景平完成签到,获得积分10
6秒前
6秒前
和尚哥完成签到,获得积分10
7秒前
aeiou完成签到,获得积分10
7秒前
若枫完成签到 ,获得积分10
8秒前
hsf完成签到,获得积分10
8秒前
8秒前
陈开心完成签到,获得积分10
9秒前
10秒前
10秒前
ShiyuZuo完成签到,获得积分10
10秒前
迷路的忆之完成签到,获得积分10
10秒前
Sun完成签到,获得积分10
11秒前
无色热带鱼完成签到,获得积分10
11秒前
小禧发布了新的文献求助10
11秒前
清璃发布了新的文献求助20
11秒前
12秒前
12秒前
江边鸟完成签到 ,获得积分10
13秒前
13秒前
13秒前
14秒前
HYD完成签到 ,获得积分10
14秒前
高分求助中
(应助此贴封号)【重要!!请各用户(尤其是新用户)详细阅读】【科研通的精品贴汇总】 10000
Kinesiophobia : a new view of chronic pain behavior 2000
Burger's Medicinal Chemistry, Drug Discovery and Development, Volumes 1 - 8, 8 Volume Set, 8th Edition 1800
Cronologia da história de Macau 1600
文献PREDICTION EQUATIONS FOR SHIPS' TURNING CIRCLES或期刊Transactions of the North East Coast Institution of Engineers and Shipbuilders第95卷 1000
BRITTLE FRACTURE IN WELDED SHIPS 1000
Lloyd's Register of Shipping's Approach to the Control of Incidents of Brittle Fracture in Ship Structures 1000
热门求助领域 (近24小时)
化学 材料科学 医学 生物 工程类 有机化学 纳米技术 计算机科学 化学工程 生物化学 物理 复合材料 内科学 催化作用 物理化学 光电子学 细胞生物学 基因 电极 遗传学
热门帖子
关注 科研通微信公众号,转发送积分 6144115
求助须知:如何正确求助?哪些是违规求助? 7971285
关于积分的说明 16554746
捐赠科研通 5256263
什么是DOI,文献DOI怎么找? 2806451
邀请新用户注册赠送积分活动 1787006
关于科研通互助平台的介绍 1656380