Ship Collaborative Path Planning Method Based on CS-STHA
نویسندگان
چکیده
Ship path planning is one of the key technologies for ship automation. Establishing a cooperative collision avoidance (CA) multi-ship encounters great value to maritime intelligent transportation. This study aims solve problem collaborative based on algorithm Conflict Search (CS) and Space-Time Hybrid A-star (STHA). First, static CA searched each by using space-time algorithm, conflict risk area determined according safety distance constraint fuzzy Collision Risk Index (CRI). Secondly, introduced into scheme, binary tree used search an optimal navigation with no low cost. In addition, smoothed cubic interpolation make consistent actual practice maneuvering characteristics. Finally, considering constraints International Regulations Preventing Collisions at Sea (COLREGs), typical two-ship encounter scenarios are designed simulated verify effectiveness proposed method. Furthermore, comparative analysis CS-STHA also carried out. The results indicate that in can obtain effectively provide reference decision-making autonomous ships.
منابع مشابه
Robot Path Planning Method Based on Improved Genetic Algorithm
This paper presents an improved genetic algorithm for mobile robot path planning. The algorithm uses artificial potential method to establish the initial population, and increases value weights in the fitness function, which increases the controllability of robot path length and path smoothness. In the new algorithm, a flip mutation operator is added, which ensures the individual population col...
متن کاملCollaborative Inductive Logic Programming for Path Planning
In distributed systems, learning does not necessarily involve the participation of agents directly in the inductive process itself. Instead, many systems frequently employ multiple instances of induction separately. In this paper, we develop and evaluate a new approach for learning in distributed systems that tightly integrates processes of induction between agents, based on inductive logic pro...
متن کاملPSO-Based Path Planning Algorithm for Humanoid Robots Considering Safety
In this paper we introduce an improvement in the path planning algorithm for the humanoid soccer playing robot which uses Ferguson splines and PSO (Particle Swarm Optimization). The objective of the algorithm is to find a path through other playing robots to the ball, which should be as short as possible and also safe enough. Ferguson splines create preliminary paths using random generated para...
متن کاملA Stochastic Optimization Method for Energy-Based Path Planning
We present a novel stochastic optimization method to compute energy–optimal paths, among all time–optimal paths, for vehicles traveling in dynamic unsteady currents. The method defines a stochastic class of instantaneous nominal vehicle speeds and then obtains the energy–optimal paths within the class by minimizing the total time– integrated energy usage while still satisfying the strong–constr...
متن کاملWave front Method Based Path Planning Algorithm for Mobile Robots
Path planning problem revolves around finding a path from start node to goal node without any collisions. This paper presents an improved version of Focused Wave Front Algorithm for mobile robot path planning in static 2D environment. Existing wave expansion algorithms either provide speed or optimality. We try to counter this problem by preventing the full expansion of the wave and expanding s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Marine Science and Engineering
سال: 2022
ISSN: ['2077-1312']
DOI: https://doi.org/10.3390/jmse10101504