arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2212.05412cs.AI
收藏

基于层次时态规划的动态提升机调度方法

A Hierarchical Temporal Planning-Based Approach for Dynamic Hoist Scheduling Problems

Sun Yat-Sen University(中山大学);Software Engineering Institute of Guangzhou(广州软件工程研究所)

Kebing Jin, Yingkai Xiao, Hankz Hankui Zhuo, Renyong Ma

摘要:

随着自主设备的发展,提升机调度已成为电镀行业应用的瓶颈。虽然有一些方法提出了针对具有挑战性的问题,他们通常不能扩展到大规模的调度问题。在本文中,我们制定了提升机调度问题作为一个新的时间规划问题的形式,适应PDDL,并提出了一种新的分层时间规划方法,有效地解决调度问题。此外,我们还提供了一系列真实的基准测试实例,可用于评估问题的解决方案。我们表明,所提出的方法是能够有效地找到高质量的解决方案,为大规模的现实生活中的基准实例,与国家的最先进的基线相比。

英文摘要:

Hoist scheduling has become a bottleneck in electroplating industry applications with the development of autonomous devices. Although there are a few approaches proposed to target at the challenging problem, they generally cannot scale to large-scale scheduling problems. In this paper, we formulate the hoist scheduling problem as a new temporal planning problem in the form of adapted PDDL, and propose a novel hierarchical temporal planning approach to efficiently solve the scheduling problem. Additionally, we provide a collection of real-life benchmark instances that can be used to evaluate solution methods for the problem. We exhibit that the proposed approach is able to efficiently find solutions of high quality for large-scale real-life benchmark instances, with comparison to state-of-the-art baselines.

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

↑