2015
DOI: 10.1080/13658816.2015.1053485
|View full text |Cite
|
Sign up to set email alerts
|

Car navigation – computing routes that avoid complicated crossings

Abstract: Personalized navigation and way-finding are prominent research areas of locationbased service (LBSs). This includes innovative concepts for car navigation. Within this paper, we investigate the idea of providing drivers a routing suggestion which avoids 'complicated crossings' in urban areas. Inexperienced drivers include persons who have a driver's license but, for whatever reason, feel uncomfortable to drive in a city environment. Situations where the inexperienced driver has to depend on a navigation device… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

3
30
0

Year Published

2016
2016
2023
2023

Publication Types

Select...
7
1

Relationship

2
6

Authors

Journals

citations
Cited by 27 publications
(33 citation statements)
references
References 31 publications
(20 reference statements)
3
30
0
Order By: Relevance
“…In our approach, we used only a derivation of the original OSM road network, which is represented by polylines. Similar to Krisp and Keler (2015), we propose the abstraction of high node density for complicated crossings. The idea is to compare the frequency of taxi visits in crossings and in other road segments with its defined complexity.…”
Section: Traffic Analysis Based On Taxi Tipmentioning
confidence: 99%
“…In our approach, we used only a derivation of the original OSM road network, which is represented by polylines. Similar to Krisp and Keler (2015), we propose the abstraction of high node density for complicated crossings. The idea is to compare the frequency of taxi visits in crossings and in other road segments with its defined complexity.…”
Section: Traffic Analysis Based On Taxi Tipmentioning
confidence: 99%
“…Researchers put much effort to learn the needs from different drivers and try to provide them personalized navigation and way-finding solutions. For example, Krisp and Keler (2015) try to provide routes with less complicated crossings for inexperienced drivers. Jiang et al (2008) also argue that crossings and turning angles may be important in road network organization and human path selection behaviour.…”
Section: Betweenness Centrality and Traffic Patterns In Neighbouring mentioning
confidence: 99%
“…In general routing algorithms offer a number of different parameters that may provide users with different type of routes, including the shortest, fastest, safest, most beautiful, least fuel/energy consumption (Ranacher et al 2016), male/female (Häusler et al 2010), easiest (Duckham and Kulik 2003) or most difficult (to drive) route (Krisp, Keler, and Karrais 2014). As Krisp & Keler (2015) suggest, that may also include the 'most difficult to drive route', which might be useful for driver training purposes. Previous research (Krisp and Keler 2015) has investigated what is an "easy to drive" route?…”
mentioning
confidence: 99%
“…As Krisp & Keler (2015) suggest, that may also include the 'most difficult to drive route', which might be useful for driver training purposes. Previous research (Krisp and Keler 2015) has investigated what is an "easy to drive" route? and "what are the traffic situations that could be avoided for inexperienced drivers and/or driving beginners?".…”
mentioning
confidence: 99%
See 1 more Smart Citation