Descripteur
Documents disponibles dans cette catégorie (112)
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
A hybrid link-node approach for finding shortest paths in road networks with turn restrictions / Qingquan Li in Transactions in GIS, vol 19 n° 6 (December 2015)
[article]
Titre : A hybrid link-node approach for finding shortest paths in road networks with turn restrictions Type de document : Article/Communication Auteurs : Qingquan Li, Auteur ; Bi Yu Chen, Auteur ; Yafei Wang, Auteur ; William H. K. Lam, Auteur Année de publication : 2015 Article en page(s) : pp 915 - 929 Note générale : bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Géomatique
[Termes IGN] analyse comparative
[Termes IGN] calcul d'itinéraire
[Termes IGN] chemin le plus court, algorithme du
[Termes IGN] navigation automobile
[Termes IGN] noeud
[Termes IGN] requête spatiale
[Termes IGN] réseau routier
[Termes IGN] traitement de données localiséesRésumé : (auteur) Turn restrictions, such as ‘no left turn’ or ‘no U-turn’, are commonly encountered in real road networks. These turn restrictions must be explicitly considered in the shortest path problem and ignoring them may lead to infeasible paths. In the present study, a hybrid link-node Dijkstra's (HLND) algorithm is proposed to exactly solve the shortest path problem in road networks with turn restrictions. A new hybrid link–node labelling approach is devised by using a link–based labelling strategy at restricted nodes with turn restrictions, and a node-based labelling strategy at unrestricted nodes without turn restrictions. Computational results for several real road networks show that the proposed HLND algorithm obtains the same optimal results as the link-based Dijkstra's algorithm, while having a similar computational performance to the classical node-based Dijkstra's algorithm. Numéro de notice : A2016-438 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE Nature : Article nature-HAL : ArtAvecCL-RevueIntern DOI : 10.1111/tgis.12133 En ligne : http://dx.doi.org/10.1111/tgis.12133 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=81349
in Transactions in GIS > vol 19 n° 6 (December 2015) . - pp 915 - 929[article]Car navigation – computing routes that avoid complicated crossings / Jukka Mathias Krisp in International journal of geographical information science IJGIS, vol 29 n° 11 (November 2015)
[article]
Titre : Car navigation – computing routes that avoid complicated crossings Type de document : Article/Communication Auteurs : Jukka Mathias Krisp, Auteur ; Andreas Keler, Auteur Année de publication : 2015 Article en page(s) : pp 1988 - 2000 Note générale : Bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Navigation et positionnement
[Termes IGN] calcul d'itinéraire
[Termes IGN] itinéraire
[Termes IGN] navigation automobile
[Termes IGN] service fondé sur la position
[Termes IGN] temps réelRésumé : (Auteur) Personalized navigation and way-finding are prominent research areas of location-based service (LBSs). This includes innovative concepts for car navigation. Within this paper, we investigate the idea of providing drivers a routing suggestion which avoids ‘complicated crossings’ in urban areas. Inexperienced drivers include persons who have a driver’s license but, for whatever reason, feel uncomfortable to drive in a city environment. Situations where the inexperienced driver has to depend on a navigation device and reach a destination in an unfamiliar territory may be difficult. Preferences of inexperienced drivers are investigated. ‘Fears’ include driving into ‘complicated crossings’. Therefore, the definition and spatial characteristics of ‘complicated crossings’ are investigated. We use OpenStreetMap as a road dataset for the routing network. Based on the topological characteristics of the dataset, measured by the number of nodes, we identify crossings that are ‘complicated’. The user can choose to compute an alternative route that avoids these complicated crossings. This methodology is one step in building a full ‘inexperienced drivers’ routing system, which includes additional preferences from the user group, for example, as avoiding left turns where no traffic light is present. Numéro de notice : A2015-616 Affiliation des auteurs : non IGN Thématique : POSITIONNEMENT Nature : Article nature-HAL : ArtAvecCL-RevueIntern DOI : 10.1080/13658816.2015.1053485 En ligne : https://doi.org/10.1080/13658816.2015.1053485 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=78085
in International journal of geographical information science IJGIS > vol 29 n° 11 (November 2015) . - pp 1988 - 2000[article]Planning unobstructed paths in traffic-aware spatial networks / Shuo Shang in Geoinformatica, vol 19 n° 4 (October - December 2015)
[article]
Titre : Planning unobstructed paths in traffic-aware spatial networks Type de document : Article/Communication Auteurs : Shuo Shang, Auteur ; Jianjun Liu, Auteur ; Kai Zheng, Auteur ; et al., Auteur Année de publication : 2015 Article en page(s) : pp 723 - 746 Note générale : bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Géomatique
[Termes IGN] accessibilité
[Termes IGN] calcul d'itinéraire
[Termes IGN] gestion des itinéraires
[Termes IGN] itinéraire
[Termes IGN] objet mobile
[Termes IGN] trafic routier
[Termes IGN] vitesseMots-clés libres : traffic-aware spatial network Résumé : (auteur) Route planning and recommendation have received significant attention in recent years. In this light, we study a novel problem of planning unobstructed paths in traffic-aware spatial networks (TAUP queries) to avoid potential traffic congestions. We propose two probabilistic TAUP queries: (1) a time-threshold query like “what is the path from the check-in desk to the flight SK 1217 with the minimum congestion probability to take at most 45 minutes?”, and (2) a probability-threshold query like “what is the fastest path from the check-in desk to the flight SK 1217 whose congestion probability is less than 20 %?”. These queries are mainly motivated by indoor space applications, but are also applicable in outdoor spaces. We believe that these queries are useful in some popular applications, such as planning unobstructed paths for VIP bags in airports and planning convenient routes for travelers. The TAUP queries are challenged by two difficulties: (1) how to model the traffic awareness in spatial networks practically, and (2) how to compute the TAUP queries efficiently under different query settings. To overcome these challenges, we construct a traffic-aware spatial network G t a (V, E) by analyzing uncertain trajectories of moving objects. Based on G t a (V, E), two efficient algorithms are developed to compute the TAUP queries. The performances of TAUP queries are verified by extensive experiments on real and synthetic spatial data. Numéro de notice : A2015--035 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE Nature : Article DOI : 10.1007/s10707-015-0227-9 Date de publication en ligne : 10/04/2015 En ligne : http://dx.doi.org/10.1007/s10707-015-0227-9 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=81121
in Geoinformatica > vol 19 n° 4 (October - December 2015) . - pp 723 - 746[article]Parcourir et marquer le temps : premiers éléments pour une étude diachronique appliquée à la cartographie d'itinéraire / Quentin Morcette in Cartes & Géomatique, n° 225 (septembre 2015)
[article]
Titre : Parcourir et marquer le temps : premiers éléments pour une étude diachronique appliquée à la cartographie d'itinéraire Type de document : Article/Communication Auteurs : Quentin Morcette, Auteur Année de publication : 2015 Article en page(s) : pp 49 - 57 Note générale : bibliographie Langues : Français (fre) Descripteur : [Vedettes matières IGN] Géomatique web
[Termes IGN] analyse spatio-temporelle
[Termes IGN] calcul d'itinéraire
[Termes IGN] carte routière
[Termes IGN] carte thématique
[Termes IGN] itinéraire
[Termes IGN] représentation cartographique
[Termes IGN] représentation du temps
[Termes IGN] tempsRésumé : (auteur) Les applications cartographiques contemporaines sont largement utilisées pour trouver son "itinéraire". La quantité d'espace est, le plus fréquemment, sous forme d'un paradoxe, exprimée en temps. Cet article montre à travers une analyse typologique et diachronique, que bien souvent les cartes d'itinéraire se passent d'une forme de représentation de la distance, que les distances sont indiquées de manière variée par ailleurs et que l'indication d'une distance-temps est liée à la cartographie numérique. Numéro de notice : A2015-814 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE Nature : Article nature-HAL : ArtAvecCL-RevueNat DOI : sans Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=79068
in Cartes & Géomatique > n° 225 (septembre 2015) . - pp 49 - 57[article]Réservation
Réserver ce documentExemplaires (1)
Code-barres Cote Support Localisation Section Disponibilité 021-2015031 RAB Revue Centre de documentation En réserve L003 Disponible Documents numériques
en open access
Parcourir et marquer le temps ... - pdf éditeurAdobe Acrobat PDF Simulating and visualizing sidewalk accessibility for wayfinding of people with disabilities / Mohammadamin Tajgardoon in International journal of cartography, vol 1 n° 1 (August 2015)
[article]
Titre : Simulating and visualizing sidewalk accessibility for wayfinding of people with disabilities Type de document : Article/Communication Auteurs : Mohammadamin Tajgardoon, Auteur ; Hassan A. Karimi, Auteur Année de publication : 2015 Article en page(s) : pp 79 - 93 Note générale : bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Géomatique
[Termes IGN] accessibilité
[Termes IGN] calcul d'itinéraire
[Termes IGN] carte de densité de clics
[Termes IGN] handicap
[Termes IGN] piéton
[Termes IGN] simulation
[Termes IGN] trottoirRésumé : (auteur) There are generally different and less wayfinding options for pedestrians than those for drivers. This makes developing models and tools that assist pedestrians in finding routes more challenging. The problem is even further exacerbated when specific routing requirements of people with disabilities are considered. While currently much research is focused on developing solutions for wayfinding of pedestrians, very few address the specific requirements of individuals with disabilities and none is focused on evaluation of the accessibility of built environments. In this paper, we propose a new approach in evaluating the accessibility of built environments for wayfinding of individuals with disabilities. The proposed approach involves simulation and visualization of the accessibility of sidewalk segments allowing urban planners, and other designers and engineers, to gain an understanding of how accessible built environments are and allowing individuals with disabilities to assess the accessibility of built environments with respect to their mobility needs. Simulations were conducted using a sidewalk network database which contains accessibility attributes based on the standards recommended by the Americans with Disabilities Act. To demonstrate the benefits of the proposed approach, a representative model was used to simulate scenarios for the wayfinding requirements at both community and individual levels. The results of the simulations are visualized in heat-maps. Numéro de notice : A2015-403 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE Nature : Article nature-HAL : ArtAvecCL-RevueIntern DOI : 10.1080/23729333.2015.1055646 En ligne : https://doi.org/10.1080/23729333.2015.1055646 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=76889
in International journal of cartography > vol 1 n° 1 (August 2015) . - pp 79 - 93[article]Points of interest recommendation from GPS trajectories / Yaqiong Liu in International journal of geographical information science IJGIS, vol 29 n° 6 (June 2015)PermalinkContext-aware abstraction and generalization of street networks: two cognitively engineered user-oriented approaches using network Voronoi diagrams / Mahdi Rahimi in Geocarto international, vol 30 n° 5 - 6 (May - July 2015)PermalinkAutomatic selection of landmarks for navigation guidance / Rui Zhu in Transactions in GIS, vol 19 n° 2 (April 2015)PermalinkA dilution-matching-encoding compaction of trajectories over road networks / Ranit Gotsman in Geoinformatica, vol 19 n° 2 (April - June 2015)PermalinkMeasuring the reliability of wheelchair user route planning based on volunteered geographic information / Pascal Neis in Transactions in GIS, vol 19 n° 2 (April 2015)PermalinkAlgorithms for vision-based path following along previously taught paths / Deon George Sabatta (2015)PermalinkA comparative analysis of routes generated by Web Mapping APIs / Monsak Socharoentum in Cartography and Geographic Information Science, Vol 42 n° 1 (January 2015)PermalinkPermalinkThe development of integrated terrestrial and marine pathways in the Argo-Saronic region, Greece / J. M. L. Newhard in Cartography and Geographic Information Science, vol 41 n° 4 (September 2014)PermalinkAn assisting, constrained 3D navigation technique for multiscale virtual 3D city models / Dieter Hildebrandt in Geoinformatica, vol 18 n° 3 (July 2014)Permalink