Patents
Literature
Patsnap Copilot is an intelligent assistant for R&D personnel, combined with Patent DNA, to facilitate innovative research.
Patsnap Copilot

88 results about "Selection operator" patented technology

Mobile-robot route planning method based on improved genetic algorithm

InactiveCN106843211AImprove environmental adaptabilityStrong optimal path search abilityPosition/course control in two dimensionsGenetic algorithmsProximal pointTournament selection
The invention relates to a mobile-robot route planning method based on an improved genetic algorithm. A raster model is adopted to preprocess a working space of a mobile robot, in a rasterized map, an improved rapid traversing random tree is adopted to generate connections of several clusters between a start point and a target point, portions for the mobile robot to freely walk on in the working space are converted into directed acyclic graphs, and a backtracking method is adopted to generate an initial population which is abundant in diversity and has no infeasible path on the basis of the directed acyclic graphs. Three genetic operators, namely a selection operator, a crossover operator and a mutation operator, are adopted to evolve the population, wherein the selection operator uses a tournament selection strategy, the crossover operator adopts a single-point crossover strategy, and the mutation operator adopts a mutation strategy which displaces an aberrance point with an optimal point in eight-neighbor points of the aberrance point. A quadratic b-spline curve is adopted to smooth an optimal route, and finally, a smooth optimal route is generated. According to the method, the route planning capability of the mobile robot under a complex dynamic environment is effectively improved.
Owner:DONGHUA UNIV

Method and device for route optimization of logistics delivery vehicle

The invention discloses a method and a device for route optimization of logistics delivery vehicle, and belongs to the technical field of logistics. The method comprises the following steps of: initializing a congestion matrix alpha and a distance matrix D, generating a delivery route weight matrix omega=alpha D, and initializing a population module N<ZQ>; selecting a population size N<X>, a maximum number of generations N<G>, a crossing-over rate beta, a mutation rate gamma and a number of generations n=0, generating an initial route r1 through a greedy algorithm, and performing mutation operation on the initial route r1 to generate N<ZQ>-1 new routes; calculating fitness A<n> of each route of a first generation population formed by the initial route and the new routes, selecting N<X> routes with the highest fitness from the current population by adopting selection operators, and performing crossover and mutation operations on the N<X> routes to generate a population of next generation; updating n=n+1, when n=N<G>, calculating the fitness A<n> of all the routes in the latest population, and selecting the delivery route with the highest fitness in the current population as the optimal route. According to the invention, when the logistics delivery vehicle delivers goods, the delivery time can be as less as possible, and the delivery route can be as short as possible.
Owner:余意 +3

Improved method for extracting Fourier transformation infrared spectrum characteristic variable of multi-component gas by aid of TR (Tikhonov regularization)

The invention discloses an improved method for extracting Fourier transformation infrared spectrum characteristic variable of multi-component gas by aid of TR (Tikhonov regularization). The method includes resolving a characteristic variable extracting model into weight sum of the difference of multiple spectral line values; converting an original TR objective function into an objective function based on the model; then adding a bound term of the difference of spectral line positions in the objective function based on the model; realizing optimal functional solution by means of an LASSO (least absolute shrinkage and selection operator) arithmetic based on an Engl's criterion so as to obtain the optimal value of a regressive vector; and obtaining the characteristic variable capable of overcoming interferences caused by spectrum baseline deviation. The accuracy of online multi-component gas analysis results can be improved by the aid of the improved method. The improved method for extracting Fourier transformation infrared spectrum characteristic variable of multi-component gas by aid of TR can be used for multi-component gas quantitative spectrometric analysis application in the fields of gas logging for petroleum and natural gas exploration, quality control and fault diagnosis of products, hardware, chemical engineering and environmental protection.
Owner:XI AN JIAOTONG UNIV

Method for automatically managing and controlling virtual GPU (Graphics Processing Unit) resource in cloud gaming

The invention provides a method for automatically managing and controlling a virtual (Graphics Processing Unit) resource in cloud gaming. The method comprises the steps of establishing an Auto-vGPU framework; selecting key index data as system input by using an LASSO (Least Absolute Shrinkage and Selection Operator)-based dimensionality reduction algorithm for supporting an input and output model, which fits the low dimension, of the Auto-vGPU framework; automatically controlling the parameter configuration in a vGASA module in the Auto-vGPU framework by utilizing a parameter automatic configuration algorithm of a PI (proportional-Integral) controller, reducing the manual operation, and supporting the Auto-vGPU framework to keep good performance in a dynamic and complicated cloud environment. According to the method provided by the invention, the automatic management on the virtual GPU resource is realized, an LASSO / LARS (Least Angle Regression) dimensionality reduction technology is used, the input capacity of each game in a virtual machine is automatically reduced, and an online controller is also designed through adopting a method for automatically configuring PI parameters according to expected performance.
Owner:SHANGHAI JIAO TONG UNIV

Wind farm multi-model draught fan optimized arrangement method based on genetic algorithm

InactiveCN103793566ACoding is intuitiveIntuitive and accurate position relationshipSpecial data processing applicationsAlgorithmSquare mesh
The invention relates to a wind farm multi-model draught fan optimized arrangement method based on a genetic algorithm. The method includes the following steps that (1) a wind farm region is divided into square meshes which are the same in size according to the diameter of a draught fan, and an integer matrix which is the same in line and row is generated randomly to be used as the initial solution of the algorithm; (2) the individual fitness value of a current generation is calculated; (3) parent individuals participating in crossover are selected through even random selection operators, and then filial generation individuals are generated by the adoption of improved crossover and mutation operators; (4) repairing operators are introduced to the individuals in a population; (5) a Tabu operator is introduced to an optimal solution of the current generation of the population, the optimal solution is used as the initial solution of a Tabu algorithm, and the neighborhood solution of the optimal solution is searched for; (6) whether the biggest number of iterations is reached or not is judged, if yes, the multi-model draught fan optimized arrangement is completed, and if not, the step (2) is executed again. Compared with the prior art, the wind farm multi-model draught fan optimized arrangement method based on the genetic algorithm has the advantages of being visual in coding mode, good in performance index, high in local search capacity, high in expansibility, high in practicability and the like.
Owner:TONGJI UNIV

Satellite remote sensing image fusion method

The invention discloses a satellite remote sensing image fusion method comprising that: natural color waveband combined intensity I, a ratio R of near-infrared waveband intensity to the natural color waveband combined intensity I, and a normalized difference vegetation index NDVI are respectively calculated with regard to a multispectral remote sensing image with a near-infrared waveband, a red light waveband, a green light waveband and a blue light waveband, and then a basic enhancement operator k1 is established according to the ratio R. A characteristic selection operator k2 and a characteristic smooth operator k3 are established according to the NDVI. A spectrum integrated compensation coefficient S is formed by the production of k1, k2 and k3, and then each waveband value in the image is multiplied by (1+S) so that the obtained result is the result after fusion of all the wavebands. The near-infrared waveband acts as a data source for enhancement processing, and the enhancement operator with clear physical meaning is designed to perform selective characteristic fusion enhancement on the remote sensing image so that the method is simple, operation is rapid, and the method is applicable to multiband satellite images with near-infrared, red, green, and blue spectral data.
Owner:PEARL RIVER HYDRAULIC RES INST OF PEARL RIVER WATER RESOURCES COMMISSION

Multi-intelligent robot task distribution method facing dynamic task

ActiveCN108416488AAvoid deadlockSolve multitasking problemsResourcesDNA computersTask completionLocal optimum
The present invention provides a multi-intelligent robot task distribution method facing a dynamic task which mainly solves the multi-task distribution problem of a task state quantity with time-variant characteristics. The method comprises the steps of: obtaining dynamic task feature parameters, combining intelligent robot ability parameters, and establishing a feature equation of a task point state quantity; according to the feature equation, designing an intelligent robot revenue function; according to the revenue function, designing a genetic algorithm fitness function; further designing agenetic algorithm difference selection operator and a local mutation operator, and providing an algorithm repair strategy; and finally, employing the genetic algorithm to generate an intelligent robot task distribution scheme to complete multi-task distribution. The multi-intelligent robot task distribution method takes obtaining of system maximum return as a target to achieve dynamic multi-taskrapid distribution, solve the algorithm chromosome deadlock problem and avoid that search falls into local optimum, and through a multi-stage distribution strategy, the method can fully deploy intelligent robots in the system to participate in task completion so as to improve the whole efficiency of the system.
Owner:CENT SOUTH UNIV

Multi-defect positioning method based on search algorithm

The invention discloses a multi-defect positioning method based on a search algorithm. The method includes the steps that 1, the search algorithm at a first stage is executed, wherein the following processing that firstly, a population with multi-defect distribution is initialized through a greedy algorithm, then a selection operator, a crossover operator and a mutation operator are executed to generate a new individual, the new individual is re-inserted into the original population, a next-generation population is formed, and when a terminal condition of the search algorithm is met, a second stage is executed is specially included; 2, multi-defect positioning at a second stage is executed, wherein a final defect distribution combined population is obtained, an executable entity rank is obtained according to candidate defect distribution populations, the executable entity sequence is mapped to a real position of a program, a rank of equivocation coefficients of corresponding program entities is obtained according to multi-defect distribution in the optimal candidate defect distribution population, and the algorithm is completed. The effect of an adopted GAMFal algorithm on the multi (single) defect positioning problem is superior to that of an existing SFL method; only little artificial participation is needed; the efficiency of the algorithm is feasible.
Owner:TIANJIN UNIV

Adaptive genetic algorithm based on population evolution process

InactiveCN106934459AIncrease diversityFast global search capabilityGenetic algorithmsAlgorithmSelection operator
The invention discloses a self-adaptive genetic algorithm based on the population evolution process, including the first step, setting the parameters of the BAGA algorithm, setting the number of iterations of the algorithm, the number of populations in each generation, the discrete precision of the independent variable, and the total number of shooting times , a constant; the second step is to use binary code to generate the initial population; the third step is to judge whether the maximum number of iterations is satisfied, and if so, output the optimal individual of the last generation, which is the optimal value found, otherwise turn to the fourth step; The fourth step is to establish the relationship between the objective function and the fitness function, and then calculate the fitness of each individual and the average fitness of contemporary individuals, save the individual with the largest contemporary fitness, and calculate the evolutionary degree of the contemporary population, the degree of population aggregation, and Balance factor, crossover probability and mutation probability; the fifth step, selection, crossover and mutation operations to generate new populations, the selection operator uses roulette technology, the crossover operation uses univariate crossover, and the mutation operation uses basic bit mutation; the sixth step, Find the best individual in the contemporary population, keep it, and then go to the second step.
Owner:NORTHWESTERN POLYTECHNICAL UNIV

Multi-population genetic algorithm-based power distribution network fault section location algorithm

The invention discloses a multi-population genetic algorithm-based power distribution network fault section location algorithm. The algorithm includes the following steps that: 1) the fault current ofa power distribution network containing distributed power sources is coded with binary codes; 2) on the basis of satisfying the requirements of the multi-power source network, a distributed power source switching coefficient is introduced to represent power source switching, the application of the algorithm to a complex power distribution network is considered, a corresponding switching functionis established; 3) the construction of a fitness function is completed for the fault section location problem of the power distribution network according to a fault current code and the switching function of the power distribution network containing the distributed power sources; and 4) a multi-population genetic algorithm (MPGA) is implemented, so that population initialization, control parametersetting, immigration operator, manual selection operator and convergence condition determination are completed. With the algorithm of the invention adopted, the fault section of the power distribution network can be located accurately. The algorithm is suitable for a complex power distribution network containing distributed power sources, and has certain effectiveness and fault tolerance.
Owner:NANJING UNIV OF SCI & TECH

WAMS-based genetic algorithm-improved power grid reactive capacity optimization configuration method

The invention relates to a genetic algorithm-improved power grid reactive capacity optimization configuration method based on real-time information of a Wide Area Measurement System (WAMS) and an Energy Management System (EMS) of a power grid. The method includes: step S1. obtaining power grid measurement information from the power grid WAMS in real time; step S2. obtaining from the EMS the power grid structure, parameters and running section information in the EMS of a current time section, and forming an admittance matrix of a whole network containing all load node equivalent admittance; step S3. performing hybrid coding on a control variable of power grid reactive optimization; step S4. establishing a fitness function; step S5. executing a selection operator; step S6. executing a cross and mutation operator; and step S7. determining the rate of convergence and convergence termination criteria. The method in the invention makes improvements on the basis of a traditional genetic algorithm, makes improvements in multiple aspects to improve defects of the traditional genetic algorithm in reactive optimization, improves the rate of convergence and quality of a solution, and prevents the problem of occurrence of a local optimal solution.
Owner:STATE GRID CORP OF CHINA +1

Method for accurately identifying parameters of thermal process state-space model by adopting improved genetic optimization algorithm

ActiveCN106650934AGood estimateAvoid Random Search PhenomenaGenetic algorithmsModel parametersGlobal optimization
The invention discloses a method for accurately identifying parameters of a thermal process state-space model by adopting an improved genetic optimization algorithm. The method mainly comprises the steps of determining structure and identification parameters of the model, determining structural parameters of the optimization algorithm, solving a fitness value, encoding, transforming a decimal system into a binary system, performing optimal chromosome high-frequency mutation, implementing an optimal chromosome preservation mechanism, a selection operator, a crossover and mutation operators, decoding, transforming the binary system into a decimal system, and performing adaptive spatial mutation. According to the invention, the optimal chromosome preservation mechanism is introduced, so that random search of the algorithm in a later period can be avoided; the global optimization ability of the algorithm can be enhanced through optimal chromosome high-frequency mutation; and a certain range of real number spatial mutation is performed on a global optimal solution through adaptive spatial mutation, the range of spatial mutation increase along with increase in algebras trapping in local optimum until a local optimal solution jumps out, and the local optimization ability of the algorithm can be enhanced.
Owner:SOUTHEAST UNIV

A controlled source audio-frequency magnetotellurics one-dimensional inversion method using an improved genetic algorithm

The invention provides a controlled source audio-frequency magnetotellurics one-dimensional inversion method using an improved genetic algorithm. By applying the genetic algorithm to CSAMT one-dimensional data inversion, a target function based on the combination of frequency weighting and phase weighting is proposed, a selection operator based on the combination of fitness value ranking selection and the simulated annealing method is proposed, segmented crossover probability upper and lower limits are proposed, and a crossover operator based on the combination of the self-adaptive crossover probability based on fitness values and a mutation operator based on the combination of fitness and gene weighting are proposed; by using the probability-based optimal individual preservation strategy, the individual with the smallest fitness value is replaced by the individual with the largest fitness value with a certain probability. Compared with the conventional CSAMT data inversion method, the method prevents inversion failure caused by the emergence of ill-conditioned matrixes, can avoid the problems of prematurity and the condition of being liable to be caught in a local extremum in the standard genetic algorithm, and enables chromosomes to move in the optimal solution direction rapidly to find the optimal solution.
Owner:JILIN UNIV

Construction project multi-objective optimization method

The invention provides a construction project multi-objective optimization method. The construction project multi-objective optimization method comprises the following steps: determining a mathematical model and genetic algorithm parameters of multi-objective optimization; establishing a population with feasible constraints and a population target function matrix; calculating an objective weight of the target function by adopting an entropy weight method according to the target function matrix, and synthesizing a hybrid dynamic weight of the target function; sorting the population by adoptinga method based on dynamic weight to obtain a Pareto temporary solution set; attaching virtual fitness values to individuals according to population individual sorting, and selecting a filial generation population by adopting a proportional selection operator and a roulette method; performing crossover operation on the filial generation population; performing mutation operation on the filial generation population after the crossover operation; combining the Pareto temporary solution set with the filial generation population after mutation operation to generate a new population; and if the algorithm termination condition is met, terminating the algorithm, otherwise, returning. According to the method, the problem of ambiguity between an original multi-objective optimization algorithm and engineering application is well solved, and the method has better engineering applicability.
Owner:SHENZHEN UNIV +2

Cross-region power system protection communication network planning method

The invention relates to a cross-region power system protection communication network planning method, comprising the steps of initializing a first generation of populations through adoption of a variable-length chromosome coding method; setting a fitness function, and evaluating fitness of chromosomes according to features of target populations; selecting parental chromosomes according to the fitness function, specifically, selecting the parental chromosomes through adoption of a selection operator, thereby enabling the parental chromosomes to be inherited by a next generation; carrying out cross processing on the parental chromosomes, and generating new chromosomes, thereby improving diversity of species; carrying out variation processing on the parental chromosomes after the cross processing, thereby improving searching capability of the populations; and combining the parental chromosomes and the newly generated chromosomes, as descendants of a current generation of populations, carrying out a next round of evolution until the preset generation number is realized, exiting a loop, and obtaining a final planning scheme, namely the chromosomes with the highest fitness in the last generation of populations. According to the method, a demand of line protection business for delay can be satisfied.
Owner:STATE GRID INFORMATION & TELECOMM BRANCH +3
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products