Avoidance of collisions at sea is crucial to navigational safety. In this paper, we use a distributed algorithm to communicate the entire collision avoidance trajectory information for each ship. In each communication, we suggest a new improvement function considering safety and efficiency to identify the avoidance ship in each cycle. Considering the nonlinear collision avoidance trajectory of ships, a new method for calculating the degree of danger using a velocity obstacle algorithm is proposed. Therefore, in each communication, each ship considers the avoidance behaviours of other ships in planning its avoidance trajectory. Additionally, we combine bi-criterion evolution (BCE) and the ant lion optimiser to plan the entire collision avoidance path. Three scenarios are designed to demonstrate the performance of this method. The results show that the proposed method can find a suitable collision-free solution for all ships.

An S-R-S (Spherical-Revolute-Spherical) redundant manipulator is similar to a human arm and is often used to perform dexterous tasks. To solve the inverse kinematics analytically, the arm-angle was usually used to parameterise the self-motion. However, the previous studies have had shortcomings; some methods cannot avoid algorithm singularity and some are unsuitable for configuration control because they use a temporary reference plane. In this paper, we propose a method of analytical inverse kinematics resolution based on dual arm-angle parameterisation. By making use of two orthogonal vectors to define two absolute reference planes, we obtain two arm angles that satisfy a specific condition. The algorithm singularity problem is avoided because there is always at least one arm angle to represent the redundancy. The dual arm angle method overcomes the shortcomings of traditional methods and retains the advantages of the arm angle. Another contribution of this paper is the derivation of the absolute reference attitude matrix, which is the key to the resolution of analytical inverse kinematics but has not been previously addressed. The simulation results for typical cases that include the algorithm singularity condition verified our method.