Isochrones, traffic and DEMOgraphics

Efentakis, Alexandros; Grivas, Nikos; Lamprianidis, George; Magenschab, Georg; Pfoser, Dieter

doi:10.1145/2525314.2525325

Cited by 17 publications

(14 citation statements)

References 5 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The major improvement in SALT is that by tweaking the number of cell levels (L = 6) and the number of cells at the upper cell level (|C L | = 16), we may efficiently answer both forward and reverse SSSP queries without increasing the preprocessing time significantly. As shown in previous works [13], this type of flexibility is extremely important for a wide range of geomarketing applications.…”

Section: Single-source Shortest-path Queriesmentioning

confidence: 79%

SALT. A Unified Framework for All Shortest-Path Query Variants on Road Networks

Efentakis

Pfoser

Vassiliou

2015

Experimental Algorithms

Self Cite

View full text Add to dashboard Cite

Although recent scientific output focuses on multiple shortest-path problem definitions for road networks, none of the existing solutions does efficiently answer all different types of SP queries. This work proposes SALT, a novel framework that not only efficiently answers SP related queries but also k-nearest neighbor queries not handled by previous approaches. Our solution offers all the benefits needed for practical use-cases, including excellent query performance and very short preprocessing times, thus making it also a viable option for dynamic road networks, i.e., edge weights changing frequently due to traffic updates. The proposed SALT framework is a deployable software solution capturing a range of network-related query problems under one "algorithmic hood".

show abstract

Section: Single-source Shortest-path Queriesmentioning

confidence: 79%

SALT. A Unified Framework for All Shortest-Path Query Variants on Road Networks

Efentakis

Pfoser

Vassiliou

2015

Experimental Algorithms

Self Cite

View full text Add to dashboard Cite

show abstract

“…We defined output that is reasonable, e. g., for actual visualization of isochrones. The approach of [25] (used as state-of-the-art in recent work [13]) can be modified easily to take isochrone edges as input. Given a (planar) graph representation of the network, this can be achieved by traversing the faces of the graph along the border of the region in range, switching to the corresponding twin face at isochrone edges.…”

Section: Final Remarksmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

“…Hence, rather than actual distances, information about the subgraph within range is required. Isolines are relevant in a wide range of applications, such as reachability analyses [3,17,18], geomarketing [13], range visualization for (electric) vehicles [20], and a variety of online applications [22].Related Work. Dijkstra's well-known algorithm [12] computes shortest paths from a given source to all (reachable) vertices in (almost) linear time.…”

mentioning

confidence: 99%

See 1 more Smart Citation

Fast Exact Computation of Isochrones in Road Networks

Baum

Buchhold

Dibbelt

et al. 2016

Experimental Algorithms

View full text Add to dashboard Cite

We study the problem of computing isochrones in road networks, where the objective is to identify the region that is reachable from a given source within a certain amount of time. While there is a wide range of practical applications for this problem (e. g., reachability analyses, geomarketing, visualizing the cruising range of a vehicle), there has been little research on fast computation of isochrones on large, realistic inputs. In this work, we formalize the notion of isochrones in road networks and present a basic approach for the resulting problem based on Dijkstra's algorithm. Moreover, we consider several speedup techniques that are based on previous approaches for one-tomany shortest path computation (or similar scenarios). In contrast to such related problems, the set of targets is not part of the input when computing isochrones. We extend known Multilevel Dijkstra techniques (such as CRP) to the isochrone scenario, adapting a previous technique called isoGRASP to our problem setting (thereby, enabling faster queries). Moreover, we introduce a family of algorithms based on (single-level) graph partitions, following different strategies to exploit the efficient access patterns of PHAST, a well-known approach towards one-to-all queries. Our experimental study reveals that all speedup techniques allow fast isochrone computation on input graphs at continental scale, while providing different tradeoffs between preprocessing effort, space consumption, and query performance. Finally, we demonstrate that all techniques scale well when run in parallel, decreasing query times to a few milliseconds (orders of magnitude faster than the basic approach) and enabling even interactive applications. on practical algorithms for routing in road networks [2]. Most work focused on computing distances (or shortest paths) between pairs (or sets) of vertices. On the other hand, isochrones (more generally, isolines) are defined as curves of constant distance (from a given source). Thereby, isochrones represent the area that is in range for a given time limit (or some other limited resource). Hence, rather than actual distances, information about the subgraph within range is required. Isolines are relevant in a wide range of applications, such as reachability analyses [3,17,18], geomarketing [13], range visualization for (electric) vehicles [20], and a variety of online applications [22].Related Work. Dijkstra's well-known algorithm [12] computes shortest paths from a given source to all (reachable) vertices in (almost) linear time. The MINE algorithm [17] is a Dijkstra-based search to compute isochrones in transportation networks, using a spatial network database. An improved variant, MIMEX [18], has reduced space requirements. Both approaches work on databases, prohibiting interactive applications (with running times beyond the order of minutes).Regarding shortest-path computation, on the other hand, various speedup techniques [2] were developed for faster queries, using an offline preprocessing phase (sometimes including an ad...

show abstract

“…Destination-selection isochrone maps [35]: When selecting the destination, reachable areas were highlighted on the map using either normal or eco-driving style (see Figure 3, upper left).…”

mentioning

confidence: 99%

Influence of Adaptive Human–Machine Interface on Electric-Vehicle Range-Anxiety Mitigation

Musabini

Nguyen

Rouyer³

et al. 2020

MTI

View full text Add to dashboard Cite

The electrification of vehicles is without a doubt one of the milestones of today’s automotive technology. Even though industry actors perceive it as a future standard, acceptance, and adoption of this kind of vehicles by the end user remain a huge challenge. One of the main issues is the range anxiety related to the electric vehicle’s remaining battery level. In the scope of the H2020 ADAS&ME project, we designed and developed an intelligent Human Machine Interface (HMI) to ease acceptance of Electric Vehicle (EV) technology. This HMI is mounted on a fake autonomous vehicle piloted by a hidden joystick (called Wizard of Oz (WoZ) driving). We examined 22 inexperienced EV drivers during a one-hour driving task tailored to generate range anxiety. According to our protocol, once the remaining battery level started to become critical after manual driving, the HMI proposed accurate coping techniques to inform the drivers how to reduce the power consumption of the vehicle. In the following steps of the protocol, the vehicle was totally out of battery, and the drivers had to experience an emergency stop. The first result of this paper was that an intelligent HMI could reduce the range anxiety of the driver by proposing adapted coping strategies (i.e., transmitting how to save energy when the vehicle approaches a traffic light). The second result was that such an HMI and automated driving to a safe spot could reduce the stress of the driver when an emergency stop is necessary.

show abstract

Isochrones, traffic and DEMOgraphics

Cited by 17 publications

References 5 publications

SALT. A Unified Framework for All Shortest-Path Query Variants on Road Networks

SALT. A Unified Framework for All Shortest-Path Query Variants on Road Networks

Fast Exact Computation of Isochrones in Road Networks

Influence of Adaptive Human–Machine Interface on Electric-Vehicle Range-Anxiety Mitigation

Contact Info

Product

Resources

About