Détail de l'auteur
Auteur Kevin M. Curtin |
Documents disponibles écrits par cet auteur (2)
Ajouter le résultat dans votre panier
Visionner les documents numériques
Affiner la recherche Interroger des sources externes
Quality assessment and accessibility mapping in an image-based geocrowdsourcing testbed / Matthew T. Rice in Cartographica, vol 53 n° 1 (Spring 2018)
[article]
Titre : Quality assessment and accessibility mapping in an image-based geocrowdsourcing testbed Type de document : Article/Communication Auteurs : Matthew T. Rice, Auteur ; Dan Jacobson, Auteur ; Dieter Pfoser, Auteur ; Kevin M. Curtin, Auteur ; Han Qin, Auteur ; et al., Auteur Année de publication : 2018 Article en page(s) : pp 1 - 14 Note générale : Bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Géomatique web
[Termes IGN] accessibilité
[Termes IGN] données localisées des bénévoles
[Termes IGN] handicap
[Termes IGN] production participative
[Termes IGN] qualité des donnéesRésumé : (Auteur) Geocrowdsourcing is a significant new focus area in mapping for people with disabilities. It utilizes public data contributions that are difficult to capture with traditional mapping workflows. Along with the benefits of geocrowdsourcing are critical drawbacks, including reliability and accuracy. A geocrowdsourcing testbed has been designed to explore the dynamics of geocrowdsourcing and quality assessment and produce temporally relevant navigation obstacle data. These reports are then used for route planning, obstacle avoidance, and spatial awareness. Recently, the geocrowdsourcing testbed has been modified to focus on the contribution of images and short descriptions, rather than the more lengthy previous reporting process. The quality assessment workflow of the geocrowdsourcing testbed is contrasted with a modified quality assessment workflow, implemented in the simpler and quicker image-based reporting paradigm. General quality assessment of data position and temporal characteristics is still possible, while general data attributes and detail are now supplied by a moderator from the contributed image. The derivation of obstacle location from multiple intersected image direction vectors does not produce reliable results, but an approach using buffered convex hulls works dependably. This simpler, quicker geocrowdsourcing workflow produces geocrowdsourced obstacle data and quality assessment estimates for location, time, and attribute accuracy. Numéro de notice : A2018-206 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE Nature : Article nature-HAL : ArtAvecCL-RevueIntern DOI : 10.3138/cart.53.1.2017-0013 Date de publication en ligne : 21/03/2018 En ligne : https://doi.org/10.3138/cart.53.1.2017-0013 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=89922
in Cartographica > vol 53 n° 1 (Spring 2018) . - pp 1 - 14[article]Exemplaires(1)
Code-barres Cote Support Localisation Section Disponibilité 031-2018011 SL Revue Centre de documentation Revues en salle Disponible A comparative analysis of traveling salesman solutions from geographic information systems / Kevin M. Curtin in Transactions in GIS, vol 18 n° 2 (April 2014)
[article]
Titre : A comparative analysis of traveling salesman solutions from geographic information systems Type de document : Article/Communication Auteurs : Kevin M. Curtin, Auteur ; Gabriela Voicu, Auteur ; Matthew Rice, Auteur ; Anthony Stefannidis, Auteur Année de publication : 2014 Article en page(s) : pp 286 - 301 Note générale : Bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Applications SIG
[Termes IGN] analyse comparative
[Termes IGN] itinéraire
[Termes IGN] optimisation (mathématiques)
[Termes IGN] problème du voyageur de commerce
[Termes IGN] programmation linéaire
[Termes IGN] système d'information géographiqueRésumé : (Auteur) The Traveling Salesman Problem is one of the most prominent problems in combinatorial optimization, and is regularly employed in a wide variety of applications. The objective of this article is to demonstrate the extent of sub-optimality produced by Traveling Salesman solution procedures implemented in the context of Geographic Information Systems and to discuss the consequences that such solutions have for practice. Toward that end, an analysis is made of Traveling Salesman solutions from implementations in four Geographic Information System packages. These implementations are tested against the optimal solution for a range of problem sizes. Computational results are presented in the context of a school bus routing application. This analysis concludes that no Traveling Salesman implementation in GIS is likely to find the optimal solution when problems exceed 10 stops. In contrast, optimal solutions can be generated with desktop linear programming software for up to 25 cities. Moreover, one GIS implementation consistently found solutions that were closer to optimal than its competitors. This research strongly suggests that for applications with fewer than 25 stops, the use of an optimal solution procedure is advised, and that GIS implementations can benefit from the integration of more robust optimization techniques Numéro de notice : A2014-168 Affiliation des auteurs : non IGN Thématique : GEOMATIQUE Nature : Article nature-HAL : ArtAvecCL-RevueIntern DOI : 10.1111/tgis.12045 Date de publication en ligne : 09/06/2013 En ligne : https://doi.org/10.1111/tgis.12045 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=33073
in Transactions in GIS > vol 18 n° 2 (April 2014) . - pp 286 - 301[article]