Centre de documentation
scientifique

A map matching-based method for electric vehicle charging station placement at directional road segment level / Zhoulin Yu in Sustainable Cities and Society, vol 84 (September 2022)  

Public [article]  inSustainable Cities and Society > vol 84 (September 2022) . - n° 103987 Titre : A map matching-based method for electric vehicle charging station placement at directional road segment level Type de document : Article/Communication Auteurs : Zhoulin Yu, Auteur ; Zhouhao Wu, Auteur ; Qihui Li, Auteur ; et al., Auteur Année de publication : 2022 Article en page(s) : n° 103987 Note générale : bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Analyse spatiale [Termes IGN] analyse de sensibilité [Termes IGN] analyse multicritère [Termes IGN] appariement de cartes [Termes IGN] distribution spatiale [Termes IGN] réseau routier [Termes IGN] segment de droite [Termes IGN] station [Termes IGN] véhicule électrique [Termes IGN] zone urbaine Résumé : (auteur) This paper proposes a method for electric vehicle charging station (EVCS) placement problem at the directional road segment (DRS) level for large urban road networks, which integrates a multi-criteria decision-making model with a new map matching technique called “segment-wise matching based on MRI”. The charging demand of DRS is estimated based on a novel prediction method which considers the arrival trips and the variation of charging demand for different trip purposes. Traffic attributes, charging demand attributes, and land price are incorporated into the TOPSIS model to determine the optimal EVCS placement. Finally, the proposed method is demonstrated using the road network of Xi'an in China as a case study. The results show the proposed method can be well applied to the EVCS placement problem at the DRS level for large-scale urban road networks. It is found that EVCS installation potentials of road segments approximately follow a normal distribution. The road segments with a high installation potential exhibit regional clustering characteristics due to the level of well-developed land use in the surrounding area. Sensitivity analyses suggest that it is important to include multiple criteria for modeling the EVCS placement problem and that traffic speed and arrival trips are key factors. Numéro de notice : A2022-545 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE Nature : Article DOI : 10.1016/j.scs.2022.103987 Date de publication en ligne : 04/06/2022 En ligne : https://doi.org/10.1016/j.scs.2022.103987 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=101119 [article]

A trajectory restoration algorithm for low-sampling-rate floating car data and complex urban road networks / Bozhao Li in International journal of geographical information science IJGIS, vol 35 n° 4 (April 2021)  

Public [article]  inInternational journal of geographical information science IJGIS > vol 35 n° 4 (April 2021) . - pp 717 - 740 Titre : A trajectory restoration algorithm for low-sampling-rate floating car data and complex urban road networks Type de document : Article/Communication Auteurs : Bozhao Li, Auteur ; Zhongliang Cai, Auteur ; Mengjun Kang, Auteur ; et al., Auteur Année de publication : 2021 Article en page(s) : pp 717 - 740 Note générale : bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Analyse spatiale [Termes IGN] appariement de cartes [Termes IGN] chemin le plus court, algorithme du [Termes IGN] Pékin (Chine) [Termes IGN] réseau routier [Termes IGN] taux d'échantillonnage [Termes IGN] trafic routier [Termes IGN] trajectoire (véhicule non spatial) [Termes IGN] zone urbaine Résumé : (auteur) Low-sampling-rate floating car data (FCD) are more challenging than those with high-sampling-rate FCD for map matching (MM) algorithms. Some MM algorithms for low-sampling-rate FCD lack sufficient efficiency nor accuracy, especially related to complex urban road networks. This paper proposes a new method named the trajectory restoration algorithm, which is based on geometry MM algorithms to ensure efficiency and accuracy. The proposed algorithm adopts the modified A* shortest path algorithm to reduce the number of function calls and fully considers road network topology and historical matched points to improve its accuracy. We test the efficiency and accuracy of the trajectory restoration algorithm with FCD data for the complex urban road networks in Beijing. The results have strong continuity which greatly improves the utilization of FCD. We show that the proposed algorithm outperforms related MM methods in efficiency and accuracy and its robustness to restore trajectories of both high and low sampling rates in complex urban road networks. Numéro de notice : A2021-269 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE Nature : Article DOI : 10.1080/13658816.2020.1825721 Date de publication en ligne : 20/10/2020 En ligne : https://doi.org/10.1080/13658816.2020.1825721 Format de la ressource électronique : url article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=97326 [article]

Hidden Markov map matching based on trajectory segmentation with heading homogeneity / Ge Cui in Geoinformatica, vol 25 n° 1 (January 2021)  

Public [article]  inGeoinformatica > vol 25 n° 1 (January 2021) . - pp 179 - 206 Titre : Hidden Markov map matching based on trajectory segmentation with heading homogeneity Type de document : Article/Communication Auteurs : Ge Cui, Auteur ; Wentao Bian, Auteur ; Xin Wang, Auteur Année de publication : 2021 Article en page(s) : pp 179 - 206 Note générale : Bibliographie Langues : Anglais (eng) Descripteur : [Termes IGN] appariement de cartes [Termes IGN] appariement de données localisées [Termes IGN] modèle de Markov caché [Termes IGN] réseau routier [Termes IGN] segmentation [Termes IGN] trajectographie par GPS [Vedettes matières IGN] Généralisation Résumé : (Auteur) Map matching is to locate GPS trajectories onto the road networks, which is an important preprocessing step for many applications based on GPS trajectories. Currently, hidden Markov model is one of the most widely used methods for map matching. However, both effectiveness and efficiency of conventional map matching methods based on hidden Markov model will decline in the dense road network, as the number of candidate road segments enormously increases around GPS point. To overcome the deficiency, this paper proposes a segment-based hidden Markov model for map matching. The proposed method first partitions GPS trajectory into several GPS sub-trajectories based on the heading homogeneity and length constraint; next, the candidate road segment sequences are searched out for each GPS sub-trajectory; last, GPS sub-trajectories and road segment sequences are matched in hidden Markov model, and the road segment sequences with the maximum probability is identified. A case study is conducted on a real GPS trajectory dataset, and the experiment result shows that the proposed method improves the effectiveness and efficiency of the conventional HMM map matching method. Numéro de notice : A2021-094 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE Nature : Article nature-HAL : ArtAvecCL-RevueIntern DOI : 10.1007/s10707-020-00429-4 Date de publication en ligne : 02/01/2021 En ligne : https://doi.org/10.1007/s10707-020-00429-4 Format de la ressource électronique : URL Article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=96934 [article]

Map matching for semi-restricted trajectories / Timon Behr (2021)  

Public Titre : Map matching for semi-restricted trajectories Type de document : Article/Communication Auteurs : Timon Behr, Auteur ; Thomas van Dijk, Auteur ; Axel Forsch, Auteur ; Jan‐Henrik Haunert, Auteur ; Sabine Storandt, Auteur Editeur : Leibniz [Allemagne] : Schloss Dagstuhl – Leibniz-Zentrum für Informatik Année de publication : 2021 Conférence : GIScience 2021, 11th International Conference on Geographic Information Science 27/09/2021 30/09/2021 Poznań Pologne Open Access Proceedings Importance : 16 p. Note générale : bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Géomatique [Termes IGN] appariement de cartes [Termes IGN] cycliste [Termes IGN] information sémantique [Termes IGN] OpenStreetMap [Termes IGN] piéton [Termes IGN] positionnement par GPS [Termes IGN] réseau routier [Termes IGN] trajet (mobilité) Résumé : (auteur) We consider the problem of matching trajectories to a road map, giving particular consideration to trajectories that do not exclusively follow the underlying network. Such trajectories arise, for example, when a person walks through the inner part of a city, crossing market squares or parking lots. We call such trajectories semi-restricted. Sensible map matching of semi-restricted trajectories requires the ability to differentiate between restricted and unrestricted movement. We develop in this paper an approach that efficiently and reliably computes concise representations of such trajectories that maintain their semantic characteristics. Our approach utilizes OpenStreetMap data to not only extract the network but also areas that allow for free movement (as e.g. parks) as well as obstacles (as e.g. buildings). We discuss in detail how to incorporate this information in the map matching process, and demonstrate the applicability of our method in an experimental evaluation on real pedestrian and bicycle trajectories. Numéro de notice : C2021-081 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE Nature : Communication DOI : 10.4230/LIPIcs.GIScience.2021.II.12 Date de publication en ligne : 14/09/2021 En ligne : https://doi.org/10.4230/LIPIcs.GIScience.2021.II.12 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=100939

Unfolding spatial-temporal patterns of taxi trip based on an improved network kernel density estimation / Boxi Shen in ISPRS International journal of geo-information, vol 9 n° 11 (November 2020)  

Public [article]  inISPRS International journal of geo-information > vol 9 n° 11 (November 2020) . - n° 683 Titre : Unfolding spatial-temporal patterns of taxi trip based on an improved network kernel density estimation Type de document : Article/Communication Auteurs : Boxi Shen, Auteur ; Xiang Xu, Auteur ; Jun Li, Auteur ; et al., Auteur Année de publication : 2020 Article en page(s) : n° 683 Note générale : bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Analyse spatiale [Termes IGN] analyse spatio-temporelle [Termes IGN] appariement de cartes [Termes IGN] estimation par noyau [Termes IGN] mobilité urbaine [Termes IGN] modèle conceptuel de données localisées [Termes IGN] modèle conceptuel de flux [Termes IGN] Shenzhen [Termes IGN] taxi [Termes IGN] trafic routier [Termes IGN] trafic urbain [Termes IGN] trajet (mobilité) Résumé : (auteur) Taxi mobility data plays an important role in understanding urban mobility in the context of urban traffic. Specifically, the taxi is an important part of urban transportation, and taxi trips reflect human behaviors and mobility patterns, allowing us to identify the spatial variety of such patterns. Although taxi trips are generated in the form of network flows, previous works have rarely considered network flow patterns in the analysis of taxi mobility data; Instead, most works focused on point patterns or trip patterns, which may provide an incomplete snapshot. In this work, we propose a novel approach to explore the spatial-temporal patterns of taxi travel by considering point, trip and network flow patterns in a simultaneous fashion. Within this approach, an improved network kernel density estimation (imNKDE) method is first developed to estimate the density of taxi trip pick-up and drop-off points (ODs). Next, the correlation between taxi service activities (i.e., ODs) and land-use is examined. Then, the trip patterns of taxi trips and its corresponding routes are analyzed to reveal the correlation between trips and road structure. Finally, network flow analysis for taxi trip among areas of varying land-use types at different times are performed to discover spatial and temporal taxi trip ODs from a new perspective. A case study in the city of Shenzhen, China, is thoroughly presented and discussed for illustrative purposes. Numéro de notice : A2020-730 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE Nature : Article nature-HAL : ArtAvecCL-RevueIntern DOI : 10.3390/ijgi9110683 Date de publication en ligne : 15/11/2020 En ligne : https://doi.org/10.3390/ijgi9110683 Format de la ressource électronique : url article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=96337 [article]

Road network simplification for location-based services / Abdeltawab M. Hendawi in Geoinformatica, vol 24 n° 4 (October 2020)  

Permalink

Méthodes d'apprentissage statistique pour la détection de la signalisation routière à partir de véhicules traceurs / Yann Méneroux (2019)  

Permalink

The effects of navigation sensors and spatial road network data quality on the performance of map matching algorithms / M. Quddus in Geoinformatica, vol 13 n° 1 (March 2009)  

Permalink

L'évolution de la navigation et de la cartographie routière, un exemple à suivre pour l'intérieur ? / P. Saint-Martin in XYZ, n° 112 (septembre - novembre 2007)

Permalink

Le map-matching / F. Le Gallo (2005)

Permalink

Mapping Dilution of Precision (MDOP) and map-matched GPS / Geoffrey Blewitt in International journal of geographical information science IJGIS, vol 16 n° 1 (january 2002)  

Permalink