A RESEARCH ON TECHNIQUES, MODELS AND METHODS PROPOSED FOR SHIP COLLISION AVOIDANCE PATH PLANNING PROBLEM

2021 ◽  
Vol 160 (A2) ◽  
Author(s):  
R Fışkın ◽  
H Kişi ◽  
E Nasibov
Keyword(s):  
Path Planning ◽  
Collision Avoidance ◽  
Heuristic Algorithms ◽  
Planning Problem ◽  
Related Field ◽  
Marine Industry ◽  
Soft Computing Techniques ◽  
Ship Collision ◽  
Marine Safety ◽  
Path Planning Problem

The development of soft computing techniques in recent years has encouraged researchers to study on the path planning problem in ship collision avoidance. These techniques have widely been implemented in marine industry and technology-oriented novel solutions have been introduced. Various models, methods and techniques have been proposed to solve the mentioned path planning problem with the aim of preventing reoccurrence of the problem and thus strengthening marine safety as well as providing fuel consumption efficiency. The purpose of this study is to scrutinize the models, methods and technologies proposed to settle the path planning issue in ship collision avoidance. The study also aims to provide certain bibliometric information which develops a literature map of the related field. For this purpose, a thorough literature review has been carried out. The results of the study have pointedly showed that the artificial intelligence methods, fuzzy logic and heuristic algorithms have greatly been used by the researchers who are interested in the related field.

A Research on Techniques, Models and Methods Proposed for Ship Collision Avoidance Path Planning Problem

2018 ◽  
Vol Vol 160 (A2) ◽  
Author(s):  
R Fışkın ◽  
H Kişi ◽  
E Nasibov
Keyword(s):  
Path Planning ◽  
Collision Avoidance ◽  
Heuristic Algorithms ◽  
Planning Problem ◽  
Related Field ◽  
Marine Industry ◽  
Soft Computing Techniques ◽  
Ship Collision ◽  
Marine Safety ◽  
Path Planning Problem

The development of soft computing techniques in recent years has encouraged researchers to study on the path planning problem in ship collision avoidance. These techniques have widely been implemented in marine industry and technology-oriented novel solutions have been introduced. Various models, methods and techniques have been proposed to solve the mentioned path planning problem with the aim of preventing reoccurrence of the problem and thus strengthening marine safety as well as providing fuel consumption efficiency. The purpose of this study is to scrutinize the models, methods and technologies proposed to settle the path planning issue in ship collision avoidance. The study also aims to provide certain bibliometric information which develops a literature map of the related field. For this purpose, a thorough literature review has been carried out. The results of the study have pointedly showed that the artificial intelligence methods, fuzzy logic and heuristic algorithms have greatly been used by the researchers who are interested in the related field.

scholarly journals Decentralized Path Planning for Multi-Objective Robot Swarm System

2021 ◽  
Vol 2113 (1) ◽  
pp. 012002
Author(s):  
Zhuokai Wu
Keyword(s):  
Path Planning ◽  
Obstacle Avoidance ◽  
Heuristic Algorithms ◽  
Optimization Problems ◽  
Planning Problem ◽  
Robot Swarm ◽  
Planning Algorithm ◽  
Path Planning Algorithm ◽  
Path Planning Problem ◽  
Multi Robot

Abstract The multi-robot path planning aims to explore a set of non-colliding paths with the shortest sum of lengths for multiple robots. The most popular approach is to artificially decompose the map into discrete small grids before applying heuristic algorithms. To solve the path planning in continuous environments, we propose a decentralized two-stage algorithm to solve the path-planning problem, where the obstacle and inter-robot collisions are both considered. In the first stage, an obstacle- avoidance path-planning problem is mathematically developed by minimizing the travel length of each robot. Specifically, the obstacle-avoidance trajectories are generated by approximating the obstacles as convex-concave constraints. In the second stage, with the given trajectories, we formulate a quadratic programming (QP) problem for velocity control using the control barrier and Lyapunov function (CBF-CLF). In this way, the multi-robot collision avoidance as well as time efficiency are satisfied by adapting the velocities of robots. In sharp contrast to the conventional heuristic methods, path length, smoothness and safety are fully considered by mathematically formulating the optimization problems in continuous environments. Extensive experiments as well as computer simulations are conducted to validate the effectiveness of the proposed path-planning algorithm.

Comparison of Single and Multi-Population Evolutionary Algorithm for Path Planning in Navigation Situation

2013 ◽  
Vol 210 ◽  
pp. 166-177 ◽  
Author(s):  
Łukasz Kuczkowski ◽  
Roman Śmierzchalski
Keyword(s):  
Path Planning ◽  
Evolutionary Algorithm ◽  
Collision Avoidance ◽  
Fitness Function ◽  
Graphical Form ◽  
Planning Problem ◽  
Avoidance Situation ◽  
Time Simulation ◽  
The Individual ◽  
Path Planning Problem

In this paper a comparison of single and multi-population evolutionary algorithm is presented. Tested algorithms are used to determine close to optimal ship paths in collision avoidance situation. For this purpose a path planning problem is defined. A specific structure of the individual path and fitness function is presented. Principle of operation of single-population and multi-population evolutionary algorithm is described. Using presented algorithms the simulations on three close to real sea environments were performed. Regardless of the test situation constant time simulation was maintained. Obtained results are presented in graphical form (sequences of successive stages of the simulation) and in form of table in which the values of fitness function for best individual in each simulation were compared. Undertaken research allow to select evolutionary algorithm that, assuming constant simulation time, will determine a better path in close to real collision avoidance situation at sea.

Solving the multi-objective path planning problem in mobile robotics with a firefly-based approach

2015 ◽  
Vol 21 (4) ◽  
pp. 949-964 ◽  
Author(s):  
Alejandro Hidalgo-Paniagua ◽  
Miguel A. Vega-Rodríguez ◽  
Joaquín Ferruz ◽  
Nieves Pavón
Keyword(s):  
Path Planning ◽  
Mobile Robotics ◽  
Planning Problem ◽  
Multi Objective ◽  
Path Planning Problem

Collision-Free Motion Planning for an Aligned Multiple-turret System Operating in Extreme Environment

Robotica ◽  
2021 ◽  
pp. 1-30
Author(s):  
Ümit Yerlikaya ◽  
R.Tuna Balkan
Keyword(s):  
Path Planning ◽  
Extreme Environment ◽  
Configuration Spaces ◽  
Planning Problem ◽  
Different Types ◽  
Planning Algorithm ◽  
Line Path ◽  
Path Planning Algorithm ◽  
Path Planning Problem ◽  
System Operating

Abstract Instead of using the tedious process of manual positioning, an off-line path planning algorithm has been developed for military turrets to improve their accuracy and efficiency. In the scope of this research, an algorithm is proposed to search a path in three different types of configuration spaces which are rectangular-, circular-, and torus-shaped by providing three converging options named as fast, medium, and optimum depending on the application. With the help of the proposed algorithm, 4-dimensional (D) path planning problem was realized as 2-D + 2-D by using six sequences and their options. The results obtained were simulated and no collision was observed between any bodies in these three options.

Path Planning for Spheres in Three Dimensional Environments With Low Interference Index

1994 ◽  
Author(s):  
Duane W. Storti ◽  
Debasish Dutta
Keyword(s):  
Path Planning ◽  
Free Path ◽  
Configuration Space ◽  
Local Knowledge ◽  
Three Dimensional ◽  
Target Point ◽  
Planning Problem ◽  
Spherical Object ◽  
Starting Point ◽  
Path Planning Problem

Abstract We consider the path planning problem for a spherical object moving through a three-dimensional environment composed of spherical obstacles. Given a starting point and a terminal or target point, we wish to determine a collision free path from start to target for the moving sphere. We define an interference index to count the number of configuration space obstacles whose surfaces interfere simultaneously. In this paper, we present algorithms for navigating the sphere when the interference index is ≤ 2. While a global calculation is necessary to characterize the environment as a whole, only local knowledge is needed for path construction.

ON THE PATH PLANNING PROBLEM IN THE VICINITY OF OBSTACLES

1998 ◽  
Vol 29 (8) ◽  
pp. 807-868 ◽  
Author(s):  
ALBERT Y. ZOMAYA MATT R. WRIGHT TAR
Keyword(s):  
Path Planning ◽  
Planning Problem ◽  
Path Planning Problem
Sign in / Sign up

Export Citation Format

Share Document