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

550results about How to "Improve convergence accuracy" patented technology

Order sequencing optimization method for logistics

InactiveCN106897852ASolve the problem of optimal picking efficiencyImprove efficiencyLogisticsLocal optimumLogistics management
The present invention provides an order sequencing optimization method for logistics. The process of the method includes the following steps that: since the same type of commodities may be stored in a plurality of different containers, containers from which corresponding commodities in orders should be taken out are determined according to the expiration dates of the commodities in the orders, the number of remaining commodities in the containers where the commodities are located or the distances of the containers before order sequencing optimization is performed; and the orders of the commodities of which the containers are determined are optimally sequenced. According to the order sequencing optimization method for logistics of the invention, an evolutionary computation optimization method is adopted to optimally sequence the orders, so that the orders of the same commodities can be arranged at adjacent positions as much as possible, and therefore, commodities which have taken out can be repeatedly utilized, and the problem of low efficiency caused by frequent transport of the commodities can be avoided; and a constructed learning group concept is utilized to expand the search range of the algorithm, so that optimization calculation can be prevented from being trapped in local optimum, and convergence precision is greatly increased. With the order sequencing optimization method for logistics of the invention adopted, the optimal commodity picking efficiency of the commodities in the orders in a logistics process can be realized.
Owner:SOUTH CHINA UNIV OF TECH

Thunder and lightning approach forecasting method based on particle swarm support vector machine

The invention discloses a thunder and lightning approach forecasting method based on a particle swarm support vector machine, relates to the technical field of thunder and lightning forecasting and aims at applying a particle swarm support vector machine method in the thunder and lightning approach forecasting. The method comprises the following steps: carrying out relevance analysis and selecting related factors which influence the occurrence of thunder and lightning from the overhead and ground historical information of an MICAPS (Meteorological Information Comprehensive Analysis and Processing System) and the actual thunder and lightning data of a ground station; preprocessing the data and reasonably interpolating missing data aiming at the characteristics that data which prove whether thunder and lightning occur or not in the thunder and lightning data are imbalanced; optimizing the parameters of the support vector machine by a particle swarm optimizing algorithm; establishing a training sample set, training the support vector machine and establishing a thunder and lightning approach forecasting model; inputting a test data set into the trained forecasting model, so as to judge whether thunder and lightning occur or not. The method has the advantages of high precision and strong generalization capability.
Owner:CHONGQING UNIV OF POSTS & TELECOMM

Self-adaptive genetic particle swarm hybrid algorithm optimization method

The invention provides a self-adaptive genetic particle swarm hybrid algorithm optimization method. The self-adaptive genetic particle swarm hybrid algorithm optimization method includes: calculatingthe density and the radius of a center region of a parent population in a genetic algorithm, and distinguishing whether the parent population is in the overall centralized distribution, the local centralized distribution or the uniform distribution; performing a selection operation of the genetic algorithm, and selecting a parent individual to be evolved; establishing computational formulas of thecrossover probability and the mutation probability according to the three distributions of the parent population; performing crossover and mutation operations according to the established crossover and mutation probability formulas so as to achieve chromosome recombination and gene mutation, and forming an offspring individual; selecting a part of individuals with high fitness from a part of offspring individuals to perform the particle swarm algorithm to form offspring particles, and combining the offspring individuals and the offspring particles into an offspring population and saving the optimal individual thereof. The invention adaptively adjusts crossover probability mutation probability parameter values in the genetic particle swarm hybrid algorithm, so that the convergence speed and the convergence precision are greatly improved.
Owner:BEIHANG UNIV

Polarization state rapid tracking monitoring method based on Kalman filtering

The invention provides a method for performing polarization state tracking and balancing on a received signal in a coherent optical communication system. The method is based on linear Kalman filtering, and comprises the following steps: performing depolarization on an electrical signal input into a filter according to a state vector predicted value to obtain a Kalman measurement predicated value; finding a point which is closest to the measurement predicated value on a circle formed by the rotation of an ideal constellation point for serving as a Kalman practical measured value; subtracting the measurement predicated value from the practical measured value to obtain a measurement allowance, and inputting the measurement allowance into a Kalman updating process; and putting an updated state vector into a next iteration. A highest polarization state rotating speed which can be tracked is about 100 times those of a constant modulus algorithm and a multi-modulus algorithm; the depolarization cost is lowered; the calculation complexity is low; and the calculation amount is small. Moreover, the method is suitable for phase shift keying (PSK) and quadrature amplitude modulation (QAM) polarization multiplexed signals of each order.
Owner:HARBIN INST OF TECH SHENZHEN GRADUATE SCHOOL

Ship track active-disturbance-rejection control method based on slip form of multi-modal nonsingular terminal

The invention provides a ship track active-disturbance-rejection control method based on the slip form of a multi-modal nonsingular terminal. The method includes the steps of constructing an expectedship heading equation according to navigational parameters of a ship, deducing a discretization nonlinear structural model of a two-order differentiator, processing expected ship heading signals in the expected ship heading equation to obtain expected ship heading differential signals required for controlling the rudder angle by the control law, obtaining the output rudder angle on the basis of the switchable error feedback control law, constructing an expanded state observer in combination with the error feedback control law, tracking the output deviation according to the expanded state observer, estimating the heading angle and inner and outer disturbance errors controlled by the control law, and feeding the heading angle and the inner and outer disturbance errors back into the control law. By improving the expanded state observer, a linear function and a nonlinear function can be switched in real time; the switchable segmented slip form face is designed; through the segmented slip form face, the switchable error feedback control law is designed, and the under-actuated ship track control is well realized.
Owner:SHANGHAI MARITIME UNIVERSITY

Method of acquiring workpiece-processing optimal scheduling based on improved chicken flock algorithm

A method of acquiring a part-processing optimal scheduling scheme based on an improved chicken flock algorithm comprises the following steps: step 1, determining an evaluation index of an optimization object for a multi-objective flexible workshop scheduling problem; step 2, establishing an optimization object function; step 3, determining a constraint condition of a scheduling optimization process; step 4, designing Pareto improved chicken flock algorithm; step 5, carrying out iterative operation, outputting a Pareto non-dominated solution, selecting an optimal solution according with an enterprise need, carrying out decoding on the optimal solution and taking the solution as a final scheduling scheme. In the invention, under the condition of satisfying a resource constraint, an operation constraint and the like, time of completion, a maximum load of a single machine and a total load of all the machines are taken as an integration optimization object, the improved chicken flock algorithm is used so that an optimal scheduling scheme of part processing can be rapidly acquired. In a chicken position updating formula, a cock learning portion in the group where the chicken belongs is added. A algorithm convergence speed is guaranteed and simultaneously solution quality is greatly increased.
Owner:JIANGNAN UNIV

Water turbine parameter identification method based on self-adaptive chaotic and differential evolution particle swarm optimization

The invention discloses a water turbine parameter identification method based on self-adaptive chaotic and differential evolution particle swarm optimization. The water turbine parameter identification method is characterized by comprising the following steps of firstly, determining a nonlinear mode of a water turbine; secondly, acquiring frequency step test data; thirdly, determining a fitness function of the self-adaptive chaotic and differential evolution particle swarm optimization; fourthly, setting a basic parameter of an identification algorithm; fifthly, calculating a fitness function value of particles and an individual extreme value of the particles in a swarm as well as a global extreme value of the swarm and updating the speed and the position of the particles; sixthly, carrying out premature judgment, if the premature is judged, carrying out differential mutation, transposition, selection and other operations to avoid local optimization; seventhly, checking whether the algorithm meets end conditions or not, if so, outputting an optimal solution, and otherwise, self-adaptively changing an inertia factor and executing the fifth step to the seventh step again. According to the water turbine parameter identification method disclosed by the invention, a water hammer time constant of the water turbine is identified, and the algorithm is high in convergence speed and convergence precision; in addition, test data of the water turbine at any load level can be utilized, so that the test cost is effectively reduced.
Owner:SICHUAN UNIV

A cloud manufacturing resource configuration method based on an improved whale algorithm

The invention discloses a method for cloud manufacturing resource optimization configuration based on an improved whale algorithm, and the method comprises the steps: building a problem model, and defining a fitness function; setting improved whale algorithm parameters, and generating an initial population; Calculating fitness values of all individuals in the population, obtaining a current optimal resource allocation scheme and converting the current optimal resource allocation scheme into whale individual position vectors; Introducing a parameter p, and judging whether p is less than or equal to 0.5; If not, performing spiral motion iteration updating to complete population updating; If yes, whether the value A (1) of the coefficient vector of the improved whale algorithm is met or not is judged; If yes, performing shrinkage encircling iteration updating; If not, performing random search predation iteration updating; Obtaining a current optimal resource configuration scheme; Adding 1to the number of iterations, and judging whether the current number of iterations is smaller than the maximum number of iterations; If yes, repeating the operation; And if not, outputting the currentoptimal resource configuration scheme. The whale algorithm is improved, so that the algorithm convergence speed is higher, the optimal solution is easier to achieve, and a new method is provided forsolving the problem of resource allocation.
Owner:CHANGAN UNIV

Multi-single-arm manipulator output consistence controller with pre-defined performance and design method thereof

The invention relates to a multi-single-arm manipulator output consistence active disturbance rejection controller structure with pre-defined performance and a design method thereof, in particular toa multi-single-arm manipulator output consistence active disturbance rejection controller, and belongs to the technical field of industrial process control. The active disturbance rejection technologyand the inversion technique are used for designing the multi-single-arm manipulator output consistence active disturbance rejection controller, the characteristic that extension state observers do not rely on a system model is utilized, and the influence of disturbance can be estimated and compensated in real time, so that the designed controller has the anti-disturbing property; tracking differentiators are designed to simplify the phenomenon of complex signal derivation of "explosion"; a manipulator system is restrained by a driving torque, the input saturation characteristic is considered,and the amplitude limiting problem of the driving torque is solved by an auxiliary system; the convergence speed and accuracy of the output consistence error are improved by using a pre-defined performance function; and according to the designed scheme, the unknown dynamic of the system can be effectively estimated, the derivation is simplified, and the control precision is improved.
Owner:NANJING UNIV OF POSTS & TELECOMM

Multi-unmanned aerial vehicle track planning method based on culture ant colony search mechanism

ActiveCN107622327ASolving multipath trajectory planning problemsWide applicabilityForecastingBiological modelsNODALSimulation
The invention provides a multi-unmanned aerial vehicle (UAV) track planning method based on a culture ant colony search mechanism, which includes the following steps: (1) carrying out mesh generationon a standard space according to a grid method; (2) building a multi-UAV track planning model, including the number of UAVs, the start and end points and a threat model; (3) initializing the start point and the end point; (4) initializing an ant colony algorithm, including: initializing an ant colony and calculating a heuristic factor and a guide factor; and (5) assigning all ants to an initial node, and updating taboo knowledge; selecting next node for transfer according to the taboo knowledge and the state transfer probability until there is no optional node or a destination node is selected, updating historical knowledge, and updating pheromones according to the historical knowledge; and outputting a shortest path if the maximum number of iterations is achieved, and continuing the process until U multi-UAV optimal multi-path tracks are obtained. The problem that it is difficult to find the optimal flight tracks of unmanned aerial vehicles due to slow search and heavy computing burden is solved, and multi-UAV track planning is realized.
Owner:HARBIN ENG UNIV

Tabu particle swarm algorithm based reactive power optimization method of power distribution network

The invention relates to the technical field of reactive powder optimization of a power distribution network of a power system, and particularly relates to a tabu particle swarm algorithm based reactive power optimization method of a power distribution network. According to the situation that a basic particle swarm algorithm in the optimization process can be easily trapped in local optimization, the invention discloses the improved method by the combination of a tabu search algorithm, and the defect that the particle swarm algorithm can be easily trapped in local optimum is overcome by utilizing the memory function and the characteristic of high climbing ability of the search algorithm; meanwhile, learning factors c1 and c2 which change as the increase of iterations and an inertia weight coefficient Omega are introduced in a particle position and a speed upgrading equation of the particle swarm algorithm, and the problem that the particle swarm algorithm can be easily trapped into the local optimum is further solved. By the combination of the two intelligent optimization algorithms, the optimization capability is improved greatly; the tabu particle swarm algorithm based reactive power optimization method is much suitable for departments relevant to a power system and the like to implement reactive power optimization of the power distribution network.
Owner:FUZHOU UNIV

High water-cut oilfield well position determining method based on evolutionary algorithm

The invention provides a high water-cut oilfield well position determining method based on an evolutionary algorithm. The method comprises the steps of building an oil reservoir model of a predetermined oil area, and dividing the oil reservoir model into grids; obtaining the oil reservoir data, and obtaining a surplus oil potential enrichment area in a history matching mode according to the oil reservoir data; computing a well position constraint value for representing the surplus oil distribution and injected water waves and volume in the surplus oil potential enrichment area to obtain the well position advantage area; carrying out iteration on an oil well in the advantage area through the evolutionary algorithm to compute a fitness function, and evaluating the fitness function through a Kriging algorithm, wherein the evolutionary algorithm is adjusted according to the fitness function, and the Kriging algorithm considers the multi-dimensional space, the nugget effect and the local weight; obtaining a maximum fitness function value according to the iteration computing of the evolutionary algorithm so as to determine the well position. The improved evolutionary algorithm and the Kringing algorithm serve as the optimization tools, a dynamic potential index is built to reduce the searching space of the evolutionary algorithm, and the optimization computing convergence precision and speed are greatly improved.
Owner:PETROCHINA CO LTD

Method for solving robot inverse kinematics based on particle swarm optimization algorithm

ActiveCN108932216ASolve the shortcomings of easy to fall into local optimumReduce the number of iterationsArtificial lifeComplex mathematical operationsLocal optimumInverse kinematics
The invention relates to a method for solving robot inverse kinematics based on a particle swarm optimization algorithm. The method comprises the following steps: 1) establishing a kinematic model according to joint parameters of a robot, obtaining a kinematic positive solution formula, setting positions of target points and an attitude matrix, determining a fitness function; 2) initializing a particle population, calculating an individual fitness value of an initial population, obtaining an individual optimal value and a global optimal value; 3) updating the position and speed of the particlepopulation using dynamic inertia weight which changes with the number of iterations, calculating a new fitness value, and determining whether to update; 4) performing genetic variation operation on the particle population, calculating the fitness value; 5) determining whether a termination condition is satisfied according to the fitness value and the number of iterations. Compared with the priorart, the method solves a shortcoming that a traditional PSO algorithm easily falls into local optimal values, and can enhance local search capability and improve convergence speed and precision by reducing the number of iterations.
Owner:SHANGHAI UNIV OF ENG SCI

Multi-objective decision engine parameter optimization method based on multi-objective quantum ant colony algorithm

InactiveCN103324978ASolve parameter optimization problemsSolve optimization problemsBiological modelsQuantum informationOptimization problem
The invention relates to a multi-objective decision engine parameter optimization method capable of enabling the minimum transmitting power, the minimum bit error rate and the maximum data rate to a cognitive radio system to be optimal at the same time. The method comprises steps of establishing a multi-objective decision engine model, calculating a multi-objective quantum ant colony algorithm path initial value, initializing a quantum information element of a multi-objective quantum ant colony algorithm, carrying out non dominated path sorting and the calculation of path congestion, sorting paths with the same non dominated path sorting rank, selecting a path with a non dominated path sorting rank of 1 and adding the path into an elite path set, calculating the path congestion, and selecting a path mapping to obtain the needed system parameter. According to the method, a discrete multiple-objective decision engine parameter optimization problem is solved, and the multi-objective quantum ant colony algorithm with non dominated path sorting is designed as a solution strategy, and the convergence precision is raised. The minimum transmitting power, the minimum bit error rate and the maximum data rate are considered at the same time, and the applicability is broadened.
Owner:HARBIN ENG UNIV

Method for reproducing two-dimensional defect of petroleum pipeline PSO-BP (Particle Swarm Optimization-Back-Propagation) neural network

InactiveCN102364501AAchieve exact reproductionSolve the shortcomings of easy to fall into local minimumNeural learning methodsComputational physicsParticle swarm algorithm
The invention aims at providing a method for reproducing a two-dimensional defect of a petroleum pipeline PSO-BP (Particle Swarm Optimization-Back-Propagation) neural network. Actually measured pipeline magnetic flux leakage data and pipeline defect data are used as experimental data of defect reconfiguration. The method comprises the steps of: with a magnetic flux leakage signal as input and a defect outline as outlet, setting a particle initial parameter, randomly initializing an initial position and an initial speed of each particle, calculating a particle fitness function numerical value , determining a past best value pbest of each particle and a global best value gbest of the whole particle swarm, updating the position and the speed of each particle, judging whether reaching the maximum iteration time or preset precision, if meeting the weight and the threshold of outputting a neutral network; and otherwise, re-comparing. The neutral network after the weight and the threshold are optimized by using a particle swarm algorithm is used for reproducing the two-dimensional defect of the pipeline and also reproducing a defect outline of the pipeline. According to the invention, the defect that the BP algorithm is easy to fall into a local minimum value can be effectively solved, and the convergence precision is improved, thus the defect of the pipeline is accurately reproduced.
Owner:HARBIN ENG UNIV

Improved particle swarm algorithm and application thereof

The invention relates to an improved particle swarm algorithm and the application of the improved particle swarm algorithm. The improved particle swarm algorithm includes the following steps that firstly, the algorithm is initialized; secondly, the positions x and speeds v of particles are randomly initialized; thirdly, the number of iterations is initialized, wherein the number t of iterations is equal to 1; fourthly, the adaptive value of each particle in a current population is calculated, if is smaller than or equal to , then is equal to and is equal to , and if is smaller than or equal to , then is equal to and is equal to ; fifthly, if the adaptive value is smaller than the set minimum error epsilon or reaches the maximum number Maxiter of iterations, the algorithm is ended, and otherwise, the sixth step is executed; sixthly, the speeds and positions of the particles are calculated and updated; seventhly, the number t of iterations is made to be t+1, and the fourth step is executed. By means of the improved particle swarm algorithm, at the initial iteration stage, the population has strong self-learning ability and weak social learning ability, and therefore population diversity is kept; at the later iteration stage, the population has weak self-learning ability and strong social learning ability, and therefore the convergence speed of the population is improved.
Owner:LIAONING UNIVERSITY

Multi-objective optimized overall workshop layout method based on multi-population genetic algorithm

The invention discloses a multi-objective optimized overall workshop layout method based on a multi-population genetic algorithm. The method comprises the following steps: firstly, a multi-row linearworkshop layout mathematical model is established, and a functional area layout problem is converted into a combined optimization mathematical model problem; secondly, based on the optimization objective of minimum total material handling cost and maximum area utilization ratio of workshop layout, a precise workshop layout model is established by taking account of constraints including horizontaland vertical placement of main streets and functional areas, adaptive row spacing and the like of the manufacturing workshop, and multiple optimization objectives are converted into a single evaluation function with a weighting method; finally, solving is performed with the multi-population genetic algorithm, immigration operators are linked with populations in the solving process, information exchange and co-evolution of multi-population are achieved, different crossover and mutation probability parameters are set for different populations by crossover and mutation probability control formulae, and different search purposes are guaranteed. The total logistics handling cost of the workshop can be effectively reduced, and the utilization rate of the workshop area is increased.
Owner:SOUTHWEST JIAOTONG UNIV +1

LSSVM (least squares support vector machine) wind speed forecasting method based on integration of GA (genetic algorithm) and PSO (particle swarm optimization)

The invention provides an LSSVM (least squares support vector machine) wind speed forecasting method based on integration of GA (genetic algorithm) and PSO (particle swarm optimization). The method comprises the following steps: finite wind speed samples are divided into a training set and a testing set, and normalization processing is performed; GA and LSSVM related parameters are initialized; chromosome coding is performed, and initial population is generated randomly; the fitness corresponding to each chromosome is calculated, if requirements are met, the PSO in the fifth step is started directly, and if the requirements are not met, selection, crossover and mutation operation of the GA are performed; optimum parameter combination obtained with the GA is used for initializing the PSO related parameters; the optimum position fitness value of each particle is compared with the optimum position fitness value of the swarm; the final optimum parameter combination is output, and an optimized LSSVM model is obtained; a forecast wind speed time history spectrum is obtained. The LSSVM wind speed forecasting method based on integration of GA and PSO has the characteristics of high optimization precision, high convergence precision, fewer iterations, high success rate and the like.
Owner:SHANGHAI 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