arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2303.01448eess.SYcs.SY
收藏

自动化仓库中拓扑、调度和路径规划的协同设计

Co-Design of Topology, Scheduling, and Path Planning in Automated Warehouses

Christopher Leet, Chanwook Oh, Michele Lora, Sven Koenig, Pierluigi Nuzzo

摘要:

我们解决自动化仓库中的仓库服务问题(WSP),该问题使用移动代理团队将产品从货架带到包装站。给定一个产品列表,WSP相当于为一个代理团队找到一个计划,在给定的时间范围内将列表上的每个产品带到一个站点。WSP由四个子问题组成,涉及执行什么任务(任务制定),谁将执行它们(任务分配),何时(调度)和如何(路径规划)执行它们。这些子问题单独是NP难的,组合起来更具挑战性。WSP的难度因自动化仓库的规模而加剧,自动化仓库经常使用数百名代理人的团队。在本文中,我们提出了一种方法,可以解决WSP在这样的规模。我们介绍了一种新的,基于合同的设计框架,分解成交通系统组件的自动化仓库。通过为这些组件中的每一个分配一个描述它可以支持的流量流的合同,我们可以合成满足给定WSP实例的流量流。明智的搜索为基础的路径规划,然后将此交通流转化为一个计划离散代理在一个模块化的方式。评价表明,该方法可以解决实际自动化仓库上的WSP实例。

英文摘要:

We address the warehouse servicing problem (WSP) in automated warehouses, which use teams of mobile agents to bring products from shelves to packing stations. Given a list of products, the WSP amounts to finding a plan for a team of agents which brings every product on the list to a station within a given timeframe. The WSP consists of four subproblems, concerning what tasks to perform (task formulation), who will perform them (task allocation), and when (scheduling) and how (path planning) to perform them. These subproblems are NP-hard individually and become more challenging in combination. The difficulty of the WSP is compounded by the scale of automated warehouses, which frequently use teams of hundreds of agents. In this paper, we present a methodology that can solve the WSP at such scales. We introduce a novel, contract-based design framework which decomposes an automated warehouse into traffic system components. By assigning each of these components a contract describing the traffic flows it can support, we can synthesize a traffic flow satisfying a given WSP instance. Component-wise search-based path planning is then used to transform this traffic flow into a plan for discrete agents in a modular way. Evaluation shows that this methodology can solve WSP instances on real automated warehouses.

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

↑