A multi-loop constrained model predictive control scheme based on autoregressive exogenous-partial least squares(ARX-PLS) framework is proposed to tackle the high dimension, coupled and constraints problems in industr...A multi-loop constrained model predictive control scheme based on autoregressive exogenous-partial least squares(ARX-PLS) framework is proposed to tackle the high dimension, coupled and constraints problems in industry processes due to safety limitation, environmental regulations, consumer specifications and physical restriction. ARX-PLS decoupling character enables to turn the multivariable model predictive control(MPC) controller design in original space into the multi-loop single input single output(SISO) MPC controllers design in latent space.An idea of iterative method is applied to decouple the constraints latent variables in PLS framework and recursive least square is introduced to identify ARX-PLS model. This algorithm is applied to a non-square simulation system and a stirred reactor for ethylene polymerizations comparing with adaptive internal model control(IMC) method based on ARX-PLS framework. Its application has shown that this method outperforms adaptive IMC method based on ARX-PLS framework to some extent.展开更多
Based on the analysis of the feature of cognitive radio networks, a relevant interference model was built. Cognitive users should consider especially the problem of interference with licensed users and satisfy the sig...Based on the analysis of the feature of cognitive radio networks, a relevant interference model was built. Cognitive users should consider especially the problem of interference with licensed users and satisfy the signal-to-interference noise ratio （SINR） requirement at the same time. According to different power thresholds, an approach was given to solve the problem of coexistence between licensed user and cognitive user in cognitive system. Then, an uplink distributed power control algorithm based on traditional iterative model was proposed. Convergence analysis of the algorithm in case of feasible systems was provided. Simulations show that this method can provide substantial power savings as compared with the power balancing algorithm while reducing the achieved SINR only slightly, since 6% S1NR loss can bring 23% power gain. Through further simulations, it can be concluded that the proposed solution has better effect as the noise power or system load increases.展开更多
The major objective of this work was to calculate evacuation capacity and solve the optimal routing problem in a given station topology from a network optimization perspective where station facilities were modelled as...The major objective of this work was to calculate evacuation capacity and solve the optimal routing problem in a given station topology from a network optimization perspective where station facilities were modelled as open finite queueing networks with a multi-objective set of performance measures. The optimal routing problem was determined so that the number of evacuation passengers was maximized while the service level was higher than a certain criterion. An analytical technique for modelling open finite queueing networks, called the iteration generalized expansion method(IGEM), was utilized to calculate the desired outputs. A differential evolution algorithm was presented for determining the optimal routes. As demonstrated, the design methodology which combines the optimization and analytical queueing network models provides a very effective procedure for simultaneously determining the service level and the maximum number of evacuation passengers in the best evacuation routes.展开更多
This paper proposes an optimization model for the airport ground movement problem(GMP)based on bilevel programming to address taxi conflicts on the airport ground and to improve the operating safety and efficiency.To ...This paper proposes an optimization model for the airport ground movement problem(GMP)based on bilevel programming to address taxi conflicts on the airport ground and to improve the operating safety and efficiency.To solve GMP,an iterative heuristic algorithm is designed.Instead of separately investigating each problem,this model simultaneously coordinates and optimizes the aircraft routing and scheduling.A simulation test is conducted on Nanjing Lukou International Airport(NKG)and the results show that the bilevel programming model can clearly outperform the widely used first-come-first-service(FCFS)scheduling scheme in terms of aircraft operational time under the precondition of none conflict.The research effort demonstrates that with the reduced operating cost and the improved overall efficiency,the proposed model can assist operations of the airports that are facing increasing traffic demand and working at almost maximum capacity.展开更多
This study proposes an efficient indirect approach for general nonlinear dynamic optimization problems without path constraints. The approach incorporates the virtues both from indirect and direct methods: it solves t...This study proposes an efficient indirect approach for general nonlinear dynamic optimization problems without path constraints. The approach incorporates the virtues both from indirect and direct methods: it solves the optimality conditions like the traditional indirect methods do, but uses a discretization technique inspired from direct methods. Compared with other indirect approaches, the proposed approach has two main advantages: (1) the discretized optimization problem only employs unconstrained nonlinear programming (NLP) algorithms such as BFGS (Broyden-Fletcher-Goldfarb-Shanno), rather than constrained NLP algorithms, therefore the computational efficiency is increased; (2) the relationship between the number of the discretized time intervals and the integration error of the four-step Adams predictor-corrector algorithm is established, thus the minimal number of time intervals that under desired integration tolerance can be estimated. The classic batch reactor problem is tested and compared in detail with literature reports, and the results reveal the effectiveness of the proposed approach. Dealing with path constraints requires extra techniques, and will be studied in the second paper.展开更多
In this paper, on-road trajectory planning is solved by introducing intelligent computing budget allocation(ICBA) into a candidate-curve-based planning algorithm, namely, ordinal-optimization-based differential evolut...In this paper, on-road trajectory planning is solved by introducing intelligent computing budget allocation(ICBA) into a candidate-curve-based planning algorithm, namely, ordinal-optimization-based differential evolution(OODE). The proposed algorithm is named IOODE with ‘I' representing ICBA. OODE plans the trajectory in two parts: trajectory curve and acceleration profile. The best trajectory curve is picked from a set of candidate curves, where each curve is evaluated by solving a subproblem with the differential evolution(DE) algorithm. The more iterations DE performs, the more accurate the evaluation will become. Thus, we intelligently allocate the iterations to individual curves so as to reduce the total number of iterations performed. Meanwhile, the selected best curve is ensured to be one of the truly top curves with a high enough probability. Simulation results show that IOODE is 20% faster than OODE while maintaining the same performance in terms of solution quality. The computing budget allocation framework presented in this paper can also be used to enhance the efficiency of other candidate-curve-based planning methods.展开更多
基金Supported by the National Natural Science Foundation of China （61174114, 60574047）, the National High Technology Re-search and Development Program of China （2007AA04Z168） and the Research Fund for the Doctoral Program of Higher Education of China （20120101130016）.
文摘A multi-loop constrained model predictive control scheme based on autoregressive exogenous-partial least squares(ARX-PLS) framework is proposed to tackle the high dimension, coupled and constraints problems in industry processes due to safety limitation, environmental regulations, consumer specifications and physical restriction. ARX-PLS decoupling character enables to turn the multivariable model predictive control(MPC) controller design in original space into the multi-loop single input single output(SISO) MPC controllers design in latent space.An idea of iterative method is applied to decouple the constraints latent variables in PLS framework and recursive least square is introduced to identify ARX-PLS model. This algorithm is applied to a non-square simulation system and a stirred reactor for ethylene polymerizations comparing with adaptive internal model control(IMC) method based on ARX-PLS framework. Its application has shown that this method outperforms adaptive IMC method based on ARX-PLS framework to some extent.
基金Project(61071104) supported by the National Natural Science Foundation of China
文摘Based on the analysis of the feature of cognitive radio networks, a relevant interference model was built. Cognitive users should consider especially the problem of interference with licensed users and satisfy the signal-to-interference noise ratio （SINR） requirement at the same time. According to different power thresholds, an approach was given to solve the problem of coexistence between licensed user and cognitive user in cognitive system. Then, an uplink distributed power control algorithm based on traditional iterative model was proposed. Convergence analysis of the algorithm in case of feasible systems was provided. Simulations show that this method can provide substantial power savings as compared with the power balancing algorithm while reducing the achieved SINR only slightly, since 6% S1NR loss can bring 23% power gain. Through further simulations, it can be concluded that the proposed solution has better effect as the noise power or system load increases.
基金Project(2011BAG01B01)supported by the Key Technologies Research Development Program,ChinaProject(RCS2012ZZ002)supported by State Key Laboratory of Rail Traffic Control&Safety,China
文摘The major objective of this work was to calculate evacuation capacity and solve the optimal routing problem in a given station topology from a network optimization perspective where station facilities were modelled as open finite queueing networks with a multi-objective set of performance measures. The optimal routing problem was determined so that the number of evacuation passengers was maximized while the service level was higher than a certain criterion. An analytical technique for modelling open finite queueing networks, called the iteration generalized expansion method(IGEM), was utilized to calculate the desired outputs. A differential evolution algorithm was presented for determining the optimal routes. As demonstrated, the design methodology which combines the optimization and analytical queueing network models provides a very effective procedure for simultaneously determining the service level and the maximum number of evacuation passengers in the best evacuation routes.
基金supported by the National Natural Science Foundations of China(Nos.U1933118,U2033205)。
文摘This paper proposes an optimization model for the airport ground movement problem(GMP)based on bilevel programming to address taxi conflicts on the airport ground and to improve the operating safety and efficiency.To solve GMP,an iterative heuristic algorithm is designed.Instead of separately investigating each problem,this model simultaneously coordinates and optimizes the aircraft routing and scheduling.A simulation test is conducted on Nanjing Lukou International Airport(NKG)and the results show that the bilevel programming model can clearly outperform the widely used first-come-first-service(FCFS)scheduling scheme in terms of aircraft operational time under the precondition of none conflict.The research effort demonstrates that with the reduced operating cost and the improved overall efficiency,the proposed model can assist operations of the airports that are facing increasing traffic demand and working at almost maximum capacity.
基金Supported by the National Natural Science Foundation of China (U1162130)the National High Technology Research and Development Program of China (2006AA05Z226)the Outstanding Youth Science Foundation,Zhejiang Province (R4100133)
文摘This study proposes an efficient indirect approach for general nonlinear dynamic optimization problems without path constraints. The approach incorporates the virtues both from indirect and direct methods: it solves the optimality conditions like the traditional indirect methods do, but uses a discretization technique inspired from direct methods. Compared with other indirect approaches, the proposed approach has two main advantages: (1) the discretized optimization problem only employs unconstrained nonlinear programming (NLP) algorithms such as BFGS (Broyden-Fletcher-Goldfarb-Shanno), rather than constrained NLP algorithms, therefore the computational efficiency is increased; (2) the relationship between the number of the discretized time intervals and the integration error of the four-step Adams predictor-corrector algorithm is established, thus the minimal number of time intervals that under desired integration tolerance can be estimated. The classic batch reactor problem is tested and compared in detail with literature reports, and the results reveal the effectiveness of the proposed approach. Dealing with path constraints requires extra techniques, and will be studied in the second paper.
基金supported by the National Natural Science Foundation of China(No.61273039)
文摘In this paper, on-road trajectory planning is solved by introducing intelligent computing budget allocation(ICBA) into a candidate-curve-based planning algorithm, namely, ordinal-optimization-based differential evolution(OODE). The proposed algorithm is named IOODE with ‘I' representing ICBA. OODE plans the trajectory in two parts: trajectory curve and acceleration profile. The best trajectory curve is picked from a set of candidate curves, where each curve is evaluated by solving a subproblem with the differential evolution(DE) algorithm. The more iterations DE performs, the more accurate the evaluation will become. Thus, we intelligently allocate the iterations to individual curves so as to reduce the total number of iterations performed. Meanwhile, the selected best curve is ensured to be one of the truly top curves with a high enough probability. Simulation results show that IOODE is 20% faster than OODE while maintaining the same performance in terms of solution quality. The computing budget allocation framework presented in this paper can also be used to enhance the efficiency of other candidate-curve-based planning methods.
