Path planning method for automatic container terminal vehicles

The invention discloses a path planning method for automatic container terminal vehicles. The method comprises the steps of decomposing a path planning problem into a main problem and a sub-problem, and solving the main problem and the sub-problem by adopting different algorithms, i.e., the main pro...

Full description

Saved in:
Bibliographic Details
Main Authors BU RENJIE, GUO KUNLUN, ZHU JIN, WANG JIA, ZHOU HONG, SHEN LEI
Format Patent
LanguageChinese
English
Published 21.02.2020
Subjects
Online AccessGet full text

Cover

More Information
Summary:The invention discloses a path planning method for automatic container terminal vehicles. The method comprises the steps of decomposing a path planning problem into a main problem and a sub-problem, and solving the main problem and the sub-problem by adopting different algorithms, i.e., the main problem adopts a framework of a branch pricing algorithm, and the sub-problem is solved by adopting a genetic algorithm. According to the method, the branch pricing algorithm and the genetic algorithm are combined, the efficiency of the algorithm is effectively improved while the quality of the solution is guaranteed, and the solution of the problem can be obtained within the shorter time. 本发明公开了一种自动化集装箱码头车辆的路径规划方法,将路径规划问题分解为主问题和子问题,并对主问题和子问题采用不同的算法求解,即主问题采用分支定价算法的框架,子问题采用遗传算法求解。本发明将分支定价算法与遗传算法结合起来,在保证解的质量的同时,有效提高了算法的效率,能够在较短的时间内得到问题的解。
Bibliography:Application Number: CN201911180062