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

137 results about "Evolution strategy" patented technology

In computer science, an evolution strategy (ES) is an optimization technique based on ideas of evolution. It belongs to the general class of evolutionary computation or artificial evolution methodologies.

System, method, and computer-accessible medium for providing a multi-objective evolutionary optimization of agent-based models

Agent-based models (ABMs)/multi-agent systems (MASs) are one of the most widely used modeling-simulation-analysis approaches for understanding the dynamical behavior of complex systems. These models can be often characterized by several parameters with nonlinear interactions which together determine the global system dynamics, usually measured by different conflicting criteria. One problem that can emerge is that of tuning the controllable system parameters at the local level, in order to reach some desirable global behavior. According to one exemplary embodiment t of the present invention, the tuning of an ABM for emergency response planning can be cast as a multi-objective optimization problem (MOOP). Further, the use of multi-objective evolutionary algorithms (MOEAs) and procedures for exploration and optimization of the resultant search space can be utilized. It is possible to employ conventional MOEAs, e.g., the Nondominated Sorting Genetic Algorithm II (NSGA-II) and the Pareto Archived Evolution Strategy (PAES), and their performance can be tested for different pairs of objectives for plan evaluation. In the experimental results, the approximate Pareto front of the non-dominated solutions is effectively obtained. Further, a conflict between the proposed objectives can be seen. Additional robustness analysis may be performed to assist policy-makers in selecting a plan according to higher-level information or criteria which is likely not present in the original problem description.
Owner:NEW YORK UNIV

Many-objective optimized scheduling method for combined operation of cascade hydropower stations

InactiveCN106203689AGuaranteed uniformityEnhanced Neighborhood Exploration CapabilitiesForecastingArtificial lifePareto optimalHydropower
The invention discloses a many-objective optimized scheduling method for combined operation of cascade hydropower stations, and aims at solving main problems in engineering application of standard quantum-behaved particle swarm optimization and problems in solving single-objective optimized scheduling. A multi-population evolution strategy is realized by external file set, advantageous individual selection and a chaotic mutation operator strategies, diversity of individuals is ensured, calculation of the method is accelerated, and an approximate Pareto optimal leading edge with sound distribution is obtained. An external file set is introduced to store elite individuals, dynamic update and maintenance of the file set are realized via non-inferior layered ordering and crowd distance, and distribution of the individual is kept uniform; and a chaotic mutation operator is used to carry out local disturbance on a non-control solution, and the neighborhood exploration capability of the individuals is enhanced. According to the invention, the particle swarm optimization is improved, and effectively applied to making the many-objective optimized scheduling scheme of combined operation of the cascade hydropower stations, and a feasible and high efficiency calculating method is provided for many-objective optimized scheduling of the cascade hydropower stations.
Owner:DALIAN UNIV OF TECH

Information propagation model based on online social network and propagation method thereof

The invention requests the protection for a information propagation model based on online social network and propagation method thereof, and belongs to the field of online social network analysis. The information propagation model is composed of accessing to the data source, building dimensional attribute driving mechanism and building dynamic evolution strategy, building hot topic propagation model. The first step, the data source is accessed. The second step, dimensional attribute driving mechanism is built, user attributes is extracted from two aspects of network structure and user history, and the effects the two factors have to the driver of the user's participation in the topic are stated quantitatively through utilizing multiple linear regression methods. The third step, dynamic evolution strategy is built, income matrix is defined and popularity is perceived, and according to evolutionary game theory, building dynamic evolution strategy. The fourth step, hot topic propagation model is built. The user multidimensional attribute model, dynamic evolution strategy and traditional SIR model build a novel hot topic propagation model. The invention has the advantages of being effective to describe the spread of trend hot information in social networks and reveal the influence of different driving factors on information dissemination.
Owner:CHONGQING UNIV OF POSTS & TELECOMM

Multi-target spectrum allocation method based on undisposal order preference quantum goose group algorithm

InactiveCN102316464ASolving discrete multi-objective optimization problemsFast convergenceNetwork planningFrequency spectrumEvolution rule
The invention aims at providing a multi-target spectrum allocation method based on an undisposal order preference quantum goose group algorithm, which comprises the following steps of: building a graph theory coloring model of cognitive radio spectrum allocation, initializing the position of the quantum geese and the quantum speed, carrying out the undisposal order preference and congestion degree calculation on individuals in the population according to the adaptability, sequencing the individuals with the same undisposal order preference levels in sequence from higher congestion degrees to lower congestion degrees, carrying out evolution on the population by a quantum goose group evolution rule, generating new quantum speed and position, carrying out undisposal order preference on obtained solutions in an elite solution set nonDomQGSAList and selecting the solutions with the undisposal solution level being 1 as the final Pareto front end solution set. The method solves the discrete multi-target optimization problem, designs the novel undisposal order preference quantum goose group algorithm as the evolution strategy and has the advantages that the convergence speed is high, and the precision is high. In addition, the method provided by the invention has a wider application range.
Owner:三亚哈尔滨工程大学南海创新发展基地

UAV group task allocation method based on quantum crow group search mechanism

The invention relates to a UAV group task allocation method based on a quantum crow group search mechanism. The UAV group task allocation method comprises the steps of: establishing a UAV group task allocation model from a plurality of start points to a plurality of tasks, wherein the UAV group task allocation model comprises UAV model numbers, start and end points, and an allocation model; initializing a quantum crow group; calculating the fitness of each quantum crow according to a fitness function, and storing a position of the quantum crow corresponding to the minimum value of the fitnessfunction as a globally optimal food position; updating a quantum position and the position of each quantum crow; and calculating the fitness of each quantum crow according to a fitness function, determining a hidden food position of each quantum crow, finding the optimal food position so far, outputting the globally optimal food position if the maximum iteration algebra is reached, and mapping themaximum iteration algebra into a task allocation matrix. The UAV group task allocation method solves the discrete multi-constrained objective function solving problem, designs a discrete quantum crowalgorithm as an evolution strategy, and has the advantages of fast convergence speed and high convergence precision.
Owner:HARBIN ENG UNIV

Method for identifying synchronous generator parameters

The invention belongs to the technical field of identifying synchronous generator parameters, and relates to a method for identifying the synchronous generator parameters by an improved evolution algorithm. Starting from an randomly-generated initial generator parameter group, optimal solution is searched through generation of an initial group, fitness calculation, recombination, mutation and selection, and stopping operation according to operating principles of struggle for existence and survival of the fittest by using actual measurement data in a power management unit (PMU) in a wide area measurement system (WAMS); and an improved evolution strategy algorithm of biomimicry is taken as optimizing theoretical basis, the decoupling of a direct axis and a quadrature axis of the synchronousgenerator and steady state and transient state are processed separately, an initial practicable parameter group is established through design parameters, and a differential equation of a higher orderis calculated by selecting a high-precision improved Euler method, so that the output variable set by the generator is solved, the optimizing process is realized through recombination, mutation and selection of the initial group, and the synchronous generator parameters are identified. The method is simple and has a reliable principle, and the correctness of the parameter identification is high.
Owner:NORTH CHINA GRID +1

Method and system for auditing and distributing sensitive data based on evolution strategy

The invention relates to the technical field of information safety, particularly to a method and a system for auditing and distributing sensitive data based on an evolution strategy. The system of the invention comprises a risk evaluation module based on trust, an auditing and distributing module based on a strategy, a data leakage auditing module and a sensitive data management service module; the risk evaluation module calculates the trust level of the user behavior and investigates the intersection of a leakage set and an intersection of an acquired set of the user, so that the crime risk of the user is obtained; the distributing module determines a distribution policy under the guide of a crime factor and a judging sum formula according to user application and distribution records; and the auditing module records a distributing log, counts the information for analyzing the user behavior and the data leakage, and feeds back an auditing result to the risk evaluation module and the distributing module. The invention meets the requirements of the anti-leakage application of the sensitive data having high requirements for data completeness; the detection source is detected by the intersection of the acquired data set of the user and the leakage data set; and no watermark information needs to be imbedded, so that the invention meets the application requirements of the sensitive data having high requirements for the completeness and the privacy.
Owner:WUHAN UNIV

A decomposition-based train operation multi-objective differential evolution algorithm

The invention discloses a decomposition-based train operation multi-objective differential evolution algorithm. The algorithm comprises the steps of 1, establishing a train elementary substance pointdynamical model; 2, establishing a train multi-objective optimization model according to the train multi-objective operation requirement; Step 3, decomposing the train operation multi-objective optimization problem into N single-objective optimization sub-problems by adopting a Chebyshev method; 4, in order to ensure the uniformity of the obtained Pareto solution, generating a weight vector by adopting a formula uniform design method; And 5, selecting an evolution strategy to form a differential evolution strategy pool, and improving the diversity and convergence of an evolution process by adopting a self-adaptive differential evolution strategy based on reputation. The train operation multi-objective optimization problem is converted into the single-objective problem, on the basis that the uniformly distributed weight vectors are obtained, multiple control strategies are provided for the train on the premise that safety is guaranteed through the self-adaptive differential evolution strategy, and safe, quasi-point, accurate parking and low-energy-consumption operation of the train are achieved.
Owner:NANJING INST OF TECH

System, method, and computer-accessible medium for providing a multi-objective evolutionary optimization of agent-based models

Agent-based models (ABMs) / multi-agent systems (MASs) are one of the most widely used modeling-simulation-analysis approaches for understanding the dynamical behavior of complex systems. These models can be often characterized by several parameters with nonlinear interactions which together determine the global system dynamics, usually measured by different conflicting criteria. One problem that can emerge is that of tuning the controllable system parameters at the local level, in order to reach some desirable global behavior. According to one exemplary embodiment t of the present invention, the tuning of an ABM for emergency response planning can be cast as a multi-objective optimization problem (MOOP). Further, the use of multi-objective evolutionary algorithms (MOEAs) and procedures for exploration and optimization of the resultant search space can be utilized. It is possible to employ conventional MOEAs, e.g., the Nondominated Sorting Genetic Algorithm II (NSGA-II) and the Pareto Archived Evolution Strategy (PAES), and their performance can be tested for different pairs of objectives for plan evaluation. In the experimental results, the approximate Pareto front of the non-dominated solutions is effectively obtained. Further, a conflict between the proposed objectives can be seen. Additional robustness analysis may be performed to assist policy-makers in selecting a plan according to higher-level information or criteria which is likely not present in the original problem description.
Owner:NEW YORK UNIV

Hyperspectral image classification method based on immune evolutionary strategy

The invention relates to a hyperspectral image classification method based on an immune evolutionary strategy and develops a corresponding simulation prototype system. The system comprises the following four functional modules: a human-machine interface module, a hyperspectral optimal band selection module, a hyperspectral terrain classification module and a classification result output module. The method comprises the following steps: 1. obtaining the initial data and related initialization operations; 2. initializing populations; 3. initially selecting the populations; 4. cloning the populations; 5. mutating the populations in a mixed manner; 6. selecting the memory populations; 7. supplementing the population antibodies; 8. carrying out iterative computations and repeating the steps from 3 to 7 until achieving the maximum evolutionary generation; 9. using the optimal antibody to carry out terrain classification on the hyperspectral data; and 10. outputting the terrain classification results of the hyperspectral images. The method can adaptively select the optimal band combination needed by different terrain classifications under different scenes, has better time complexity and good robustness and is high in classification precision and wide in applicable scope.
Owner:BEIHANG UNIV

Particle swarm optimization algorithm based on clustering degree of swarm

The present invention discloses a particle swarm optimization algorithm based on a clustering degree of a swarm. The algorithm comprises the following steps of carrying out initialization; updating the swarm; judging whether a number of iterations is greater than a preset number of iterations and executing a corresponding step; judging whether a number of update iterations is greater than a preset number of times of stagnation and executing a corresponding step; calculating a particle clustering degree of each particle and a particle clustering degree of a swarm optimal position so as to acquire a distance between each particle and the swarm optimal position; according to a fitness of each particle, selecting a plurality of particles of which the number accords with a swarm scale to form a current swarm; and carrying out iterative optimization and updating until the maximum number of iterations is reached. According to the particle swarm optimization algorithm disclosed by the embodiment of the present invention, different evolutionary strategies can be adopted for different particles according to the progress of the optimizing process and the particle clustering degree so as to reduce the possibility of falling into the local minimum, improve the global searching ability of the algorithm and effectively avoid premature convergence.
Owner:STATE GRID CORP OF CHINA +2

Active distribution network measurement optimization and configuration method containing node injection power uncertainty

The invention discloses an active distribution network measurement optimization and configuration method containing node injection power uncertainty. The uncertainties of a large-scale electric vehicle charging load and photovoltaic power generation system output are modeled and analyzed by a dynamic probability density function; the network observability of the active distribution network after containing the node injection power uncertainty is analyzed from a state evaluation angle; an active distribution network measurement optimization and configuration model containing the node injection power uncertainty is established; and the active distribution network measurement optimization and configuration model is optimized and solved by adopting an adaptive covariance matrix evolutionary strategy to obtain a data acquisition point optimal configuration scheme under the premise of ensuring the complete observability of the network. By adoption of the method, the shortcoming that the electric vehicle charging randomness and the photovoltaic power generation system output intermittence are neglected in the current distribution network situation awareness program is overcome; theoretical support for further safety evaluation of the active distribution network is supplied; and in addition, the safe operation and control economical efficiency of the active distribution network can be further improved.
Owner:SOUTHEAST UNIV
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