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

Dynamic monitoring method and system for querying minimum distance and position

A dynamic monitoring and distance technology, applied in special data processing applications, instruments, electrical digital data processing, etc., can solve problems such as inability to solve the best position query problem

Active Publication Date: 2017-05-10
重庆交慧发掘科技有限公司
View PDF3 Cites 0 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

The techniques in these research works do not solve the optimal location query problem, because the closest point query problem is different from the optimal location query problem

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
  • Dynamic monitoring method and system for querying minimum distance and position

Examples

Experimental program
Comparison scheme
Effect test

Embodiment 1

[0078] Such as figure 1 As shown, the present invention provides a dynamic monitoring method for querying the minimum distance and position, including steps S1 to S3.

[0079] Step S1, given a set C of customer points, a set F of facility points, and a set P of candidate locations, the minimum distance and location are in is the weighted attraction distance of customer point c, w(c) is the weight of customer point c, if the distance d(c,f) between customer point c and facility point f in the road network is the minimum of the points in c and F value, then define f as the attractor of c, c is attracted by f, a(c)=d(c,f) is the attracting distance of c;

[0080] Step S2, obtain p according to the initial facility point set F and customer point set C in the road network;

[0081] Preferably, step S2 includes:

[0082] The steps to obtain p according to the initial facility point set F and customer point set C in the road network include:

[0083] An undirected connected gr...

Embodiment 2

[0111] The present invention also provides another dynamic monitoring system for querying the minimum distance and position, including:

[0112] The definition module is used to give a set C of customer points, a set F of facility points, and a set P of candidate locations. The minimum distance and location are in is the weighted attraction distance of customer point c, w(c) is the weight of customer point c, if the distance d(c,f) between customer point c and facility point f in the road network is the minimum of the points in c and F value, then define f as the attractor of c, c is attracted by f, a(c)=d(c,f) is the attracting distance of c;

[0113] An acquisition module, used to acquire p according to the initial facility point set F and customer point set C in the road network;

[0114] The update module is used to dynamically monitor p at any time according to the update of the facility point set F or the customer point set C in the road network.

[0115] Further, i...

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 provides a dynamic monitoring method and system for inquiring the minimum distance and position. The method comprises the step: giving a customer point set C, a facility point set F and a candidate position set P, wherein the minimized distance and position is that , is the weighted attracting distance of a customer point c, w(c) is the weight of the customer point c, if the distance d (c and f) between the customer point c and a facility point f in a road network is the minima value of the point c and the point f, the point f is defined to be an attractor of the point c, the point c is attracted by the point f, a(c)= d(c and f), and the d(c and f) is the attracting distance; obtaining p according to the initial facility point set F and the initial customer point set C in the road network; dynamically monitoring the p at any time according to updating of the facility point set F or the customer point set C in the road network. The dynamic monitoring method and system can rapidly and dynamically inquire the minimum distance and position.

Description

technical field [0001] The invention relates to a dynamic monitoring method and system for querying the minimum distance and position. Background technique [0002] In the past few years, there has been a lot of work on a class of "facility placement problems" in the presence of sets of customer points (see reference 8: Farahani, R.Z., Hekmatfar, M.: Facility Location: Concepts, Models, Algorithms and Case Studies, 1st edn. Physica-Verlag HD (2009), Literature 15: Nickel, S., Puerto, J.: Location Theory: A Unified Approach, 1st edn. Springer (2005)). In the most general case, the problem consists of: (1) a set C of customer points and a set P of facility candidates, and (2) query the locations of k new facilities in P such that a pre-defined optimal condition. This kind of problem has a polynomial time algorithm when k is a constant, and it is an NP-hard problem when k is a general variable (see literature 8 and 15). The existing work mainly studies its approximate algorit...

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 Patents(China)
IPC IPC(8): G06F17/30
Inventor 姚斌吴亦凡李飞飞肖小奎
Owner 重庆交慧发掘科技有限公司
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