An interactive approach to route search

Yaron Kanza*, Roy Levin, Eliyahu Safra, Yehoshua Sagiv

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

13 Scopus citations

Abstract

In a probabilistic route search, there is a start location, a target location, and search queries Q1, ..., Qn. Each Q i has an answer set Ai consisting of geo-spatial objects and their probabilities. The probability of an object o ∈ Ai specifies the likelihood that o satisfies Qi. The goal is to compute a route that is short and yet has a high probability of satisfying all the Qi. This paper investigates interactive route search. Upon arrival at each object, the user provides feedback specifying whether the object satisfies its corresponding query. The goal is to compute the next object to be visited, based on the feedback. Several heuristic algorithms are given and compared experimentally.

Original languageEnglish
Title of host publication17th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems, ACM SIGSPATIAL GIS 2009
Pages408-411
Number of pages4
DOIs
StatePublished - 2009
Event17th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems, ACM SIGSPATIAL GIS 2009 - Seattle, WA, United States
Duration: 4 Nov 20096 Nov 2009

Publication series

NameGIS: Proceedings of the ACM International Symposium on Advances in Geographic Information Systems

Conference

Conference17th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems, ACM SIGSPATIAL GIS 2009
Country/TerritoryUnited States
CitySeattle, WA
Period4/11/096/11/09

Keywords

  • Geographic information system
  • Heuristic algorithms
  • Path
  • Probabilistic data
  • Queries
  • Route
  • Search

Fingerprint

Dive into the research topics of 'An interactive approach to route search'. Together they form a unique fingerprint.

Cite this