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

159 results about "Nonlinear optimization problem" patented technology

A smooth nonlinear programming (NLP) or nonlinear optimization problem is one in which the objective or at least one of the constraints is a smooth nonlinear function of the decision variables.

Day-ahead economic scheduling method for electric-pneumatic coupled system based on mixed integer second-order cone programming

ActiveCN108846507ARealize the solutionPrecisely optimize the operation planForecastingSteady stateNatural gas
The invention discloses a day-ahead economic scheduling method for an electric-pneumatic coupled system based on mixed integer second-order cone programming. A function whose all-day energy and spareall-in cost are minimum is used as a target function, and constraint conditions of a power system and a natural gas system, and electric-pneumatic coupling and conversion relations are considered, toestablish an optimization model of electric-pneumatic coupled system day-ahead economic scheduling. On the basis of the model, through second-order cone relaxation of a steady-state airflow equation of a gas pipeline, a mixed integer second-order cone programming model of day-ahead economic scheduling of the electric-pneumatic coupled system is established, and an initial operation scheme is solved and obtained. Aimed at a problem that an initial scheduling result of a natural gas system is not accurate, a calibration model based on a steady-state power flow calculation method of a natural gassystem is established, so as to modify an initial operation scheme. The method realizes accurate solution of a non-convex nonlinear optimization problem, and provides a feasible, economical and accurate optimal operation scheme for electric-pneumatic coupled system day-ahead scheduling.
Owner:XI AN JIAOTONG UNIV

Track profile irregularity amplitude estimation method employing optimal belief rules based inference

The invention relates to a track profile irregularity amplitude estimation method employing optimal belief rules based inference. According to the method, the mapping relationship between parametric variable input and yield output is modeled by a belief rule base. A corresponding change relationship between vibration frequency domain characteristic data of different measurement points and a track profile irregularity amplitude is described by building the belief rule base. By a sequence linear programming method, an initial belief rules based (BRB) model is optimized through limited historical data; and the effects on the model caused by subjective factors are reduced. According to the sequence linear programming (SLP) method, a nonlinear optimization problem of an original model is converted into a step-by-step linear optimization problem; and various parameters of the optimization model can be relatively simply and rapidly calculated, so that the track profile irregularity amplitude can be accurately and rapidly estimated through belief inference under the condition of given vibration frequency domain characteristic. According to the track profile irregularity amplitude estimation method, the estimation accuracy and the calculation efficiency of the model are improved; and the method has the advantage of being relatively efficient on a track profile irregularity system which needs to be monitored in real time.
Owner:HANGZHOU DIANZI UNIV

Time optimal rapid three-dimensional obstacle avoidance path planning method

ActiveCN109828600ARealize online planningImprove task responsivenessPosition/course control in three dimensionsOptimal controlSimulation
The invention discloses a time optimal rapid three-dimensional obstacle avoidance path planning method, particularly relates to an unmanned aerial vehicle obstacle avoidance path planning method, andbelongs to the field of unmanned aerial vehicle path planning. According to the invention, the method comprises the steps: establishing an unmanned optimal control model which takes the acceleration in each direction as a control variable and contains the flight time sum through considering the maximum acceleration and obstacle constraint conditions; loosening an original non-convex nonlinear optimization problem into a second-order cone programming problem; and finally, solving a series of second-order cone programming problems through iteration to obtain a solution of an original problem andobtain an optimal change strategy in the speed direction. In other words, the obstacle avoidance path planning with the optimal time is realized by coordinating the flight time and the flight speed direction, the online planning of the obstacle avoidance path and the related control quantity can be realized, and the task response capability of the unmanned aerial vehicle can be further improved through the optimized flight path with the optimal time.
Owner:BEIJING INSTITUTE OF TECHNOLOGYGY

Benders decoupling-based energy storage and distributed power supply and power distribution network coordination planning method

The invention discloses a coordinated planning method for energy storage, distributed power supply and distribution network based on Benders decoupling. On the basis of establishing a coordinated planning model of distribution network considering energy storage and distributed power supply, according to the idea of ​​Benders decoupling, Decompose the model into the main problem and sub-problems, and decompose the sub-problems again to form decomposition sub-problems and relaxation sub-problems, solve the decomposed sub-problems to obtain the values ​​of the continuous variables of the sub-problems, and solve the relaxed sub-problems to obtain the values ​​of the discrete variables of the sub-problems value, and form an effective cut set to feed back to the main problem. After iterative solution, the overall optimal solution that takes into account both the main problem and the sub-problem is obtained. The invention decomposes and re-decomposes the mixed integer nonlinear optimization problem containing a large number of integer variables and continuous variables, reduces the scale of the problem, and solves the difficult problem of large-scale planning considering multi-stages and multi-variables in distribution network planning. At the same time, coordinated planning is carried out for the optimal configuration of energy storage and distributed power sources and the reconstruction of the grid structure to achieve efficient solutions.
Owner:SOUTHEAST UNIV +2

Kinematic calibration method for Stewart parallel robot

The invention relates to a kinematic calibration method for a Stewart parallel robot. According to the kinematic calibration method for the Stewart parallel robot, model simplification is achieved according to a coordinate system establishment rule to obtain a minimum to-be-identified parameter set, and then a nonlinear kinematic model of the parallel robot is obtained; any fixed measurement equipment and any three fixed target point are adopted, and the posture of a robot fixing platform relative to a measurement coordinate system, the positions of the target points relative to a movable robot platform coordinate system, and the like are used as to-be-identified parameters, so that a simple measurement process is achieved, and operation is easy; the nonlinear kinematic model of the parallel robot is combined with a measurement process model to obtain a nonlinear identification model of a whole calibration system; and the resolution of a nonlinear equation system is converted into theresolution of a nonlinear optimization problem. By the adoption of the kinematic calibration method for the Stewart parallel robot, model establishment is achieved through the complete minimum parameter set, model calibration is easier, and true parameters of the robot are directly resolved on the basis of a nonlinear optimization idea; and the kinematic calibration method has the advantages thatoperation is easy, user interfaces are friendly, and the practicability is high.
Owner:SHENYANG INST OF AUTOMATION - CHINESE ACAD OF SCI

Laser monocular vision fusion positioning mapping method in dynamic scene

The invention discloses a laser monocular vision fusion positioning mapping method in a dynamic scene, and the method comprises the steps: 1, detecting dynamic obstacle information according to point cloud data of a current frame and pose priori information predicted by a visual odometer of a previous frame; 2, forming an image mask on monocular vision 2 with mutually calibrated external parameters, extracting ORB feature points on the image mask and matching the ORB feature points with ORB feature points of a previous frame, estimating the depth of the ORB feature points, obtaining a relative pose through pose calculation, and outputting key frame information meeting requirements; 3, inserting the key frame into the common view, updating the connection relation between the key frame and other key frames, the growth tree and the bag-of-word model according to the common view degree of map points, generating new map points, finding the adjacent key frame according to the essential map of the current key frame, constructing a nonlinear optimization problem, and optimizing the pose and the map points of the key frame; 4, judging whether the similarity between the image data of each key frame and the image data of the current key frame reaches a threshold value or not, if yes, judging that loopback occurs, replacing or filling map points where conflicts exist between the current key frame and the loopback key frame, then connecting the current key frame and the loopback key frame on the essential map, updating the essential map, and finally, carrying out global BA to obtain optimized key frame poses, feature point maps and point cloud maps. According to the invention, the SLAM purpose can be executed in a dynamic scene.
Owner:HUNAN UNIV +1

Phased array beam dwell scheduling method based on scheduling benefit and genetic algorithm

The invention discloses a phased array beam dwell scheduling method based on a scheduling benefit and a genetic algorithm, belongs to the field of phased array radar resource management, and particularly relates to a method for implementing adaptive beam dwell scheduling by utilizing a task priority and a scheduling strategy. According to the invention, firstly, on the basis of a target threat model, target attribute information is expressed with a threat degree function; secondly, a two-dimensional priority list thought is utilized, a two-dimensional priority list is utilized for twice to integrate three parameters of a working mode priority, a deadline and a threat degree into a comprehensive priority in a nonlinear weighting mode, and uniqueness of the comprehensive priority is ensured;then the comprehensive priority is combined with a validity function of task scheduling to form a new scheduling benefit and accordingly, a scheduling optimization model is established, wherein a pulse interleaving technology and time and energy constraint conditions are considered; and finally, such nonlinear optimization problem is solved by the genetic algorithm. According to the phased arraybeam dwell scheduling method based on the new scheduling benefit, which is disclosed by the invention, a loss rate of a task can be effectively reduced, a hit value ratio and a correction value rate are improved, and meanwhile, an execution threat rate and a time utilization rate are also promoted.
Owner:UNIV OF ELECTRONICS SCI & TECH OF CHINA

Method and device for assessing machining accuracy of ultra-large type curved surface parts

ActiveCN103617369AMatching fine-tuningRapid Machining Accuracy EvaluationSpecial data processing applicationsData setNuclear power
The invention discloses a method and a device for assessing the machining accuracy of ultra-large type curved surface parts. The method comprises the steps of performing data preprocessing to obtain relatively-evenly sampled data sets on the curved surfaces of the parts, initially positioning the sampled data sets according to the transformation relation between a measurement coordinate system and a theoretical coordinate system of a theoretical curved surface model so as to obtain initial iteration vectors roughly matched with the curved surfaces; utilizing the sampled data sets and the initial iteration vectors to solve the nonlinear optimization problem and obtain optimal coordinate transformation enabling the sampled data sets and the theoretical curved surface model to be matched; performing error analysis based on the sampled data sets and the optimal coordinate transformation and analyzing the machining accuracy of the ultra-large type curved surface parts. By adopting the method and the device for assessing the machining accuracy of the ultra-large type curved surface parts, assessment of the machining accuracy of the ultra-large type curved surface parts including steel safety casings of nuclear power plants and the like can be quickly, efficiently and accurately achieved.
Owner:STATE POWER INVESTMENT CORP RES INST +1

High-precision passive time difference positioning method based on motion multistation

The invention belongs to the technical field of passive detection, and relates to a high-position passive time difference positioning method based on motion multistation. The method comprises the steps: building a time difference positioning model, and respectively determining the coordinate position of a main station and the coordinate positions of auxiliary stations; solving the time difference according to a formula that a distance difference is the product of light velocity and the time difference: d<i1>=c*tau<i1>, wherein i=2, 3, ...,M; forming a time difference observation matrix through the coordinate position of the main station, the coordinate positions of all auxiliary stations and the solved time difference, wherein the impact on the positioning precision is considered, and the noise follows the Gaussian distribution (mean value = 0, and variance is sigma2). According to the invention, an intelligent search strategy in a CS algorithm is introduced to solve a nonlinear optimization problem in a time difference positioning system, thereby solving the problems that the calculation burden of the time difference observation matrix is large and the calculation complexity is high. The method can achieve the high-precision estimation of the position of a radiation source, can quickly approach to a global optimal solution without depending on a priori condition of the initial target position, and is not liable to cause the positioning fuzziness and a no-solution condition.
Owner:HARBIN ENG 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