Centre de documentation
scientifique

Predicting the variability in pedestrian travel rates and times using crowdsourced GPS data / Michael J. Campbell in Computers, Environment and Urban Systems, vol 97 (October 2022)  

Public [article]  inComputers, Environment and Urban Systems > vol 97 (October 2022) . - n° 101866 Titre : Predicting the variability in pedestrian travel rates and times using crowdsourced GPS data Type de document : Article/Communication Auteurs : Michael J. Campbell, Auteur ; Philip E. Dennison, Auteur ; Matthew Thompson, Auteur Année de publication : 2022 Article en page(s) : n° 101866 Note générale : bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Géomatique [Termes IGN] base de données localisées [Termes IGN] Californie (Etats-Unis) [Termes IGN] chemin le moins coûteux, algorithme du [Termes IGN] données issues des réseaux sociaux [Termes IGN] durée de trajet [Termes IGN] mobilité urbaine [Termes IGN] navigation pédestre [Termes IGN] pente [Termes IGN] planification urbaine [Termes IGN] trace GPS [Termes IGN] Utah (Etas-Unis) Résumé : (auteur) Accurately predicting pedestrian travel times is critically valuable in emergency response, wildland firefighting, disaster management, law enforcement, and urban planning. However, the relationship between pedestrian movement and landscape conditions is highly variable between individuals, making it difficult to estimate how long it will take broad populations to get from one location to another on foot. Although functions exist for predicting travel rates, they typically oversimplify the inherent variability of pedestrian travel by assuming the effects of landscapes on movement are universal. In this study, we present an approach for predicting the variability in pedestrian travel rates and times using a large, crowdsourced database of GPS tracks. Acquired from the outdoor recreation website AllTrails, these tracks represent nearly 2000 hikes on a diverse range of trails in Utah and California, USA. We model travel rates as a function of the slope of the terrain by generating a series of non-linear percentile models from the 2.5 th to the 97.5 th by 2.5 percentiles. The 50 th percentile model, representing the hiking speed of the typical individual, demonstrates marked improvement over existing slope-travel rate functions when compared to an independent test dataset. Our results demonstrate novel capacity to estimate travel time variability, with modeled percentiles being able to predict actual percentiles with less than 10% error. Travel rate functions can also be applied to least cost path analysis to provide variability in travel times. Numéro de notice : A2022-599 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE Nature : Article nature-HAL : ArtAvecCL-RevueIntern DOI : 10.1016/j.compenvurbsys.2022.101866 Date de publication en ligne : 20/08/2022 En ligne : https://doi.org/10.1016/j.compenvurbsys.2022.101866 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=101452 [article]

Cost distances and least cost paths respond differently to cost scenario variations: a sensitivity analysis of ecological connectivity modeling / Paul Savary in International journal of geographical information science IJGIS, vol 36 n° 8 (August 2022)  

Public [article]  inInternational journal of geographical information science IJGIS > vol 36 n° 8 (August 2022) . - pp 1652-1676 Titre : Cost distances and least cost paths respond differently to cost scenario variations: a sensitivity analysis of ecological connectivity modeling Type de document : Article/Communication Auteurs : Paul Savary, Auteur ; Jean-Christophe Foltête, Auteur ; Stéphane Garnier, Auteur Année de publication : 2022 Article en page(s) : pp 1652-1676 Note générale : bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Analyse spatiale [Termes IGN] analyse de sensibilité [Termes IGN] chemin le moins coûteux, algorithme du [Termes IGN] connexité (topologie) [Termes IGN] coût Résumé : (auteur) Biodiversity conservation measures designed to ensure ecological connectivity depend on the reliable modeling of species movements. Least-cost path modeling makes it possible to identify the most likely dispersal paths within a landscape and provide two items of ecological relevance: (i) the spatial location of these least-cost paths (LCPs) and (ii) the accumulated cost along them (’cost distance’, CD). This spatial analysis requires that cost values be assigned to every type of land cover. The sensitivity of both LCPs and CDs to the cost scenarios has not been comprehensively assessed across realistic landscapes and diverging cost scenarios. We therefore assessed it in diverse landscapes sampled over metropolitan France and with widely diverging cost scenarios. The spatial overlap of the LCPs was more sensitive to the cost scenario than the CD values were. In addition, highly correlated CD matrices can be derived from very different cost scenarios. Although the range of the cost values and the properties of each cost scenario significantly influenced the outputs of LCP modeling, landscape composition and configuration variables also explained their variations. Accordingly, we provide guidelines for the use of LCP modeling in ecological studies and conservation planning. Numéro de notice : A2022-614 Affiliation des auteurs : non IGN Thématique : BIODIVERSITE/GEOMATIQUE Nature : Article nature-HAL : ArtAvecCL-RevueIntern DOI : 10.1080/13658816.2021.2014852 Date de publication en ligne : 21/12/2021 En ligne : https://doi.org/10.1080/13658816.2021.2014852 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=101368 [article]

The "Incense Road" from Petra to Gaza: an analysis using GIS and Cost functions / Motti Zohar in International journal of geographical information science IJGIS, vol 34 n° 2 (February 2020)  

Public [article]  inInternational journal of geographical information science IJGIS > vol 34 n° 2 (February 2020) . - pp 292 - 310 Titre : The "Incense Road" from Petra to Gaza: an analysis using GIS and Cost functions Type de document : Article/Communication Auteurs : Motti Zohar, Auteur ; Tali Erickson-Gini, Auteur Année de publication : 2020 Article en page(s) : pp 292 - 310 Note générale : bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Systèmes d'information géographique [Termes IGN] Arabie [Termes IGN] bassin méditerranéen [Termes IGN] carte archéologique [Termes IGN] carte numérique [Termes IGN] chemin le moins coûteux, algorithme du [Termes IGN] empreinte [Termes IGN] histoire [Termes IGN] image ALOS-PALSAR [Termes IGN] modèle numérique de surface [Termes IGN] Petra [Termes IGN] reconstruction de route [Termes IGN] ressources en eau [Termes IGN] système d'information géographique Résumé : (auteur) As early as the fourth century BCE, the Nabateans established the Incense Road to facilitate the transport of aromatic substances (frankincense and myrrh) from the Arabian Peninsula to the Mediterranean basin. An important part of this road was the segment between Petra and Gaza. Although studied before, the accurate route of parts of this segment is still vague since evidence of Roman milestones are scarce and significant portions of the landscape have changed dramatically in modern times, essentially wiping out the tracks of ancient roads. In this study, we use Geographic Information Systems (GIS) and Least Cost Path (LCP) analyses for reconstructing the original path of the Incense Road as well as verifying the factors influencing its establishment. The implemented analyses support the archeological evidence of two travel phases between Petra and Oboda (Avdat): During the first phase the Nabateans used the Darb es-Sultan route; during the second phase, from the first century BCE onwards, they passed through the Ramon Crater. This is the first time such reconstruction is made in the southern Levant. It was found that slope degree and the distance to water resources are dominant factors in reconstructing the accurate path of the Incense Road. Numéro de notice : A2020-029 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE Nature : Article nature-HAL : ArtAvecCL-RevueIntern DOI : 10.1080/13658816.2019.1669795 En ligne : https://doi.org/10.1080/13658816.2019.1669795 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=94482 [article]

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)  

Public [article]  inNetworks and Spatial Economics > vol 18 n° 3 (September 2018) . - pp 447 - 471 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 transport Ré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 [article]

A 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)  

Public [article]  inInternational journal of geographical information science IJGIS > vol 30 n° 7- 8 (July - August 2016) . - pp 1469 - 1485 Titre : A method for finding a least-cost wide path in raster space Type de document : Article/Communication Auteurs : Takeshi Shirabe, Auteur Année de publication : 2016 Article en page(s) : pp 1469 - 1485 Note générale : Bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Systèmes d'information géographique [Termes IGN] chemin le moins coûteux, algorithme du [Termes IGN] données maillées [Termes IGN] traitement automatique de données Résumé : (Auteur) Given a grid of cells each having an associated cost value, a raster version of the least-cost path problem seeks a sequence of cells connecting two specified cells such that its total accumulated cost is minimized. Identifying least-cost paths is one of the most basic functions of raster-based geographic information systems. Existing algorithms are useful if the path width is assumed to be zero or negligible compared to the cell size. This assumption, however, may not be valid in many real-world applications ranging from wildlife corridor planning to highway alignment. This paper presents a method to solve a raster-based least-cost path problem whose solution is a path having a specified width in terms of Euclidean distance (rather than by number of cells). Assuming that all cell values are positive, it does so by transforming the given grid into a graph such that each node represents a neighborhood of a certain form determined by the specified path width, and each arc represents a possible transition from one neighborhood to another. An existing shortest path algorithm is then applied to the graph. This method is highly efficient, as the number of nodes in the transformed graph is not more than the number of cells in the given grid and decreases with the specified path width. However, a shortcoming of this method is the possibility of generating a self-intersecting path which occurs only when the given grid has an extremely skewed distribution of cost values. Numéro de notice : A2016-311 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE Nature : Article nature-HAL : ArtAvecCL-RevueIntern DOI : 10.1080/13658816.2015.1124435 En ligne : http://dx.doi.org/10.1080/13658816.2015.1124435 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=80911 [article]

Exemplaires(2)

Code-barres	Cote	Support	Localisation	Section	Disponibilité
079-2016042	RAB	Revue	Centre de documentation	En réserve L003	Disponible
079-2016041	RAB	Revue	Centre de documentation	En réserve L003	Disponible

The 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)  

Permalink

Finding optimal travel routes with uncertain cost data / Denis J. Dean in Transactions in GIS, vol 17 n° 2 (April 2013)  

Permalink

Comparison of different strategies for determining raster-based least-cost paths with a minimum amount of distortion / H. Antikainen in Transactions in GIS, vol 17 n° 1 (February 2013)  

Permalink

Aerial image mosaicking with aid of vector roads / D. Wang in Photogrammetric Engineering & Remote Sensing, PERS, vol 78 n° 11 (November 2012)  

Permalink

An extension of GIS-based least-cost path modelling to the location of wide paths / Alexandre B. Goncalves in International journal of geographical information science IJGIS, vol 24 n°7-8 (july 2010)  

Permalink

Multi-criteria evaluation and least-cost path analysis for optimal haulage routing of dump trucks in large scale open-pit mines / Yunjung Choi in International journal of geographical information science IJGIS, vol 23 n°11-12 (november 2009)  

Permalink

Deriving new minimum cost pathways from existing paths / Denis J. Dean in Cartography and Geographic Information Science, vol 32 n° 1 (January 2005)  

Permalink

Extensions to least-cost path algorithms for roadway planning / C. Yu in International journal of geographical information science IJGIS, vol 17 n° 4 (june 2003)  

Permalink