Subway location method based on SINS/DR integrated navigation and map-matching technology

With the development of rail transit,subway is playing an increasingly important role in peoples daily life.The positioning technology of subway is the key of communication based on train control system(CBTC).Considering that the global positioning system(GPS)cant be utilized in the subway and the ground equipment is complex and expensive,a self-positioning method based on inertial measurement unit(IMU)and speed sensor is put forward,and the track electronic map is used to reduce the error.This method can suppress the error divergence of Strapdown inertial navigation system(SINS)and reduce the cumulative error of dead reckoning(DR)due to attitude error.In accordance with the particularity of railway lines,using the least squares method to match the line and revise the error caused by the navigation,can greatly improve the positioning accuracy and reduce the dependency on the ground equipment,and the costs of construction and maintenance can be lowered.

Towards adaptable and tunable cloud-based map-matching strategy for GPS trajectories

Smart cities have given a significant impetus to manage traffic and use transport networks in an intelligent way. For the above reason, intelligent transportation systems （ITSs） and location-based services （LBSs） have become an interesting research area over the last years. Due to the rapid increase of data volume within the transportation domain, cloud environment is of paramount importance for storing, accessing, handling, and processing such huge amounts of data. A large part of data within the transportation domain is produced in the form of Global Positioning System （GPS） data. Such a kind of data is usually infrequent and noisy and achieving the quality of real-time transport applications based on GPS is a difficult task. The map-matching process, which is responsible for the accurate alignment of observed GPS positions onto a road network, plays a pivotal role in many ITS applications. Regarding accuracy, the performance of a map-matching strategy is based on the shortest path between two consecutive observed GPS positions. On the other extreme, processing shortest path queries （SPQs） incurs high computational cost. Current map-matching techniques are approached with a fixed number of parameters, i.e., the number of candidate points （NCP） and error circle radius （ECR）, which may lead to uncertainty when identifying road segments and either low-accurate results or a large number of SPQs. Moreover, due to the sampling error, GPS data with a high-sampling period （i.e., less than 10 s） typically contains extraneous datum, which also incurs an extra number of SPQs. Due to the high computation cost incurred by SPQs, current map-matching strategies are not suitable for real-time processing. In this paper, we propose real-time map-matching （called RT-MM）, which is a fully adaptive map-matching strategy based on cloud to address the key challenge of SPQs in a map-matching process for real-time GPS trajectories. The evaluation of our approach against state-of-the-art approaches is performed through simulations based on both synthetic and real-word datasets.

Underwater map-matching aided inertial navigation system based on multi-geophysical information

In order to achieve long-term covert precise navigation for an underwater vehicle,the shortcomings of various underwater navigation methods used are analyzed.Given the low navigation precision of underwater mapmatching aided inertial navigation based on singlegeophysical information,a model of an underwater mapmatching aided inertial navigation system based on multigeophysical information(gravity,topography and geomagnetism)is put forward,and the key technologies of map-matching based on multi-geophysical information are analyzed.Iterative closest contour point(ICCP)mapmatching algorithm and data fusion based on Dempster-Shafer(D-S)evidence theory are applied to navigation simulation.Simulation results show that accumulation of errors with increasing of time and distance are restrained and fusion of multi-map-matching is superior to any single-map-matching,which can effectively determine the best match of underwater vehicle position and improve the accuracy of underwater vehicle navigation.

A map-matching algorithm dealing with sparse cellular fingerprint observations

The widespread availability of mobile communication makes mobile devices a resource for the collection of data about mobile infrastructures and user mobility.In these contexts,the problem of reconstructing the most likely trajectory of a device on the road network on the basis of the sequence of observed locations(map-matching problem)turns out to be particularly relevant.Different contributions have demonstrated that the reconstruction of the trajectory of a device with good accuracy is technically feasible even when only a sparse set of GNSS positions is available.In this paper,we face the problem of coping with sparse sequences of cellular fingerprints.Compared to GNSS positions,cellular fingerprints provide coarser spatial information,but they work even when a device is missing GNSS positions or is operating in an energy saving mode.We devise a new map-matching algorithm,that exploits the well-known Hidden Markov Model and Random Forests to successfully deal with noisy and sparse cellular observations.The performance of the proposed solution has been tested over a medium-sized Italian city urban environment by varying both the sampling of the observations and the density of the fingerprint map as well as by including some GPS positions into the sequence of fingerprint observations.

An adaptive Markov chain algorithm applied over map-matching of vehicle trip GPS data

Markov chains have frequently been applied to match the probable routes with a set of GPS trip data that a pilot vehicle is emitting over a specific graph road network. This class of mapmatching (MM) algorithms presently demonstrates and involve statistical and ad-hoc measures to drive the Markov chain transitional probabilities in picking the best route combinations constrained over the graph road network. In this study, we have devised an adaptive scheme to modify the Markov Chain (MC) kernel window as we move along the GPS samples to reduce the mistakes that can happen by the use of narrower MC widths. The measure for temporarily increasing the MC window width is chosen to be the ratio between the geodesic distance of current route to the actual geodesic distance between each pair of GPS samples. This adaptive use of MC has shown to have hardened the results significantly with tolerable computational cost increase. The details of the overall algorithm are depicted by the example routes extracted from various vehicle trips and the results are shown to validate the usefulness of the algorithm in practice.

GPS/GIS based vehicle dispatching for opencast mines

An integrated GPS and GIS based vehicle dispatching system was presented. The system uses GIS technology for the development of digital mine map database and GPS for vehicle positioning. The system consists of five modules: position module incorporated GPS and dead reckoning (DR); a map database structure for displaying and guidance purposes; a routing module based on the map database is able to give out the best route for the vehicles; map matching and route guidance module put the vehicle position to its exact location on the road despite of errors in positioning and map data; and the client-server module allows client exchange information between driver and control centre. The system can be operated in client-server level in which users can request routing and guidance with devices such as hand phone and PDA by communicating their current positions to the server or runs in autonomous mode when users cannot reach the server.

Deriving Network-Constrained Trajectories from Sporadic Tracking Points Collected in Location-Based Services

The paper proposes an economical and fast algorithm for deriving trajectories from sporadic tracking points collected in location-based services (LBS). Although many traffic studies or applications can benefit from the derived trajectories, the sporadic tracking points are always implicitly overlooked by most of existing map-matching algorithms. The algorithm proposed in this paper finds network paths or trajectories traveled by vehicles through augmenting GPS data with odometer data. An odometer can provide data of traveled distance which are compared with the lengths of candidate network paths in order to find the most approximate network path approaching the trajectory of a vehicle. Tracking points are classified into anchor points and non-anchor points. The former are used to divide trajectories, and the latter screen candidate network paths. An elliptic selection zone and a reduction process are applied to the selection of possible road segments composing candidate network paths. A brute-force searching algorithm is developed to find candidate network paths and calculate their lengths. A two-step screening process is designed to select the final result from candidate network paths. Finally, a series of experiments are conducted to validate the proposed algorithm.