Looking for breakthrough ideas for innovation challenges? Try Patsnap Eureka!

Method for inquiring visible neighbours of moving objects in environment with barriers

A query method and obstacle technology, applied in the field of indexing and query, to achieve good performance

Inactive Publication Date: 2011-04-13
ZHEJIANG UNIV
View PDF5 Cites 10 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

Considering both the mobility of objects and the large number of occluders in the environment, there is no suitable method to solve visual neighbor query

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Method for inquiring visible neighbours of moving objects in environment with barriers
  • Method for inquiring visible neighbours of moving objects in environment with barriers
  • Method for inquiring visible neighbours of moving objects in environment with barriers

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0045] The technical solution of the present invention will be further described in conjunction with the accompanying drawings and specific embodiments.

[0046] 1. If figure 1 Shown, the specific implementation process and working principle of the present invention are as follows:

[0047] Step 1) Index the spatial data, that is, use R tree index for stationary obstacles, and use TPR tree index for moving objects;

[0048] Step 2) maintaining a priority queue for storing TPR tree index nodes using metrics and a result list, in which the candidate objects currently satisfying the visible neighbor condition are stored;

[0049] Step 3) traversing the mobile object index, putting the root node of the TPR tree into the priority queue, and recursively visiting the node with the smallest measure in the queue;

[0050] Step 4) Utilize the R-tree index to judge the occlusion effect, and calculate the time when the index node is not occluded;

[0051] Step 5) Calculate the distance...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

PUM

No PUM Login to View More

Abstract

The invention discloses a method for inquiring visible neighbours of moving objects in the environment with barriers. The neighbour inquiry technology of the moving objects in a spatial database is utilized and the existing branch and bound algorithm is utilized to inquire the neighbours which are not blocked in the environment with barriers. In the spatial data, R-tree index is utilized for the barriers, TPR-tree index is utilized for the moving objects, the branch and bound algorithm is utilized to traverse the indexes, and meanwhile inquiry is realized by combining calculation of the blocking time of the moving objects. The method has the following beneficial effects: utilizing the existing indexing technology and the moving object neighbour inquiry technology in the spatial database and researches and achievements in the environment with barriers, providing the method of inquiring the moving objects which are not blocked in certain period in the environment with barriers, ensuring that the users can select the optimum inquiry time interval according to the application requirements and providing best performances.

Description

technical field [0001] The invention relates to the indexing and querying technology in the space database, in particular to a querying method for visible moving neighbors in the obstacle environment. Background technique [0002] A spatial database is a database system that stores and manages spatial data. In order to quickly and effectively access massive spatial data, experts and scholars have proposed a large number of spatial index methods, including R tree index, R* tree index, K-D-B tree index, and Hilbert curve index. On this basis, a variety of unique queries and their solutions are proposed, such as nearest neighbor query, K nearest neighbor query, continuous neighbor query, reverse nearest neighbor query, farthest neighbor query, skyline query. [0003] With the rapid development of mobile communication technology and GPS services, mobile data is increasing at an unpredictable rate in human life. So many applications prompt people to look for more effective ways...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

Application Information

Patent Timeline
no application Login to View More
Patent Type & Authority Applications(China)
IPC IPC(8): G06F17/30
Inventor 寿黎但胡天磊陈刚陈珂庞贵锋
Owner ZHEJIANG UNIV
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Patsnap Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Patsnap Eureka Blog
Learn More
PatSnap group products

Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com