The authors propose a topological analysis of large urban street networks based on a computational and functional graph representation. This representation gives a functional view in which vertices represent named streets and edges represent street intersections. A range of graph measures, including street connectivity, average path length, and clustering coefficient, are computed for structural analysis. In order to characterise different clustering degrees of streets in a street network they generalise the clustering coefficient to a k-clustering coefficient that takes into account k neighbours. Based on validations applied to three cities, the authors show that large urban street networks form small-world networks but exhibit no scale-free property.

This research introduces a path planning method based on the geometric A-star algorithm. The whole approach is applied to an Automated Guided Vehicle (AGV) in order to avoid the problems of many nodes, long-distance and large turning angle, and these problems usually exist in the sawtooth and cross paths produced by the traditional A-star algorithm. First, a grid method models a port environment. Second, the nodes in the close-list are filtered by the functions P(x,y ) and W(x,y ) and the nodes that do not meet the requirements are removed to avoid the generation of irregular paths. Simultaneously, to enhance the stability of the AGV regarding turning paths, the polyline at the turning path is replaced by a cubic B-spline curve. The path planning experimental results applied to different scenarios and different specifications showed that compared with other seven different algorithms, the geometric A-star algorithm reduces the number of nodes by 10% ~ 40%, while the number of turns is reduced by 25%, the turning angle is reduced by 33.3%, and the total distance is reduced by 25.5%. Overall, the simulation results of the path planning confirmed the effectiveness of the geometric A-star algorithm.

Ship trajectory prediction is a key requisite for maritime navigation early warning and safety, but accuracy and computation efficiency are major issues still to be resolved. The research presented in this paper introduces a deep learning framework and a Gate Recurrent Unit (GRU) model to predict vessel trajectories. First, series of trajectories are extracted from Automatic Identification System (AIS) ship data (i.e., longitude, latitude, speed, and course). Secondly, main trajectories are derived by applying the Density-Based Spatial Clustering of Applications with Noise (DBSCAN) algorithm. Next, a trajectory information correction algorithm is applied based on a symmetric segmented-path distance to eliminate the influence of a large number of redundant data and to optimize incoming trajectories. A recurrent neural network is applied to predict real-time ship trajectories and is successively trained. Ground truth data from AIS raw data in the port of Zhangzhou, China were used to train and verify the validity of the proposed model. Further comparison was made with the Long Short-Term Memory (LSTM) network. The experiments showed that the ship’s trajectory prediction method can improve computational time efficiency even though the prediction accuracy is similar to that of LSTM.