Descripteur
Documents disponibles dans cette catégorie (63)
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
An algorithm for on-the-fly K shortest paths finding in multi-storey buildings using a hierarchical topology model / Rosen Ivanov in International journal of geographical information science IJGIS, vol 32 n° 11-12 (November - December 2018)
[article]
Titre : An algorithm for on-the-fly K shortest paths finding in multi-storey buildings using a hierarchical topology model Type de document : Article/Communication Auteurs : Rosen Ivanov, Auteur Année de publication : 2018 Article en page(s) : pp 2362 - 2385 Note générale : Bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Navigation et positionnement
[Termes IGN] bati
[Termes IGN] calcul d'itinéraire
[Termes IGN] cartographie à la volée
[Termes IGN] chemin le plus court, algorithme du
[Termes IGN] connexité (graphes)
[Termes IGN] connexité (topologie)
[Termes IGN] modèle topologique de données
[Termes IGN] modélisation 3D du bâti BIM
[Termes IGN] positionnement en intérieurRésumé : (Auteur) This article presents an approach to computing K shortest paths in large buildings with complex horizontal and vertical connectivity. The building topology is obtained from Building Information Model (BIM) and implemented using directed multigraphs. Hierarchical design allows the calculation of feasible paths without the need to load into memory the topology of the entire building. It is possible to expand the graph with new connectivity on-the-fly. The paths calculated may be composed of traversable building components that are located inside the buildings or those that are both inside and outside buildings. The performance (computational time and heap size used) is optimized by using the appropriate collections (maps, lists and sets). The proposed algorithm is evaluated in several use-case scenarios – complete graphs and real building environments. In all test scenarios, the proposed path finding algorithm is faster and uses less memory when compared to the fast version of the Yen’s KSP algorithm. The proposed approach can be successfully used as a first level of coarse-to-fine path finding algorithms. Numéro de notice : A2018-525 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE/INFORMATIQUE/POSITIONNEMENT Nature : Article nature-HAL : ArtAvecCL-RevueIntern DOI : 10.1080/13658816.2018.1510126 Date de publication en ligne : 24/08/2018 En ligne : https://doi.org/10.1080/13658816.2018.1510126 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=91352
in International journal of geographical information science IJGIS > vol 32 n° 11-12 (November - December 2018) . - pp 2362 - 2385[article]Réservation
Réserver ce documentExemplaires(1)
Code-barres Cote Support Localisation Section Disponibilité 079-2018061 RAB Revue Centre de documentation En réserve L003 Disponible A hybrid ensemble learning method for tourist route recommendations based on geo-tagged social networks / Lin Wan in International journal of geographical information science IJGIS, vol 32 n° 11-12 (November - December 2018)
[article]
Titre : A hybrid ensemble learning method for tourist route recommendations based on geo-tagged social networks Type de document : Article/Communication Auteurs : Lin Wan, Auteur ; Yuming Hong, Auteur ; Zhou Huang, Auteur ; Xia Peng, Auteur ; Ran Li, Auteur Année de publication : 2018 Article en page(s) : pp 2225 - 2246 Note générale : Bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Géomatique
[Termes IGN] apprentissage automatique
[Termes IGN] calcul d'itinéraire
[Termes IGN] classification bayesienne
[Termes IGN] contenu généré par les utilisateurs
[Termes IGN] données localisées des bénévoles
[Termes IGN] données météorologiques
[Termes IGN] exploration de données géographiques
[Termes IGN] géobalise
[Termes IGN] image Flickr
[Termes IGN] Pékin (Chine)
[Termes IGN] point d'intérêtRésumé : (Auteur) Geo-tagged travel photos on social networks often contain location data such as points of interest (POIs), and also users’ travel preferences. In this paper, we propose a hybrid ensemble learning method, BAyes-Knn, that predicts personalized tourist routes for travelers by mining their geographical preferences from these location-tagged data. Our method trains two types of base classifiers to jointly predict the next travel destination: (1) The K-nearest neighbor (KNN) classifier quantifies users’ location history, weather condition, temperature and seasonality and uses a feature-weighted distance model to predict a user’s personalized interests in an unvisited location. (2) A Bayes classifier introduces a smooth kernel function to estimate a-priori probabilities of features and then combines these probabilities to predict a user’s latent interests in a location. All the outcomes from these subclassifiers are merged into one final prediction result by using the Borda count voting method. We evaluated our method on geo-tagged Flickr photos and Beijing weather data collected from 1 January 2005 to 1 July 2016. The results demonstrated that our ensemble approach outperformed 12 other baseline models. In addition, the results showed that our framework has better prediction accuracy than do context-aware significant travel-sequence-patterns recommendations and frequent travel-sequence patterns. Numéro de notice : A2018-523 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE Nature : Article nature-HAL : ArtAvecCL-RevueIntern DOI : 10.1080/13658816.2018.1458988 Date de publication en ligne : 03/05/2018 En ligne : https://doi.org/10.1080/13658816.2018.1458988 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=91348
in International journal of geographical information science IJGIS > vol 32 n° 11-12 (November - December 2018) . - pp 2225 - 2246[article]Réservation
Réserver ce documentExemplaires(1)
Code-barres Cote Support Localisation Section Disponibilité 079-2018061 RAB Revue Centre de documentation En réserve L003 Disponible Sea-land interdependence in the global maritime network: the case of Australian port cities / Justin Berli in Networks and Spatial Economics, vol 18 n° 3 (September 2018)
[article]
Titre : Sea-land interdependence in the global maritime network: the case of Australian port cities Type de document : Article/Communication Auteurs : Justin Berli , Auteur ; Mattia Bunel , Auteur ; César Ducruet, Auteur Année de publication : 2018 Projets : World Seastems / Ducruet, César Article en page(s) : pp 447 - 471 Note générale : bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Analyse spatiale
[Termes IGN] accessibilité
[Termes IGN] Australie
[Termes IGN] chemin le moins coûteux, algorithme du
[Termes IGN] chemin le plus court, algorithme du
[Termes IGN] connexité (topologie)
[Termes IGN] port
[Termes IGN] réseau de transportRésumé : (auteur) This article tackles the longstanding issue of intermodality head on. From a geomatics perspective, we model both maritime and road networks connecting port and non-port cities taking into account crucial features such as physical geography, shortest paths, and transport costs. This creates the opportunity to study a hybrid network – both planar and non-planar, and the centrality/accessibility of cities in this bi-layered network. Based on the case of Australia, main results convey new empirical findings on how port and urban hierarchies correlate with single-layered and bi-layered connectivity. We discuss main results in the light of network science, spatial science, and transport studies. Numéro de notice : A2018-499 Affiliation des auteurs : LASTIG COGIT+Ext (2012-2019) Thématique : GEOMATIQUE Nature : Article nature-HAL : ArtAvecCL-RevueIntern DOI : 10.1007/s11067-018-9403-4 Date de publication en ligne : 01/06/2018 En ligne : https://doi.org/10.1007/s11067-018-9403-4 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=96889
in Networks and Spatial Economics > vol 18 n° 3 (September 2018) . - pp 447 - 471[article]A context-based geoprocessing framework for optimizing meetup location of multiple moving objects along road networks / Shaohua Wang in International journal of geographical information science IJGIS, vol 32 n° 7-8 (July - August 2018)
[article]
Titre : A context-based geoprocessing framework for optimizing meetup location of multiple moving objects along road networks Type de document : Article/Communication Auteurs : Shaohua Wang, Auteur ; Song Gao, Auteur ; Xin Feng, Auteur ; Alan T. Murray, Auteur ; Yuan Zeng Année de publication : 2018 Article en page(s) : pp 1368 - 1390 Note générale : Bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Applications SIG
[Termes IGN] arbre-R
[Termes IGN] chaîne de traitement
[Termes IGN] chemin le plus court, algorithme du
[Termes IGN] démonstration de faisabilité
[Termes IGN] méthode heuristique
[Termes IGN] objet mobile
[Termes IGN] optimisation (mathématiques)
[Termes IGN] position
[Termes IGN] prise en compte du contexte
[Termes IGN] réseau routierRésumé : (Editeur) Given different types of constraints on human life, people must make decisions that satisfy social activity needs. Minimizing costs (i.e. distance, time, or money) associated with travel plays an important role in perceived and realized social quality of life. Identifying optimal interaction locations on road networks when there are multiple moving objects (MMO) with space–time constraints remains a challenge. In this research, we formalize the problem of finding dynamic ideal interaction locations for MMO as a spatial optimization model and introduce a context-based geoprocessing heuristic framework to address this problem. As a proof of concept, a case study involving identification of a meetup location for multiple people under traffic conditions is used to validate the proposed geoprocessing framework. Five heuristic methods with regard to efficient shortest-path search space have been tested. We find that the R* tree-based algorithm performs the best with high quality solutions and low computation time. This framework is implemented in a geographic information systems environment to facilitate integration with external geographic contextual information, e.g. temporary road barriers, points of interest, and real-time traffic information, when dynamically searching for ideal meetup sites. The proposed method can be applied in trip planning, carpooling services, collaborative interaction, and logistics management. Numéro de notice : A2018-278 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE Nature : Article DOI : 10.1080/13658816.2018.1431838 En ligne : https://doi.org/10.1080/13658816.2018.1431838 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=90360
in International journal of geographical information science IJGIS > vol 32 n° 7-8 (July - August 2018) . - pp 1368 - 1390[article]Réservation
Réserver ce documentExemplaires(1)
Code-barres Cote Support Localisation Section Disponibilité 079-2018041 RAB Revue Centre de documentation En réserve L003 Disponible The characteristics of asymmetric pedestrian behavior : A preliminary study using passive smartphone location data / Nick Malleson in Transactions in GIS, vol 22 n° 2 (April 2018)
[article]
Titre : The characteristics of asymmetric pedestrian behavior : A preliminary study using passive smartphone location data Type de document : Article/Communication Auteurs : Nick Malleson, Auteur ; Anthony Vanky, Auteur ; Behrooz Hashemian, Auteur ; Paolo Santi, Auteur ; Santosh K. Verma, Auteur ; et al., Auteur Année de publication : 2018 Article en page(s) : pp 616 - 634 Note générale : Bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Analyse spatiale
[Termes IGN] chemin le plus court, algorithme du
[Termes IGN] matrice
[Termes IGN] piéton
[Termes IGN] téléphone intelligent
[Termes IGN] trace numériqueRésumé : (Auteur) Understanding the movements of people is essential for the design and management of urban areas. This article presents a novel approach to understanding the asymmetry in route choice (i.e., the degree to which people choose different walking routes for their outbound and return journeys). The study utilizes a large volume of traces of individual routes, captured using a smartphone application. The routes are aggregated to a regular grid, and matrix statistics are developed to estimate the aggregate degree of route asymmetry for different types of route (shortest, longest, weekday, weekend, etc.). The results suggest that people change their route approximately 15% of the time. Although this varied little when observing trips made at the weekend or on a weekday, people taking journeys that deviated substantially from the shortest possible path were 6 percentage points less likely to change their routes than those taking journeys that were closest to the shortest path (14 and 20% asymmetry, respectively). The absolute length also impacted on the asymmetry of journeys, but not as substantially. This result is important because, for the first time, it reports a correlation between deviation from shortest route and aggregate pedestrian choice. Numéro de notice : A2018-218 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE Nature : Article nature-HAL : ArtAvecCL-RevueIntern DOI : 10.1111/tgis.12336 Date de publication en ligne : 06/04/2018 En ligne : https://doi.org/10.1111/tgis.12336 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=90010
in Transactions in GIS > vol 22 n° 2 (April 2018) . - pp 616 - 634[article]Semantic enrichment of octree structured point clouds for multi‐story 3D pathfinding / Florian W. Fichtner in Transactions in GIS, vol 22 n° 1 (February 2018)PermalinkPermalinkHub Labels on the database for large-scale graphs with the COLD framework / Alexandros Efentakis in Geoinformatica, vol 21 n° 4 (October - December 2017)PermalinkSnapshot and continuous points-based trajectory search / Shuyao Qi in Geoinformatica, vol 21 n° 4 (October - December 2017)PermalinkCrowdsourcing a cyclist perspective on suggested recreational paths in real-world networks / Kevin Baker in Cartography and Geographic Information Science, Vol 44 n° 5 (September 2017)PermalinkRéduction de l'erreur systématique de mesure géométrique par enrichissement altimétrique des données géographiques / Jean-François Girres in Cartes & Géomatique, n° 233 (septembre - novembre 2017)PermalinkPermalinkA method for finding a least-cost wide path in raster space / Takeshi Shirabe in International journal of geographical information science IJGIS, vol 30 n° 7- 8 (July - August 2016)PermalinkTrajectory Box Plot: a new pattern to summarize movements / Laurent Etienne in International journal of geographical information science IJGIS, vol 30 n° 5-6 (May - June 2016)PermalinkMulti-agent based path planning for first responders among moving obstacles / Zhiyong Wang in Computers, Environment and Urban Systems, vol 56 (March 2016)PermalinkSeamline determination for high resolution orthoimage mosaicking using watershed segmentation / Wang Mi in Photogrammetric Engineering & Remote Sensing, PERS, vol 82 n° 2 (February 2016)PermalinkThe interaction of landmarks and map alignment in you-are-here maps / Grant McKenzie in Cartographic journal (the), Vol 53 n° 1 (February 2016)PermalinkThe role of contextual info-marks in navigating a virtual rural environment / Adam Rousell in Transactions in GIS, vol 20 n° 1 (February 2016)PermalinkPermalinkSPLZ: An efficient algorithm for single source shortest path problem using compression method / Jingwei Sun in Geoinformatica, vol 20 n° 1 (January - March 2016)PermalinkA 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)PermalinkCar navigation – computing routes that avoid complicated crossings / Jukka Mathias Krisp in International journal of geographical information science IJGIS, vol 29 n° 11 (November 2015)PermalinkPlanning unobstructed paths in traffic-aware spatial networks / Shuo Shang in Geoinformatica, vol 19 n° 4 (October - December 2015)PermalinkParcourir 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)PermalinkSimulating and visualizing sidewalk accessibility for wayfinding of people with disabilities / Mohammadamin Tajgardoon in International journal of cartography, vol 1 n° 1 (August 2015)Permalink