arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2501.06583cs.CEcs.SYeess.SY
收藏

优化轮式装载机性能——一种端到端方法

Optimizing wheel loader performance -- an end-to-end approach

Koji Aoshima, Eddie Wadbro, Martin Servin

AI总结:

研究轮式装载机自动化装载的端到端优化方法,利用深度神经网络世界模型预测土堆状态,通过前瞻树搜索优化动作序列,比贪婪策略和固定控制器效率分别提升6%和14%。

摘要:

矿山和建筑工地的轮式装载机反复从土堆装载土壤以装载接收者。自动化此任务带来了一个具有挑战性的规划问题,因为每次装载的性能取决于土堆状态,而土堆状态又取决于之前的装载。我们研究了一种端到端优化方法,考虑了未来的装载结果以及土堆与接收者之间的运输成本。为了预测土堆状态的演变和装载性能,我们使用了世界模型,这些模型利用在大量模拟装载周期上训练的深度神经网络。前瞻树搜索通过评估数千个动作候选者的性能来优化装载动作序列,这些候选者在预测的土堆状态下递归地扩展为后续动作候选者。测试结果表明,在15次连续装载的范围内,前瞻树搜索比贪婪策略(始终选择最大化当前单次装载性能的动作)效率高6%,比针对标称情况优化的固定装载控制器效率高14%。

英文摘要:

Wheel loaders in mines and construction sites repeatedly load soil from a pile to load receivers. Automating this task presents a challenging planning problem since each loading's performance depends on the pile state, which depends on previous loadings. We investigate an end-to-end optimization approach considering future loading outcomes and transportation costs between the pile and load receivers. To predict the evolution of the pile state and the loading performance, we use world models that leverage deep neural networks trained on numerous simulated loading cycles. A look-ahead tree search optimizes the sequence of loading actions by evaluating the performance of thousands of action candidates, which expand into subsequent action candidates under the predicted pile states recursively. Test results demonstrate that, over a horizon of 15 sequential loadings, the look-ahead tree search is 6% more efficient than a greedy strategy, which always selects the action that maximizes the current single loading performance, and 14% more efficient than using a fixed loading controller optimized for the nominal case.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑