Collectively Find Spatial Objects in Time-Dependent Spatial Network

摘要

With the rapid revolution of GPS-equipped devices, discovery of spatial objects with user's requirement in a city that takes minimum travelling time is a very big challenge. To retrieve spatial objects, we use some spatial queries that have both textual description and location of objects. All existing queries in spatial network focus on finding single objects rather than group of objects, and also assume that each edge of spatial network has constant weight. But in real-world scenario weight of each edge varies and depends on various factor for, e.g., congestion, road blocking, etc. In this paper, we propose a query that collectively finds a group of spatial objects in such a way that group's keyword matches with query's keyword and sum of their traveling time is minimum using objects near to the query location and also has lowest inter-object distance with considering the lowest congestion in their path. The aim of this query is to help users in application like emergency services, trip planning, etc.