Landmark weights - an alternative to spatial distances in shortest route algorithms

Although numerous studies have shown that landmarks are important for navigation, almost all navigation systems implement a shortest-route algorithm without considering landmarks. Which options do we have to integrate landmarks into a route calculation? How would the resulting routes differ from sho...

Full description

Saved in:
Bibliographic Details
Published inSpatial cognition and computation Vol. 23; no. 3; pp. 206 - 232
Main Authors Nuhn, Eva, Timpf, Sabine
Format Journal Article
LanguageEnglish
Published Mahwah Taylor & Francis 03.07.2023
Taylor & Francis Ltd
Subjects
Online AccessGet full text
ISSN1387-5868
1542-7633
1573-9252
DOI10.1080/13875868.2022.2130330

Cover

Abstract Although numerous studies have shown that landmarks are important for navigation, almost all navigation systems implement a shortest-route algorithm without considering landmarks. Which options do we have to integrate landmarks into a route calculation? How would the resulting routes differ from shortest routes? We propose a weighting method for Dijkstra's shortest route algorithm to generate "landmark routes" and compare them to their corresponding shortest routes. We show that the extra distance and time needed to walk the landmark routes is acceptable in most of the routes. The main contribution is a thorough discussion of the differences between the two types of routes. Since the results are promising, we discuss variations in computing the weights as well as recommend human subject tests.
AbstractList Although numerous studies have shown that landmarks are important for navigation, almost all navigation systems implement a shortest-route algorithm without considering landmarks. Which options do we have to integrate landmarks into a route calculation? How would the resulting routes differ from shortest routes? We propose a weighting method for Dijkstra's shortest route algorithm to generate "landmark routes" and compare them to their corresponding shortest routes. We show that the extra distance and time needed to walk the landmark routes is acceptable in most of the routes. The main contribution is a thorough discussion of the differences between the two types of routes. Since the results are promising, we discuss variations in computing the weights as well as recommend human subject tests.
Author Timpf, Sabine
Nuhn, Eva
Author_xml – sequence: 1
  givenname: Eva
  orcidid: 0000-0003-2443-8122
  surname: Nuhn
  fullname: Nuhn, Eva
  email: eva.nuhn@geo.uni-augsburg.de
  organization: University of Augsburg
– sequence: 2
  givenname: Sabine
  orcidid: 0000-0002-7964-4110
  surname: Timpf
  fullname: Timpf, Sabine
  organization: University of Augsburg
BookMark eNqFkE1LAzEURYNUsK3-BCHgemo-JjMJbpTiFxRcqOuQyWTa1GlSk9TSf29K68aFrt5b3HN574zAwHlnALjEaIIRR9eY8prxik8IImRCMEWUohMwxKwkRV1ROsh7zhT70BkYxbhEiOC6YkPwOlOuXanwAbfGzhcpwgIqB1WfTHAq2S8Dk4dxnVfVw9bGpJw2EVoH48KHZGKCwW-SycjcB5sWq3gOTjvVR3NxnGPw_nD_Nn0qZi-Pz9O7WaEp5anQjKlGcdEgxduqVjVvqlLrWiDBeYtpo4loSibaTouOkYaQrtUcC40qTlHJ6BhcHXrXwX9u8iVy6Tf56j5KwjFnlDFc5dTNIaWDjzGYTmqb8jvepaBsLzGSe4vyx6LcW5RHi5lmv-h1sNnX7l_u9sBZ1_mwUlsf-lYmtet96EJ2aKOkf1d8A8jtizI
CitedBy_id crossref_primary_10_1080_17489725_2024_2371298
crossref_primary_10_3389_fpsyg_2023_1092715
crossref_primary_10_3390_buildings13041024
Cites_doi 10.1007/s41324-016-0023-0
10.1007/11863939_5
10.1023/A:1015514424931
10.1080/17489721003785602
10.1080/17489725.2017.1401129
10.1186/s13040-017-0155-3
10.1080/13875860802039257
10.1002/1099-0720(200007/
10.1007/978-3-319-05732-3
10.1007/3-540-48384-5
10.1007/3-540-45799-2_17
10.1007/3-540-48384-5_3
10.1145/2820783.2820820
10.1007/3-540-48384-5_5
10.1016/j.csda.2010.03.004
10.1007/978-3-540-39923-0_25
10.1207/s15516709cog0202_3
10.1007/3-540-48384-5_4
10.1007/BF01386390
10.1007/3-540-63623-4_61
10.1109/MAES.1986.5005198
10.1111/j.2044-835X.1988.tb01113.x
10.1504/IJWGS.2006.011714
10.1007/s10339-007-0199-2
10.1007/978-3-540-39923-0_24
10.1371/journal.pone.0134322
10.1016/j.apgeog.2014.06.009
10.1080/13875868.2021.1987438
10.1046/j.1468-1331.2000.t01-1-00082.x
10.1007/BF03354963
10.1007/978-3-540-39923-0_20
10.1007/978-3-540-87473-7_18
10.56021/9780801859939
10.1177/03611981211006426
10.34726/lbs2019.16
10.1007/3-540-45424-1
10.1007/978-3-540-39923-0_12
10.1109/TSSC.1968.300136
10.1007/978-3-319-96385-3_21
ContentType Journal Article
Copyright 2022 Taylor & Francis 2022
2022 Taylor & Francis
Copyright_xml – notice: 2022 Taylor & Francis 2022
– notice: 2022 Taylor & Francis
DBID AAYXX
CITATION
7SC
7TK
8FD
JQ2
L7M
L~C
L~D
DOI 10.1080/13875868.2022.2130330
DatabaseName CrossRef
Computer and Information Systems Abstracts
Neurosciences Abstracts
Technology Research Database
ProQuest Computer Science Collection
Advanced Technologies Database with Aerospace
Computer and Information Systems Abstracts – Academic
Computer and Information Systems Abstracts Professional
DatabaseTitle CrossRef
Technology Research Database
Computer and Information Systems Abstracts – Academic
ProQuest Computer Science Collection
Computer and Information Systems Abstracts
Neurosciences Abstracts
Advanced Technologies Database with Aerospace
Computer and Information Systems Abstracts Professional
DatabaseTitleList
Technology Research Database
DeliveryMethod fulltext_linktorsrc
Discipline Psychology
EISSN 1542-7633
1573-9252
EndPage 232
ExternalDocumentID 10_1080_13875868_2022_2130330
2130330
Genre Research Article
GroupedDBID .7F
.86
.QJ
0BK
0R~
123
30N
4.4
53G
AAENE
AAGDL
AAHIA
AAJMT
AALDU
AAMIU
AAPUL
AAQRR
ABCCY
ABFIM
ABHAV
ABIVO
ABJNI
ABLIJ
ABPAQ
ABPEM
ABTAI
ABUFD
ABXUL
ABXYU
ACGFO
ACGFS
ACHQT
ACIWK
ACPRK
ACTIO
ADCVX
ADGTB
AEISY
AEOZL
AEPSL
AEYOC
AFKVX
AFRVT
AGDLA
AGMYJ
AHBYD
AHDZW
AIJEM
AIYEW
AJWEG
AKBVH
AKOOK
ALMA_UNASSIGNED_HOLDINGS
ALQZU
AQRUH
AVBZW
AWYRJ
BGNMA
BLEHA
CCCUG
CE4
CS3
DGEBU
DKSSO
DU5
EBS
E~A
E~B
F5P
FPAXQ
GTTXZ
H13
HF~
HZ~
H~P
IPNFZ
J.P
KYCEM
LJTGL
M4Y
M4Z
NA5
NU0
O9-
P2P
RIG
RNANH
ROSJB
RTWRZ
S-T
SNACF
TASJS
TBQAZ
TEN
TFL
TFT
TFW
TNC
TTHFI
TUROJ
TWF
UT5
UU3
ZGOLN
~S~
AAYXX
CITATION
7SC
7TK
8FD
ADYSH
JQ2
L7M
L~C
L~D
ID FETCH-LOGICAL-c338t-c55aba89b0a8d67a78b64cc790988d13bc29b459dfc9f52b22fdc819c06830453
ISSN 1387-5868
IngestDate Fri Jul 25 12:07:27 EDT 2025
Wed Oct 01 02:55:18 EDT 2025
Thu Apr 24 22:56:42 EDT 2025
Mon Oct 20 23:48:48 EDT 2025
IsPeerReviewed true
IsScholarly true
Issue 3
Language English
LinkModel OpenURL
MergedId FETCHMERGED-LOGICAL-c338t-c55aba89b0a8d67a78b64cc790988d13bc29b459dfc9f52b22fdc819c06830453
Notes ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ORCID 0000-0002-7964-4110
0000-0003-2443-8122
PQID 2818535516
PQPubID 2030026
PageCount 27
ParticipantIDs proquest_journals_2818535516
informaworld_taylorfrancis_310_1080_13875868_2022_2130330
crossref_citationtrail_10_1080_13875868_2022_2130330
crossref_primary_10_1080_13875868_2022_2130330
ProviderPackageCode CITATION
AAYXX
PublicationCentury 2000
PublicationDate 2023-07-03
PublicationDateYYYYMMDD 2023-07-03
PublicationDate_xml – month: 07
  year: 2023
  text: 2023-07-03
  day: 03
PublicationDecade 2020
PublicationPlace Mahwah
PublicationPlace_xml – name: Mahwah
PublicationTitle Spatial cognition and computation
PublicationYear 2023
Publisher Taylor & Francis
Taylor & Francis Ltd
Publisher_xml – name: Taylor & Francis
– name: Taylor & Francis Ltd
References cit0033
cit0034
Caduff D. (cit0009) 2005
cit0032
cit0039
cit0037
cit0038
cit0035
cit0036
cit0020
Caduff D. (cit0008) 2005
Hampe M. (cit0023) 2003; 66
Grum E. (cit0022) 2005
cit0028
cit0029
cit0026
Breiman L. (cit0007) 1984
cit0027
cit0024
cit0025
cit0011
cit0012
cit0010
Lynch K (cit0030) 1960
cit0019
Golledge R. (cit0021) 1999
cit0017
cit0018
cit0015
cit0016
Maass W. (cit0031) 1996
Rüetschi U.-J. (cit0041) 2006
cit0013
cit0014
cit0044
cit0001
cit0045
cit0042
cit0043
cit0040
cit0006
cit0004
cit0048
cit0005
cit0049
cit0002
cit0046
cit0003
cit0047
References_xml – ident: cit0011
  doi: 10.1007/s41324-016-0023-0
– ident: cit0019
  doi: 10.1007/11863939_5
– ident: cit0048
  doi: 10.1023/A:1015514424931
– ident: cit0034
– ident: cit0016
  doi: 10.1080/17489721003785602
– start-page: 1
  volume-title: 6th Swiss Transport Research Conference
  year: 2006
  ident: cit0041
– ident: cit0035
  doi: 10.1080/17489725.2017.1401129
– ident: cit0012
  doi: 10.1186/s13040-017-0155-3
– start-page: 711
  volume-title: 10th International Conference on Information & Communciation Technologies (ICT) in Urban Planning and Spatial Development and Impacts of ICT on Physcial Space
  year: 2005
  ident: cit0022
– ident: cit0042
  doi: 10.1080/13875860802039257
– ident: cit0005
  doi: 10.1002/1099-0720(200007/
– ident: cit0040
  doi: 10.1007/978-3-319-05732-3
– ident: cit0020
  doi: 10.1007/3-540-48384-5
– ident: cit0038
  doi: 10.1007/3-540-45799-2_17
– ident: cit0018
– ident: cit0043
  doi: 10.1007/3-540-48384-5_3
– volume-title: AAAI spring symposium
  year: 2005
  ident: cit0008
– ident: cit0025
  doi: 10.1145/2820783.2820820
– ident: cit0029
  doi: 10.1007/3-540-48384-5_5
– ident: cit0006
  doi: 10.1016/j.csda.2010.03.004
– ident: cit0017
  doi: 10.1007/978-3-540-39923-0_25
– ident: cit0028
  doi: 10.1207/s15516709cog0202_3
– ident: cit0046
  doi: 10.1007/3-540-48384-5_4
– ident: cit0014
  doi: 10.1007/BF01386390
– ident: cit0003
  doi: 10.1007/3-540-63623-4_61
– ident: cit0032
  doi: 10.1109/MAES.1986.5005198
– ident: cit0037
  doi: 10.1111/j.2044-835X.1988.tb01113.x
– ident: cit0045
  doi: 10.1504/IJWGS.2006.011714
– year: 1960
  ident: cit0030
  publication-title: MIT Press
– ident: cit0010
  doi: 10.1007/s10339-007-0199-2
– ident: cit0044
  doi: 10.1007/978-3-540-39923-0_24
– ident: cit0049
  doi: 10.1371/journal.pone.0134322
– ident: cit0047
  doi: 10.1016/j.apgeog.2014.06.009
– ident: cit0002
  doi: 10.1080/13875868.2021.1987438
– ident: cit0004
  doi: 10.1046/j.1468-1331.2000.t01-1-00082.x
– ident: cit0013
  doi: 10.1007/BF03354963
– ident: cit0026
  doi: 10.1007/978-3-540-39923-0_20
– start-page: 14
  volume-title: 5th Swiss Transport Research Conference
  year: 2005
  ident: cit0009
– ident: cit0039
  doi: 10.1007/978-3-540-87473-7_18
– volume-title: Wayfinding behavior
  year: 1999
  ident: cit0021
  doi: 10.56021/9780801859939
– ident: cit0027
  doi: 10.1177/03611981211006426
– ident: cit0036
  doi: 10.34726/lbs2019.16
– ident: cit0033
  doi: 10.1007/3-540-45424-1
– ident: cit0015
  doi: 10.1007/978-3-540-39923-0_12
– ident: cit0024
  doi: 10.1109/TSSC.1968.300136
– volume-title: Classification and regression trees
  year: 1984
  ident: cit0007
– ident: cit0001
  doi: 10.1007/978-3-319-96385-3_21
– volume: 66
  start-page: 147
  volume-title: Geowissenschaftliche Mitteilungen: Location based services & telecartography, proceedings of the symposium 2004
  year: 2003
  ident: cit0023
– volume-title: Von Visuellen Daten zu inkrementellen Wegbeschreibungen in dreidimensionalen Umgebungen: Das Modell eines kognitiven Agenten
  year: 1996
  ident: cit0031
SSID ssj0021765
Score 2.3036969
Snippet Although numerous studies have shown that landmarks are important for navigation, almost all navigation systems implement a shortest-route algorithm without...
SourceID proquest
crossref
informaworld
SourceType Aggregation Database
Enrichment Source
Index Database
Publisher
StartPage 206
SubjectTerms Algorithms
landmark route
navigation and wayfinding
Navigation systems
shortest route
Spatial cognition
Weighting methods
Title Landmark weights - an alternative to spatial distances in shortest route algorithms
URI https://www.tandfonline.com/doi/abs/10.1080/13875868.2022.2130330
https://www.proquest.com/docview/2818535516
Volume 23
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVLSH
  databaseName: aylor and Francis Online
  customDbUrl:
  mediaType: online
  eissn: 1542-7633
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0021765
  issn: 1387-5868
  databaseCode: AHDZW
  dateStart: 20030301
  isFulltext: true
  providerName: Library Specific Holdings
– providerCode: PRVAWR
  databaseName: Taylor & Francis Science and Technology Library-DRAA
  customDbUrl:
  eissn: 1542-7633
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0021765
  issn: 1387-5868
  databaseCode: 30N
  dateStart: 20030101
  isFulltext: true
  titleUrlDefault: http://www.tandfonline.com/page/title-lists
  providerName: Taylor & Francis
link http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV1LT9wwELYKvXBB0BbxrHzobZUla-fhHKsKhKp2L4DELfIjZhGQXW0MCH4940ey2YJK6SVaRbKT7HyeGc-Mv0HomxQanNYsi4iG5QYKL48Eq1REZZpzzQA2jqf79zg7OU9-XqQXi3Jbd7rEiKF8evVcyf9IFe6BXO0p2XdItpsUbsBvkC9cQcJw_ScZ_-K1uuXz68GDC3A2g2gAy9UlwGtP6A2eZWNrpn0qxlgRuwLYZmKLbBszmE9toQC_uZzOr8wkUJcHZ_U0jAwlRqFuWbo-EEsJ_PHdxIdx7jslDxiYaR9yFm3qPgQXCHWFqLSnDy31bsp855thFXRkAk555vkrWiVKaA8stK8R46xnXIkPZr7Q277Q0T7NPgy27YQMiTWvIWmzxJP9h_3qqgpHge60naa005RhmhX0kYDit909aDzu9uSj3HUb7b6zPeTF4sNX32bJfVkit31hzJ2HcraB1sPWAn_3ONlEH6r6E1rrLNzjZ3TaAgYHwOAI8xr3AIPNFAfA4A4w-KrGLWCwAwxeAOYLOj8-OvtxEoWuGpGklJlIpikXnBUi5kxlOc-ZyBIp8yIuGFMjKiQpRJIWSstCp0QQopUEv1HGGbNpdbqFVutpXW0jrDhstiXNE6JUokYxl5W2eVqtwUrwItlBSftnlTJQztvOJzflX0W1g4bdsJnnXHlrQNGXRGlcsEv7zjQlfWPsfiu2MiztpnQUadTmkHff-y57aG2xkPbRqpnfVQfgtxrx1SHvGZOKjcc
linkProvider Taylor & Francis
linkToHtml http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1LT8MwDI4QHODCG_EmB64dbdNHekSIacC2C5vELcqjAQTr0JoJwa8nTttpAyEO_ABbreM4dvzlM0LnUmibtCaJF2q73WzASz1Bc-URGadcU-s2jqe71086w-j2IX6YewsDsEqooXVFFOFiNWxuuIxuIHEXAbFZNk0AmRWGrRDCMLFl-0psk32YYkD8_qzoClI3ThJEPJBpXvH8pmbhfFpgL_0Rrd0R1N5Asvn4Cnny0poa0ZKf33gd__d3m2i9zlDxZeVSW2gpL7bR2ixQfuyg-65VPuKTF_zuLlZL7GFeYNd4LxyRODZjXAJW2ypSkKECWBs_F7h8AnBvafBkPDW5FXkcT57N06jcRcP29eCq49XDGTxpq1rjyTjmgtNM-JyqJOUpFUkkZZr5GaUqIEKGmYjiTGmZ6TgUYaiVtOmH9BMK3Vmyh5aLcZHvI6y4rdkksUW6UpEKfC5zDe0-rW2w4Vl0gKJmSZismcthgMYrC2qC08ZkDEzGapMdoNZM7K2i7vhLIJtfb2bcnYmuBpww8ofsceMcrI4CJXNMWwRakYf_UH2GVjuDXpd1b_p3R2gN5t07vDA5RstmMs1PbFZkxKlz-y8cFPzV
linkToPdf http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1LT8MwDI4QSIgLb8SbHLh2tE0f6REB04AxIQEStyiPhiGgQ2smBL-eOG0nBkI77AfYah3HseMvnxE6lkLbpDVJvFDb7WYDXuoJmiuPyDjlmlq3cTzdN72k8xBdPcYNmrCsYZVQQ-uKKMLFatjc70o3iLiTgNgkmyYAzArDVghRmNiqfSGBrhi84vB745orSN00SRDxQKZ5xPOfmonjaYK89E-wdidQewWJ5tsr4MlLa2RES379onWc6edW0XKdn-LTyqHW0FxerKOlcZj83EB3Xav7jQ9f8Ie7Vi2xh3mBXdu9cDTi2AxwCUhtq0hBfgpQbfxc4LIP0N7S4OFgZHIr8jQYPpv-W7mJHtoX92cdrx7N4Elb0xpPxjEXnGbC51QlKU-pSCIp08zPKFUBETLMRBRnSstMx6EIQ62kTT6kn1DozZItNF8MinwbYcVtxSaJLdGVilTgc5lraPZpbUMNz6IdFDUrwmTNWw7jM15ZUNObNiZjYDJWm2wHtcZi7xVxxzSB7OdyM-NuTHQ13oSRKbL7jW-wOgaUzPFsEWhE7s6g-ggt3p63Wfeyd72HlmDYvQMLk300b4aj_MCmREYcOqf_BvUP-3k
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Landmark+weights+-+an+alternative+to+spatial+distances+in+shortest+route+algorithms&rft.jtitle=Spatial+cognition+and+computation&rft.au=Nuhn%2C+Eva&rft.au=Timpf%2C+Sabine&rft.date=2023-07-03&rft.issn=1387-5868&rft.eissn=1542-7633&rft.volume=23&rft.issue=3&rft.spage=206&rft.epage=232&rft_id=info:doi/10.1080%2F13875868.2022.2130330&rft.externalDBID=n%2Fa&rft.externalDocID=10_1080_13875868_2022_2130330
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1387-5868&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1387-5868&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1387-5868&client=summon