CN107747942A - Mobile reader path planning and the method for optimization in a kind of RFID application systems - Google Patents
Mobile reader path planning and the method for optimization in a kind of RFID application systems Download PDFInfo
- Publication number
- CN107747942A CN107747942A CN201710813768.4A CN201710813768A CN107747942A CN 107747942 A CN107747942 A CN 107747942A CN 201710813768 A CN201710813768 A CN 201710813768A CN 107747942 A CN107747942 A CN 107747942A
- Authority
- CN
- China
- Prior art keywords
- path
- reader
- ant
- pheromones
- node
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
Classifications
-
- G—PHYSICS
- G01—MEASURING; TESTING
- G01C—MEASURING DISTANCES, LEVELS OR BEARINGS; SURVEYING; NAVIGATION; GYROSCOPIC INSTRUMENTS; PHOTOGRAMMETRY OR VIDEOGRAMMETRY
- G01C21/00—Navigation; Navigational instruments not provided for in groups G01C1/00 - G01C19/00
- G01C21/20—Instruments for performing navigational calculations
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06K—GRAPHICAL DATA READING; PRESENTATION OF DATA; RECORD CARRIERS; HANDLING RECORD CARRIERS
- G06K17/00—Methods or arrangements for effecting co-operative working between equipments covered by two or more of main groups G06K1/00 - G06K15/00, e.g. automatic card files incorporating conveying and reading operations
- G06K17/0022—Methods or arrangements for effecting co-operative working between equipments covered by two or more of main groups G06K1/00 - G06K15/00, e.g. automatic card files incorporating conveying and reading operations arrangements or provisious for transferring data to distant stations, e.g. from a sensing device
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06N—COMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS
- G06N3/00—Computing arrangements based on biological models
- G06N3/004—Artificial life, i.e. computing arrangements simulating life
- G06N3/006—Artificial life, i.e. computing arrangements simulating life based on simulated virtual individual or collective life forms, e.g. social simulations or particle swarm optimisation [PSO]
Landscapes
- Engineering & Computer Science (AREA)
- Physics & Mathematics (AREA)
- Radar, Positioning & Navigation (AREA)
- Remote Sensing (AREA)
- Theoretical Computer Science (AREA)
- General Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- Biophysics (AREA)
- General Health & Medical Sciences (AREA)
- Biomedical Technology (AREA)
- Life Sciences & Earth Sciences (AREA)
- Computational Linguistics (AREA)
- Data Mining & Analysis (AREA)
- Evolutionary Computation (AREA)
- Artificial Intelligence (AREA)
- Molecular Biology (AREA)
- Computing Systems (AREA)
- Health & Medical Sciences (AREA)
- Mathematical Physics (AREA)
- Software Systems (AREA)
- Automation & Control Theory (AREA)
- Agricultural Chemicals And Associated Chemicals (AREA)
Abstract
The invention discloses mobile reader path planning in a kind of RFID application systems and the method for optimization, on the basis of fixed reader deployment decision scheme, solution mobile reader path planning and optimization problem are converted into using figure mapping method and seek the shortest route problem that all nodes are traveled through in weighted graph；Then, design ant algorithm and realize the solution shortest route problem, to obtain the planning in mobile reader path and optimization.The inventive method is novel, simple, takes full advantage of fixed fixed reader deployment scheme, is not required to be modeled otherwise for mobile reader.
Description
Technical field
It is more particularly to a kind of using figure mapping and ant algorithm the present invention relates to RFID applications and system optimization technology field
Realize mobile reader path planning and the method for optimization in RFID application systems.
Background technology
With the continuous development of technology of Internet of things, substantial amounts of RFID (Radio Frequency Identification) should
Needed to plan and built with system, how to plan and dispose a RFID application system efficiently, inexpensive, it has also become RFID skills
A very important task in art application.One RFID of Internet-of-things application system of deployment need to consider simultaneously application environment,
Many factors and the constraintss such as covering, interference, load balance, recognition rate, equipment cost, modeling and optimization process are very multiple
It is miscellaneous, thus turn into one of the problem of challenging in RFID applications.As RFID of Internet-of-things application system scale is more and more huger
Greatly, it is complicated, in some application systems, in addition to Optimization deployment fixed reader, it is also necessary to planning and optimization mobile reader
Path.If only realizing mobile reader path planning and optimization by rule of thumb, generally require repeatedly, largely attempt and repair
Just, the problem of expending substantial amounts of human and material resources and financial resources, and being not easy to find to exist during disposing, may not necessarily be optimized
Scheme.At present, it there are no and preferably realize mobile reader path planning and the method for optimization.
The content of the invention
The shortcomings that it is an object of the invention to overcome prior art and deficiency, there is provided movement is read in a kind of RFID application systems
Device path planning and the method for optimization are read, on the basis of fixed reader deployment decision scheme, is asked using figure mapping method handle
Solution mobile reader path planning is converted into the shortest route problem asked and all nodes are traveled through in weighted graph with optimization problem；So
Afterwards, design ant algorithm and realize the solution shortest route problem, to solve some large-scale complex RFID of Internet-of-things application systems
Middle the problem of needing to plan with optimization mobile reader path.
The purpose of the present invention is realized by following technical scheme：
Mobile reader path planning and the method for optimization, comprise the following steps in a kind of RFID application systems：
Step 1：Obtain fixed reader deployment decision scheme P；
Step 2：Mapped, obtain weighted graph G；
Step 3：Summit corresponding to fixed reader and the side being connected in weighted graph G are deleted, obtains subgraph G '；
Step 4：Mobile reader path planning translates into optimization problem seeks all nodes of traversal in this subgraph G '
Shortest route problem, the most short path optimizing obtained using ant algorithm is the mobile route of mobile reader.
Preferably, when the shortest route problem for traveling through all nodes is sought in step 4, node is repeatable to be accessed.
Preferably, step 4 concretely comprises the following steps：
4-1：Each side pheromones intensity of subgraph G ' is initialized, each ant selects next according to certain rule of probability
The node to be reached, until ultimately forming a legal path；
4-2：Path length caused by each ant is calculated, path length is each edge lengths sum in path；
4-2：Update the pheromones on each side；Each advanced row information element volatilization operation in side, then according to caused by each ant
Path length obtains the pheromones that ant is discharged；
4-4：After all ants complete the renewal operation of pheromones, current shortest path is recorded, and it is right
The value added of pheromones is initialized；
4-5：End condition is unsatisfactory for, and goes to step 4-1；End condition meets, obtains subgraph G ' shortest path, is
The mobile route of mobile reader.
Further, in step 4-1, the taboo list of each side pheromones intensity of subgraph G ' and each ant is initialized；Often
Individual ant selects next node to be reached, until ultimately forming according to certain rule of probability under the restriction of taboo list
One legal path.
Further, in step 4-4, after all ants complete the renewal operation of pheromones, record is current
Shortest path, and the value added of taboo list and pheromones is initialized.
Preferably, the rule for obtaining weighted graph G is mapped in step 2 to be had：Weighted graph G node is made up of reading device position,
On line between two reading device positions is the side of weighted graph, if the distance between two reading device positions is more than transmitting radius and receives radius
There are barrier then not on line, distance of the weights between the two readers between twice of middle maximum or two reading device positions.
Preferably, if reader number is M in RFID of Internet-of-things application system reader deployment scheme P in step 3, there is N
Individual reading device position is fixed from moving, then this corresponding N number of node and its side being connected are deleted in weighted graph G；It is remaining
The subgraph of node and side composition is designated as G ', and the node schemed in G ' does not dispose reader.
The present invention compared with prior art, has the following advantages that and beneficial effect：
The present invention is mapped as solution mobile reader path planning and optimization problem in fixed reader deployment scheme
The shortest route problem for traveling through all summits is sought in the figure being made up of reading device position, and the shortest path is tried to achieve with ant algorithm
Footpath, it is the mobile route of mobile reader.This method is novel, simple, takes full advantage of fixed fixed reader deployment
Scheme, it is not required to be modeled otherwise for mobile reader.
Brief description of the drawings
Fig. 1 is to implement illustration mapping method schematic diagram.
Fig. 2 is embodiment method overall flow figure.
Embodiment
With reference to embodiment and accompanying drawing, the present invention is described in further detail, but embodiments of the present invention are unlimited
In this.
Embodiment 1
It is weighted graph G provided with RFID application systems a fixed reader Optimization deployment scheme P, mapping P, wherein, cum rights
Figure G node is made up of reading device position, and the on line between two reading device positions is the side of weighted graph, if between two reading device positions
Distance be more than transmitting radius and receive twice of maximum in radius or two reading device positions between have barrier then not on line, weights
For the distance between the two readers, as shown in Figure 1.
If reader number is M in RFID of Internet-of-things application system reader deployment scheme P, there is N number of reading device position to consolidate
Fixed immovable, then the side that this corresponding N number of node is deleted in weighted graph G and its is connected (has one end to be connected with this N number of node
With regard to deleting).The subgraph of remaining node and side composition is designated as G ', and the node schemed in G ' does not dispose reader.So, movement is read
Read device path planning and the shortest path asked in this subgraph G ' and travel through all nodes (repeatable to access) is translated into optimization problem
Footpath problem, the most short path optimizing obtained using ant algorithm are the mobile route of mobile reader.
Ant algorithm is initially by the observation to ant communities, is inspired and drawn by ant behavioural characteristic.Ant is calculated
Method has the characteristics that concurrency, robustness, positive feedback.Its basic thought is to put m ant according to certain regular random
In n node.Each ant creates a legal path by state transition probability.It is each during Making Path
The renewal that the side that ant is passed by by local updating rule to oneself carries out pheromones operates, when all ants are all completed
After the construction in path, then the global of pheromones is carried out to the side on optimal path and is updated.
Mobile reader path planning and optimization in RFID application systems are realized with figure mapping conversion method and ant algorithm
Flow it is as follows：
Step 1：Obtain fixed reader deployment decision scheme P.
Step 2：Mapped, obtain weighted graph G.
Step 3：Summit corresponding to fixed reader and the side being connected in weighted graph G are deleted, obtains subgraph G '.
Step 4：Initialize the taboo list of each side pheromones intensity of subgraph G ' and each ant.Each ant is according to certain
The rule of probability, next node to be reached is selected under the restriction of taboo list, until ultimately forming a legal path.
Step 5：Path length caused by each ant is calculated, path length is each edge lengths sum in path.
Step 6：Update the pheromones on each side.Each advanced row information element volatilization operation in side, is then produced according to each ant
Path length obtain the pheromones that are discharged of ant.
Step 7：After all ants complete the renewal operation of pheromones, current shortest path is recorded, and
The value added of taboo list and pheromones is initialized.
Step 8：End condition is unsatisfactory for, and goes to step 4.
Step 9：Subgraph G ' shortest path is obtained, is the mobile route of mobile reader.
Above-described embodiment is the preferable embodiment of the present invention, but embodiments of the present invention are not by above-described embodiment
Limitation, other any Spirit Essences without departing from the present invention with made under principle change, modification, replacement, combine, simplification,
Equivalent substitute mode is should be, is included within protection scope of the present invention.
Claims (7)
1. mobile reader path planning and the method for optimization in a kind of RFID application systems, it is characterised in that including following step
Suddenly：
Step 1：Obtain fixed reader deployment decision scheme P；
Step 2：Mapped, obtain weighted graph G；
Step 3：Summit corresponding to fixed reader and the side being connected in weighted graph G are deleted, obtains subgraph G '；
Step 4：Mobile reader path planning translates into optimization problem seeks all nodes of traversal most in this subgraph G '
Short path problem, the most short path optimizing obtained using ant algorithm are the mobile route of mobile reader.
2. according to the method for claim 1, it is characterised in that the shortest route problem for traveling through all nodes is sought in step 4
When, node is repeatable to be accessed.
3. according to the method for claim 1, it is characterised in that step 4 concretely comprises the following steps：
4-1：Each side pheromones intensity of subgraph G ' is initialized, according to certain rule of probability, selection is next to arrive each ant
The node reached, until ultimately forming a legal path；
4-2：Path length caused by each ant is calculated, path length is each edge lengths sum in path；
4-2：Update the pheromones on each side；Each advanced row information element volatilization in side operates, then the path according to caused by each ant
Length obtains the pheromones that ant is discharged；
4-4：After all ants complete the renewal operation of pheromones, current shortest path is recorded, and to information
The value added of element is initialized；
4-5：End condition is unsatisfactory for, and goes to step 4-1；End condition meets, obtains subgraph G ' shortest path, is mobile
The mobile route of reader.
4. according to the method for claim 3, it is characterised in that in step 4-1, initialize each side pheromones intensity of subgraph G '
And the taboo list of each ant；Each ant selects next want according to certain rule of probability under the restriction of taboo list
The node of arrival, until ultimately forming a legal path.
5. according to the method for claim 3, it is characterised in that in step 4-4, when all ants complete pheromones
After renewal operation, current shortest path is recorded, and the value added of taboo list and pheromones is initialized.
6. according to the method for claim 1, it is characterised in that the rule for obtaining weighted graph G is mapped in step 2 to be had：Cum rights
Figure G node is made up of reading device position, and the on line between two reading device positions is the side of weighted graph, if between two reading device positions
Distance be more than transmitting radius and receive twice of maximum in radius or two reading device positions between have barrier then not on line, weights
For the distance between the two readers.
7. according to the method for claim 1, it is characterised in that if RFID of Internet-of-things application system reader portion in step 3
Reader number is M in management side case P, has N number of reading device position to be fixed from moving, then this corresponding N is deleted in weighted graph G
Individual node and there is the side that one end is connected with this N number of node；The subgraph of remaining node and side composition is designated as G ', schemes the knot in G '
Point does not dispose reader.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710813768.4A CN107747942A (en) | 2017-09-11 | 2017-09-11 | Mobile reader path planning and the method for optimization in a kind of RFID application systems |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710813768.4A CN107747942A (en) | 2017-09-11 | 2017-09-11 | Mobile reader path planning and the method for optimization in a kind of RFID application systems |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN107747942A true CN107747942A (en) | 2018-03-02 |
Family
ID=61255609
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201710813768.4A Pending CN107747942A (en) | 2017-09-11 | 2017-09-11 | Mobile reader path planning and the method for optimization in a kind of RFID application systems |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN107747942A (en) |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20070237152A1 (en) * | 2003-01-20 | 2007-10-11 | Nanyang Polytechnic | Path Searching System Using Multiple Groups Of Cooperating Agents And Method Thereof |
| CN101777773A (en) * | 2010-01-12 | 2010-07-14 | 广东天富风光潮发电设备有限公司 | Ant colony algorithm-based small wind power generation grid-connected energy management system and method |
| CN102778229A (en) * | 2012-05-31 | 2012-11-14 | 重庆邮电大学 | Mobile Agent path planning method based on improved ant colony algorithm under unknown environment |
| CN103198391A (en) * | 2013-03-21 | 2013-07-10 | 国家电网公司 | Electric power communication spare part management system and method based on ant colony algorithm |
| CN106225788A (en) * | 2016-08-16 | 2016-12-14 | 上海理工大学 | The robot path planning method of ant group algorithm is expanded based on path |
| CN106503789A (en) * | 2016-11-08 | 2017-03-15 | 西安电子科技大学宁波信息技术研究院 | Loop-free shortest path searching method based on Di Jiesitela and minimax ant colony |
-
2017
- 2017-09-11 CN CN201710813768.4A patent/CN107747942A/en active Pending
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20070237152A1 (en) * | 2003-01-20 | 2007-10-11 | Nanyang Polytechnic | Path Searching System Using Multiple Groups Of Cooperating Agents And Method Thereof |
| CN101777773A (en) * | 2010-01-12 | 2010-07-14 | 广东天富风光潮发电设备有限公司 | Ant colony algorithm-based small wind power generation grid-connected energy management system and method |
| CN102778229A (en) * | 2012-05-31 | 2012-11-14 | 重庆邮电大学 | Mobile Agent path planning method based on improved ant colony algorithm under unknown environment |
| CN103198391A (en) * | 2013-03-21 | 2013-07-10 | 国家电网公司 | Electric power communication spare part management system and method based on ant colony algorithm |
| CN106225788A (en) * | 2016-08-16 | 2016-12-14 | 上海理工大学 | The robot path planning method of ant group algorithm is expanded based on path |
| CN106503789A (en) * | 2016-11-08 | 2017-03-15 | 西安电子科技大学宁波信息技术研究院 | Loop-free shortest path searching method based on Di Jiesitela and minimax ant colony |
Non-Patent Citations (2)
| Title |
|---|
| 孟凡振: "基于RFID和WSN融合的物流配送***最优路径选择算法研究", 《中国优秀硕士学位论文全文数据库信息科技辑》 * |
| 王永波: "基于RFID 的大型仓储拣货路径优化方法研究", 《万方学位论文数据库》 * |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Chen et al. | Reliable shortest path finding in stochastic networks with spatial correlated link travel times | |
| Khalil et al. | Learning combinatorial optimization algorithms over graphs | |
| Niu et al. | An improved intelligent water drops algorithm for achieving optimal job-shop scheduling solutions | |
| Huang et al. | A shortest path algorithm with novel heuristics for dynamic transportation networks | |
| Huang et al. | A novel forecasting approach inspired by human memory: The example of short-term traffic volume forecasting | |
| CN102256270B (en) | Dynamic self configuring overlays method and system | |
| CN105138601B (en) | A kind of graphic mode matching method for supporting fuzzy constraint relationship | |
| Sommer | Approximate shortest path and distance queries in networks | |
| Cao et al. | Creating balanced and connected clusters to improve service delivery routes in logistics planning | |
| Wallgrün | Qualitative spatial reasoning for topological map learning | |
| Kaipa et al. | Glowworm swarm optimization: algorithm development | |
| Osaba et al. | On efficiently solving the vehicle routing problem with time windows using the bat algorithm with random reinsertion operators | |
| CN105184326A (en) | Active learning multi-label social network data analysis method based on graph data | |
| Osamy et al. | IPDCA: intelligent proficient data collection approach for IoT-enabled wireless sensor networks in smart environments | |
| Pour et al. | Solving the facility and layout and location problem by ant-colony optimization-meta heuristic | |
| Ma et al. | A decentralized model predictive traffic signal control method with fixed phase sequence for urban networks | |
| He et al. | Reinforcement learning for multi-item retrieval in the puzzle-based storage system | |
| Di Puglia Pugliese et al. | Solution approaches for the vehicle routing problem with occasional drivers and time windows | |
| Legendre et al. | Reconsidering microscopic mobility modeling for self-organizing networks | |
| Yao et al. | Fast optimization for large scale logistics in complex urban systems using the hybrid sparrow search algorithm | |
| Mrazovic et al. | CIGO! Mobility management platform for growing efficient and balanced smart city ecosystem | |
| Mahmood et al. | An Overview of recent and traditional decision tree classifiers in machine learning | |
| CN107747942A (en) | Mobile reader path planning and the method for optimization in a kind of RFID application systems | |
| Fuentealba et al. | Guidelines for digital twins in 5g agriculture | |
| Zhou et al. | Traffic conduction analysis model with time series rule mining |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| RJ01 | Rejection of invention patent application after publication | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20180302 |