Non-deterministic Algorithms
Non-deterministic Algorithms
- New search for: Lazarowska, Agnieszka
- New search for: Lazarowska, Agnieszka
This chapter covers a description of non-deterministic algorithms for ship safe trajectory planning. A non-deterministic algorithm can return a different solution for every run of calculations with the same input data. A stochastic algorithm is a type of a non-deterministic algorithm, which applies some probabilistic operations. Population-based stochastic algorithms are applying some probabilistic operations to a population of individuals, constituting candidate solutions in order to obtain the best solution to the considered problem. These methods are mostly inspired by the behavior of animals and other organisms, therefore are classified as nature-inspired algorithms, commonly categorized as heuristics. A heuristic is a technique composed of a rule or a set of rules, which seeks for a good solution to the considered problem in a reasonable amount of time. A heuristic does not guarantee the achievement of an optimal solution. It is aimed at the reception of an acceptable, near-optimal solution. In this chapter two of such approaches will be presented with the application to ship safe trajectory planning. These are: Ant Colony Optimization (Sect. 5.1) and Evolutionary Algorithms (Sect. 5.2).
Document information
Non-deterministic Algorithms
Springer Ser.Naval Architect., Marine Engineer., Shipbuilding, Shipping
2022-03-26
14 pages
Article/Chapter (Book)
Electronic Resource
English
Similar titles
| 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