A Trajectory-Oriented Carriageway-Based Road Network Data Model, Part 1: Background

This is the first of a three-part series of pape rs which introduces a general background of building trajectory-oriented road net work data models, including motivation, related works, and basic concepts. The p urpose of the series is to develop a trajectory-oriented road network data mode l, namely carriageway-based road network data model (CRNM). Part 1 deals with t he modeling background. Part 2 proposes the principle and architecture of the CR NM. Part 3 investigates the implementation of the CRNM in a case study. In the p resent paper, the challenges of managing trajectory data are discussed. Then, de veloping trajectory-oriented road network data models is proposed as a solution and existing road network data models are reviewed. Basic representation approa ches of a road network are introduced as well as its constitution.

A Trajectory-Oriented, Carriageway-Based Road Network Data Model,Part 2:Methodology

This is the second of a three-part series of papers which presents the principle and architecture of the CRNM, a trajectory-oriented, carriageway-based road network data model. The first part of the series has introduced a general background of building trajectory-oriented road network data models, including motivation, related works, and basic concepts. Based on it, this paper describs the CRNM in detail. At first, the notion of basic roadway entity is proposed and discussed. Secondly, carriageway is selected as the basic roadway entity after compared with other kinds of roadway, and approaches to representing other roadways with carriageways are introduced. At last, an overall architecture of the CRNM is proposed.

A Trajectory-Oriented Carriageway-Based Road Network Data Model, Part 3: Implementation

This is the final of a three-part series of papers which mainly discusses the implementation issues of the CRNM. The first two papers in the series have introduced the modeling background and methodology, respectively. An overall architecture of the CRNM has been proposed in the last paper. On the basis of the above discusses, a linear reference method (LRM) for providing spatial references for location points of a trajectory is developed. A case study is introduced to illustrate the application of the CRNM for modeling a road network in the real world is given. A comprehensive conclusion is given for the series of papers.

Identifying Anomaly Aircraft Trajectories in Terminal Areas Based on Deep Autoencoder and Its Application in Trajectory Clustering

Anomalous trajectory detection and traffic flow classification for complicated airspace are of vital importance to safety and efficiency analysis.Some researchers employed density-based unsupervised machine learning method to exploit these trajectories related to air traffic control(ATC)actions.However,the quality of position data and the tiny density difference between traffic flows in the terminal area make it particularly challenging.To alleviate these two challenges,this paper proposes a novel framework which combines robust deep auto-encoder(RDAE)model and density peak(DP)clustering algorithm.Specifically,the RDAE model is utilized to reconstruct denoising trajectory and identify anomaly trajectories in the terminal area by two different regularizations.Then,the nonlinear components captured by the encoder of RDAE are input in the DP algorithm to classify the global traffic flows.An experiment on a terminal airspace at Guangzhou Baiyun Airport(ZGGG)with anomaly label shows that the proposed combination can automatically capture non-conventional spatiotemporal traffic patterns in the aircraft movement.The superiority of RDAE and combination are also demonstrated by visualizing and quantitatively evaluating the experimental results.

Efficient and Effective 4D Trajectory Data Cleansing

As the rapid development of aviation industry and newly emerging crowd-sourcing projects such as Flightradar24 and FlightAware,large amount of air traffic data,particularly four-dimension(4D)trajectory data,have become available for the public.In order to guarantee the accuracy and reliability of results,data cleansing is the first step in analyzing 4D trajectory data,including error identification and mitigation.Data cleansing techniques for the 4D trajectory data are investigated.Back propagation(BP)neural network algorithm is applied to repair errors.Newton interpolation method is used to obtain even-spaced trajectory samples over a uniform distribution of each flight’s 4D trajectory data.Furthermore,a new method is proposed to compress data while maintaining the intrinsic characteristics of the trajectories.Density-based spatial clustering of applications with noise(DBSCAN)is applied to identify remaining outliers of sample points.Experiments are performed on a data set of one-day 4D trajectory data over Europe.The results show that the proposed method can achieve more efficient and effective results than the existing approaches.The work contributes to the first step of data preprocessing and lays foundation for further downstream 4D trajectory analysis.

UAV trajectory planning algorithmfor data collection in wireless sensor networks

In order to maximize the value of information(VoI)of collected data in unmanned aerial vehicle(UAV)-aided wireless sensor networks(WSNs),a UAV trajectory planning algorithm named maximum VoI first and successive convex approximation(MVF-SCA)is proposed.First,the Rician channel model is adopted in the system and sensor nodes(SNs)are divided into key nodes and common nodes.Secondly,the data collection problem is formulated as a mixed integer non-linear program(MINLP)problem.The problem is divided into two sub-problems according to the different types of SNs to seek a sub-optimal solution with a low complexity.Finally,the MVF-SCA algorithm for UAV trajectory planning is proposed,which can not only be used for daily data collection in the target area,but also collect time-sensitive abnormal data in time when the exception occurs.Simulation results show that,compared with the existing classic traveling salesman problem(TSP)algorithm and greedy path planning algorithm,the VoI collected by the proposed algorithm can be improved by about 15%to 30%.

A Differential Privacy Based (k-Ψ)-Anonymity Method for Trajectory Data Publishing

In recent years,mobile Internet technology and location based services have wide application.Application providers and users have accumulated huge amount of trajectory data.While publishing and analyzing user trajectory data have brought great convenience for people,the disclosure risks of user privacy caused by the trajectory data publishing are also becoming more and more prominent.Traditional k-anonymous trajectory data publishing technologies cannot effectively protect user privacy against attackers with strong background knowledge.For privacy preserving trajectory data publishing,we propose a differential privacy based(k-Ψ)-anonymity method to defend against re-identification and probabilistic inference attack.The proposed method is divided into two phases:in the first phase,a dummy-based(k-Ψ)-anonymous trajectory data publishing algorithm is given,which improves(k-δ)-anonymity by considering changes of thresholdδon different road segments and constructing an adaptive threshold setΨthat takes into account road network information.In the second phase,Laplace noise regarding distance of anonymous locations under differential privacy is used for trajectory perturbation of the anonymous trajectory dataset outputted by the first phase.Experiments on real road network dataset are performed and the results show that the proposed method improves the trajectory indistinguishability and achieves good data utility in condition of preserving user privacy.

Trajectory-Based Data Forwarding Schemes for Vehicular Networks

This paper explains trajectory-based data forwarding schemes for multihop data delivery in vehicular networks where the trajectory is the GPS navigation path for driving in a road network. Nowadays, GPS-based navigation is popular with drivers either for efficient driv- ing in unfamiliar road networks or for a better route, even in familiar road networks with heavy traffic. In this paper, we describe how to take advantage of vehicle trajectories in order to design data-forwarding schemes for information exchange in vehicular networks. The design of data-forwarding schemes takes into account not only the macro-scoped mobility of vehicular traffic statistics in road net- works, but also the micro-scoped mobility of individual vehicle trajectories. This paper addresses the importance of vehicle trajectory in the design of multihop vehicle-to-infrastructure, infrastructure-to-vehicle, and vehicle-to-vehicle data forwarding schemes. First, we explain the modeling of packet delivery delay and vehicle travel delay in both a road segment and an end-to-end path in a road net- work. Second, we describe a state-of-the-art data forwarding scheme using vehicular traffic statistics for the estimation of the end-to- end delivery delay as a forwarding metric. Last, we describe two data forwarding schemes based on both vehicle trajectory and vehicu- lar traffic statistics in a privacy-preserving manner.

Autonomous UAV 3D trajectory optimization and transmission scheduling for sensor data collection on uneven terrains

This paper considers a time-constrained data collection problem from a network of ground sensors located on uneven terrain by an Unmanned Aerial Vehicle(UAV),a typical Unmanned Aerial System(UAS).The ground sensors harvest renewable energy and are equipped with batteries and data buffers.The ground sensor model takes into account sensor data buffer and battery limitations.An asymptotically globally optimal method of joint UAV 3D trajectory optimization and data transmission schedule is developed.The developed method maximizes the amount of data transmitted to the UAV without losses and too long delays and minimizes the propulsion energy of the UAV.The developed algorithm of optimal trajectory optimization and transmission scheduling is based on dynamic programming.Computer simulations demonstrate the effectiveness of the proposed algorithm.

Comparison of Estimated Cycle Split Failures from High-Resolution Controller Event and Connected Vehicle Trajectory Data

Current traffic signal split failure (SF) estimations derived from high-resolution controller event data rely on detector occupancy ratios and preset thresholds. The reliability of these techniques depends on the selected thresholds, detector lengths, and vehicle arrival patterns. Connected vehicle (CV) trajectory data can more definitively show when a vehicle split fails by evaluating the number of stops it experiences as it approaches an intersection, but it has limited market penetration. This paper compares cycle-by-cycle SF estimations from both high-resolution controller event data and CV trajectory data, and evaluates the effect of data aggregation on SF agreement between the two techniques. Results indicate that, in general, split failure events identified from CV data are likely to also be captured from high-resolution data, but split failure events identified from high-resolution data are less likely to be captured from CV data. This is due to the CV market penetration rate (MPR) of ~5% being too low to capture representative data for every controller cycle. However, data aggregation can increase the ratio in which CV data captures split failure events. For example, day-of-week data aggregation increased the percentage of split failures identified with high-resolution data that were also captured with CV data from 35% to 56%. It is recommended that aggregated CV data be used to estimate SF as it provides conservative and actionable results without the limitations of intersection and detector configuration. As the CV MPR increases, the accuracy of CV-based SF estimation will also improve.

Tracking data management using topology of moving object database system for moving object constrained trajectory in LBS application

Advances in wireless technologies and positioning technologies and spread of wireless devices, an interest in LBS(Location Based Service) is arising. To provide location based service, tracking data should have been stored in moving object database management system (called MODBMS) with proper policies and managed efficiently. So the methods which acquire the location information at regular time intervals then, store and manage have been studied. In this paper, we suggest tracking data management techniques using topology that is corresponding to the moving path of moving object. In our techniques, we update the MODBMS when moving object arrived at a street intersection or a curved road which is represented as the node in topology and predict the location at past and future with attribute of topology and linear function. In this technique, location data that are corresponding to the node in topology are stored, thus reduce the number of update and amount of data. Also in case predicting the location, because topology are used as well as existing location information, accuracy for prediction is increased than applying linear function or spline function.

A trajectory data warehouse solution for workforce management decision-making

In modern workforce management,the demand for new ways to maximize worker satisfaction,productivity,and security levels is endless.Workforce movement data such as those source data from an access control system can support this ongoing process with subsequent analysis.In this study,a solution to attaining this goal is proposed,based on the design and implementation of a data mart as part of a dimensional trajectory data warehouse(TDW)that acts as a repository for the management of movement data.A novel methodological approach is proposed for modeling multiple spatial and temporal dimensions in a logical model.The case study presented in this paper for modeling and analyzing workforce movement data is to support human resource management decision-making and the following discussion provides a representative example of the contribution of a TDW in the process of information management and decision support systems.The entire process of exporting,cleaning,consolidating,and transforming data is implemented to achieve an appropriate format for final import.Structured query language(SQL)queries demonstrate the convenience of dimensional design for data analysis,and valuable information can be extracted from the movements of employees on company premises to manage the workforce efficiently and effectively.Visual analytics through data visualization support the analysis and facilitate decisionmaking and business intelligence.

Big data-driven automatic generation of ship route planning in complex maritime environments

With the rapid development of the global economy, maritime transportation has become much more convenient due to large capacities and low freight. However, this means the sea lanes are becoming more and more crowded,leading to high probabilities of marine accidents in complex maritime environments. According to relevant historical statistics, a large number of accidents have happened in water areas that lack high precision navigation data, which can be utilized to enhance navigation safety. The purpose of this work was to carry out ship route planning automatically, by mining historical big automatic identification system(AIS) data. It is well-known that experiential navigation information hidden in maritime big data could be automatically extracted using advanced data mining techniques;assisting in the generation of safe and reliable ship planning routes for complex maritime environments. In this paper, a novel method is proposed to construct a big data-driven framework for generating ship planning routes automatically, under varying navigation conditions. The method performs density-based spatial clustering of applications with noise first on a large number of ship trajectories to form different trajectory vector clusters. Then, it iteratively calculates its centerline in the trajectory vector cluster, and constructs the waterway network from the node-arc topology relationship among these centerlines. The generation of shipping route could be based on the waterway network and conducted by rasterizing the marine environment risks for the sea area not covered by the waterway network. Numerous experiments have been conducted on different AIS data sets in different water areas, and the experimental results have demonstrated the effectiveness of the framework of the ship route planning proposed in this paper.

UTM:A trajectory privacy evaluating model for online health monitoring

A huge amount of sensitive personal data is being collected by various online health monitoring applications.Although the data is anonymous,the personal trajectories(e.g.,the chronological access records of small cells)could become the anchor of linkage attacks to re-identify the users.Focusing on trajectory privacy in online health monitoring,we propose the User Trajectory Model(UTM),a generic trajectory re-identification risk predicting model to reveal the underlying relationship between trajectory uniqueness and aggregated data(e.g.,number of individuals covered by each small cell),and using the parameter combination of aggregated data to further mathematically derive the statistical characteristics of uniqueness(i.e.,the expectation and the variance).Eventually,exhaustive simulations validate the effectiveness of the UTM in privacy risk evaluation,confirm our theoretical deductions and present counter-intuitive insights.

Anti-Jamming Trajectory Design for UAV-Enabled Wireless Sensor Networks Using Communication Flight Corridor

This paper investigates the anti-jamming trajectory design to safeguard the effective data collection, where a unmanned aerial vehicle(UAV)is dispatched to collect data over multiple sensor nodes(SNs) in jamming environment. Under the limited power and transmission range of SNs, we aim to minimize the UAV’s flight energy consumption in a finite task period, by jointly optimizing SNs collection sequence and UAV flight trajectory. Firstly, we propose a general optimization framework which consists of path planning and trajectory optimization for the formulated non-convex problem. In the path planning phase, a dynamic programming(DP) algorithm is used to provide the initial path of the UAV, which is the shortest path to visit each SN. In the trajectory optimization phase, we introduce the concept of Communication Flight Corridor(CFC) to meet the non-convex constraints and apply a piecewise Bézier curve, based on Bernoulli polynomial, to represent the flight trajectory of the UAV, which can transform the optimization variables from infinite time variables to polynomial coefficients of finite order. Finally, we simulate the flight trajectory of UAV in hovering mode and continuous flight mode under different parameters, and the simulation results demonstrate the effectiveness of the proposed method.

Control System in Missiles for Whole-Trajectory-Controlled Trajectory Correction Projectile Based on DSP

A control system for correction mechanisms through the whole trajectory is proposed based on the principle of one-dimensional trajectory correction projectile. Digital signal processing( DSP) is utilized as the core controller and gobal positioning system( GPS) is used to measure trajectory parameters to meet the requirements of calculating ballistics and system functions. Firstly,the hardware,mainly including communication module,ballistic calculation module,boosting& detonating module and data storage module,is designed. Secondly,the supporting software is developed based on the communication protocols of GPS and the workflow of control system. Finally,the feasibility and the reliability of the control system are verified through dynamic tests in a car and live firing experiments. The system lays a foundation for the research on trajectory correction projectile for the whole trajectory.

A Method of Road Data Aided Inertial Navigation by Using Learning to Rank and ICCP Algorithm

As an independent navigation method,inertial navigation system(INS)has played a huge advantage in a lot of special conditions.But its positioning error will accumulate with time,so it is difficult to work independently for a long time.The vehicle loaded with the inertial navigation system usually drives on the road,so the high precision road data based on geographic information system(GIS)can be used as a bind of auxiliary information,which could correct INS errors by the correlation matching algorithm.The existing road matching methods rely on mathematical models,mostly for global positioning system(GPS)trajectory data,and are limited to model parameters.Therefore,based on the features of inertial navigation trajectory and road,this paper proposes a road data aided vehicle inertial navigation method based on the learning to rank and iterative closest contour point(ICCP)algorithm.Firstly,according to the geometric and directional features of inertial navigation trajectory and road,the combined feature vector is constructed as the input value;Furthermore,the scoring function and RankNet neural network based on the features of vehicle trajectory data and road data are constructed,which can learn and extract the features;Then,the nearest point of each track point and its corresponding road data set to be matched is calculated.The average translation between the two data sets is calculated by using the position relationship between each group of track points to be matched and road points;Finally,the trajectory data set is iteratively translated according to the translation amount,and the matching track point set is obtained when the trajectory error converges to complete the matching.During experiments,it is compared with other algorithms including the hidden Markov model(HMM)matching method.The experimental results show that the algorithm can effectively suppress the divergence of trajectory error.The matching accuracy is close to HMM algorithm,and the computational efficiency can meet the requirements of the traditional matching algorithm.

An Efficient Long Short-Term Memory and Gated Recurrent Unit Based Smart Vessel Trajectory Prediction Using Automatic Identification System Data

Maritime transportation,a cornerstone of global trade,faces increasing safety challenges due to growing sea traffic volumes.This study proposes a novel approach to vessel trajectory prediction utilizing Automatic Identification System(AIS)data and advanced deep learning models,including Long Short-Term Memory(LSTM),Gated Recurrent Unit(GRU),Bidirectional LSTM(DBLSTM),Simple Recurrent Neural Network(SimpleRNN),and Kalman Filtering.The research implemented rigorous AIS data preprocessing,encompassing record deduplication,noise elimination,stationary simplification,and removal of insignificant trajectories.Models were trained using key navigational parameters:latitude,longitude,speed,and heading.Spatiotemporal aware processing through trajectory segmentation and topological data analysis(TDA)was employed to capture dynamic patterns.Validation using a three-month AIS dataset demonstrated significant improvements in prediction accuracy.The GRU model exhibited superior performance,achieving training losses of 0.0020(Mean Squared Error,MSE)and 0.0334(Mean Absolute Error,MAE),with validation losses of 0.0708(MSE)and 0.1720(MAE).The LSTM model showed comparable efficacy,with training losses of 0.0011(MSE)and 0.0258(MAE),and validation losses of 0.2290(MSE)and 0.2652(MAE).Both models demonstrated reductions in training and validation losses,measured by MAE,MSE,Average Displacement Error(ADE),and Final Displacement Error(FDE).This research underscores the potential of advanced deep learning models in enhancing maritime safety through more accurate trajectory predictions,contributing significantly to the development of robust,intelligent navigation systems for the maritime industry.

An Algorithm for Determination of Projectile Attitude Angles in Projectile Trajectory Prediction

A fast and accurate algorithm is established in this paper to increase the precision of ballistic trajectory prediction.The algorithm is based on the six-degree-of-freedom(6 DOF)trajectory equations,to estimate the projectile attitude angles in every measuring time.Hereby,the algorithm utilizes the Davidon-Fletcher-Powell(DFP)method to solve nonlinear equations and Doppler radar trajectory test information containing only position coordinates of the projectile to reconstruct the angular information.The″position coordinates by the test″and″angular displacements by reconstruction″at the end phase of the radar measurement are used as an initial value for the trajectory computation to extrapolate the trajectory impact point.The numerical simulations validate the proposed method and demonstrate that the estimated impact point agrees very well with the real one.Morover,other artillery trajectory can be predicted by the algorithm,and other trajectory models,such as 4 DOF and 5 DOF models,can also be incorporated into the proposed algorithm.