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

A method and system for obtaining shortest path for sampling

A shortest path, path technology, applied in the direction of instruments, calculation models, data processing applications, etc., to achieve the effect of speeding up the end

Active Publication Date: 2019-06-07
CHINA NAT ENVIRONMENTAL MONITORING CENT
View PDF13 Cites 3 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0007] The purpose of this application is to provide a method and method for obtaining the shortest path for sampling, which solves the problem of the shortest path passing through a designated location

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
  • A method and system for obtaining shortest path for sampling
  • A method and system for obtaining shortest path for sampling
  • A method and system for obtaining shortest path for sampling

Examples

Experimental program
Comparison scheme
Effect test

Embodiment 1

[0028] figure 1 is a flow chart of the method for obtaining the sampled shortest path of the present application.

[0029] like figure 1 As shown, obtaining the shortest path for sampling includes the following steps:

[0030] Step 110: Construct a location map based on the designated locations and non-designated locations, wherein the designated locations are all necessary locations in the sampling task, and the non-designated locations are locations other than the designated locations in the environmental monitoring area.

[0031] Let the set of all locations L={A1, A2,...An}, where n is the number of all locations.

[0032] The set of designated locations GL={GA1, GA2,...GAm}∈L, where m is the number of designated locations. Let the starting point SA∈L and the ending point EA∈L.

[0033] The following matrix C indicates whether any two locations Ai and Aj in the set L are directly connected:

[0034]

[0035] in

[0036]

[0037] The distance matrix between any ...

Embodiment 2

[0089] The present application also provides a shortest path system 300 for sampling, such as image 3 As shown, the system includes a composition module 310 , a pheromone initialization module 320 , an initial path acquisition module 330 , a first judgment module 340 , a final path acquisition module 350 , a shortest path acquisition module 360 ​​and a supplementary path acquisition module 370 .

[0090] The mapping module 310 is used to construct a location map based on designated locations and non-designated locations, wherein the designated locations are all necessary locations in the sampling task, and the non-designated locations are locations other than the designated locations in the environmental monitoring area.

[0091] Let the set of all locations L={A1, A2,...An}, where n is the number of all locations.

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 method and system for obtaining the shortest path of sampling. The method comprises the steps of constcuting a position map according to a sampling task; initializing three kinds of pheromones of each place; judging whether a condition of ending iteration is met or not; if not, obtaining a supplementary path of each sampling vehicle, and forming a whole path of each sampling vehicle until a condition of ending iteration is met; taking the set of the whole paths of all the sampling vehicles as a final path set; and obtaining the shortest path from the final path set. Byadding the place pheromones and the path pheromones, the problem that the traditional ant colony algorithm cannot process the shortest path passing through the specified place is solved.

Description

technical field [0001] The present application relates to the technical field of environmental monitoring, in particular to a method and system for obtaining the shortest path for sampling. Background technique [0002] The environmental detection system includes multiple sampling points and multiple detection stations. In actual operation, after the sampling vehicle obtains the sampling task, it needs to start from the location of the sampling vehicle, pass through multiple sampling points in the sampling task, and place multiple sampling points. Samples obtained at each point are sent to multiple testing stations in the mission. The travel route of the sampling vehicle is related to the efficiency of sampling. Therefore, how to obtain the shortest path for sampling is a technical problem that needs to be solved urgently. [0003] In the prior art, the Dijkstra algorithm is used to calculate the shortest path between the sampling vehicle from its location to the final dete...

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
IPC IPC(8): G06Q10/04G06N3/00
Inventor 白雪许秀艳李文攀解鑫陈鑫嵇晓燕石野杨凯孙宗光王正胡晶泊安新国
Owner CHINA NAT ENVIRONMENTAL MONITORING CENT
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