In this paper, we investigate an online berth allocation problem, where vessels arrive one by one and their information is revealed upon arrival. Our objective is to design online algorithms to minimize the maximum load of all berths (makespan). We first demonstrate that the widely used Greedy algorithm has a very poor theoretical guarantee; specifically, the competitive ratio of the Greedy algorithm for this problem is lower...

To ensure the safety and energy efficiency of autonomous sampling operations for a deep-sea landing vehicle (DSLV), the Safety Energy-Dynamic Window Approach (SE-DWA) algorithm was proposed. The safety assessment sub-function formed from the warning obstacle zone and safety factor addresses the safety issue arising from the excessive range measurement error of forward-looking sonar. The trajectory comparison evaluation sub-fun...