Change search
ReferencesLink to record
Permanent link

Direct link
Shortest Path Search from a Physical Perspective
Department of Geoinformation and Cartography, Vienna University of Technology.ORCID iD: 0000-0001-5572-7395
2005 (English)In: SPATIAL INFORMATION THEORY, PROCEEDINGS / [ed] A. G. Cohn and D. M. Mark, Springer Berlin/Heidelberg, 2005, 83-95 p.Conference paper (Refereed)
Abstract [en]

Shortest path problems are simple yet rich in applications in many areas including spatial information theory and geographic information science. Though they explicitly or implicitly involve some object that travels in a given network, existing algorithms and applications tend to focus only on geometric properties of the network (e.g. arc length and connectivity), and overlook physical properties of the object (e.g. velocity and acceleration) which may not be constant during a trip. This paper introduces a physical perspective to shortest path search by enforcing laws of motion, to enhance the estimation of travel times and the search for optimal paths with respect to physical quantities rather than socio-economic values.

Place, publisher, year, edition, pages
Springer Berlin/Heidelberg, 2005. 83-95 p.
, Lecture Notes in Computer Science, ISSN 0302-9743 ; 3693
National Category
Computer Science
URN: urn:nbn:se:kth:diva-66485DOI: 10.1007/11556114_6ISI: 000233132900006ISBN: 3-540-28964-XOAI: diva2:484155
International Conference on Spatial Informational Theory. Elliottville, NY. SEP 14-18, 2005

QC 20120127

Available from: 2012-01-26 Created: 2012-01-26 Last updated: 2016-05-16Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full text

Search in DiVA

By author/editor
Shirabe, Takeshi
Computer Science

Search outside of DiVA

GoogleGoogle Scholar
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Altmetric score

Total: 18 hits
ReferencesLink to record
Permanent link

Direct link