Searcharxiv⌕ Search

arXiv subjects

Yutao Chen

Publications and source records attributed to Yutao Chen.

22 records · Page 2Linked to original sources

CelebHair: A New Large-Scale Dataset for Hairstyle Recommendation based on CelebA

In this paper, we present a new large-scale dataset for hairstyle recommendation, CelebHair, based on the celebrity facial attributes dataset, CelebA. Our dataset inherited the majority of facial images along with some beauty-related facial attributes from CelebA. Additionally, we employed facial landmark detection techniques to extract extra features such as nose length and pupillary distance, and deep convolutional neural networks for face shape and hairstyle classification. Empirical comparison has demonstrated the superiority of our dataset to other existing hairstyle-related datasets regarding variety, veracity, and volume. Analysis and experiments have been conducted on the dataset in order to evaluate its robustness and usability.

cs.CV↗

An Efficient Move Blocking Strategy for Multiple Shooting based Nonlinear Model Predictive Control

Move blocking (MB) is a widely used strategy to reduce the degrees of freedom of the Optimal Control Problem (OCP) arising in receding horizon control. The size of the OCP is reduced by forcing the input variables to be constant over multiple discretization steps. In this paper, we focus on developing computationally efficient MB schemes for multiple shooting based nonlinear model predictive control (NMPC). The degrees of freedom of the OCP is reduced by introducing MB in the shooting step, resulting in a smaller but sparse OCP. Therefore, the discretization accuracy and level of sparsity is maintained. A condensing algorithm that exploits the sparsity structure of the OCP is proposed, that allows to reduce the computation complexity of condensing from quadratic to linear in the number of discretization nodes. As a result, active-set methods with warm-start strategy can be efficiently employed, thus allowing the use of a longer prediction horizon. A detailed comparison between the proposed scheme and the nonuniform grid NMPC is given. Effectiveness of the algorithm in reducing computational burden while maintaining optimization accuracy and constraints fulfillment is shown by means of simulations with two different problems.

math.OC↗

MATMPC - A MATLAB Based Toolbox for Real-time Nonlinear Model Predictive Control

In this paper we introduce MATMPC, an open source software built in MATLAB for nonlinear model predictive control (NMPC). It is designed to facilitate modelling, controller design and simulation for a wide class of NMPC applications. MATMPC has a number of algorithmic modules, including automatic differentiation, direct multiple shooting, condensing, linear quadratic program (QP) solver and globalization. It also supports a unique Curvature-like Measure of Nonlinearity (CMoN) MPC algorithm. MATMPC has been designed to provide state-of-the-art performance while making the prototyping easy, also with limited programming knowledge. This is achieved by writing each module directly in MATLAB API for C. As a result, MATMPC modules can be compiled into MEX functions with performance comparable to plain C/C++ solvers. MATMPC has been successfully used in operating systems including WINDOWS, LINUX AND OS X. Selected examples are shown to highlight the effectiveness of MATMPC.

eess.SY↗

An Adaptive Partial Sensitivity Updating Scheme for Fast Nonlinear Model Predictive Control

In recent years, efficient optimization algorithms for Nonlinear Model Predictive Control (NMPC) have been proposed, that significantly reduce the on-line computational time. In particular, direct multiple shooting and Sequential Quadratic Programming (SQP) are used to efficiently solve Nonlinear Programming (NLP) problems arising from continuous-time NMPC applications. One of the computationally demanding steps for on-line optimization is the computation of sensitivities of the nonlinear dynamics at every sampling instant, especially for systems of large dimensions, strong stiffness, and when using long prediction horizons. In this paper, within the algorithmic framework of the Real-Time Iteration (RTI) scheme based on multiple shooting, an inexact sensitivity updating scheme is proposed, that performs a partial update of the Jacobian of the constraints in the NLP. Such update is triggered by using a Curvature-like Measure of Nonlinearity (CMoN), so that only sensitivities exhibiting highly nonlinear behaviour are updated, thus adapting to system operating conditions and possibly reducing the computational burden. An advanced tuning strategy for the updating scheme is provided to automatically determine the number of sensitivities being updated, with a guaranteed bounded error on the Quadratic Programming (QP) solution. Numerical and control performance of the scheme is evaluated by means of two simulation examples performed on a dedicated implementation. Local convergence analysis is also presented and a tunable convergence rate is proven, when applied to the SQP method.

eess.SY↗