Crude oil scheduling optimization is an effective method to enhance the economic benefits of oil refining.But uncertainties,including uncertain demands of crude distillation units(CDUs),might make the production plans...Crude oil scheduling optimization is an effective method to enhance the economic benefits of oil refining.But uncertainties,including uncertain demands of crude distillation units(CDUs),might make the production plans made by the traditional deterministic optimization models infeasible.A data-driven Wasserstein distributionally robust chance-constrained(WDRCC)optimization approach is proposed in this paper to deal with demand uncertainty in crude oil scheduling.First,a new deterministic crude oil scheduling optimization model is developed as the basis of this approach.The Wasserstein distance is then used to build ambiguity sets from historical data to describe the possible realizations of probability distributions of uncertain demands.A cross-validation method is advanced to choose suitable radii for these ambiguity sets.The deterministic model is reformulated as a WDRCC optimization model for crude oil scheduling to guarantee the demand constraints hold with a desired high probability even in the worst situation in ambiguity sets.The proposed WDRCC model is transferred into an equivalent conditional value-at-risk representation and further derived as a mixed-integer nonlinear programming counterpart.Industrial case studies from a real-world refinery are conducted to show the effectiveness of the proposed method.Out-of-sample tests demonstrate that the solution of the WDRCC model is more robust than those of the deterministic model and the chance-constrained model.展开更多
A dynamics-based adaptive control approach is proposed for a planar dual-arm space robot in the presence of closed-loop constraints and uncertain inertial parameters of the payload. The controller is capable of contro...A dynamics-based adaptive control approach is proposed for a planar dual-arm space robot in the presence of closed-loop constraints and uncertain inertial parameters of the payload. The controller is capable of controlling the po- sition and attitude of both the satellite base and the payload grasped by the manipulator end effectors. The equations of motion in reduced-order form for the constrained system are derived by incorporating the constraint equations in terms of accelerations into Kane's equations of the unconstrained system. Model analysis shows that the resulting equations perfectly meet the requirement of adaptive controller design. Consequently, by using an indirect approach, an adaptive control scheme is proposed to accomplish position/attitude trajectory tracking control with the uncertain parameters be- ing estimated on-line. The actuator redundancy due to the closed-loop constraints is utilized to minimize a weighted norm of the joint torques. Global asymptotic stability is proven by using Lyapunov's method, and simulation results are also presented to demonstrate the effectiveness of the proposed approach.展开更多
An approach is proposed for modeling and anal- yses of rigid multibody systems with frictional translation joints and driving constraints. The geometric constraints of translational joints with small clearance are tre...An approach is proposed for modeling and anal- yses of rigid multibody systems with frictional translation joints and driving constraints. The geometric constraints of translational joints with small clearance are treated as bilat- eral constraints by neglecting the impact between sliders and guides. Firstly, the normal forces acting on sliders, the driv- ing constraint forces (or moments) and the constraint forces of smooth revolute joints are all described by complementary conditions. The frictional contacts are characterized by a set- valued force law of Coulomb's dry friction. Combined with the theory of the horizontal linear complementarity problem (HLCP), an event-driven scheme is used to detect the transi- tions of the contact situation between sliders and guides, and the stick-slip transitions of sliders, respectively. And then, all constraint forces in the system can be computed easily. Secondly, the dynamic equations of multibody systems are written at the acceleration-force level by the Lagrange multiplier technique, and the Baumgarte stabilization method is used to reduce the constraint drift. Finally, a numerical example is given to show some non-smooth dynamical behaviors of the studied system. The obtained results validate the feasibility of algorithm and the effect of constraint stabilization.展开更多
This study proposes a two-stage photovoltaic(PV)voltage control strategy for centralized control that ignores short-term load fluctuations.In the first stage,a deterministic power flow model optimizes the 15-minute ac...This study proposes a two-stage photovoltaic(PV)voltage control strategy for centralized control that ignores short-term load fluctuations.In the first stage,a deterministic power flow model optimizes the 15-minute active cycle of the inverter and reactive outputs to reduce network loss and light rejection.In the second stage,the local control stabilizes the fluctuations and tracks the system state of the first stage.The uncertain interval model establishes a chance constraint model for the inverter voltage-reactive power local control.Second-order cone optimization and sensitivity theories were employed to solve the models.The effectiveness of the model was confirmed using a modified IEEE 33 bus example.The intraday control outcome for distributed power generation considering the effects of fluctuation uncertainty,PV penetration rate,and inverter capacity is analyzed.展开更多
In this paper, we obtain optimum allocation of replaceable and repairable components in a system design. When repair and replace time are considered as random in the constraints. We convert probabilistic constraint in...In this paper, we obtain optimum allocation of replaceable and repairable components in a system design. When repair and replace time are considered as random in the constraints. We convert probabilistic constraint into an equivalent deterministic constraint by using chance constrained programming. We have used the selective maintenance policy to determine how many components to be replaced & repaired within the limited maintenance time interval and cost. A Numerical example is presented to illustrate the computational procedure and problem is solved by using LINGO Software.展开更多
Mathematical programs with complementarity constraints(MPCC) is an important subclass of MPEC.It is a natural way to solve MPCC by constructing a suitable approximation of the primal problem.In this paper,we propose a...Mathematical programs with complementarity constraints(MPCC) is an important subclass of MPEC.It is a natural way to solve MPCC by constructing a suitable approximation of the primal problem.In this paper,we propose a new smoothing method for MPCC by using the aggregation technique.A new SQP algorithm for solving the MPCC problem is presented.At each iteration,the master direction is computed by solving a quadratic program,and the revised direction for avoiding the Maratos effect is generated by an explicit formula.As the non-degeneracy condition holds and the smoothing parameter tends to zero,the proposed SQP algorithm converges globally to an S-stationary point of the MPEC problem,its convergence rate is superlinear.Some preliminary numerical results are reported.展开更多
In this paper,we study the distributionally robust joint chance-constrained Markov decision process.Utilizing the logarithmic transformation technique,we derive its deterministic reformulation with bi-convex terms und...In this paper,we study the distributionally robust joint chance-constrained Markov decision process.Utilizing the logarithmic transformation technique,we derive its deterministic reformulation with bi-convex terms under the moment-based uncertainty set.To cope with the non-convexity and improve the robustness of the solution,we propose a dynamical neural network approach to solve the reformulated optimization problem.Numerical results on a machine replacement problem demonstrate the efficiency of the proposed dynamical neural network approach when compared with the sequential convex approximation approach.展开更多
Smooth constraint is important in linear inversion, but it is difficult to apply directly to model parameters in genetic algorithms. If the model parameters are smoothed in iteration, the diversity of models will be g...Smooth constraint is important in linear inversion, but it is difficult to apply directly to model parameters in genetic algorithms. If the model parameters are smoothed in iteration, the diversity of models will be greatly suppressed and all the models in population will tend to equal in a few iterations, so the optimal solution meeting requirement can not be obtained. In this paper, an indirect smooth constraint technique is introduced to genetic inversion. In this method, the new models produced in iteration are smoothed, then used as theoretical models in calculation of misfit function, but in process of iteration only the original models are used in order to keep the diversity of models. The technique is effective in inversion of surface wave and receiver function. Using this technique, we invert the phase velocity of Raleigh wave in the Tibetan Plateau, revealing the horizontal variation of S wave velocity structure near the center of the Tibetan Plateau. The results show that the S wave velocity in the north is relatively lower than that in the south. For most paths there is a lower velocity zone with 12-25 km thick at the depth of 15-40 km. The lower velocity zone in upper mantle is located below the depth of 100 km, and the thickness is usually 40-80 km, but for a few paths reach to 100 km thick. Among the area of Ando, Maqi and Ushu stations, there is an obvious lower velocity zone with the lowest velocity of 4.2-4.3 km/s at the depth of 90-230 km. Based on the S wave velocity structures of different paths and former data, we infer that the subduction of the Indian Plate is delimited nearby the Yarlung Zangbo suture zone.展开更多
The Lie symmetry and Hojman conserved quantity of Nielsen equations in a dynamical system of relative motion with nonholonomic constraint of the Chetaev type are studied. The differential equations of motion of the Ni...The Lie symmetry and Hojman conserved quantity of Nielsen equations in a dynamical system of relative motion with nonholonomic constraint of the Chetaev type are studied. The differential equations of motion of the Nielsen equation for the system, the definition and the criterion of Lie symmetry, and the expression of the Hojman conserved quantity deduced directly from the Lie symmetry for the system are obtained. An example is given to illustrate the application of the results.展开更多
Temperature (T) and salinity (S) profiles from conductivity-temperature-depth data collected during the Northern South China Sea Open Cruise from August 16 to September 13, 2008 are assimilated using Ensemble Kalm...Temperature (T) and salinity (S) profiles from conductivity-temperature-depth data collected during the Northern South China Sea Open Cruise from August 16 to September 13, 2008 are assimilated using Ensemble Kalman Filter (EnKF). An adaptive observational error strategy is used to prevent filter from diverging. In the meantime, aiming at the limited improvement in some sites caused by the T and S biases in the model, a T-S constraint scheme is adopted to improve the assimilation performance, where T and S are separately updated at these locations. Validation is performed by comparing assimilated outputs with independent in situ data (satellite remote sensing sea level anomaly (SLA), the OSCAR velocity product and shipboard ADCP). The results show that the new EnKF assimilation scheme can significantly reduce the root mean square error (RMSE) of oceanic T and S compared with the control run and traditional EnKF. The system can also improve the simulation of circulations and SLA.展开更多
A computational method of constraint stabilization and correction is introduced. The method is based on the Baumgart's one-step method. Constraint conditions are addressed to stabilize and correct the solution. Two e...A computational method of constraint stabilization and correction is introduced. The method is based on the Baumgart's one-step method. Constraint conditions are addressed to stabilize and correct the solution. Two examples are given to illustrate the results of the method.展开更多
This paper considers the problem of supply-demand imbalances in Mobility-on-Demand(MoD)services.These imbalances occur due to uneven stochastic travel demand and can be mitigated by proactively rebalancing empty vehic...This paper considers the problem of supply-demand imbalances in Mobility-on-Demand(MoD)services.These imbalances occur due to uneven stochastic travel demand and can be mitigated by proactively rebalancing empty vehicles to areas where the demand is high.To achieve this,we propose a method that takes into account uncertainties of predicted travel demand while minimizing pick-up time and rebalance mileage for autonomous MoD ride-hailing.More precisely,first travel demand is predicted using Gaussian Process Regression(GPR)which provides uncertainty bounds on the prediction.We then formulate a stochastic model predictive control(MPC)for the autonomous ride-hailing service and integrate the demand predictions with uncertainty bounds.In order to guarantee constraint satisfaction in the optimization under estimated stochastic demand prediction,we employ a probabilistic constraining method with user-defined confidence interval,using Chance Constrained MPC(CCMPC).The benefits of the proposed method are twofold.First,travel demand uncertainty prediction from data can naturally be embedded into the MoD optimization framework,allowing us to keep the imbalance at each station below a certain threshold with a user-defined probability.Second,CCMPC can be relaxed into a Mixed-Integer-Linear-Program(MILP)and the MILP can be solved as a corresponding Linear-Program,which always admits an integral solution.Our transportation simulations show that by tuning the confidence bound on the chance constraint,close to optimal oracle performance can be achieved,with a median customer wait time reduction of 4%compared to using only the mean prediction of the GPR.展开更多
基金the supports from National Natural Science Foundation of China(61988101,62073142,22178103)National Natural Science Fund for Distinguished Young Scholars(61925305)International(Regional)Cooperation and Exchange Project(61720106008)。
文摘Crude oil scheduling optimization is an effective method to enhance the economic benefits of oil refining.But uncertainties,including uncertain demands of crude distillation units(CDUs),might make the production plans made by the traditional deterministic optimization models infeasible.A data-driven Wasserstein distributionally robust chance-constrained(WDRCC)optimization approach is proposed in this paper to deal with demand uncertainty in crude oil scheduling.First,a new deterministic crude oil scheduling optimization model is developed as the basis of this approach.The Wasserstein distance is then used to build ambiguity sets from historical data to describe the possible realizations of probability distributions of uncertain demands.A cross-validation method is advanced to choose suitable radii for these ambiguity sets.The deterministic model is reformulated as a WDRCC optimization model for crude oil scheduling to guarantee the demand constraints hold with a desired high probability even in the worst situation in ambiguity sets.The proposed WDRCC model is transferred into an equivalent conditional value-at-risk representation and further derived as a mixed-integer nonlinear programming counterpart.Industrial case studies from a real-world refinery are conducted to show the effectiveness of the proposed method.Out-of-sample tests demonstrate that the solution of the WDRCC model is more robust than those of the deterministic model and the chance-constrained model.
基金supported by the National Natural Science Foundation of China(11272027)
文摘A dynamics-based adaptive control approach is proposed for a planar dual-arm space robot in the presence of closed-loop constraints and uncertain inertial parameters of the payload. The controller is capable of controlling the po- sition and attitude of both the satellite base and the payload grasped by the manipulator end effectors. The equations of motion in reduced-order form for the constrained system are derived by incorporating the constraint equations in terms of accelerations into Kane's equations of the unconstrained system. Model analysis shows that the resulting equations perfectly meet the requirement of adaptive controller design. Consequently, by using an indirect approach, an adaptive control scheme is proposed to accomplish position/attitude trajectory tracking control with the uncertain parameters be- ing estimated on-line. The actuator redundancy due to the closed-loop constraints is utilized to minimize a weighted norm of the joint torques. Global asymptotic stability is proven by using Lyapunov's method, and simulation results are also presented to demonstrate the effectiveness of the proposed approach.
基金supported by the National Natural Science Foundation of China(11372018 and 11172019)
文摘An approach is proposed for modeling and anal- yses of rigid multibody systems with frictional translation joints and driving constraints. The geometric constraints of translational joints with small clearance are treated as bilat- eral constraints by neglecting the impact between sliders and guides. Firstly, the normal forces acting on sliders, the driv- ing constraint forces (or moments) and the constraint forces of smooth revolute joints are all described by complementary conditions. The frictional contacts are characterized by a set- valued force law of Coulomb's dry friction. Combined with the theory of the horizontal linear complementarity problem (HLCP), an event-driven scheme is used to detect the transi- tions of the contact situation between sliders and guides, and the stick-slip transitions of sliders, respectively. And then, all constraint forces in the system can be computed easily. Secondly, the dynamic equations of multibody systems are written at the acceleration-force level by the Lagrange multiplier technique, and the Baumgarte stabilization method is used to reduce the constraint drift. Finally, a numerical example is given to show some non-smooth dynamical behaviors of the studied system. The obtained results validate the feasibility of algorithm and the effect of constraint stabilization.
基金supported by the China National Natural Science Foundation(52177082)China National Key R&D Program(2020YFC0827001)Science and Technology Project of Jilin Electric Power Co.,Ltd(2020JBGS-03).
文摘This study proposes a two-stage photovoltaic(PV)voltage control strategy for centralized control that ignores short-term load fluctuations.In the first stage,a deterministic power flow model optimizes the 15-minute active cycle of the inverter and reactive outputs to reduce network loss and light rejection.In the second stage,the local control stabilizes the fluctuations and tracks the system state of the first stage.The uncertain interval model establishes a chance constraint model for the inverter voltage-reactive power local control.Second-order cone optimization and sensitivity theories were employed to solve the models.The effectiveness of the model was confirmed using a modified IEEE 33 bus example.The intraday control outcome for distributed power generation considering the effects of fluctuation uncertainty,PV penetration rate,and inverter capacity is analyzed.
文摘In this paper, we obtain optimum allocation of replaceable and repairable components in a system design. When repair and replace time are considered as random in the constraints. We convert probabilistic constraint into an equivalent deterministic constraint by using chance constrained programming. We have used the selective maintenance policy to determine how many components to be replaced & repaired within the limited maintenance time interval and cost. A Numerical example is presented to illustrate the computational procedure and problem is solved by using LINGO Software.
基金supported by the National Natural Science Foundation of China(No.10861005)the Natural Science Foundation of Guangxi Province (No.0728206)the Innovation Project of Guangxi Graduate Education(No. 2009105950701M29).
文摘Mathematical programs with complementarity constraints(MPCC) is an important subclass of MPEC.It is a natural way to solve MPCC by constructing a suitable approximation of the primal problem.In this paper,we propose a new smoothing method for MPCC by using the aggregation technique.A new SQP algorithm for solving the MPCC problem is presented.At each iteration,the master direction is computed by solving a quadratic program,and the revised direction for avoiding the Maratos effect is generated by an explicit formula.As the non-degeneracy condition holds and the smoothing parameter tends to zero,the proposed SQP algorithm converges globally to an S-stationary point of the MPEC problem,its convergence rate is superlinear.Some preliminary numerical results are reported.
基金supported by National Natural Science Foundation of China(Grant Nos.11991023 and 12371324)National Key R&D Program of China(Grant No.2022YFA1004000)。
文摘In this paper,we study the distributionally robust joint chance-constrained Markov decision process.Utilizing the logarithmic transformation technique,we derive its deterministic reformulation with bi-convex terms under the moment-based uncertainty set.To cope with the non-convexity and improve the robustness of the solution,we propose a dynamical neural network approach to solve the reformulated optimization problem.Numerical results on a machine replacement problem demonstrate the efficiency of the proposed dynamical neural network approach when compared with the sequential convex approximation approach.
基金State Natural Science Foundation (49874021).Contribution No. 01FE2002, Institute of Geophysics, China Seismological Bureau.
文摘Smooth constraint is important in linear inversion, but it is difficult to apply directly to model parameters in genetic algorithms. If the model parameters are smoothed in iteration, the diversity of models will be greatly suppressed and all the models in population will tend to equal in a few iterations, so the optimal solution meeting requirement can not be obtained. In this paper, an indirect smooth constraint technique is introduced to genetic inversion. In this method, the new models produced in iteration are smoothed, then used as theoretical models in calculation of misfit function, but in process of iteration only the original models are used in order to keep the diversity of models. The technique is effective in inversion of surface wave and receiver function. Using this technique, we invert the phase velocity of Raleigh wave in the Tibetan Plateau, revealing the horizontal variation of S wave velocity structure near the center of the Tibetan Plateau. The results show that the S wave velocity in the north is relatively lower than that in the south. For most paths there is a lower velocity zone with 12-25 km thick at the depth of 15-40 km. The lower velocity zone in upper mantle is located below the depth of 100 km, and the thickness is usually 40-80 km, but for a few paths reach to 100 km thick. Among the area of Ando, Maqi and Ushu stations, there is an obvious lower velocity zone with the lowest velocity of 4.2-4.3 km/s at the depth of 90-230 km. Based on the S wave velocity structures of different paths and former data, we infer that the subduction of the Indian Plate is delimited nearby the Yarlung Zangbo suture zone.
文摘The Lie symmetry and Hojman conserved quantity of Nielsen equations in a dynamical system of relative motion with nonholonomic constraint of the Chetaev type are studied. The differential equations of motion of the Nielsen equation for the system, the definition and the criterion of Lie symmetry, and the expression of the Hojman conserved quantity deduced directly from the Lie symmetry for the system are obtained. An example is given to illustrate the application of the results.
基金The Strategic Priority Research Program of the Chinese Academy of Sciences under contract No.XDA10010405the Promgram of Guangdong Province Department of Science and Technology No.2012A032100004+1 种基金the National Natural Science Foundation of China under contract Nos 41476012,41521005 and 41406131the Knowledge Innovation Program of the Chinese Academy of Sciences under contract Nos SQ201001 and SQ201205
文摘Temperature (T) and salinity (S) profiles from conductivity-temperature-depth data collected during the Northern South China Sea Open Cruise from August 16 to September 13, 2008 are assimilated using Ensemble Kalman Filter (EnKF). An adaptive observational error strategy is used to prevent filter from diverging. In the meantime, aiming at the limited improvement in some sites caused by the T and S biases in the model, a T-S constraint scheme is adopted to improve the assimilation performance, where T and S are separately updated at these locations. Validation is performed by comparing assimilated outputs with independent in situ data (satellite remote sensing sea level anomaly (SLA), the OSCAR velocity product and shipboard ADCP). The results show that the new EnKF assimilation scheme can significantly reduce the root mean square error (RMSE) of oceanic T and S compared with the control run and traditional EnKF. The system can also improve the simulation of circulations and SLA.
基金the National Natural Science Foundation of China (10572021 ,10372053)Basic Research Foundation of Beijing Institute of Tech-nology (BIT-UBF-200507A4206)
文摘A computational method of constraint stabilization and correction is introduced. The method is based on the Baumgart's one-step method. Constraint conditions are addressed to stabilize and correct the solution. Two examples are given to illustrate the results of the method.
基金co-funded by Vinnova,Sweden through the project:Simulation,analysis and modeling of future efficient traffic systems.
文摘This paper considers the problem of supply-demand imbalances in Mobility-on-Demand(MoD)services.These imbalances occur due to uneven stochastic travel demand and can be mitigated by proactively rebalancing empty vehicles to areas where the demand is high.To achieve this,we propose a method that takes into account uncertainties of predicted travel demand while minimizing pick-up time and rebalance mileage for autonomous MoD ride-hailing.More precisely,first travel demand is predicted using Gaussian Process Regression(GPR)which provides uncertainty bounds on the prediction.We then formulate a stochastic model predictive control(MPC)for the autonomous ride-hailing service and integrate the demand predictions with uncertainty bounds.In order to guarantee constraint satisfaction in the optimization under estimated stochastic demand prediction,we employ a probabilistic constraining method with user-defined confidence interval,using Chance Constrained MPC(CCMPC).The benefits of the proposed method are twofold.First,travel demand uncertainty prediction from data can naturally be embedded into the MoD optimization framework,allowing us to keep the imbalance at each station below a certain threshold with a user-defined probability.Second,CCMPC can be relaxed into a Mixed-Integer-Linear-Program(MILP)and the MILP can be solved as a corresponding Linear-Program,which always admits an integral solution.Our transportation simulations show that by tuning the confidence bound on the chance constraint,close to optimal oracle performance can be achieved,with a median customer wait time reduction of 4%compared to using only the mean prediction of the GPR.