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

Minimum distance calculating method of moving object in restricted space

A technology with the shortest distance and moving objects, applied in computing, instruments, electrical digital data processing, etc., can solve problems such as distance calculation of moving objects, and achieve the effect of improving efficiency

Active Publication Date: 2015-11-11
NANJING UNIV OF AERONAUTICS & ASTRONAUTICS
View PDF3 Cites 10 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0013] The purpose of the present invention is to propose an abstract model of moving objects in a confined space to solve the problem of distance calculation between moving objects

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
  • Minimum distance calculating method of moving object in restricted space
  • Minimum distance calculating method of moving object in restricted space
  • Minimum distance calculating method of moving object in restricted space

Examples

Experimental program
Comparison scheme
Effect test

Embodiment 2

[0052] Embodiment two of the present invention is as Figure 8 As shown in , it shows that when the query point of the moving object is above or below the convex polygon, the specific steps to directly calculate the angle difference between the two are as follows:

[0053] A. Randomly take the two vertices of the convex polygon corresponding to the restricted space and mark them as a and b;

[0054] B. Construct a straight line between the moving object p and the vertex a, and find the angle formed between the straight line and the x-axis;

[0055] C. Construct a straight line between the moving object p and the vertex b, and find the angle formed between the straight line and the x-axis;

[0056] D. Find the difference between the two included angles and denote it as θ;

[0057] E. Save the angle difference between the mobile query point p and the vertex.

Embodiment 3

[0059] Embodiment three of the present invention is as Figure 9 As shown in , it shows that when the query point of the moving object is not above or below the convex polygon, the specific steps to adjust the angle difference between the two are as follows:

[0060] A. Randomly take the two vertices of the convex polygon corresponding to the restricted space and mark them as a and b;

[0061] B. Construct a straight line between the moving object p and the vertex a, and find the angle formed between the straight line and the x-axis;

[0062] C. Construct a straight line between the moving object p and the vertex b, and find the angle formed between the straight line and the x-axis;

[0063] D. Find the difference between the two included angles and denote it as θ;

[0064] E. Subtract θ from 180° to get the latest angle difference;

[0065] F. Save the angle difference between the moving query point p and the vertex.

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 relates to a minimum distance calculating method of a moving object in a restricted space, and belongs to the technical field of moving objects management in the computer spatial database. According to the minimum distance calculating method of a moving object in a restricted space, obstacles in an indoor space are modeled and a visible area of the moving object is calculated. By using a method of using boundary vertices of the moving object and the obstacle space to construct a maximum angular difference, an optimum vertex in the obstacle space is obtained, and the visible area is constructed. Based on this, in the invention, the visible area is used, and for different position relationships between the moving object and the visible area: for the moving object in the visible area, the distance is directly calculated by using an Euclidean distance calculating method; and for the moving object not in the visual area, the minimum distance between the moving object and a target object is obtained by using the Dijkstra's Algorithm and the method of constructing a weighted directed graph.

Description

technical field [0001] The invention relates to a method for calculating the shortest distance of a moving object in a limited space, and belongs to the technical field of moving object management in a computer space database. Background technique [0002] Various popular smart mobile terminals, car navigation, etc., all have the function of interconnection, and can realize location sharing based on GPS, Beidou, Bluetooth, RFID and other technologies. Industry analysts predict that wireless and mobile terminals will surpass desktop computers, and mobile computing technology will emerge as the times require. Mobile computing technology promotes location-based services (LBS), and location-based services also play an increasingly important role in people's daily life, such as: intelligent transportation, route planning and logistics tracking and many other fields. Location-based services depend on efficient management of moving objects. [0003] Unlike the outdoor environment...

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): G06F19/00
Inventor 李博涵张潮秦小麟李东静王潇逸夏斌
Owner NANJING UNIV OF AERONAUTICS & ASTRONAUTICS
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