This chapter includes a description of safe trajectory planning algorithms for ships classified as deterministic methods, which are characterized by a feature of solution repeatability for every run of calculations with the same input data. This characteristic results from their operation principle. A deterministic algorithm is constructed in such a way, that it always performs a set of precisely defined steps in order to find a solution. Among algorithms described in this chapter are the following methods: the Trajectory Base Algorithm (Sect. 4.1), graph search methods—the Discrete Artificial Potential Field algorithm (Sect. 4.2), the Wave-Front algorithm (Sect. 4.3) and the Visibility Graph search Algorithm (Sect. 4.4), the Dynamic Programming approach (Sect. 4.5) and Local Search (Sect. 4.6). The last method sometimes can be classified to non-deterministic approaches instead of deterministic ones. It will happen when the local search algorithm applies probabilistic operations.
Deterministic Algorithms
Springer Ser.Naval Architect., Marine Engineer., Shipbuilding, Shipping
2022-03-26
26 pages
Aufsatz/Kapitel (Buch)
Elektronische Ressource
Englisch
Springer Verlag | 2022
|Two Deterministic Half-Quadratic Regularization Algorithms for Computed Imaging
British Library Conference Proceedings | 1994
|Deterministic and Probabilistic Conflict Detection Algorithms for NextGen Airport Surface Operations
British Library Conference Proceedings | 2012
|Combining Genetic and Deterministic Algorithms for Locating Actuators on Space Structures
Online Contents | 1996
|