scholarly journals Beam Search Algorithm for Ship Anti-Collision Trajectory Planning

Sensors ◽  
2019 ◽  
Vol 19 (24) ◽  
pp. 5338 ◽  
Author(s):  
Joanna Karbowska-Chilinska ◽  
Jolanta Koszelew ◽  
Krzysztof Ostrowski ◽  
Piotr Kuczynski ◽  
Eric Kulbiej ◽  
...  

The biggest challenges in the maritime environment are accidents and excessive fuel consumption. In order to improve the safety of navigation at sea and to reduce fuel consumption, the strategy of anti-collision, shortest trajectory planning is proposed. The strategy described in this paper is based on the beam search method. The beam search algorithm (BSA) takes into account many safe trajectories for the present ship and chooses the best in terms of length and other criteria. The risk of collision of present ship with any target ships is detected when the closest point of approach (CPA) of the present ship is violated by the target ship’s planned trajectory. Only course alteration of the present ship is applied, and not speed alteration. The algorithm has been implemented in the decision support system NAVDEC and tested in a real navigation environment on the m/f Wolin, a Polish ferry. Almost all BSA trajectories calculated were shorter in comparison to the standard NAVDEC-calculated algorithm.

Sensors ◽  
2020 ◽  
Vol 20 (15) ◽  
pp. 4115
Author(s):  
Jolanta Koszelew ◽  
Joanna Karbowska-Chilinska ◽  
Krzysztof Ostrowski ◽  
Piotr Kuczyński ◽  
Eric Kulbiej ◽  
...  

A single anti-collision trajectory generation problem for an “own” vessel only is significantly different from the challenge of generating a whole set of safe trajectories for multi-surface vehicle encounter situations in the open sea. Effective solutions for such problems are needed these days, as we are entering the era of autonomous ships. The article specifies the problem of anti-collision trajectory planning in many-to-many encounter situations. The proposed original multi-surface vehicle beam search algorithm (MBSA), based on the beam search strategy, solves the problem. The general idea of the MBSA involves the application of a solution for one-to-many encounter situations (using the beam search algorithm, BSA), which was tested on real automated radar plotting aid (ARPA) and automatic identification system (AIS) data. The test results for the MBSA were from simulated data, which are discussed in the final part. The article specifies the problem of anti-collision trajectory planning in many-to-many encounter situations involving moving autonomous surface vehicles, excluding Collision Regulations (COLREGs) and vehicle dynamics.


2019 ◽  
Vol 9 (1) ◽  
pp. 2-11
Author(s):  
Marina Efthymiou ◽  
Frank Fichert ◽  
Olaf Lantzsch

Abstract. The paper examines the workload perceived by air traffic control officers (ATCOs) and pilots during continuous descent operations (CDOs), applying closed- and open-path procedures. CDOs reduce fuel consumption and noise emissions. Therefore, they are supported by airports as well as airlines. However, their use often depends on pilots asking for CDOs and controllers giving approval and directions. An adapted NASA Total Load Index (TLX) was used to measure the workload perception of ATCOs and pilots when applying CDOs at selected European airports. The main finding is that ATCOs’ workload increased when giving both closed- and open-path CDOs, which may have a negative impact on their willingness to apply CDOs. The main problem reported by pilots was insufficient distance-to-go information provided by ATCOs. The workload change is important when considering the use of CDOs.


Author(s):  
Umit Can ◽  
Bilal Alatas

The classical optimization algorithms are not efficient in solving complex search and optimization problems. Thus, some heuristic optimization algorithms have been proposed. In this paper, exploration of association rules within numerical databases with Gravitational Search Algorithm (GSA) has been firstly performed. GSA has been designed as search method for quantitative association rules from the databases which can be regarded as search space. Furthermore, determining the minimum values of confidence and support for every database which is a hard job has been eliminated by GSA. Apart from this, the fitness function used for GSA is very flexible. According to the interested problem, some parameters can be removed from or added to the fitness function. The range values of the attributes have been automatically adjusted during the time of mining of the rules. That is why there is not any requirements for the pre-processing of the data. Attributes interaction problem has also been eliminated with the designed GSA. GSA has been tested with four real databases and promising results have been obtained. GSA seems an effective search method for complex numerical sequential patterns mining, numerical classification rules mining, and clustering rules mining tasks of data mining.


Mathematics ◽  
2020 ◽  
Vol 8 (11) ◽  
pp. 1970
Author(s):  
Jun-Kyu Park ◽  
Suwoong Lee ◽  
Aaron Park ◽  
Sung-June Baek

In spectroscopy, matching a measured spectrum to a reference spectrum in a large database is often computationally intensive. To solve this problem, we propose a novel fast search algorithm that finds the most similar spectrum in the database. The proposed method is based on principal component transformation and provides results equivalent to the traditional full search method. To reduce the search range, hierarchical clustering is employed, which divides the spectral data into multiple clusters according to the similarity of the spectrum, allowing the search to start at the cluster closest to the input spectrum. Furthermore, a pilot search was applied in advance to further accelerate the search. Experimental results show that the proposed method requires only a small fraction of the computational complexity required by the full search, and it outperforms the previous methods.


2020 ◽  
Vol 2020 ◽  
pp. 1-10
Author(s):  
Shan Fang ◽  
Lan Yang ◽  
Tianqi Wang ◽  
Shoucai Jing

Traffic lights force vehicles to stop frequently at signalized intersections, which leads to excessive fuel consumption, higher emissions, and travel delays. To address these issues, this study develops a trajectory planning method for mixed vehicles at signalized intersections. First, we use the intelligent driver car-following model to analyze the string stability of traffic flow upstream of the intersection. Second, we propose a mixed-vehicle trajectory planning method based on a trigonometric model that considers prefixed traffic signals. The proposed method employs the proportional-integral-derivative (PID) model controller to simulate the trajectory when connected vehicles (equipped with internet access) follow the optimal advisory speed. Essentially, only connected vehicle trajectories need to be controlled because normal vehicles simply follow the connected vehicles according to the Intelligent Driver Model (IDM). The IDM model aims to minimize traffic oscillation and ensure that all vehicles pass the signalized intersection without stopping. The results of a MATLAB simulation indicate that the proposed method can reduce fuel consumption and NOx, HC, CO2, and CO concentrations by 17%, 22.8%, 17.8%, 17%, and 16.9% respectively when the connected vehicle market penetration is 50 percent.


Author(s):  
Aleksandar Stevanovic ◽  
Jelka Stevanovic ◽  
Kai Zhang ◽  
Stuart Batterman

Sign in / Sign up

Export Citation Format

Share Document