CN118821813A - A reader-writer deployment method and system for unmanned aerial vehicle intelligent hangar - Google Patents
A reader-writer deployment method and system for unmanned aerial vehicle intelligent hangar Download PDFInfo
- Publication number
- CN118821813A CN118821813A CN202411305418.3A CN202411305418A CN118821813A CN 118821813 A CN118821813 A CN 118821813A CN 202411305418 A CN202411305418 A CN 202411305418A CN 118821813 A CN118821813 A CN 118821813A
- Authority
- CN
- China
- Prior art keywords
- reader
- writer
- particle swarm
- deployment
- particles
- 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
- G06—COMPUTING OR CALCULATING; COUNTING
- G06K—GRAPHICAL DATA READING; PRESENTATION OF DATA; RECORD CARRIERS; HANDLING RECORD CARRIERS
- G06K7/00—Methods or arrangements for sensing record carriers, e.g. for reading patterns
- G06K7/10—Methods or arrangements for sensing record carriers, e.g. for reading patterns by electromagnetic radiation, e.g. optical sensing; by corpuscular radiation
- G06K7/10009—Methods or arrangements for sensing record carriers, e.g. for reading patterns by electromagnetic radiation, e.g. optical sensing; by corpuscular radiation sensing by radiation using wavelengths larger than 0.1 mm, e.g. radio-waves or microwaves
- G06K7/10198—Methods or arrangements for sensing record carriers, e.g. for reading patterns by electromagnetic radiation, e.g. optical sensing; by corpuscular radiation sensing by radiation using wavelengths larger than 0.1 mm, e.g. radio-waves or microwaves setting parameters for the interrogator, e.g. programming parameters and operating modes
-
- G—PHYSICS
- G06—COMPUTING OR CALCULATING; 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 provisions for transferring data to distant stations, e.g. from a sensing device
- G06K17/0029—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 provisions for transferring data to distant stations, e.g. from a sensing device the arrangement being specially adapted for wireless interrogation of grouped or bundled articles tagged with wireless record carriers
-
- G—PHYSICS
- G06—COMPUTING OR CALCULATING; COUNTING
- G06K—GRAPHICAL DATA READING; PRESENTATION OF DATA; RECORD CARRIERS; HANDLING RECORD CARRIERS
- G06K7/00—Methods or arrangements for sensing record carriers, e.g. for reading patterns
- G06K7/10—Methods or arrangements for sensing record carriers, e.g. for reading patterns by electromagnetic radiation, e.g. optical sensing; by corpuscular radiation
- G06K7/10009—Methods or arrangements for sensing record carriers, e.g. for reading patterns by electromagnetic radiation, e.g. optical sensing; by corpuscular radiation sensing by radiation using wavelengths larger than 0.1 mm, e.g. radio-waves or microwaves
- G06K7/10366—Methods or arrangements for sensing record carriers, e.g. for reading patterns by electromagnetic radiation, e.g. optical sensing; by corpuscular radiation sensing by radiation using wavelengths larger than 0.1 mm, e.g. radio-waves or microwaves the interrogation device being adapted for miscellaneous applications
- G06K7/10415—Methods or arrangements for sensing record carriers, e.g. for reading patterns by electromagnetic radiation, e.g. optical sensing; by corpuscular radiation sensing by radiation using wavelengths larger than 0.1 mm, e.g. radio-waves or microwaves the interrogation device being adapted for miscellaneous applications the interrogation device being fixed in its position, such as an access control device for reading wireless access cards, or a wireless ATM
-
- G—PHYSICS
- G06—COMPUTING OR CALCULATING; 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]
-
- G—PHYSICS
- G06—COMPUTING OR CALCULATING; COUNTING
- G06N—COMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS
- G06N3/00—Computing arrangements based on biological models
- G06N3/12—Computing arrangements based on biological models using genetic models
- G06N3/126—Evolutionary algorithms, e.g. genetic algorithms or genetic programming
Landscapes
- Engineering & Computer Science (AREA)
- Physics & Mathematics (AREA)
- Health & Medical Sciences (AREA)
- Theoretical Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Life Sciences & Earth Sciences (AREA)
- Artificial Intelligence (AREA)
- Toxicology (AREA)
- Biophysics (AREA)
- General Health & Medical Sciences (AREA)
- General Engineering & Computer Science (AREA)
- Computational Linguistics (AREA)
- Evolutionary Biology (AREA)
- Molecular Biology (AREA)
- Evolutionary Computation (AREA)
- Mathematical Physics (AREA)
- Software Systems (AREA)
- Data Mining & Analysis (AREA)
- Bioinformatics & Cheminformatics (AREA)
- Bioinformatics & Computational Biology (AREA)
- Computing Systems (AREA)
- Computer Vision & Pattern Recognition (AREA)
- Electromagnetism (AREA)
- Computer Networks & Wireless Communication (AREA)
- Biomedical Technology (AREA)
- Genetics & Genomics (AREA)
- Physiology (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
本发明公开了一种用于无人机智能机库的读写器部署方法及系统,方法包括:对智能机库进行环境映射创建射频识别虚拟模型;对射频识别虚拟模型进行识别获取智能机库中无人机的电子标签位置;基于电子标签位置和读写器初始位置计算标签覆盖率和读写器负载,基于标签覆盖率和读写器负载构建读写器部署优化函数;利用粒子群算法和遗传算法对读写器部署优化函数进行求解,输出读写器最优部署策略;本发明考虑了读写器之间的负载平衡,避免部分读写器过载而其他读写器空闲,从而提高了读写器部署的可靠性,结合了遗传算法和粒子群算法的优点,具有更好的鲁棒性和适应性。
The invention discloses a reader/writer deployment method and system for an unmanned aerial vehicle (UAV) intelligent hangar, the method comprising: performing environmental mapping on the intelligent hangar to create a radio frequency identification virtual model; identifying the radio frequency identification virtual model to obtain the electronic tag position of the UAV in the intelligent hangar; calculating the tag coverage and the reader/writer load based on the electronic tag position and the initial position of the reader/writer, and constructing a reader/writer deployment optimization function based on the tag coverage and the reader/writer load; solving the reader/writer deployment optimization function by using a particle swarm algorithm and a genetic algorithm, and outputting an optimal reader/writer deployment strategy; the invention takes into account the load balance between readers/writers, avoids overloading of some readers/writers while other readers/writers are idle, thereby improving the reliability of reader/writer deployment, combining the advantages of the genetic algorithm and the particle swarm algorithm, and having better robustness and adaptability.
Description
技术领域Technical Field
本发明属于读写器部署领域,具体涉及用于无人机智能机库的读写器部署方法及系统。The present invention belongs to the field of reader/writer deployment, and in particular relates to a reader/writer deployment method and system for an unmanned aerial vehicle intelligent hangar.
背景技术Background Art
无人机技术近年来在民用和军事领域均取得了显著进展,目前部分电力公司利用无人机对电力线路、变电站等进行巡检,及时发现和处理潜在的安全隐患,提高电力系统的稳定性和安全性,同时在不同的数据采集站点建立了用于存储无人机的无人机智能机库。In recent years, drone technology has made significant progress in both civil and military fields. At present, some power companies use drones to inspect power lines, substations, etc., to promptly discover and deal with potential safety hazards, improve the stability and safety of the power system, and at the same time, drone smart hangars for storing drones have been established at different data collection sites.
现有技术中无人机智能机库中配置有射频识别系统,射频识别系统通常由读写器和电子标签组成。通过无线电波识别和追踪带有电子标签的无人机,实现了无人机信息的自动化和实时化管理。In the prior art, a radio frequency identification system is configured in the drone smart hangar, and the radio frequency identification system is usually composed of a reader and an electronic tag. The drone with the electronic tag is identified and tracked by radio waves, realizing the automatic and real-time management of drone information.
然而,射频识别读写器和标签的通信范围存在差异,导致信号覆盖不均匀,某些区域可能存在盲区;缺乏有效的部署策略,可能导致读写器数量过多,造成资源浪费。However, the communication ranges of RFID readers and tags vary, resulting in uneven signal coverage and possible blind spots in certain areas. The lack of an effective deployment strategy may lead to an excessive number of readers and writers, resulting in a waste of resources.
发明内容Summary of the invention
本发明提供了一种用于无人机智能机库的读写器部署方法及系统,通过综合考虑覆盖率和负载平衡因素,实现更高效、更精确的读写器部署。The present invention provides a reader/writer deployment method and system for an unmanned aerial vehicle intelligent hangar, which realizes more efficient and accurate reader/writer deployment by comprehensively considering coverage and load balancing factors.
为达到上述目的,本发明所采用的技术方案是:In order to achieve the above object, the technical solution adopted by the present invention is:
本发明第一方面提供了一种用于无人机智能机库的读写器部署方法,包括:The first aspect of the present invention provides a reader-writer deployment method for a drone intelligent hangar, comprising:
对智能机库进行环境映射创建射频识别虚拟模型;对射频识别虚拟模型进行识别获取智能机库中无人机的电子标签位置;Perform environmental mapping of the smart hangar to create a RFID virtual model; identify the RFID virtual model to obtain the electronic tag location of the drone in the smart hangar;
基于电子标签位置和读写器初始位置计算标签覆盖率和读写器负载,基于标签覆盖率和读写器负载构建读写器部署优化函数;Calculate the tag coverage and reader load based on the electronic tag position and the reader initial position, and build a reader deployment optimization function based on the tag coverage and reader load;
利用粒子群算法和遗传算法对读写器部署优化函数进行求解的过程包括:The process of solving the reader-writer deployment optimization function using particle swarm optimization and genetic algorithm includes:
随机生成粒子群的初始位置和速度,粒子代表为读写器部署方案,寻找粒子群中的全局最优解;利用全局最优解更新读写器部署方案的历史最优解;The initial position and speed of the particle swarm are randomly generated. The particles represent the reader deployment plan. The global optimal solution in the particle swarm is found. The historical optimal solution of the reader deployment plan is updated using the global optimal solution.
基于历史最优解迭代更新粒子的速度和位置,根据迭代次数选择性对粒子群进行交叉操作和变异操作,重新寻找粒子群中的全局最优解;重复迭代直至达到最大迭代次数输出读写器最优部署策略。Based on the historical optimal solution, the speed and position of the particles are iteratively updated, and the particle swarm is selectively cross-operated and mutated according to the number of iterations to re-search the global optimal solution in the particle swarm; the iteration is repeated until the maximum number of iterations is reached to output the optimal deployment strategy of the reader/writer.
进一步的,根据迭代次数选择性对粒子群进行交叉操作和变异操作,包括:Furthermore, crossover and mutation operations are selectively performed on the particle swarm according to the number of iterations, including:
判断粒子群的迭代次数是否小于设定阈值;Determine whether the number of iterations of the particle swarm is less than the set threshold;
当粒子群的迭代次数小于设定阈值,在基于历史最优解迭代更新粒子的速度和位置后,对粒子群进行交叉操作和变异操作,重新寻找粒子群中的全局最优解;When the number of iterations of the particle swarm is less than the set threshold, after iteratively updating the particle speed and position based on the historical optimal solution, the particle swarm is subjected to crossover and mutation operations to search for the global optimal solution in the particle swarm again;
当粒子群的迭代次数大于或等于设定阈值,在基于历史最优解迭代更新粒子的速度和位置后,直接寻找粒子群中的全局最优解。When the number of iterations of the particle swarm is greater than or equal to the set threshold, after iteratively updating the particle speed and position based on the historical optimal solution, the global optimal solution in the particle swarm is directly sought.
进一步的,基于标签覆盖率和读写器负载构建读写器部署优化函数,包括:Furthermore, a reader deployment optimization function is constructed based on tag coverage and reader load, including:
; ;
; ;
公式中,表示为读写器部署的综合评价参数,表示为标签覆盖率;表示为读写器负载;表示为标签覆盖率的权重;表示为读写器负载的权重。In the formula, It is represented as the comprehensive evaluation parameter of reader-writer deployment. Expressed as label coverage; Expressed as reader load; Expressed as the weight of label coverage; Expressed as the weight of the reader load.
进一步的,基于电子标签位置和读写器初始位置计算标签覆盖率,包括:Furthermore, the tag coverage is calculated based on the electronic tag position and the initial position of the reader, including:
电子标签位置和读写器初始位置计算电子标签和读写器之间的距离,根据距离计算电子标签的覆盖率,表达公式为:The electronic tag position and the reader initial position calculate the distance between the electronic tag and the reader , according to the distance The coverage rate of electronic tags is calculated using the following formula:
; ;
; ;
; ;
公式中,表示为第i个电子标签的覆盖率;表示为射频覆盖第i个电子标签的读写器数量;表示为第i个电子标签和第j个读写器之间的距离;表示为读写器射频覆盖范围的距离;表示为第j个读写器;N表示为读写器集合;m表示为智能机库中读写器数量。In the formula, It is expressed as the coverage of the i-th electronic tag; It is represented by the number of readers/writers that cover the ith electronic tag through radio frequency; It is represented as the distance between the i-th electronic tag and the j-th reader; It is expressed as the distance of the reader's radio frequency coverage; represents the jth reader/writer; N represents the reader/writer set; m represents the number of readers/writers in the smart hangar.
进一步的,基于电子标签位置和读写器初始位置计算读写器负载,包括:Furthermore, the reader load is calculated based on the electronic tag position and the reader initial position, including:
; ;
公式中,n表示为智能机库中电子标签数量;表示为读取第i个电子标签的读写器。In the formula, n represents the number of electronic tags in the smart hangar; Represents the reader/writer that reads the i-th electronic tag.
进一步的,对粒子群进行交叉操作,包括:Furthermore, the particle swarm is subjected to crossover operations, including:
从粒子群中随机选择两个粒子作为交叉操作的父代粒子,分别记为父代粒子和父代粒子;Two particles are randomly selected from the particle swarm as the parent particles of the crossover operation, and are denoted as parent particles and parent particle ;
对父代粒子和父代粒子进行交叉操作获得子代粒子,表达公式为:For parent particles and parent particle Perform crossover operation to obtain offspring particles, the expression formula is:
; ;
公式中,为[0,1]中的随机数;和表示为子代粒子;In the formula, is a random number in [0,1]; and Represented as descendant particles;
重复对粒子群进行交叉操作,直至交叉操作生成的子代粒子与粒子群中粒子总数量的比例达到预设的交叉概率Pc。Repeat the crossover operation on the particle swarm until the ratio of the offspring particles generated by the crossover operation to the total number of particles in the particle swarm reaches the preset crossover probability Pc.
进一步的,对粒子群进行变异操作,包括:Furthermore, the particle swarm is subjected to mutation operations, including:
从粒子群中随机选择G个粒子作为变异操作的初代粒子,对初代粒子进行变异操作获得变异粒子,表达公式为:Randomly select G particles from the particle swarm as the first generation particles for mutation operation, and perform mutation operation on the first generation particles to obtain mutated particles. The expression formula is:
; ;
; ;
公式中,表示为初代粒子的位置;表示为变异粒子的位置;表示为位置变异量;表示为初代粒子的速度;表示为变异粒子的速度;表示为速度变异量;In the formula, Represents the position of the first generation particle; is represented as the position of the mutant particle; It is expressed as the amount of positional variation; It is represented as the velocity of the first generation of particles; Expressed as the velocity of the mutant particle; Expressed as speed variation;
重复对粒子群进行变异操作,直至变异粒子与粒子群中粒子总数量的比例达到预设的变异概率Pm。Repeat the mutation operation on the particle swarm until the ratio of the mutated particles to the total number of particles in the particle swarm reaches the preset mutation probability Pm.
本发明第二方面提供了一种用于无人机智能机库的读写器部署系统,其特征在于,包括:The second aspect of the present invention provides a reader-writer deployment system for an unmanned aerial vehicle intelligent hangar, characterized in that it includes:
映射模块,对智能机库进行环境映射创建射频识别虚拟模型;对射频识别虚拟模型进行识别获取智能机库中无人机的电子标签位置;The mapping module maps the environment of the smart hangar and creates a RFID virtual model; the RFID virtual model is identified to obtain the electronic tag location of the drone in the smart hangar;
处理分析模块,基于电子标签位置和读写器初始位置计算标签覆盖率和读写器负载,基于标签覆盖率和读写器负载构建读写器部署优化函数;The processing and analysis module calculates the tag coverage and reader load based on the electronic tag position and the reader initial position, and builds a reader deployment optimization function based on the tag coverage and reader load;
优化求解模块,用于随机生成粒子群的初始位置和速度,粒子代表为读写器部署方案,寻找粒子群中的全局最优解;利用全局最优解更新读写器部署方案的历史最优解;基于历史最优解迭代更新粒子的速度和位置,根据迭代次数选择性对粒子群进行交叉操作和变异操作,The optimization solution module is used to randomly generate the initial position and speed of the particle swarm. The particles represent the reader deployment plan and find the global optimal solution in the particle swarm. The global optimal solution is used to update the historical optimal solution of the reader deployment plan. The particle speed and position are iteratively updated based on the historical optimal solution. The particle swarm is selectively cross-operated and mutated according to the number of iterations.
输出模块,用于重新寻找粒子群中的全局最优解;重复迭代直至达到最大迭代次数输出读写器最优部署策略。The output module is used to re-find the global optimal solution in the particle swarm; iterates repeatedly until the maximum number of iterations is reached and outputs the optimal deployment strategy of the reader/writer.
进一步的,电子标签包括标签电源、高频接口、微控制器、第一EEPROM存储器和RAM存储器;标签电源与第一EEPROM存储器电性连接,第一EEPROM存储器和RAM存储器电性连接于微控制器,所述微控制器通过高频接口与标签天线电性连接。Furthermore, the electronic tag includes a tag power supply, a high-frequency interface, a microcontroller, a first EEPROM memory and a RAM memory; the tag power supply is electrically connected to the first EEPROM memory, the first EEPROM memory and the RAM memory are electrically connected to the microcontroller, and the microcontroller is electrically connected to the tag antenna through the high-frequency interface.
进一步的,读写器包括逻辑控制单元;所述逻辑控制单元电性连接有第二EEPROM存储器和ROM存储器;所述第二EEPROM存储器电性连接电压调节器;解调器电性连接至所述逻辑控制单元;所述逻辑控制单元通过调制器与读写器天线电性连接。Furthermore, the reader/writer includes a logic control unit; the logic control unit is electrically connected to a second EEPROM memory and a ROM memory; the second EEPROM memory is electrically connected to a voltage regulator; a demodulator is electrically connected to the logic control unit; and the logic control unit is electrically connected to the reader/writer antenna through the modulator.
第三方面本发明提供了电子设备,包括存储介质和处理器;所述存储介质用于存储指令;所述处理器用于根据所述指令进行操作以执行本发明第一方面所述的读写器部署方法。In a third aspect, the present invention provides an electronic device, comprising a storage medium and a processor; the storage medium is used to store instructions; the processor is used to operate according to the instructions to execute the reader/writer deployment method described in the first aspect of the present invention.
与现有技术相比,本发明的有益效果:Compared with the prior art, the present invention has the following beneficial effects:
本发明基于电子标签位置和读写器初始位置计算标签覆盖率和读写器负载,基于标签覆盖率和读写器负载构建读写器部署优化函数;考虑了读写器之间的负载平衡,避免部分读写器过载而其他读写器空闲,从而提高了读写器部署的可靠性。The present invention calculates the tag coverage and reader load based on the electronic tag position and the initial position of the reader, and constructs a reader deployment optimization function based on the tag coverage and reader load; the load balance between readers is taken into account to avoid overloading of some readers while other readers are idle, thereby improving the reliability of reader deployment.
本发明利用粒子群算法和遗传算法对读写器部署优化函数进行求解,获得读写器最优部署策略;在迭代初期通过交叉和变异操作防止粒子群陷入局部最优解,而在迭代后期则通过减少这些操作来保证解的稳定性和收敛性;结合了遗传算法和粒子群算法的优点,使读写器部署方法具有更好的鲁棒性和适应性。The present invention uses particle swarm algorithm and genetic algorithm to solve the reader/writer deployment optimization function and obtain the optimal reader/writer deployment strategy; in the early stage of iteration, crossover and mutation operations are used to prevent the particle swarm from falling into the local optimal solution, and in the later stage of iteration, these operations are reduced to ensure the stability and convergence of the solution; the advantages of genetic algorithm and particle swarm algorithm are combined to make the reader/writer deployment method have better robustness and adaptability.
附图说明BRIEF DESCRIPTION OF THE DRAWINGS
图1为本发明实施例1提供的一种用于无人机智能机库的读写器部署方法的流程图;FIG1 is a flow chart of a reader-writer deployment method for a drone smart hangar provided by Embodiment 1 of the present invention;
图2为本发明实施例2提供的一种用于无人机智能机库的读写器部署方法的流程图;FIG2 is a flow chart of a reader-writer deployment method for a drone smart hangar provided by Embodiment 2 of the present invention;
图3为本发明实施例2提供的GA-PSO群算法优化后的读写器部署分布图;FIG3 is a reader/writer deployment distribution diagram after optimization by the GA-PSO group algorithm provided in Example 2 of the present invention;
图4为本发明实施例2提供的GA-PSO群算法优化后的适应值折线图;FIG4 is a line graph of the fitness value after optimization by the GA-PSO group algorithm provided in Example 2 of the present invention;
图5为本发明实施例2提供的GA算法优化后的读写器部署分布图;FIG5 is a reader/writer deployment distribution diagram after GA algorithm optimization provided in Example 2 of the present invention;
图6为本发明实施例2提供的GA算法优化后的适应值折线图;FIG6 is a line graph of fitness values after optimization by the GA algorithm provided in Example 2 of the present invention;
图7为本发明实施例2提供的PSO算法优化后的读写器部署分布图;FIG7 is a reader/writer deployment distribution diagram after PSO algorithm optimization provided in Example 2 of the present invention;
图8为本发明实施例2提供的PSO算法优化后的适应值折线图;FIG8 is a line graph of the fitness value after the PSO algorithm is optimized according to Embodiment 2 of the present invention;
图9为本发明实施例3提供的电子标签的结构图;FIG9 is a structural diagram of an electronic tag provided in Embodiment 3 of the present invention;
图10为本发明实施例3提供的读写器的结构图。FIG10 is a structural diagram of a reader/writer provided in Embodiment 3 of the present invention.
具体实施方式DETAILED DESCRIPTION
下面结合附图对本发明作进一步描述。以下实施例仅用于更加清楚地说明本发明的技术方案,而不能以此来限制本发明的保护范围。The present invention will be further described below in conjunction with the accompanying drawings. The following embodiments are only used to more clearly illustrate the technical solution of the present invention, and cannot be used to limit the protection scope of the present invention.
所述无人机机库的横向设置为x轴,所述无人机机库的纵向设置为z轴;所述无人机机库的垂直方向设置为y轴。The horizontal direction of the drone hangar is set as the x-axis, the longitudinal direction of the drone hangar is set as the z-axis; the vertical direction of the drone hangar is set as the y-axis.
实施例1Example 1
如图1所示,本实施提供了一种用于无人机智能机库的读写器部署方法,包括:As shown in FIG1 , this implementation provides a reader-writer deployment method for a drone smart hangar, including:
步骤1,对智能机库进行环境映射创建射频识别虚拟模型,通过将智能机库映射至虚拟环境,对不同读写器部署策略进行模拟;对射频识别虚拟模型进行识别获取智能机库中无人机的电子标签位置;基于电子标签位置和读写器初始位置计算标签覆盖率和读写器负载,基于标签覆盖率和读写器负载构建读写器部署优化函数;Step 1: Create an RFID virtual model by mapping the smart hangar to the virtual environment, and simulate different reader deployment strategies by mapping the smart hangar to the virtual environment; identify the RFID virtual model to obtain the electronic tag position of the drone in the smart hangar; calculate the tag coverage and reader load based on the electronic tag position and the initial position of the reader, and build a reader deployment optimization function based on the tag coverage and reader load;
步骤2,利用粒子群算法和遗传算法对读写器部署优化函数进行求解的过程包括:Step 2: The process of solving the reader-writer deployment optimization function using the particle swarm algorithm and the genetic algorithm includes:
步骤21,随机生成粒子群的初始位置和速度,粒子代表为读写器部署方案,寻找粒子群中的全局最优解;利用全局最优解更新读写器部署方案的历史最优解,包括:Step 21, randomly generate the initial position and speed of the particle swarm, the particle represents the reader deployment plan, and find the global optimal solution in the particle swarm; use the global optimal solution to update the historical optimal solution of the reader deployment plan, including:
计算第t次迭代中全局最优解的适应度值,记为适应度值,当迭代次数为1时,直接将全局最优解设定为历史最优解;当迭代次数不为1时,将适应度值与适应度值进行对比,选择适应度值较大的读写器部署策略作为第t次迭代后存储的历史最优解;适应度值表示为第t-1次迭代后存储的历史最优解的适应度值。Calculate the fitness value of the global optimal solution in the tth iteration, recorded as the fitness value When the number of iterations is 1, the global optimal solution is directly set as the historical optimal solution; when the number of iterations is not 1, the fitness value With fitness value For comparison, the reader deployment strategy with a larger fitness value is selected as the historical optimal solution stored after the tth iteration; the fitness value It is expressed as the fitness value of the historical optimal solution stored after the t-1th iteration.
步骤22,基于历史最优解迭代更新粒子的速度和位置,判断粒子群的迭代次数是否小于设定阈值;Step 22, iteratively updating the speed and position of the particles based on the historical optimal solution, and determining whether the number of iterations of the particle swarm is less than a set threshold;
步骤23,当粒子群的迭代次数小于设定阈值,在基于历史最优解迭代更新粒子的速度和位置后,对粒子群进行交叉操作和变异操作,跳转至步骤25;Step 23, when the number of iterations of the particle swarm is less than the set threshold, after iteratively updating the speed and position of the particles based on the historical optimal solution, the particle swarm is subjected to crossover and mutation operations, and the process jumps to step 25;
步骤24,当粒子群的迭代次数大于或等于设定阈值,在基于历史最优解迭代更新粒子的速度和位置后,跳转至步骤25。Step 24, when the number of iterations of the particle swarm is greater than or equal to the set threshold, after iteratively updating the speed and position of the particles based on the historical optimal solution, jump to step 25.
步骤25,重新寻找粒子群中的全局最优解;重复迭代直至达到最大迭代次数输出读写器最优部署策略,读写器最优部署策略即为每个读写器最佳部署位置,根据读写器最优部署策略将读写器部署至无人机智能机库内。Step 25, re-search the global optimal solution in the particle swarm; repeat the iteration until the maximum number of iterations is reached to output the optimal deployment strategy of the reader/writer. The optimal deployment strategy of the reader/writer is the best deployment position for each reader/writer. The reader/writer is deployed to the UAV intelligent hangar according to the optimal deployment strategy of the reader/writer.
本实施在迭代初期通过交叉和变异操作防止粒子群陷入局部最优解,而在迭代后期则通过减少这些操作来保证解的稳定性和收敛性;结合了遗传算法和粒子群算法的优点,使读写器部署方法具有更好的鲁棒性和适应性。This implementation prevents the particle swarm from falling into the local optimal solution through crossover and mutation operations in the early stage of iteration, and ensures the stability and convergence of the solution by reducing these operations in the later stage of iteration; it combines the advantages of genetic algorithm and particle swarm algorithm to make the reader deployment method more robust and adaptable.
实施例2Example 2
如图2所示,本实施提供了一种用于无人机智能机库的读写器部署方法,包括:As shown in FIG2 , this implementation provides a reader-writer deployment method for a drone smart hangar, including:
步骤1,对智能机库进行环境映射创建射频识别虚拟模型;对射频识别虚拟模型进行识别获取智能机库中无人机的电子标签位置;基于电子标签位置和读写器初始位置计算标签覆盖率和读写器负载,基于标签覆盖率和读写器负载构建读写器部署优化函数,包括:Step 1: Perform environmental mapping of the smart hangar to create an RFID virtual model; identify the RFID virtual model to obtain the electronic tag position of the drone in the smart hangar; calculate the tag coverage and reader load based on the electronic tag position and the initial position of the reader, and build a reader deployment optimization function based on the tag coverage and reader load, including:
; ;
; ;
公式中,表示为读写器部署的综合评价参数,表示为标签覆盖率;表示为读写器负载;表示为标签覆盖率的权重;表示为读写器负载的权重。In the formula, It is represented as the comprehensive evaluation parameter of reader-writer deployment. Expressed as label coverage; Expressed as reader load; Expressed as the weight of label coverage; Expressed as the weight of the reader load.
基于电子标签位置和读写器初始位置计算标签覆盖率,包括:Calculate the tag coverage based on the electronic tag position and the reader initial position, including:
电子标签位置和读写器初始位置计算电子标签和读写器之间的距离,根据距离计算电子标签的覆盖率,表达公式为:The electronic tag position and the reader initial position calculate the distance between the electronic tag and the reader , according to the distance The coverage rate of electronic tags is calculated using the following formula:
; ;
; ;
; ;
公式中,表示为第i个电子标签的覆盖率;表示为射频覆盖第i个电子标签的读写器数量;表示为第i个电子标签和第j个读写器之间的距离;表示为读写器射频覆盖范围的距离;表示为第j个读写器;N表示为读写器集合;m表示为智能机库中读写器数量。In the formula, It is expressed as the coverage of the i-th electronic tag; It is represented by the number of readers/writers that cover the ith electronic tag through radio frequency; It is represented as the distance between the i-th electronic tag and the j-th reader; It is expressed as the distance of the reader's radio frequency coverage; represents the jth reader/writer; N represents the reader/writer set; m represents the number of readers/writers in the smart hangar.
基于电子标签位置和读写器初始位置计算读写器负载,包括:Calculate the reader load based on the electronic tag position and the reader initial position, including:
; ;
公式中,n表示为智能机库中电子标签数量;表示为读取第i个电子标签的读写器。In the formula, n represents the number of electronic tags in the smart hangar; Represents the reader/writer that reads the i-th electronic tag.
步骤2,利用粒子群算法和遗传算法对读写器部署优化函数进行求解的过程包括:Step 2: The process of solving the reader-writer deployment optimization function using the particle swarm algorithm and the genetic algorithm includes:
步骤21,随机生成粒子群的初始位置和速度,粒子代表为读写器部署方案,寻找粒子群中的全局最优解;利用全局最优解更新读写器部署方案的历史最优解;包括:Step 21, randomly generate the initial position and speed of the particle swarm, the particle represents the reader deployment plan, find the global optimal solution in the particle swarm; use the global optimal solution to update the historical optimal solution of the reader deployment plan; including:
计算第t次迭代中全局最优解的适应度值,记为适应度值,当迭代次数为1时,直接将全局最优解设定为历史最优解;当迭代次数不为1时,将适应度值与适应度值进行对比,选择适应度值较大的读写器部署策略作为第t次迭代后存储的历史最优解;适应度值表示为第t-1次迭代后存储的历史最优解的适应度值。Calculate the fitness value of the global optimal solution in the tth iteration, recorded as the fitness value When the number of iterations is 1, the global optimal solution is directly set as the historical optimal solution; when the number of iterations is not 1, the fitness value With fitness value For comparison, the reader deployment strategy with a larger fitness value is selected as the historical optimal solution stored after the tth iteration; the fitness value It is expressed as the fitness value of the historical optimal solution stored after the t-1th iteration.
步骤22,基于历史最优解迭代更新粒子的速度和位置,判断粒子群的迭代次数是否小于设定阈值;Step 22, iteratively updating the speed and position of the particles based on the historical optimal solution, and determining whether the number of iterations of the particle swarm is less than a set threshold;
步骤23,当粒子群的迭代次数小于设定阈值,在基于历史最优解迭代更新粒子的速度和位置后,对粒子群进行交叉操作和变异操作,跳转至步骤25;读写器最优部署策略即为每个读写器最佳部署位置,根据读写器最优部署策略将读写器部署至无人机智能机库内。Step 23, when the number of iterations of the particle swarm is less than the set threshold, after iteratively updating the particle speed and position based on the historical optimal solution, the particle swarm is crossover and mutation operated, and the process jumps to step 25; the optimal deployment strategy of the reader/writer is the optimal deployment position for each reader/writer, and the reader/writer is deployed in the UAV intelligent hangar according to the optimal deployment strategy of the reader/writer.
其中,对粒子群进行交叉操作,包括:Among them, the crossover operation on the particle swarm includes:
从粒子群中随机选择两个粒子作为交叉操作的父代粒子,分别记为父代粒子和父代粒子;Two particles are randomly selected from the particle swarm as the parent particles of the crossover operation, and are denoted as parent particles and parent particle ;
对父代粒子和父代粒子进行交叉操作获得子代粒子,表达公式为:For parent particles and parent particle Perform crossover operation to obtain offspring particles, the expression formula is:
; ;
公式中,为[0,1]中的随机数;和表示为子代粒子;In the formula, is a random number in [0,1]; and Represented as descendant particles;
重复对粒子群进行交叉操作,直至交叉操作生成的子代粒子与粒子群中粒子总数量的比例达到预设的交叉概率Pc。Repeat the crossover operation on the particle swarm until the ratio of the offspring particles generated by the crossover operation to the total number of particles in the particle swarm reaches the preset crossover probability Pc.
其中,对粒子群进行变异操作,包括:Among them, the mutation operation on the particle swarm includes:
从粒子群中随机选择G个粒子作为变异操作的初代粒子,对初代粒子进行变异操作获得变异粒子,表达公式为:Randomly select G particles from the particle swarm as the first generation particles for mutation operation, and perform mutation operation on the first generation particles to obtain mutated particles. The expression formula is:
; ;
; ;
公式中,表示为初代粒子的位置;表示为变异粒子的位置;表示为位置变异量;表示为初代粒子的速度;表示为变异粒子的速度;表示为速度变异量;In the formula, Represents the position of the first generation particle; is represented as the position of the mutant particle; It is expressed as the amount of positional variation; It is represented as the velocity of the first generation of particles; Expressed as the velocity of the mutant particle; Expressed as speed variation;
重复对粒子群进行变异操作,直至变异粒子与粒子群中粒子总数量的比例达到预设的变异概率Pm。Repeat the mutation operation on the particle swarm until the ratio of the mutated particles to the total number of particles in the particle swarm reaches the preset mutation probability Pm.
步骤24,当粒子群的迭代次数大于或等于设定阈值,在基于历史最优解迭代更新粒子的速度和位置后,跳转至步骤25。Step 24, when the number of iterations of the particle swarm is greater than or equal to the set threshold, after iteratively updating the speed and position of the particles based on the historical optimal solution, jump to step 25.
步骤25,重新寻找粒子群中的全局最优解;重复迭代直至达到最大迭代次数输出读写器最优部署策略。Step 25, re-search the global optimal solution in the particle swarm; repeat the iteration until the maximum number of iterations is reached to output the optimal deployment strategy of the reader/writer.
为了进一步验证本发明中改进粒子群算法(GA-PSO算法)的有效性,将本算法分别于遗传算法(GA算法)和粒子群优化算法(PSO算法)进行比较。In order to further verify the effectiveness of the improved particle swarm optimization algorithm (GA-PSO algorithm) in the present invention, the algorithm is compared with the genetic algorithm (GA algorithm) and the particle swarm optimization algorithm (PSO algorithm).
如图3、图5和图7所示,GA-PSO算法、GA算法和PSO算法优化后的读写器部署分布图。 其中, “圆圈”表示为读写器的覆盖范围,“米”表示为电子标签;GA算法和PSO算法优化后的读写器部署分布图存在两个电子标签不在读写器覆盖范围内;GA-PSO算法优化后的读写器部署分布图存在单个电子标签不在读写器覆盖范围内; 如图4、图6和图8所示,GA-PSO算法、GA算法和PSO算法优化后读写器最优部署策略的适应值折线图;GA-PSO算法优化后读写器最优部署策略的适应值为0.686;GA算法优化后读写器最优部署策略的适应值为0.672;PSO算法优化后读写器最优部署策略的适应值为0.672;通过对比可以判断出GA-PSO算法在迭代初期通过交叉和变异操作能够防止粒子群陷入局部最优解,提高了读写器部署的可靠性。As shown in Figures 3, 5 and 7, the reader deployment distribution diagrams after optimization by GA-PSO algorithm, GA algorithm and PSO algorithm. Among them, "circle" represents the coverage of the reader, and "meter" represents the electronic tag; the reader deployment distribution diagrams after optimization by GA algorithm and PSO algorithm have two electronic tags that are not within the coverage of the reader; the reader deployment distribution diagram after optimization by GA-PSO algorithm has a single electronic tag that is not within the coverage of the reader; As shown in Figures 4, 6 and 8, the fitness value line graphs of the optimal deployment strategy of the reader after optimization by GA-PSO algorithm, GA algorithm and PSO algorithm; the fitness value of the optimal deployment strategy of the reader after optimization by GA-PSO algorithm is 0.686; the fitness value of the optimal deployment strategy of the reader after optimization by GA algorithm is 0.672; the fitness value of the optimal deployment strategy of the reader after optimization by PSO algorithm is 0.672; by comparison, it can be judged that GA-PSO algorithm can prevent particle swarm from falling into local optimal solution through crossover and mutation operations in the early stage of iteration, thereby improving the reliability of reader deployment.
GA算法和PSO算法获得读写器最优部署策略需要的迭代次数分别为102和80;GA-PSO算法获得读写器最优部署策略需要的迭代次数为77;通过对比可以判断出GA-PSO算法在迭代后期则通过减少这些操作能够保证解的稳定性和收敛性;结合了遗传算法和粒子群算法的优点,使读写器部署方法具有更好的鲁棒性和适应性。The number of iterations required for the GA algorithm and the PSO algorithm to obtain the optimal reader deployment strategy are 102 and 80 respectively; the number of iterations required for the GA-PSO algorithm to obtain the optimal reader deployment strategy is 77; by comparison, it can be judged that the GA-PSO algorithm can ensure the stability and convergence of the solution by reducing these operations in the later stage of iteration; combining the advantages of genetic algorithm and particle swarm algorithm, the reader deployment method has better robustness and adaptability.
将读写器数量分别设置为9、12和15;将GA-PSO算法、GA算法和PSO算法分别运行20次输出读写器最优部署策略,得到平均最优适应值,如表1所示。The number of readers is set to 9, 12 and 15 respectively; the GA-PSO algorithm, GA algorithm and PSO algorithm are run 20 times respectively to output the optimal deployment strategy of readers and writers, and the average optimal fitness value is obtained, as shown in Table 1.
表1,GA-PSO算法、GA算法和PSO算法的平均最优适应值;Table 1, Average optimal fitness values of GA-PSO algorithm, GA algorithm and PSO algorithm;
从测试结果可以看出,在相同的条件下,GA-PSO算法的适应值最大或迭代次数最少,即改进粒子群算法的优化效果最好。由于随着迭代次数的增加,惯性权重逐渐减小,使粒子继承了较少的原方向的速度,从而飞行较近具有较好的探索能力。但粒子群的搜索能力下降了,随着迭代次数的增加,容易陷入局部最优解。而改进粒子群算法在每次迭代时,根据一定的概率在粒子群中选取一定数量的粒子,使其随机两两进行繁殖,产生相应数目的子代粒子,并用子代粒子代替父代粒子,使种群规模保持不变,交叉操作可以使粒子受益于父母双方,增强搜索能力,易于跳出局部最优;改进粒子群算法(GA-PSO算法)的变异操作,以一定的变异概率,对部分粒子的位置进行变化,因而增强了GA-PSO算法的优化能力。From the test results, we can see that under the same conditions, the GA-PSO algorithm has the largest fitness value or the least number of iterations, that is, the improved particle swarm algorithm has the best optimization effect. Gradually decreases, so that the particles inherit less speed in the original direction, so that they fly closer and have better exploration ability. However, the search ability of the particle swarm decreases, and it is easy to fall into the local optimal solution as the number of iterations increases. The improved particle swarm algorithm selects a certain number of particles from the particle swarm according to a certain probability in each iteration, so that they reproduce randomly in pairs, produce a corresponding number of offspring particles, and replace the parent particles with offspring particles to keep the population size unchanged. The crossover operation can benefit the particles from both parents, enhance the search ability, and easily jump out of the local optimal solution; the mutation operation of the improved particle swarm algorithm (GA-PSO algorithm) changes the positions of some particles with a certain mutation probability, thereby enhancing the optimization ability of the GA-PSO algorithm.
实施例3Example 3
本实施例提供了一种用于无人机智能机库的读写器部署系统,本实施所述的读写器部署系统能够应用实施例1和实施例2所述读写器部署方法,读写器部署系统包括:This embodiment provides a reader/writer deployment system for a drone intelligent hangar. The reader/writer deployment system described in this embodiment can apply the reader/writer deployment method described in Embodiment 1 and Embodiment 2. The reader/writer deployment system includes:
映射模块,对智能机库进行环境映射创建射频识别虚拟模型;对射频识别虚拟模型进行识别获取智能机库中无人机的电子标签位置;The mapping module maps the environment of the smart hangar and creates a RFID virtual model; the RFID virtual model is identified to obtain the electronic tag location of the drone in the smart hangar;
处理分析模块,基于电子标签位置和读写器初始位置计算标签覆盖率和读写器负载,基于标签覆盖率和读写器负载构建读写器部署优化函数;The processing and analysis module calculates the tag coverage and reader load based on the electronic tag position and the reader initial position, and builds a reader deployment optimization function based on the tag coverage and reader load;
优化求解模块,用于随机生成粒子群的初始位置和速度,粒子代表为读写器部署方案,寻找粒子群中的全局最优解;利用全局最优解更新读写器部署方案的历史最优解;基于历史最优解迭代更新粒子的速度和位置,根据迭代次数选择性对粒子群进行交叉操作和变异操作,The optimization solution module is used to randomly generate the initial position and speed of the particle swarm. The particles represent the reader deployment plan and find the global optimal solution in the particle swarm. The global optimal solution is used to update the historical optimal solution of the reader deployment plan. The particle speed and position are iteratively updated based on the historical optimal solution. The particle swarm is selectively cross-operated and mutated according to the number of iterations.
输出模块,用于重新寻找粒子群中的全局最优解;重复迭代直至达到最大迭代次数输出读写器最优部署策略。The output module is used to re-find the global optimal solution in the particle swarm; iterates repeatedly until the maximum number of iterations is reached and outputs the optimal deployment strategy of the reader/writer.
如图9所示,电子标签包括标签电源、高频接口、微控制器、第一EEPROM存储器和RAM存储器;标签电源与第一EEPROM存储器电性连接,第一EEPROM存储器和RAM存储器电性连接于微控制器,所述微控制器通过高频接口与标签天线电性连接。As shown in Figure 9, the electronic tag includes a tag power supply, a high-frequency interface, a microcontroller, a first EEPROM memory and a RAM memory; the tag power supply is electrically connected to the first EEPROM memory, the first EEPROM memory and the RAM memory are electrically connected to the microcontroller, and the microcontroller is electrically connected to the tag antenna through the high-frequency interface.
如图10所示,读写器包括逻辑控制单元;所述逻辑控制单元电性连接有第二EEPROM存储器和ROM存储器;所述第二EEPROM存储器电性连接电压调节器;解调器电性连接至所述逻辑控制单元;所述逻辑控制单元通过调制器与读写器天线电性连接。As shown in Figure 10, the reader/writer includes a logic control unit; the logic control unit is electrically connected to a second EEPROM memory and a ROM memory; the second EEPROM memory is electrically connected to a voltage regulator; a demodulator is electrically connected to the logic control unit; and the logic control unit is electrically connected to the reader/writer antenna through the modulator.
所述优化求解模块根据迭代次数选择性对粒子群进行交叉操作和变异操作,包括:The optimization solution module selectively performs crossover and mutation operations on the particle swarm according to the number of iterations, including:
判断粒子群的迭代次数是否小于设定阈值;Determine whether the number of iterations of the particle swarm is less than the set threshold;
当粒子群的迭代次数小于设定阈值,在基于历史最优解迭代更新粒子的速度和位置后,对粒子群进行交叉操作和变异操作,重新寻找粒子群中的全局最优解;When the number of iterations of the particle swarm is less than the set threshold, after iteratively updating the particle speed and position based on the historical optimal solution, the particle swarm is subjected to crossover and mutation operations to search for the global optimal solution in the particle swarm again;
当粒子群的迭代次数大于或等于设定阈值,在基于历史最优解迭代更新粒子的速度和位置后,直接寻找粒子群中的全局最优解。When the number of iterations of the particle swarm is greater than or equal to the set threshold, after iteratively updating the particle speed and position based on the historical optimal solution, the global optimal solution in the particle swarm is directly sought.
实施例4Example 4
第三方面本发明提供了电子设备,包括存储介质和处理器;所述存储介质用于存储指令;所述处理器用于根据所述指令进行操作以执行实施例1和实施例2所述的读写器部署方法。In a third aspect, the present invention provides an electronic device, comprising a storage medium and a processor; the storage medium is used to store instructions; the processor is used to operate according to the instructions to execute the reader/writer deployment method described in Example 1 and Example 2.
本领域内的技术人员应明白,本申请的实施例可提供为方法、系统、或计算机程序产品。因此,本申请可采用完全硬件实施例、完全软件实施例、或结合软件和硬件方面的实施例的形式。而且,本申请可采用在一个或多个其中包含有计算机可用程序代码的计算机可用存储介质(包括但不限于磁盘存储器、CD-ROM、光学存储器等)上实施的计算机程序产品的形式。Those skilled in the art will appreciate that the embodiments of the present application may be provided as methods, systems, or computer program products. Therefore, the present application may take the form of a complete hardware embodiment, a complete software embodiment, or an embodiment combining software and hardware. Moreover, the present application may take the form of a computer program product implemented on one or more computer-usable storage media (including but not limited to disk storage, CD- ROM , optical storage, etc.) containing computer-usable program codes.
本申请是参照根据本申请实施例的方法、设备(系统)、和计算机程序产品的流程图和/或方框图来描述的。应理解可由计算机程序指令实现流程图和/或方框图中的每一流程和/或方框、以及流程图和/或方框图中的流程和/或方框的结合。可提供这些计算机程序指令到通用计算机、专用计算机、嵌入式处理机或其他可编程数据处理设备的处理器以产生一个机器,使得通过计算机或其他可编程数据处理设备的处理器执行的指令产生用于实现在流程图一个流程或多个流程和/或方框图一个方框或多个方框中指定的功能的装置。The present application is described with reference to the flowcharts and/or block diagrams of the methods, devices (systems), and computer program products according to the embodiments of the present application. It should be understood that each process and/or box in the flowchart and/or block diagram, as well as the combination of the processes and/or boxes in the flowchart and/or block diagram, can be implemented by computer program instructions. These computer program instructions can be provided to a processor of a general-purpose computer, a special-purpose computer, an embedded processor, or other programmable data processing device to generate a machine, so that the instructions executed by the processor of the computer or other programmable data processing device generate a device for implementing the functions specified in one process or multiple processes in the flowchart and/or one box or multiple boxes in the block diagram.
这些计算机程序指令也可存储在能引导计算机或其他可编程数据处理设备以特定方式工作的计算机可读存储器中,使得存储在该计算机可读存储器中的指令产生包括指令装置的制造品,该指令装置实现在流程图一个流程或多个流程和/或方框图一个方框或多个方框中指定的功能。These computer program instructions may also be stored in a computer-readable memory that can direct a computer or other programmable data processing device to work in a specific manner, so that the instructions stored in the computer-readable memory produce a manufactured product including an instruction device that implements the functions specified in one or more processes in the flowchart and/or one or more boxes in the block diagram.
这些计算机程序指令也可装载到计算机或其他可编程数据处理设备上,使得在计算机或其他可编程设备上执行一系列操作步骤以产生计算机实现的处理,从而在计算机或其他可编程设备上执行的指令提供用于实现在流程图一个流程或多个流程和/或方框图一个方框或多个方框中指定的功能的步骤。These computer program instructions may also be loaded onto a computer or other programmable data processing device so that a series of operational steps are executed on the computer or other programmable device to produce a computer-implemented process, whereby the instructions executed on the computer or other programmable device provide steps for implementing the functions specified in one or more processes in the flowchart and/or one or more boxes in the block diagram.
以上所述仅是本发明的优选实施方式,应当指出,对于本技术领域的普通技术人员来说,在不脱离本发明技术原理的前提下,还可以做出若干改进和变形,这些改进和变形也应视为本发明的保护范围。The above is only a preferred embodiment of the present invention. It should be pointed out that for ordinary technicians in this technical field, several improvements and modifications can be made without departing from the technical principles of the present invention. These improvements and modifications should also be regarded as the scope of protection of the present invention.
Claims (10)
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202411305418.3A CN118821813A (en) | 2024-09-19 | 2024-09-19 | A reader-writer deployment method and system for unmanned aerial vehicle intelligent hangar |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202411305418.3A CN118821813A (en) | 2024-09-19 | 2024-09-19 | A reader-writer deployment method and system for unmanned aerial vehicle intelligent hangar |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN118821813A true CN118821813A (en) | 2024-10-22 |
Family
ID=93069941
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202411305418.3A Pending CN118821813A (en) | 2024-09-19 | 2024-09-19 | A reader-writer deployment method and system for unmanned aerial vehicle intelligent hangar |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN118821813A (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN119398078A (en) * | 2024-12-31 | 2025-02-07 | 广东中世发智能科技股份有限公司 | RFID jewelry tag reading system and method |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107277830A (en) * | 2017-08-03 | 2017-10-20 | 扬州大学 | A kind of wireless sensor network node dispositions method based on particle group optimizing and mutation operator |
| CN111225367A (en) * | 2020-01-08 | 2020-06-02 | 西安电子科技大学 | RFID Network Planning Method Based on Hybrid Particle Swarm Optimization |
-
2024
- 2024-09-19 CN CN202411305418.3A patent/CN118821813A/en active Pending
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107277830A (en) * | 2017-08-03 | 2017-10-20 | 扬州大学 | A kind of wireless sensor network node dispositions method based on particle group optimizing and mutation operator |
| CN111225367A (en) * | 2020-01-08 | 2020-06-02 | 西安电子科技大学 | RFID Network Planning Method Based on Hybrid Particle Swarm Optimization |
Non-Patent Citations (2)
| Title |
|---|
| 全艺璇 等: "基于改进型灰狼算法的RFID网络规划", 计算机科学, 12 August 2020 (2020-08-12), pages 253 - 257 * |
| 刘快: "RFID读写器网络配置及算法优化研究", 中国优秀硕士学位论文全文数据库信息科技辑, no. 51, 15 December 2013 (2013-12-15), pages 8 - 21 * |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN119398078A (en) * | 2024-12-31 | 2025-02-07 | 广东中世发智能科技股份有限公司 | RFID jewelry tag reading system and method |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Wang et al. | Wireless sensor network deployment optimization based on two flower pollination algorithms | |
| Zainuddin et al. | A review of crossover methods and problem representation of genetic algorithm in recent engineering applications | |
| Mittal et al. | A novel hybrid optimization methodology to optimize the total number and placement of wind turbines | |
| Fard et al. | A bi-objective stochastic closed-loop supply chain network design problem considering downside risk | |
| Peker et al. | An efficient solving of the traveling salesman problem: the ant colony system having parameters optimized by the Taguchi method | |
| CN111007813B (en) | AGV obstacle avoidance scheduling method based on multi-population hybrid intelligent algorithm | |
| Talbi | Hybrid metaheuristics for multi-objective optimization | |
| CN118821813A (en) | A reader-writer deployment method and system for unmanned aerial vehicle intelligent hangar | |
| Elewe et al. | Hybridized firefly algorithm for multi-objective radio frequency identification (RFID) network planning | |
| Wang et al. | Electricity load forecasting based on support vector machines and simulated annealing particle swarm optimization algorithm | |
| CN115113647B (en) | A resource scheduling method for swarm drones based on intelligent evolutionary algorithm | |
| CN115080388B (en) | Automatic driving system-oriented simulation test scene generation method | |
| Strumberger et al. | Bare bones fireworks algorithm for the rfid network planning problem | |
| CN116523158A (en) | Multi-unmanned aerial vehicle track planning method, device, equipment and storage medium | |
| Raghib et al. | An optimal deployment of readers for rfid network planning using nsga-ii | |
| CN119226869B (en) | HOA-CNN-based power distribution network ground fault cause classification method, system and medium | |
| D’Ambrosio et al. | Optimizing cellular automata through a meta-model assisted memetic algorithm | |
| CN118944191A (en) | A multi-stage planning method for low-carbon elasticity-driven energy storage considering mixed uncertainty | |
| CN118508418A (en) | Method, device, storage medium and product for determining parameters of load model | |
| Balaji et al. | Comparative Study of Various Machine Learning and Deep Learning Techniques for Energy Prediction and Consumption Using IoT Modules | |
| CN110689320A (en) | Large-scale multi-target project scheduling method based on co-evolution algorithm | |
| CN104517141B (en) | Radio frequency identification network topology method based on load balance Yu particle cluster algorithm | |
| CN117173586A (en) | Distributed photovoltaic monitoring and identification methods, devices, equipment and storage media | |
| Ma et al. | Task allocation method of multi-logistics robots based on autoencoder-embedded genetic algorithm | |
| Shokouhifar et al. | Designing a renewable and sustainable phosphorus fertilizer supply chain network using an ensemble knowledge-based heuristic-metaheuristic algorithm |
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 |
Application publication date: 20241022 |