.png){kind=icon}
返回
Multi-vehicle refill scheduling with queueing
.png){kind=icon}
OA
AI
DOI：10.1016/j.compag.2017.11.014.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
We consider the problem of refill scheduling for a team of vehicles or robots that must contend for access to a single physical location for refilling. The objective is to minimise time spent in travelling to/from the refill station, and also time lost to queuing (waiting for access). In this paper, we present principled results for this problem in the context of agricultural operations. We first establish that the problem is NP-hard and prove that the maximum number of vehicles that can usefully work together is bounded. We then focus on the design of practical algorithms and present two solutions. The first is an exact algorithm based on dynamic programming that is suitable for small problem instances. The second is an approximate anytime algorithm based on the branch and bound approach that is suitable for large problem instances with many robots. We present simulated results of our algorithms for three classes of agricultural work that cover a range of operations: spot spraying, broadcast spraying and slurry application. We show that the algorithm is reasonably robust to inaccurate prediction of resource utilisation rate, which is difficult to estimate in cases such as spot application of herbicide for weed control, and validate its performance in simulation using realistic scenarios with up to 30 robots.
Keyword:
Agricultural robotics
Multi-robot systems
Multi-robot scheduling
Multi-vehicle scheduling
Refill scheduling
Queuing
Spot spraying
Broadcast spraying
Slurry application
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
8.9
论文数:
1.0W
被引数:
5.4W
机构
引用论文
A Variable Neighborhood Search Branching for the Electric Vehicle Routing Problem with Time WindowsOAAI
OAAI分享收藏Subgroup-specific structural variation across 1,000 medulloblastoma genomes1,000髓母细胞瘤基因组的亚组特异性结构变异.png)
NatureOAAI
NatureIF48.5
OAAI分享收藏
查看更多内容