647 research outputs found

    Continuous Obstructed Detour Queries

    Get PDF
    In this paper, we introduce Continuous Obstructed Detour (COD) Queries, a novel query type in spatial databases. COD queries continuously return the nearest point of interests (POIs) such as a restaurant, an ATM machine and a pharmacy with respect to the current location and the fixed destination of a moving pedestrian in presence of obstacles like a fence, a lake or a private building. The path towards a destination is typically not predetermined and the nearest POIs can change over time with the change of a pedestrian\u27s current location towards a fixed destination. The distance to a POI is measured as the summation of the obstructed distance from the pedestrian\u27s current location to the POI and the obstructed distance from the POI to the pedestrian\u27s destination. Evaluating the query for every change of a pedestrian\u27s location would incur extremely high processing overhead. We develop an efficient solution for COD queries and verify the effectiveness and efficiency of our solution in experiments

    Efficient Distance-Aware Query Evaluation on Indoor Moving Objects

    Get PDF

    Dynamic Path Planning and Replanning for Mobile Robot Team Using RRT*

    Get PDF
    It is necessary for a mobile robot to be able to efficiently plan a path from itsstarting or current location to a desired goal location. This is a trivial task when theenvironment is static. However, the operational environment of the robot is rarelystatic, and it often has many moving obstacles. The robot may encounter one, ormany, of these unknown and unpredictable moving obstacles. The robot will need todecide how to proceed when one of these obstacles is obstructing it's path. A methodof dynamic replanning using RRT* is presented. The robot will modify its currentplan when an unknown random moving obstacle obstructs the path. In multi-robotscenarios it is important to efficiently develop path planning solutions. A methodof node sharing is presented to quickly develop path plans for a multi-robot team.Various experimental results show the effectiveness of the proposed methods

    Continuous Spatial Query Processing in Mobile Information Systems

    Get PDF
    Nowadays, many mobile applications provide location-based services that allow users to access location-related information from anywhere, whenever they desire. A moving user can issue queries to access information about moving or static objects. Continuous spatial query processing systems are used for this type of application. We propose two query processing strategies for location based services. The objectives of our strategies are to reduce: (1) the server workload, (2) the data transmission cost and (3) the query response time, for location-based services while providing an answer for a continuous region query. We compare our first strategy with a brute-force strategy and found that our strategy can significantly reduce the server workload and data transmission cost over the brute-force method. We compare our improved strategy with the original strategy and brute-force strategy. The experimental results show that the improved strategy achieves lower query response time than the original and brute-force strategy

    Continuous Spatial Query Processing:A Survey of Safe Region Based Techniques

    Get PDF
    In the past decade, positioning system-enabled devices such as smartphones have become most prevalent. This functionality brings the increasing popularity of location-based services in business as well as daily applications such as navigation, targeted advertising, and location-based social networking. Continuous spatial queries serve as a building block for location-based services. As an example, an Uber driver may want to be kept aware of the nearest customers or service stations. Continuous spatial queries require updates to the query result as the query or data objects are moving. This poses challenges to the query efficiency, which is crucial to the user experience of a service. A large number of approaches address this efficiency issue using the concept of safe region . A safe region is a region within which arbitrary movement of an object leaves the query result unchanged. Such a region helps reduce the frequency of query result update and hence improves query efficiency. As a result, safe region-based approaches have been popular for processing various types of continuous spatial queries. Safe regions have interesting theoretical properties and are worth in-depth analysis. We provide a comparative study of safe region-based approaches. We describe how safe regions are computed for different types of continuous spatial queries, showing how they improve query efficiency. We compare the different safe region-based approaches and discuss possible further improvements
    • …
    corecore