Unlock instant, AI-driven research and patent intelligence for your innovation.
Dynamic monitoring method and system for querying minimum distance and position
What is Al technical title?
Al technical title is built by PatSnap Al team. It summarizes the technical point description of the patent document.
A dynamic monitoring and distance technology, applied in special data processing applications, instruments, electrical digital data processing, etc., can solve the problem of not being able to solve the problem of optimal location query.
Inactive Publication Date: 2016-09-07
SHANGHAI JIAOTONG UNIV
View PDF2 Cites 0 Cited by
Summary
Abstract
Description
Claims
Application Information
AI Technical Summary
This helps you quickly interpret patents by identifying the three key elements:
Problems solved by technology
Method used
Benefits of technology
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
Click on the blue label to locate the original text in one second.
Reading with bidirectional positioning of images and text.
Smart Image
Examples
Experimental program
Comparison scheme
Effect test
Embodiment 1
[0114] 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 S5.
[0115] 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;
[0116] Step S2, through the undirected connected graph G representing the road network o =(V o ,E o ) to insert all facilities f and customers c to E o The edges in are divided into new edges. For each point ρ∈C∪F, first consider the edge e∈E where ρ is located o , let the two endpoints of e be v l and v r , and then...
Embodiment 2
[0164] The present invention also provides another dynamic monitoring system for querying the minimum distance and position, including:
[0165] 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;
[0166] The undirected connected graph module is used to represent the undirected connected graph G of the road network through directions o =(V o ,E o ) to insert all facilities f and customers c to E o The edges in are divided into new edges. For each point ρ∈C∪F, first consider the edge e∈E where ρ is located o , let the two ...
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
Login to View More
Abstract
The invention provides a dynamic monitoring method and system for inquiring the minimum distance and the position. The dynamic monitoring method comprises the steps of presetting a set C of client points, a set F of facility points and a candidate position set P, enabling the minimum distance and the position to refer that all facility points f and client points c are inserted in an undirected connected graph Go=(Vo,Eo) for indicating a road network so as to divide edges in the Eo into new edges, as for each point p belonging to a union set of C and F, firstly giving consideration to the edge e, belonging to Eo, where the p is located, enabling the two points of the e to be v1and vr, then dividing the e into two parts including v1 to p and p to vr so as to enable the p to be a new top point of the undirected connected graph, adding all new top points to generate a new undirected connected graph G=(V,E), wherein V is a union set of the Vo, the C and the F, dividing G into n sub-graphs from G1 to Gn according to the edges, wherein the value of the n is set according to needs of a user, obtaining p according to the initial set F of facility points and the initial set C of client points in the G, and dynamically monitoring the p at any time according to updating of the set F of facility points and the set C of client points in the G. The dynamic monitoring method and system can rapidly and dynamically inquire the minimum distance and the 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
Application Date:The date an application was filed.
Publication Date:The date a patent or application was officially published.
First Publication Date:The earliest publication date of a patent with the same application number.
Issue Date:Publication date of the patent grant document.
PCT Entry Date:The Entry date of PCT National Phase.
Estimated Expiry Date:The statutory expiry date of a patent right according to the Patent Law, and it is the longest term of protection that the patent right can achieve without the termination of the patent right due to other reasons(Term extension factor has been taken into account ).
Invalid Date:Actual expiry date is based on effective date or publication date of legal transaction data of invalid patent.
Login to View More 
Login to View More