Descripteur
Termes IGN > aménagement > infrastructure > réseau technique > réseau de transport
réseau de transportSynonyme(s)réseau de communicationVoir aussi |
Documents disponibles dans cette catégorie (799)
Ajouter le résultat dans votre panier
Visionner les documents numériques
Affiner la recherche Interroger des sources externes
Etendre la recherche sur niveau(x) vers le bas
Extraction of street pole-like objects based on plane filtering from mobile LiDAR data / Jingming Tu in IEEE Transactions on geoscience and remote sensing, vol 59 n° 1 (January 2021)
[article]
Titre : Extraction of street pole-like objects based on plane filtering from mobile LiDAR data Type de document : Article/Communication Auteurs : Jingming Tu, Auteur ; Jian Yao, Auteur ; Li Li, Auteur ; et al., Auteur Année de publication : 2021 Article en page(s) : pp 749 - 768 Note générale : bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Lasergrammétrie
[Termes IGN] analyse d'image orientée objet
[Termes IGN] carte routière
[Termes IGN] détection d'objet
[Termes IGN] données lidar
[Termes IGN] extraction de traits caractéristiques
[Termes IGN] forme caractéristique
[Termes IGN] méthode robuste
[Termes IGN] octree
[Termes IGN] réseau routierRésumé : (auteur) Pole-like objects provide important street infrastructure for road inventory and road mapping. In this article, we proposed a novel pole-like object extraction algorithm based on plane filtering from mobile Light Detection and Ranging (LiDAR) data. The proposed approach is composed of two parts. In the first part, a novel octree-based split scheme was proposed to fit initial planes from off-ground points. The results of the plane fitting contribute to the extraction of pole-like objects. In the second part, we proposed a novel method of pole-like object extraction by plane filtering based on local geometric feature restriction and isolation detection. The proposed approach is a new solution for detecting pole-like objects from mobile LiDAR data. The innovation in this article is that we assumed that each of the pole-like objects can be represented by a plane. Thus, the essence of extracting pole-like objects will be converted to plane selecting problem. The proposed method has been tested on three data sets captured from different scenes. The average completeness, correctness, and quality of our approach can reach up to 87.66%, 88.81%, and 79.03%, which is superior to state-of-the-art approaches. The experimental results indicate that our approach can extract pole-like objects robustly and efficiently. Numéro de notice : A2021-042 Affiliation des auteurs : non IGN Thématique : IMAGERIE Nature : Article nature-HAL : ArtAvecCL-RevueIntern DOI : 10.1109/TGRS.2020.2993454 Date de publication en ligne : 20/05/2020 En ligne : https://doi.org/10.1109/TGRS.2020.2993454 Format de la ressource électronique : url article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=96758
in IEEE Transactions on geoscience and remote sensing > vol 59 n° 1 (January 2021) . - pp 749 - 768[article]Finding the most navigable path in road networks / Ramneek Kaur in Geoinformatica, vol 25 n° 1 (January 2021)
[article]
Titre : Finding the most navigable path in road networks Type de document : Article/Communication Auteurs : Ramneek Kaur, Auteur ; Vikram Goyal, Auteur ; Venkata M. V. Gunturi, Auteur Année de publication : 2021 Article en page(s) : pp 207 - 240 Note générale : Bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Analyse spatiale
[Termes IGN] arc
[Termes IGN] calcul d'itinéraire
[Termes IGN] durée de trajet
[Termes IGN] programmation dynamique
[Termes IGN] réseau routierRésumé : (Auteur) Input to the Most Navigable Path (MNP) problem consists of the following: (a) a road network represented as a directed graph, where each edge is associated with numeric attributes of cost and “navigability score” values; (b) a source and a destination and; (c) a budget value which denotes the maximum permissible cost of the solution. Given the input, MNP aims to determine a path between the source and the destination which maximizes the navigability score while constraining its cost to be within the given budget value. The problem can be modeled as the arc orienteering problem which is known to be NP-hard. The current state-of-the-art for this problem may generate paths having loops, and its adaptation for MNP that yields simple paths, was found to be inefficient. In this paper, we propose five novel algorithms for the MNP problem. Our algorithms first compute a seed path from the source to the destination, and then modify the seed path to improve its navigability. We explore two approaches to compute the seed path. For modification of the seed path, we explore different Dynamic Programming based approaches. We also propose an indexing structure for the MNP problem which helps in reducing the running time of some of our algorithms. Our experimental results indicate that the proposed solutions yield comparable or better solutions while being orders of magnitude faster than the current state-of-the-art for large real road networks. Numéro de notice : A2021-095 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE Nature : Article nature-HAL : ArtAvecCL-RevueIntern DOI : 10.1007/s10707-020-00428-5 Date de publication en ligne : 03/01/2021 En ligne : https://doi.org/10.1007/s10707-020-00428-5 Format de la ressource électronique : URL Article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=96935
in Geoinformatica > vol 25 n° 1 (January 2021) . - pp 207 - 240[article]Hidden Markov map matching based on trajectory segmentation with heading homogeneity / Ge Cui in Geoinformatica, vol 25 n° 1 (January 2021)
[article]
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éralisationRé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
in Geoinformatica > vol 25 n° 1 (January 2021) . - pp 179 - 206[article]Machine learning for the distributed and dynamic management of a fleet of taxis and autonomous shuttles / Tatiana Babicheva (2021)
Titre : Machine learning for the distributed and dynamic management of a fleet of taxis and autonomous shuttles Titre original : Machine Learning pour la gestion distribuée et dynamique d’une flotte de taxis et navettes autonomes Type de document : Thèse/HDR Auteurs : Tatiana Babicheva, Auteur ; Leïla Kloul, Directeur de thèse ; Dominique Barth, Directeur de thèse Editeur : Bures-sur-Yvette : Université Paris-Saclay Année de publication : 2021 Importance : 190 p. Format : 21 x 30 cm Note générale : bibliographie
Thèse de Doctorat de l'Université Paris-Saclay, InformatiqueLangues : Anglais (eng) Descripteur : [Vedettes matières IGN] Géomatique
[Termes IGN] apprentissage par renforcement
[Termes IGN] autopartage
[Termes IGN] calcul d'itinéraire
[Termes IGN] méthode heuristique
[Termes IGN] navigation autonome
[Termes IGN] OpenStreetMap
[Termes IGN] optimisation (mathématiques)
[Termes IGN] réseau neuronal artificiel
[Termes IGN] réseau routier
[Termes IGN] taxi
[Termes IGN] trafic routier
[Termes IGN] trafic urbain
[Termes IGN] véhicule électrique
[Termes IGN] ville intelligenteIndex. décimale : THESE Thèses et HDR Résumé : (auteur) In this thesis are investigated methods to manage shared electric autonomous taxi urban systems under online context in which customer demands occur over time, and where vehicles are available for ride-sharing and require electric recharging management. We propose the heuristics based on problem decomposition which include road network repartition and highlighting of subproblems such as charging management, empty vehicle redistribution and dynamic ride-sharing.The set of new methods for empty vehicle redistribution is proposed, such as proactive, meaning to take into account both current demand and anticipated future demand, in contrast to reactive methods, which act based on current demand only.We provide the reinforcement learning in different levels depending on granularity of the system.We propose station-based RL model for small networks and zone-based RL model, where the agents are zones of the city obtained by partitioning, for huge ones. The complete information optimisation is provided in order to analyse the system performance a-posteriori in offline context.The evaluation of the performance of proposed methods is provided in set of road networks of different nature and size. The proposed method provides promising results outperforming the other tested methods and the real data on the taxi system performance in terms of number of satisfied passengers under fixed fleet size. Note de contenu : 1- Introduction
2- State-of-the-art
3- Modelling the electrical aTaxisystem
4- Functional architecture of aTaxi system management
5- Reinforcement learning for aTaxi system optimisation
6- Evaluation scenarii
7- Numerical evaluation of aTaxi systems
8- Conclusion and discussionNuméro de notice : 28591 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE/INFORMATIQUE Nature : Thèse française Note de thèse : thèse de Doctorat : Informatique : Paris-Saclay : 2021 Organisme de stage : Données et Algorithmes pour une ville intelligente et durable (UVSQ) DOI : sans En ligne : https://tel.hal.science/tel-03230845/ Format de la ressource électronique : URL Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=97968
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 PermalinkRoute intersection reduction with connected autonomous vehicles / Sadegh Motallebi in Geoinformatica, vol 25 n° 1 (January 2021)PermalinkAutomated labeling of schematic maps by optimization with knowledge acquired from existing maps / Tian Lan in Transactions in GIS, Vol 24 n° 6 (December 2020)PermalinkEmpirical assessment of road network resilience in natural hazards using crowdsourced traffic data / Yi Qiang in International journal of geographical information science IJGIS, vol 34 n° 12 (December 2020)PermalinkLes stations virtuelles au service de la cartographie mobile / Mathieu Regul in XYZ, n° 165 (décembre 2020)PermalinkFollow the road: historical GIS for evaluating the development of routes in the Negev region during the twentieth century / Motti Zohar in Cartography and Geographic Information Science, vol 47 n° 6 (October 2020)PermalinkGoing to the Finnish line / Hannu Heinonen in GEO: Geoconnexion international, vol 19 n° 6 (October 2020)PermalinkNetwork-constrained bivariate clustering method for detecting urban black holes and volcanoes / Qiliang Liu in International journal of geographical information science IJGIS, vol 34 n° 10 (October 2020)PermalinkRoad network simplification for location-based services / Abdeltawab M. Hendawi in Geoinformatica, vol 24 n° 4 (October 2020)PermalinkMoGUS, un outil de modélisation et d'analyse comparative des trames urbaines / Dominique Badariotti in Revue internationale de géomatique, vol 30 n° 3-4 (juillet - décembre 2020)PermalinkAn empirical study on the intra-urban goods movement patterns using logistics big data / Pengxiang Zhao in International journal of geographical information science IJGIS, vol 34 n° 6 (June 2020)PermalinkA multi-factor spatial optimization approach for emergency medical facilities in Beijing / Liang Zhou in ISPRS International journal of geo-information, vol 9 n° 6 (June 2020)PermalinkMethodology of the automatic generalization of buildings, road networks, forests and surface waters: a case study based on the Topographic Objects Database in Poland / Izabela Karsznia in Geocarto international, vol 35 n° 7 ([15/05/2020])PermalinkAutomatic extraction of road intersection points from USGS historical map series using deep convolutional neural networks / Mahmoud Saeedimoghaddam in International journal of geographical information science IJGIS, vol 34 n° 5 (May 2020)PermalinkDeep learning for enrichment of vector spatial databases: Application to highway interchange / Guillaume Touya in ACM Transactions on spatial algorithms and systems, TOSAS, vol 6 n° 3 (May 2020)PermalinkExploring the potential of deep learning segmentation for mountain roads generalisation / Azelle Courtial in ISPRS International journal of geo-information, vol 9 n° 5 (May 2020)PermalinkSpatio-temporal evaluation of transport accessibility of the Istanbul metrobus line / Wasim Shoman in Geocarto international, vol 35 n° 6 ([01/05/2020])PermalinkAnalytic hierarchy process based spatial biodiversity impact assessment model of highway broadening in Sikkim Himalaya / Polash Banerjee in Geocarto international, vol 35 n° 5 ([01/04/2020])PermalinkTechniques for efficient detection of rapid weather changes and analysis of their impacts on a highway network / Adil Alim in Geoinformatica, vol 24 n° 2 (April 2020)PermalinkLearning sequential slice representation with an attention-embedding network for 3D shape recognition and retrieval in MLS point clouds / Zhipeng Luo in ISPRS Journal of photogrammetry and remote sensing, vol 161 (March 2020)Permalink