scholarly journals Partitioned Quasi-Newton Approximation for Direct Collocation Methods and Its Application to the Fuel-Optimal Control of a Diesel Engine

2014 ◽  
Vol 2014 ◽  
pp. 1-6 ◽  
Author(s):  
Jonas Asprion ◽  
Oscar Chinellato ◽  
Lino Guzzella

The numerical solution of optimal control problems by direct collocation is a widely used approach. Quasi-Newton approximations of the Hessian of the Lagrangian of the resulting nonlinear program are also common practice. We illustrate that the transcribed problem is separable with respect to the primal variables and propose the application of dense quasi-Newton updates to the small diagonal blocks of the Hessian. This approach resolves memory limitations, preserves the correct sparsity pattern, and generates more accurate curvature information. The effectiveness of this improvement when applied to engineering problems is demonstrated. As an example, the fuel-optimal and emission-constrained control of a turbocharged diesel engine is considered. First results indicate a significantly faster convergence of the nonlinear program solver when the method proposed is used instead of the standard quasi-Newton approximation.

1999 ◽  
Vol 32 (2) ◽  
pp. 8160-8165 ◽  
Author(s):  
X. Dovifaaz ◽  
M. Ouladsine ◽  
A. Rachid ◽  
S. Ouenou-Gamo

2016 ◽  
Vol 2016 ◽  
pp. 1-10 ◽  
Author(s):  
Amr Radwan ◽  
Hoang-Linh To ◽  
Won-Joo Hwang

Because memory buffers become larger and cheaper, they have been put into network devices to reduce the number of loss packets and improve network performance. However, the consequences of large buffers are long queues at network bottlenecks and throughput saturation, which has been recently noticed in research community as bufferbloat phenomenon. To address such issues, in this article, we design a forward-backward optimal control queue algorithm based on an indirect approach with parametric optimization. The cost function which we want to minimize represents a trade-off between queue length and packet loss rate performance. Through the integration of an indirect approach with parametric optimization, our proposal has advantages of scalability and accuracy compared to direct approaches, while still maintaining good throughput and shorter queue length than several existing queue management algorithms. All numerical analysis, simulation in ns-2, and experiment results are provided to solidify the efficiency of our proposal. In detailed comparisons to other conventional algorithms, the proposed procedure can run much faster than direct collocation methods while maintaining a desired short queue (≈40 packets in simulation and80 (ms) in experiment test).


2021 ◽  
Vol 22 (4) ◽  
pp. 1087-1095
Author(s):  
Qi Jing ◽  
Qingguo Luo ◽  
Yong Gui ◽  
Hongbin Liu

Sign in / Sign up

Export Citation Format

Share Document