Route skyline queries: A multi-preference path planning approach

Kriegel, Hans‐Peter; Renz, Matthias; Schubert, Matthias

doi:10.1109/icde.2010.5447845

Cited by 131 publications

(85 citation statements)

References 21 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The authors in [26] proposed a new method to process continuous skyline in road network based on precomputing the shortest range data of targets. The authors in [27] introduced route skyline computation in a multiattribute graph. Top routes are computed iteratively in an efficient way and pruning technique is adopted in order to reduce the search space.…”

Section: Related Workmentioning

confidence: 99%

Continuous Probabilistic Skyline Queries for Uncertain Moving Objects in Road Network

Pan

Dong

Cao

et al. 2014

International Journal of Distributed Sensor Networks

View full text Add to dashboard Cite

In moving environment, the positions of moving objects cannot be located accurately. Apart from the measuring instrument errors, movement of the objects is the main factor contributing to this uncertainty. This uncertainty makes dominant relationship of data instable, which will affect skyline operator. In this paper, we mainly study the continuous probabilistic skyline query for uncertain moving objects in road network. The query point is deemed to be stationary while moving objects are treated as targets with uncertainty described by a probability density function. After defining the notion of dominant probability and probabilistic skyline, we put forward a novel algorithm to deal with continuous probabilistic skyline query on road network. Firstly, we compute the dominant probability and skyline probability to get initial permanent p-skyline set. Then we define events to predict the time when dominant relationship between moving objects may change. Furthermore, we track and calculate events to update the probabilistic skyline in an incremental way. Two pruning strategies are proposed to cancel invalid events and objects in a bid to diminish search space. Finally, an extensive experimental evaluation on real datasets shows that probabilistic skyline sets in road network can be updated by the proposed algorithm. It demonstrates both efficiency and effectiveness.

show abstract

Section: Related Workmentioning

confidence: 99%

Continuous Probabilistic Skyline Queries for Uncertain Moving Objects in Road Network

Pan

Dong

Cao

et al. 2014

International Journal of Distributed Sensor Networks

View full text Add to dashboard Cite

show abstract

“…The algorithms terminates when there is no path left that could be extended into a member of the route skyline to the destination node. For a more detailed description of the algorithm please refer to [2].…”

Section: Implemented Algorithmsmentioning

confidence: 99%

“…To calculate the route skyline for a given set of quality criteria, we employ the ARSC algorithm described in [2]. The basic idea of this algorithm is a best first traversal of the graph beginning with the starting position.…”

Section: Implemented Algorithmsmentioning

confidence: 99%

See 1 more Smart Citation

MARiO: Multi-Attribute Routing in Open Street Map

Graf

Kriegel

Renz

et al. 2011

Advances in Spatial and Temporal Databases

Self Cite

View full text Add to dashboard Cite

Abstract. In recent years, the Open Street Map (OSM) project collected a large repository of spatial network data containing a rich variety of information about traffic lights, road types, points of interest etc.. Formally, this network can be described as a multi-attribute graph, i.e. a graph considering multiple attributes when describing the traversal of an edge. In this demo, we present our framework for Multi Attribute Routing in Open Street Map (MARiO). MARiO includes methods for preprocessing OSM data by deriving attribute information and integrating additional data from external sources. There are several routing algorithms already available and additional methods can be easily added by using a plugin mechanism. Since routing in a multi-attribute environment often results in large sets of potentially interesting routes, our graphical fronted allows various views to interactively explore query results.

show abstract

“…The penalties are derived from the overlap of the actual path with previously computed paths [9,10]. Finally, the alternative routing problem has also been approached as skyline query on multi-criterion networks [11,12,13].…”

Section: Introductionmentioning

confidence: 99%

Alternative routing

Chondrogiannis

Bouros

Gamper

et al. 2015

Proceedings of the 23rd SIGSPATIAL International Conference on Advances in Geographic Information Systems

View full text Add to dashboard Cite

Shortest path computation is a fundamental problem in road networks with application in various domains in research and industry. However, returning only the shortest path is often not satisfying; users are also interested in alternative paths which might be longer but have other advantages, e.g., less frequent traffic congestion. In this paper, we formally introduce the k-Shortest Paths with Limited Overlap (k-SPwLO) problem seeking to recommend k alternative paths which are (a) as short as possible and (b) sufficiently dissimilar based on a user-controlled similarity threshold. We propose two algorithms that examine the paths from a source s to a target t in increasing order of their length and progressively construct the result set. The baseline algorithm BSL builds upon a standard algorithm for computing k-Shortest Paths, followed by a filter step. The OnePass algorithm considers the overlap constraint in each expansion step while traversing the network. We evaluate the performance of both algorithms on real road networks and show that OnePass always outperforms BSL.

show abstract

Route skyline queries: A multi-preference path planning approach

Cited by 131 publications

References 21 publications

Continuous Probabilistic Skyline Queries for Uncertain Moving Objects in Road Network

Continuous Probabilistic Skyline Queries for Uncertain Moving Objects in Road Network

MARiO: Multi-Attribute Routing in Open Street Map

Alternative routing

Contact Info

Product

Resources

About