A single anti-collision trajectory generation problem for an “own” vessel only is significantly different from the challenge of generating a whole set of safe trajectories for multi-surface vehicle encounter situations in the open sea. Effective solutions for such problems are needed these days, as we are entering the era of autonomous ships. The article specifies the problem of anti-collision trajectory planning in many-to-many encounter situations. The proposed original multi-surface vehicle beam search algorithm (MBSA), based on the beam search strategy, solves the problem. The general idea of the MBSA involves the application of a solution for one-to-many encounter situations (using the beam search algorithm, BSA), which was tested on real automated radar plotting aid (ARPA) and automatic identification system (AIS) data. The test results for the MBSA were from simulated data, which are discussed in the final part. The article specifies the problem of anti-collision trajectory planning in many-to-many encounter situations involving moving autonomous surface vehicles, excluding Collision Regulations (COLREGs) and vehicle dynamics.

The biggest challenges in the maritime environment are accidents and excessive fuel consumption. In order to improve the safety of navigation at sea and to reduce fuel consumption, the strategy of anti-collision, shortest trajectory planning is proposed. The strategy described in this paper is based on the beam search method. The beam search algorithm (BSA) takes into account many safe trajectories for the present ship and chooses the best in terms of length and other criteria. The risk of collision of present ship with any target ships is detected when the closest point of approach (CPA) of the present ship is violated by the target ship’s planned trajectory. Only course alteration of the present ship is applied, and not speed alteration. The algorithm has been implemented in the decision support system NAVDEC and tested in a real navigation environment on the m/f Wolin, a Polish ferry. Almost all BSA trajectories calculated were shorter in comparison to the standard NAVDEC-calculated algorithm.

The Orienteering Problem with Time Windows (OPTW) is an optimisation NP-hard problem. This paper proposes a hybrid genetic algorithm (GAPR) for approximating a solution to the OPTW. Instead of a crossover we use a path relinking (PR) strategy as a form of intensification solution. PR generates a new solution by exploring trajectories between two random solutions: genes not present in one solution are included in the other one. Experiments performed on popular benchmark instances show that the proposed GAPR gives good quality solutions using short computing times. Moreover, GAPR gives new best solutions for some test instances.