arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2203.15360eess.SYcs.SYmath.OC
收藏

具有集装箱高度约束的起重机时间最优控制

Time-optimal control of cranes subject to container height constraints

Filipe Marques Barbosa, Johan Löfberg

摘要:

港口业务的生产力和效率在很大程度上取决于船舶装卸的速度。考虑到这一点,船岸起重机执行将集装箱运输到船上的关键任务,并且必须尽可能快地完成。虽然在以前的研究中已经解决了最小化移动有效载荷所花费的时间的问题,但是集装箱堆叠的不同高度并不是重点。在本文中,我们执行变量的变化和重新制定的优化问题,以处理堆栈高度的约束。因此,这些约束变得微不足道,很容易表示,因为它们变成边界约束时,问题是离散化的数值求解器。为了验证这个想法,我们模拟了一个小规模的场景,其中使用不同的堆栈高度。结果证实了我们的想法和堆栈约束的表示变得确实微不足道。这种方法有希望应用于实际的起重机操作,并有可能提高其自动化。

英文摘要:

The productivity and efficiency of port operations strongly depend on how fast a ship can be unloaded and loaded again. With this in mind, ship-to-shore cranes perform the critical task of transporting containers into and onto a ship and must do so as fast as possible. Though the problem of minimizing the time spent in moving the payload has been addressed in previous studies, the different heights of the container stacks have not been the focus. In this paper, we perform a change of variable and reformulate the optimization problem to deal with the constraints on the stack heights. As consequence, these constraints become trivial and easy to represent since they turn into bound constraints when the problem is discretized for the numerical solver. To validate the idea, we simulate a small-scale scenario where different stack heights are used. The results confirm our idea and the representation of the stack constraints become indeed trivial. This approach is promising to be applied in real crane operations and has the potential to enhance their automation.

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

↑