Unlike traditional propeller-driven underwater vehicles,blended-wing-body underwater gliders(BWBUGs)achieve zigzag gliding through periodic adjustments of their net buoyancy,enhancing their cruising capabilities while...Unlike traditional propeller-driven underwater vehicles,blended-wing-body underwater gliders(BWBUGs)achieve zigzag gliding through periodic adjustments of their net buoyancy,enhancing their cruising capabilities while mini-mizing energy consumption.However,enhancing gliding performance is challenging due to the complex system design and limited design experience.To address this challenge,this paper introduces a model-based,multidisciplinary system design optimization method for BWBUGs at the conceptual design stage.First,a model-based,multidisciplinary co-simulation design framework is established to evaluate both system-level and disciplinary indices of BWBUG performance.A data-driven,many-objective multidisciplinary optimization is subsequently employed to explore the design space,yielding 32 Pareto optimal solutions.Finally,a model-based physical system simulation,which represents the design with the largest hyper-volume contribution among the 32 final designs,is established.Its gliding perfor-mance,validated by component behavior,lays the groundwork for constructing the entire system’s digital prototype.In conclusion,this model-based,multidisciplinary design optimization method effectively generates design schemes for innovative underwater vehicles,facilitating the development of digital prototypes.展开更多
Synthesis of chemical processes is of non-convex and multi-modal. Deterministic strategies often fail to find global optimum within reasonable time scales. Stochastic methodologies generally approach global solution i...Synthesis of chemical processes is of non-convex and multi-modal. Deterministic strategies often fail to find global optimum within reasonable time scales. Stochastic methodologies generally approach global solution in probability. In recogniting the state of art status in the discipline, a new approach for global optimization of processes, based on sequential number theoretic optimization (SNTO), is proposed. In this approach, subspaces and feasible points are derived from uniformly scattered points, and iterations over passing the corner of local optimum are enhanced via parallel strategy. The efficiency of the approach proposed is verified by results obtained from various case studies.展开更多
Testing is the premise and foundation of realizing equipment health management （EHM）. To address the problem that the static periodic test strategy may cause deficient test or excessive test, a dynamic sequential te...Testing is the premise and foundation of realizing equipment health management （EHM）. To address the problem that the static periodic test strategy may cause deficient test or excessive test, a dynamic sequential test strategy （DSTS） for EHM is presented. Considering the situation that equipment health state is not completely observable in reality, a DSTS optimization method based on partially observable semi-Markov decision pro- cess （POSMDP） is proposed. Firstly, an equipment health state degradation model is constructed by Markov process, and the control limit maintenance policy is also introduced. Secondly, POSMDP is formulated in great detail. And then, POSMDP is converted to completely observable belief semi-Markov decision process （BSMDP） through belief state. The optimal equation and the corresponding optimal DSTS, which minimize the long-run ex- pected average cost per unit time, are obtained with BSMDP. The results of application in complex equipment show that the proposed DSTS is feasible and effective.展开更多
Several structural design parameters for the description of the geometric features of a hollow fan blade were determined.A structural design optimization model of a hollow fan blade which based on the strength constra...Several structural design parameters for the description of the geometric features of a hollow fan blade were determined.A structural design optimization model of a hollow fan blade which based on the strength constraint and minimum mass was established based on the finite element method through these parameters.Then,the sequential quadratic programming algorithm was employed to search the optimal solutions.Several groups of value for initial design variables were chosen,for the purpose of not only finding much more local optimal results but also analyzing which discipline that the variables according to could be benefit for the convergence and robustness.Response surface method and Monte Carlo simulations were used to analyze whether the objective function and constraint function are sensitive to the variation of variables or not.Then the robust results could be found among a group of different local optimal solutions.展开更多
This paper offers an extensive overview of the utilization of sequential approximate optimization approaches in the context of numerically simulated large-scale continuum structures.These structures,commonly encounter...This paper offers an extensive overview of the utilization of sequential approximate optimization approaches in the context of numerically simulated large-scale continuum structures.These structures,commonly encountered in engineering applications,often involve complex objective and constraint functions that cannot be readily expressed as explicit functions of the design variables.As a result,sequential approximation techniques have emerged as the preferred strategy for addressing a wide array of topology optimization challenges.Over the past several decades,topology optimization methods have been advanced remarkably and successfully applied to solve engineering problems incorporating diverse physical backgrounds.In comparison to the large-scale equation solution,sensitivity analysis,graphics post-processing,etc.,the progress of the sequential approximation functions and their corresponding optimizersmake sluggish progress.Researchers,particularly novices,pay special attention to their difficulties with a particular problem.Thus,this paper provides an overview of sequential approximation functions,related literature on topology optimization methods,and their applications.Starting from optimality criteria and sequential linear programming,the other sequential approximate optimizations are introduced by employing Taylor expansion and intervening variables.In addition,recent advancements have led to the emergence of approaches such as Augmented Lagrange,sequential approximate integer,and non-gradient approximation are also introduced.By highlighting real-world applications and case studies,the paper not only demonstrates the practical relevance of these methods but also underscores the need for continued exploration in this area.Furthermore,to provide a comprehensive overview,this paper offers several novel developments that aim to illuminate potential directions for future research.展开更多
The sequential rock remote sensing information is a group of rocks that are correlative in space or in space and time. For the sake of plottiug them, someone had brought forward the optimization segn.entotion metkod. ...The sequential rock remote sensing information is a group of rocks that are correlative in space or in space and time. For the sake of plottiug them, someone had brought forward the optimization segn.entotion metkod. We have ased this method to plot the sequential rock remote sensing information at tbe remote sensing hyperspetral test field of Daqing mountain, Inner Mongolia Autonomous Region, China, and found some disadvantages of this method. Therefore, we put forward the optimization dichotomy to plot them, and get better results. Finally we make a conclusion.展开更多
This paper discusses the two-block large-scale nonconvex optimization problem with general linear constraints.Based on the ideas of splitting and sequential quadratic optimization(SQO),a new feasible descent method fo...This paper discusses the two-block large-scale nonconvex optimization problem with general linear constraints.Based on the ideas of splitting and sequential quadratic optimization(SQO),a new feasible descent method for the discussed problem is proposed.First,we consider the problem of quadratic optimal(QO)approximation associated with the current feasible iteration point,and we split the QO into two small-scale QOs which can be solved in parallel.Second,a feasible descent direction for the problem is obtained and a new SQO-type method is proposed,namely,splitting feasible SQO(SF-SQO)method.Moreover,under suitable conditions,we analyse the global convergence,strong convergence and rate of superlinear convergence of the SF-SQO method.Finally,preliminary numerical experiments regarding the economic dispatch of a power system are carried out,and these show that the SF-SQO method is promising.展开更多
Generating dynamically feasible trajectory for fixed-wing Unmanned Aerial Vehicles(UAVs)in dense obstacle environments remains computationally intractable.This paper proposes a Safe Flight Corridor constrained Sequent...Generating dynamically feasible trajectory for fixed-wing Unmanned Aerial Vehicles(UAVs)in dense obstacle environments remains computationally intractable.This paper proposes a Safe Flight Corridor constrained Sequential Convex Programming(SFC-SCP)to improve the computation efficiency and reliability of trajectory generation.SFC-SCP combines the front-end convex polyhedron SFC construction and back-end SCP-based trajectory optimization.A Sparse A^(*)Search(SAS)driven SFC construction method is designed to efficiently generate polyhedron SFC according to the geometric relation among obstacles and collision-free waypoints.Via transforming the nonconvex obstacle-avoidance constraints to linear inequality constraints,SFC can mitigate infeasibility of trajectory planning and reduce computation complexity.Then,SCP casts the nonlinear trajectory optimization subject to SFC into convex programming subproblems to decrease the problem complexity.In addition,a convex optimizer based on interior point method is customized,where the search direction is calculated via successive elimination to further improve efficiency.Simulation experiments on dense obstacle scenarios show that SFC-SCP can generate dynamically feasible safe trajectory rapidly.Comparative studies with state-of-the-art SCP-based methods demonstrate the efficiency and reliability merits of SFC-SCP.Besides,the customized convex optimizer outperforms off-the-shelf optimizers in terms of computation time.展开更多
In early 2018,the Boliden Garpenberg operation implemented an optimized control strategy as an addition to the existing ventilation on demand system.The purpose of the strategy is to further minimize energy use for ma...In early 2018,the Boliden Garpenberg operation implemented an optimized control strategy as an addition to the existing ventilation on demand system.The purpose of the strategy is to further minimize energy use for main and booster fans,whilst also fulfilling airflow setpoints without violating constraints such as min/max differential pressure over fans and interaction of air between areas in mines.Using air flow measurements and a dynamical model of the ventilation system,a mine-wide coordination control of fans can be carried out.The numerical model is data driven and derived from historical operational data or step changes experiments.This makes both initial deployment and lifetime model maintenance,as the mine evolves,a comparably easy operation.The control has been proven to operate in a stable manner over long periods without having to re-calibrate the model.Results prove a 40%decrease in energy use for the fans involved and a greater controllability of air flow.Moreover,a 15%decrease of the total air flow into the mine will give additional proportional heating savings during winter periods.All in all,the multivariable controller shows a correlation between production in the mine and the ventilation system performance superior to all of its predecessors.展开更多
BACKGROUND A cure for Helicobacter pylori(H.pylori)remains a problem of global concern.The prevalence of antimicrobial resistance is widely rising and becoming a challenging issue worldwide.Optimizing sequential thera...BACKGROUND A cure for Helicobacter pylori(H.pylori)remains a problem of global concern.The prevalence of antimicrobial resistance is widely rising and becoming a challenging issue worldwide.Optimizing sequential therapy seems to be one of the most attractive strategies in terms of efficacy,tolerability and cost.The most common sequential therapy consists of a dual therapy[proton-pump inhibitors(PPIs)and amoxicillin]for the first period(5 to 7 d),followed by a triple therapy for the second period(PPI,clarithromycin and metronidazole).PPIs play a key role in maintaining a gastric pH at a level that allows an optimal efficacy of antibiotics,hence the idea of using new generation molecules.This open-label prospective study randomized 328 patients with confirmed H.pylori infection into three groups(1:1:1):The first group received quadruple therapy consisting of twice-daily(bid)omeprazole 20 mg,amoxicillin 1 g,clarith-romycin 500 mg and metronidazole 500 mg for 10 d(QT-10),the second group received a 14 d quadruple therapy following the same regimen(QT-14),and the third group received an optimized sequential therapy consisting of bid rabe-prazole 20 mg plus amoxicillin 1 g for 7 d,followed by bid rabeprazole 20 mg,clarithromycin 500 mg and metronidazole 500 mg for the next 7 d(OST-14).AEs were recorded throughout the study,and the H.pylori eradication rate was determined 4 to 6 wk after the end of treatment,using the 13C urea breath test.RESULTS In the intention-to-treat and per-protocol analysis,the eradication rate was higher in the OST-14 group compared to the QT-10 group:(93.5%,85.5%P=0.04)and(96.2%,89.5%P=0.03)respectively.However,there was no statist-ically significant difference in eradication rates between the OST-14 and QT-14 groups:(93.5%,91.8%P=0.34)and(96.2%,94.4%P=0.35),respectively.The overall incidence of AEs was significantly lower in the OST-14 group(P=0.01).Furthermore,OST-14 was the most cost-effective among the three groups.CONCLUSION The optimized 14-d sequential therapy is a safe and effective alternative.Its eradication rate is comparable to that of the 14-d concomitant therapy while causing fewer AEs and allowing a gain in terms of cost.展开更多
For uncertainty quantification of complex models with high-dimensional,nonlinear,multi-component coupling like digital twins,traditional statistical sampling methods,such as random sampling and Latin hypercube samplin...For uncertainty quantification of complex models with high-dimensional,nonlinear,multi-component coupling like digital twins,traditional statistical sampling methods,such as random sampling and Latin hypercube sampling,require a large number of samples,which entails huge computational costs.Therefore,how to construct a small-size sample space has been a hot issue of interest for researchers.To this end,this paper proposes a sequential search-based Latin hypercube sampling scheme to generate efficient and accurate samples for uncertainty quantification.First,the sampling range of the samples is formed by carving the polymorphic uncertainty based on theoretical analysis.Then,the optimal Latin hypercube design is selected using the Latin hypercube sampling method combined with the"space filling"criterion.Finally,the sample selection function is established,and the next most informative sample is optimally selected to obtain the sequential test sample.Compared with the classical sampling method,the generated samples can retain more information on the basis of sparsity.A series of numerical experiments are conducted to demonstrate the superiority of the proposed sequential search-based Latin hypercube sampling scheme,which is a way to provide reliable uncertainty quantification results with small sample sizes.展开更多
A kind of direct methods is presented for the solution of optimal control problems with state constraints. These methods are sequential quadratic programming methods. At every iteration a quadratic programming which i...A kind of direct methods is presented for the solution of optimal control problems with state constraints. These methods are sequential quadratic programming methods. At every iteration a quadratic programming which is obtained by quadratic approximation to Lagrangian function and linear approximations to constraints is solved to get a search direction for a merit function. The merit function is formulated by augmenting the Lagrangian function with a penalty term. A line search is carried out along the search direction to determine a step length such that the merit function is decreased. The methods presented in this paper include continuous sequential quadratic programming methods and discreate sequential quadratic programming methods.展开更多
This paper presents a novel sequential inverse optimal control(SIOC)method for discrete-time systems,which calculates the unknown weight vectors of the cost function in real time using the input and output of an optim...This paper presents a novel sequential inverse optimal control(SIOC)method for discrete-time systems,which calculates the unknown weight vectors of the cost function in real time using the input and output of an optimally controlled discrete-time system.The proposed method overcomes the limitations of previous approaches by eliminating the need for the invertible Jacobian assumption.It calculates the possible-solution spaces and their intersections sequentially until the dimension of the intersection space decreases to one.The remaining one-dimensional vector of the possible-solution space’s intersection represents the SIOC solution.The paper presents clear conditions for convergence and addresses the issue of noisy data by clarifying the conditions for the singular values of the matrices that relate to the possible-solution space.The effectiveness of the proposed method is demonstrated through simulation results.展开更多
The quantitative rules of the transfer and variation of errors,when the Gaussian integral functions F.(z) are evaluated sequentially by recurring,have been expounded.The traditional viewpoint to negate the applicabili...The quantitative rules of the transfer and variation of errors,when the Gaussian integral functions F.(z) are evaluated sequentially by recurring,have been expounded.The traditional viewpoint to negate the applicability and reliability of upward recursive formula in principle is amended.An optimal scheme of upward-and downward-joint recursions has been developed for the sequential F(z) computations.No additional accuracy is needed with the fundamental term of recursion because the absolute error of Fn(z) always decreases with the recursive approach.The scheme can be employed in modifying any of existent subprograms for Fn<z> computations.In the case of p-d-f-and g-type Gaussians,combining this method with Schaad's formulas can reduce,at least,the additive operations by a factor 40%;the multiplicative and exponential operations by a factor 60%.展开更多
In this paper,we present a novel distributed sequential allocation mechanism for optimizing investments in unmanned systems,framed as a multi-agent dynamic planning problem.The core contribution lies in an advanced al...In this paper,we present a novel distributed sequential allocation mechanism for optimizing investments in unmanned systems,framed as a multi-agent dynamic planning problem.The core contribution lies in an advanced algorithm that integrates multi-agent parallel computing for global optimization with single-agent sequential allocation for local refinement.This hybrid approach ensures both optimality and polynomial-time complexity,effectively addressing the challenges of multi-field investment with uncertain costs and rewards.By employing sophisticated optimization techniques,our algorithm dynamically adjusts investment strategies based on the real-time data.Simulation results in typical scenarios demonstrate the algorithm’s superiority over benchmark methods,offering significantly enhanced investment solutions tailored to the unique requirements of unmanned systems.Our method not only improves investment efficiency and effectiveness,but also provides a robust and adaptable solution for the dynamic and uncertain nature of unmanned systems investment portfolios,thereby ensuring sustained performance and strategic advantage.展开更多
An improved approach is presented in this paper to implement highly constrained cooperative guidance to attack a stationary target.The problem with time-varying Proportional Navigation(PN)gain is first formulated as a...An improved approach is presented in this paper to implement highly constrained cooperative guidance to attack a stationary target.The problem with time-varying Proportional Navigation(PN)gain is first formulated as a nonlinear optimal control problem,which is difficult to solve due to the existence of nonlinear kinematics and nonconvex constraints.After convexification treatments and discretization,the solution to the original problem can be approximately obtained by solving a sequence of Second-Order Cone Programming(SOCP)problems,which can be readily solved by state-of-the-art Interior-Point Methods(IPMs).To mitigate the sensibility of the algorithm on the user-provided initial profile,a Two-Stage Sequential Convex Programming(TSSCP)method is presented in detail.Furthermore,numerical simulations under different mission scenarios are conducted to show the superiority of the proposed method in solving the cooperative guidance problem.The research indicated that the TSSCP method is more tractable and reliable than the traditional methods and has great potential for real-time processing and on-board implementation.展开更多
This paper proposes a dynamic opportunistic preventive maintenance (PM) optimization policy for multi-unit series systems by integrating multi PM techniques. Two PM techniques, periodic PM and sequential PM, are consi...This paper proposes a dynamic opportunistic preventive maintenance (PM) optimization policy for multi-unit series systems by integrating multi PM techniques. Two PM techniques, periodic PM and sequential PM, are considered. Whenever one of the units reaches its reliability threshold, a PM action has to be performed on that unit. At that time the whole system has to be stopped and PM opportunities arise for the other unitsof the system. An optimal PM practice is determined by maximizing the short-term cumulative opportunistic maintenance (OM) cost savings for the whole system. Numerical examples are given to show how this approach works. Finally, a comparison between the proposed PM policy and the other policies is given.展开更多
This paper proposed a reliability design model for composite materials under the mixture of random and interval variables. Together with the inverse reliability analysis technique, the sequential single-loop optimizat...This paper proposed a reliability design model for composite materials under the mixture of random and interval variables. Together with the inverse reliability analysis technique, the sequential single-loop optimization method is applied to the reliability-based design of composites. In the sequential single-loop optimization, the optimization and the reliability analysis are decoupled to improve the computational efficiency. As shown in examples, the minimum weight problems under the constraint of structural reliability are solved for laminated composites. The Particle Swarm Optimization （PSO） algorithm is utilized to search for the optimal solutions. The design results indicate that, under the mixture of random and interval variables, the method that combines the sequential single-loop optimization and the PSO algorithm can deal effectively with the reliability-based design of composites.展开更多
With the unique erggdicity, i rregularity, and.special ability to avoid being trapped in local optima, chaos optimization has been a novel global optimization technique and has attracted considerable attention for a...With the unique erggdicity, i rregularity, and.special ability to avoid being trapped in local optima, chaos optimization has been a novel global optimization technique and has attracted considerable attention for application in various fields, such as nonlinear programming problems. In this article, a novel neural network nonlinear predic-tive control （NNPC） strategy baseed on the new Tent-map chaos optimization algorithm （TCOA） is presented. Thefeedforward neural network＇is used as the multi-step predictive model. In addition, the TCOA is applied to perform the nonlinear rolling optimization to enhance the convergence and accuracy in the NNPC. Simulation on a labora-tory-scale liquid-level system is given to illustrate the effectiveness of the proposed method.展开更多
This paper presents a novel optimization technique for an efficient multi-fidelity model building approach to reduce computational costs for handling aerodynamic shape optimization based on high-fidelity simulation mo...This paper presents a novel optimization technique for an efficient multi-fidelity model building approach to reduce computational costs for handling aerodynamic shape optimization based on high-fidelity simulation models. The wing aerodynamic shape optimization problem is solved by dividing optimization into three steps—modeling 3D（high-fidelity） and 2D（lowfidelity） models, building global meta-models from prominent instead of all variables, and determining robust optimizing shape associated with tuning local meta-models. The adaptive robust design optimization aims to modify the shape optimization process. The sufficient infilling strategy—known as adaptive uniform infilling strategy—determines search space dimensions based on the last optimization results or initial point. Following this, 3D model simulations are used to tune local meta-models. Finally, the global optimization gradient-based method—Adaptive Filter Sequential Quadratic Programing（AFSQP） is utilized to search the neighborhood for a probable optimum point. The effectiveness of the proposed method is investigated by applying it, along with conventional optimization approach-based meta-models, to a Blended Wing Body（BWB） Unmanned Aerial Vehicle（UAV）. The drag coefficient is defined as the objective function, which is subjected to minimum lift coefficient bounds and stability constraints. The simulation results indicate improvement in meta-model accuracy and reduction in computational time of the method introduced in this paper.展开更多
基金supported by the Postdoctoral Fellowship Program of CPSF(Grant No.GZC20242194)the National Natural Science Foundation of China(Grant Nos.52175251 and 52205268)+1 种基金the Industry Key Technology Research Fund Project of Northwestern Polytechnical University(Grant No.HYGJXM202318)the National Basic Scientific Research Program(Grant No.JCKY2021206B005).
文摘Unlike traditional propeller-driven underwater vehicles,blended-wing-body underwater gliders(BWBUGs)achieve zigzag gliding through periodic adjustments of their net buoyancy,enhancing their cruising capabilities while mini-mizing energy consumption.However,enhancing gliding performance is challenging due to the complex system design and limited design experience.To address this challenge,this paper introduces a model-based,multidisciplinary system design optimization method for BWBUGs at the conceptual design stage.First,a model-based,multidisciplinary co-simulation design framework is established to evaluate both system-level and disciplinary indices of BWBUG performance.A data-driven,many-objective multidisciplinary optimization is subsequently employed to explore the design space,yielding 32 Pareto optimal solutions.Finally,a model-based physical system simulation,which represents the design with the largest hyper-volume contribution among the 32 final designs,is established.Its gliding perfor-mance,validated by component behavior,lays the groundwork for constructing the entire system’s digital prototype.In conclusion,this model-based,multidisciplinary design optimization method effectively generates design schemes for innovative underwater vehicles,facilitating the development of digital prototypes.
文摘Synthesis of chemical processes is of non-convex and multi-modal. Deterministic strategies often fail to find global optimum within reasonable time scales. Stochastic methodologies generally approach global solution in probability. In recogniting the state of art status in the discipline, a new approach for global optimization of processes, based on sequential number theoretic optimization (SNTO), is proposed. In this approach, subspaces and feasible points are derived from uniformly scattered points, and iterations over passing the corner of local optimum are enhanced via parallel strategy. The efficiency of the approach proposed is verified by results obtained from various case studies.
基金supported by the National Natural Science Foundation of China (51175502)
文摘Testing is the premise and foundation of realizing equipment health management （EHM）. To address the problem that the static periodic test strategy may cause deficient test or excessive test, a dynamic sequential test strategy （DSTS） for EHM is presented. Considering the situation that equipment health state is not completely observable in reality, a DSTS optimization method based on partially observable semi-Markov decision pro- cess （POSMDP） is proposed. Firstly, an equipment health state degradation model is constructed by Markov process, and the control limit maintenance policy is also introduced. Secondly, POSMDP is formulated in great detail. And then, POSMDP is converted to completely observable belief semi-Markov decision process （BSMDP） through belief state. The optimal equation and the corresponding optimal DSTS, which minimize the long-run ex- pected average cost per unit time, are obtained with BSMDP. The results of application in complex equipment show that the proposed DSTS is feasible and effective.
文摘Several structural design parameters for the description of the geometric features of a hollow fan blade were determined.A structural design optimization model of a hollow fan blade which based on the strength constraint and minimum mass was established based on the finite element method through these parameters.Then,the sequential quadratic programming algorithm was employed to search the optimal solutions.Several groups of value for initial design variables were chosen,for the purpose of not only finding much more local optimal results but also analyzing which discipline that the variables according to could be benefit for the convergence and robustness.Response surface method and Monte Carlo simulations were used to analyze whether the objective function and constraint function are sensitive to the variation of variables or not.Then the robust results could be found among a group of different local optimal solutions.
基金financially supported by the National Key R&D Program (2022YFB4201302)Guang Dong Basic and Applied Basic Research Foundation (2022A1515240057)the Huaneng Technology Funds (HNKJ20-H88).
文摘This paper offers an extensive overview of the utilization of sequential approximate optimization approaches in the context of numerically simulated large-scale continuum structures.These structures,commonly encountered in engineering applications,often involve complex objective and constraint functions that cannot be readily expressed as explicit functions of the design variables.As a result,sequential approximation techniques have emerged as the preferred strategy for addressing a wide array of topology optimization challenges.Over the past several decades,topology optimization methods have been advanced remarkably and successfully applied to solve engineering problems incorporating diverse physical backgrounds.In comparison to the large-scale equation solution,sensitivity analysis,graphics post-processing,etc.,the progress of the sequential approximation functions and their corresponding optimizersmake sluggish progress.Researchers,particularly novices,pay special attention to their difficulties with a particular problem.Thus,this paper provides an overview of sequential approximation functions,related literature on topology optimization methods,and their applications.Starting from optimality criteria and sequential linear programming,the other sequential approximate optimizations are introduced by employing Taylor expansion and intervening variables.In addition,recent advancements have led to the emergence of approaches such as Augmented Lagrange,sequential approximate integer,and non-gradient approximation are also introduced.By highlighting real-world applications and case studies,the paper not only demonstrates the practical relevance of these methods but also underscores the need for continued exploration in this area.Furthermore,to provide a comprehensive overview,this paper offers several novel developments that aim to illuminate potential directions for future research.
文摘The sequential rock remote sensing information is a group of rocks that are correlative in space or in space and time. For the sake of plottiug them, someone had brought forward the optimization segn.entotion metkod. We have ased this method to plot the sequential rock remote sensing information at tbe remote sensing hyperspetral test field of Daqing mountain, Inner Mongolia Autonomous Region, China, and found some disadvantages of this method. Therefore, we put forward the optimization dichotomy to plot them, and get better results. Finally we make a conclusion.
基金supported by the National Natural Science Foundation of China(12171106)the Natural Science Foundation of Guangxi Province(2020GXNSFDA238017 and 2018GXNSFFA281007)the Shanghai Sailing Program(21YF1430300)。
文摘This paper discusses the two-block large-scale nonconvex optimization problem with general linear constraints.Based on the ideas of splitting and sequential quadratic optimization(SQO),a new feasible descent method for the discussed problem is proposed.First,we consider the problem of quadratic optimal(QO)approximation associated with the current feasible iteration point,and we split the QO into two small-scale QOs which can be solved in parallel.Second,a feasible descent direction for the problem is obtained and a new SQO-type method is proposed,namely,splitting feasible SQO(SF-SQO)method.Moreover,under suitable conditions,we analyse the global convergence,strong convergence and rate of superlinear convergence of the SF-SQO method.Finally,preliminary numerical experiments regarding the economic dispatch of a power system are carried out,and these show that the SF-SQO method is promising.
基金supported by the National Natural Science Foundation of China(No.62203256)。
文摘Generating dynamically feasible trajectory for fixed-wing Unmanned Aerial Vehicles(UAVs)in dense obstacle environments remains computationally intractable.This paper proposes a Safe Flight Corridor constrained Sequential Convex Programming(SFC-SCP)to improve the computation efficiency and reliability of trajectory generation.SFC-SCP combines the front-end convex polyhedron SFC construction and back-end SCP-based trajectory optimization.A Sparse A^(*)Search(SAS)driven SFC construction method is designed to efficiently generate polyhedron SFC according to the geometric relation among obstacles and collision-free waypoints.Via transforming the nonconvex obstacle-avoidance constraints to linear inequality constraints,SFC can mitigate infeasibility of trajectory planning and reduce computation complexity.Then,SCP casts the nonlinear trajectory optimization subject to SFC into convex programming subproblems to decrease the problem complexity.In addition,a convex optimizer based on interior point method is customized,where the search direction is calculated via successive elimination to further improve efficiency.Simulation experiments on dense obstacle scenarios show that SFC-SCP can generate dynamically feasible safe trajectory rapidly.Comparative studies with state-of-the-art SCP-based methods demonstrate the efficiency and reliability merits of SFC-SCP.Besides,the customized convex optimizer outperforms off-the-shelf optimizers in terms of computation time.
文摘In early 2018,the Boliden Garpenberg operation implemented an optimized control strategy as an addition to the existing ventilation on demand system.The purpose of the strategy is to further minimize energy use for main and booster fans,whilst also fulfilling airflow setpoints without violating constraints such as min/max differential pressure over fans and interaction of air between areas in mines.Using air flow measurements and a dynamical model of the ventilation system,a mine-wide coordination control of fans can be carried out.The numerical model is data driven and derived from historical operational data or step changes experiments.This makes both initial deployment and lifetime model maintenance,as the mine evolves,a comparably easy operation.The control has been proven to operate in a stable manner over long periods without having to re-calibrate the model.Results prove a 40%decrease in energy use for the fans involved and a greater controllability of air flow.Moreover,a 15%decrease of the total air flow into the mine will give additional proportional heating savings during winter periods.All in all,the multivariable controller shows a correlation between production in the mine and the ventilation system performance superior to all of its predecessors.
文摘BACKGROUND A cure for Helicobacter pylori(H.pylori)remains a problem of global concern.The prevalence of antimicrobial resistance is widely rising and becoming a challenging issue worldwide.Optimizing sequential therapy seems to be one of the most attractive strategies in terms of efficacy,tolerability and cost.The most common sequential therapy consists of a dual therapy[proton-pump inhibitors(PPIs)and amoxicillin]for the first period(5 to 7 d),followed by a triple therapy for the second period(PPI,clarithromycin and metronidazole).PPIs play a key role in maintaining a gastric pH at a level that allows an optimal efficacy of antibiotics,hence the idea of using new generation molecules.This open-label prospective study randomized 328 patients with confirmed H.pylori infection into three groups(1:1:1):The first group received quadruple therapy consisting of twice-daily(bid)omeprazole 20 mg,amoxicillin 1 g,clarith-romycin 500 mg and metronidazole 500 mg for 10 d(QT-10),the second group received a 14 d quadruple therapy following the same regimen(QT-14),and the third group received an optimized sequential therapy consisting of bid rabe-prazole 20 mg plus amoxicillin 1 g for 7 d,followed by bid rabeprazole 20 mg,clarithromycin 500 mg and metronidazole 500 mg for the next 7 d(OST-14).AEs were recorded throughout the study,and the H.pylori eradication rate was determined 4 to 6 wk after the end of treatment,using the 13C urea breath test.RESULTS In the intention-to-treat and per-protocol analysis,the eradication rate was higher in the OST-14 group compared to the QT-10 group:(93.5%,85.5%P=0.04)and(96.2%,89.5%P=0.03)respectively.However,there was no statist-ically significant difference in eradication rates between the OST-14 and QT-14 groups:(93.5%,91.8%P=0.34)and(96.2%,94.4%P=0.35),respectively.The overall incidence of AEs was significantly lower in the OST-14 group(P=0.01).Furthermore,OST-14 was the most cost-effective among the three groups.CONCLUSION The optimized 14-d sequential therapy is a safe and effective alternative.Its eradication rate is comparable to that of the 14-d concomitant therapy while causing fewer AEs and allowing a gain in terms of cost.
基金co-supported by the National Natural Science Foundation of China(Nos.51875014,U2233212 and 51875015)the Natural Science Foundation of Beijing Municipality,China(No.L221008)+1 种基金Science,Technology Innovation 2025 Major Project of Ningbo of China(No.2022Z005)the Tianmushan Laboratory Project,China(No.TK2023-B-001)。
文摘For uncertainty quantification of complex models with high-dimensional,nonlinear,multi-component coupling like digital twins,traditional statistical sampling methods,such as random sampling and Latin hypercube sampling,require a large number of samples,which entails huge computational costs.Therefore,how to construct a small-size sample space has been a hot issue of interest for researchers.To this end,this paper proposes a sequential search-based Latin hypercube sampling scheme to generate efficient and accurate samples for uncertainty quantification.First,the sampling range of the samples is formed by carving the polymorphic uncertainty based on theoretical analysis.Then,the optimal Latin hypercube design is selected using the Latin hypercube sampling method combined with the"space filling"criterion.Finally,the sample selection function is established,and the next most informative sample is optimally selected to obtain the sequential test sample.Compared with the classical sampling method,the generated samples can retain more information on the basis of sparsity.A series of numerical experiments are conducted to demonstrate the superiority of the proposed sequential search-based Latin hypercube sampling scheme,which is a way to provide reliable uncertainty quantification results with small sample sizes.
文摘A kind of direct methods is presented for the solution of optimal control problems with state constraints. These methods are sequential quadratic programming methods. At every iteration a quadratic programming which is obtained by quadratic approximation to Lagrangian function and linear approximations to constraints is solved to get a search direction for a merit function. The merit function is formulated by augmenting the Lagrangian function with a penalty term. A line search is carried out along the search direction to determine a step length such that the merit function is decreased. The methods presented in this paper include continuous sequential quadratic programming methods and discreate sequential quadratic programming methods.
文摘This paper presents a novel sequential inverse optimal control(SIOC)method for discrete-time systems,which calculates the unknown weight vectors of the cost function in real time using the input and output of an optimally controlled discrete-time system.The proposed method overcomes the limitations of previous approaches by eliminating the need for the invertible Jacobian assumption.It calculates the possible-solution spaces and their intersections sequentially until the dimension of the intersection space decreases to one.The remaining one-dimensional vector of the possible-solution space’s intersection represents the SIOC solution.The paper presents clear conditions for convergence and addresses the issue of noisy data by clarifying the conditions for the singular values of the matrices that relate to the possible-solution space.The effectiveness of the proposed method is demonstrated through simulation results.
文摘The quantitative rules of the transfer and variation of errors,when the Gaussian integral functions F.(z) are evaluated sequentially by recurring,have been expounded.The traditional viewpoint to negate the applicability and reliability of upward recursive formula in principle is amended.An optimal scheme of upward-and downward-joint recursions has been developed for the sequential F(z) computations.No additional accuracy is needed with the fundamental term of recursion because the absolute error of Fn(z) always decreases with the recursive approach.The scheme can be employed in modifying any of existent subprograms for Fn<z> computations.In the case of p-d-f-and g-type Gaussians,combining this method with Schaad's formulas can reduce,at least,the additive operations by a factor 40%;the multiplicative and exponential operations by a factor 60%.
基金supported by the National Natural Science Foundation of China(No.72101263).
文摘In this paper,we present a novel distributed sequential allocation mechanism for optimizing investments in unmanned systems,framed as a multi-agent dynamic planning problem.The core contribution lies in an advanced algorithm that integrates multi-agent parallel computing for global optimization with single-agent sequential allocation for local refinement.This hybrid approach ensures both optimality and polynomial-time complexity,effectively addressing the challenges of multi-field investment with uncertain costs and rewards.By employing sophisticated optimization techniques,our algorithm dynamically adjusts investment strategies based on the real-time data.Simulation results in typical scenarios demonstrate the algorithm’s superiority over benchmark methods,offering significantly enhanced investment solutions tailored to the unique requirements of unmanned systems.Our method not only improves investment efficiency and effectiveness,but also provides a robust and adaptable solution for the dynamic and uncertain nature of unmanned systems investment portfolios,thereby ensuring sustained performance and strategic advantage.
基金supported by the Joint Foundation of the Ministry of Education of China(No.6141A02022340).
文摘An improved approach is presented in this paper to implement highly constrained cooperative guidance to attack a stationary target.The problem with time-varying Proportional Navigation(PN)gain is first formulated as a nonlinear optimal control problem,which is difficult to solve due to the existence of nonlinear kinematics and nonconvex constraints.After convexification treatments and discretization,the solution to the original problem can be approximately obtained by solving a sequence of Second-Order Cone Programming(SOCP)problems,which can be readily solved by state-of-the-art Interior-Point Methods(IPMs).To mitigate the sensibility of the algorithm on the user-provided initial profile,a Two-Stage Sequential Convex Programming(TSSCP)method is presented in detail.Furthermore,numerical simulations under different mission scenarios are conducted to show the superiority of the proposed method in solving the cooperative guidance problem.The research indicated that the TSSCP method is more tractable and reliable than the traditional methods and has great potential for real-time processing and on-board implementation.
基金the National Natural Science Foundation of China (Nos. 50905115 and 70771065)the National High Technology Research and Development Program (863) of China (Nos. 2009AA043403,2009AA043000 and 2008042801)the Shanghai Natural Science Foundation (No. 09ZR1414400)
文摘This paper proposes a dynamic opportunistic preventive maintenance (PM) optimization policy for multi-unit series systems by integrating multi PM techniques. Two PM techniques, periodic PM and sequential PM, are considered. Whenever one of the units reaches its reliability threshold, a PM action has to be performed on that unit. At that time the whole system has to be stopped and PM opportunities arise for the other unitsof the system. An optimal PM practice is determined by maximizing the short-term cumulative opportunistic maintenance (OM) cost savings for the whole system. Numerical examples are given to show how this approach works. Finally, a comparison between the proposed PM policy and the other policies is given.
基金the National Natural Science Foundation of China(No.10772070)Ph.D Programs Foundation of Ministry of Education of China(No.20070487064).
文摘This paper proposed a reliability design model for composite materials under the mixture of random and interval variables. Together with the inverse reliability analysis technique, the sequential single-loop optimization method is applied to the reliability-based design of composites. In the sequential single-loop optimization, the optimization and the reliability analysis are decoupled to improve the computational efficiency. As shown in examples, the minimum weight problems under the constraint of structural reliability are solved for laminated composites. The Particle Swarm Optimization （PSO） algorithm is utilized to search for the optimal solutions. The design results indicate that, under the mixture of random and interval variables, the method that combines the sequential single-loop optimization and the PSO algorithm can deal effectively with the reliability-based design of composites.
基金Supported by the National Natural Science Foundation of China （No.60374037, No.60574036）, the Program for New Century Excellent Talents in University of China （NCET）, the Specialized Research Fund for the Doctoral Program of Higher Education of China （No.20050055013）, .and the 0pening Project Foundation of National Lab of Industrial Control Technology （No.0708008）.
文摘With the unique erggdicity, i rregularity, and.special ability to avoid being trapped in local optima, chaos optimization has been a novel global optimization technique and has attracted considerable attention for application in various fields, such as nonlinear programming problems. In this article, a novel neural network nonlinear predic-tive control （NNPC） strategy baseed on the new Tent-map chaos optimization algorithm （TCOA） is presented. Thefeedforward neural network＇is used as the multi-step predictive model. In addition, the TCOA is applied to perform the nonlinear rolling optimization to enhance the convergence and accuracy in the NNPC. Simulation on a labora-tory-scale liquid-level system is given to illustrate the effectiveness of the proposed method.
文摘This paper presents a novel optimization technique for an efficient multi-fidelity model building approach to reduce computational costs for handling aerodynamic shape optimization based on high-fidelity simulation models. The wing aerodynamic shape optimization problem is solved by dividing optimization into three steps—modeling 3D（high-fidelity） and 2D（lowfidelity） models, building global meta-models from prominent instead of all variables, and determining robust optimizing shape associated with tuning local meta-models. The adaptive robust design optimization aims to modify the shape optimization process. The sufficient infilling strategy—known as adaptive uniform infilling strategy—determines search space dimensions based on the last optimization results or initial point. Following this, 3D model simulations are used to tune local meta-models. Finally, the global optimization gradient-based method—Adaptive Filter Sequential Quadratic Programing（AFSQP） is utilized to search the neighborhood for a probable optimum point. The effectiveness of the proposed method is investigated by applying it, along with conventional optimization approach-based meta-models, to a Blended Wing Body（BWB） Unmanned Aerial Vehicle（UAV）. The drag coefficient is defined as the objective function, which is subjected to minimum lift coefficient bounds and stability constraints. The simulation results indicate improvement in meta-model accuracy and reduction in computational time of the method introduced in this paper.
