Asynchronous decentralized event-triggered control

In this paper we propose an approach to the implementation of controllers with decentralized strategies triggering controller updates. We consider set-ups with a central node in charge of the computation of the control commands, and a set of not co-located sensors providing measurements to the controller node. The solution we propose does not require measurements from the sensors to be synchronized in time. The sensors in our proposal provide measurements in an aperiodic way triggered by local conditions. Furthermore, in the proposed implementation (most of) the communication between nodes requires only the exchange of one bit of information (per controller update), which could aid in reducing transmission delays and as a secondary effect result in fewer transmissions being triggered.     

Artificial neural network application for modeling the rail rolling process

Rail rolling process is one of the most complicated hot rolling processes. Evaluating the effects of parametric values on this complex process is only possible through modeling. In this study, the production parameters of different types of rails in the rail rolling processes were modeled with an artificial neural network (ANN), and it was aimed to obtain optimum parameter values for a different type of rail. For this purpose, the data from the Rail and Profile Rolling Mill in Kardemir Iron & Steel Works Co. (Karabük, Turkey) were used. BD1, BD2, and Tandem are three main parts of the rolling mill, and in order to obtain the force values of the 49 kg/m rail in each pass for the BD1 and BD2 sections, the force and torque values for the Tandem section, parameter values of 60, 54, 46, and 33 kg/m type rails were used. Comparing the results obtained from the ANN model and the actual field data demonstrated that force and torque values were obtained with acceptable error rates. The results of the present study demonstrated that ANN is an effective and reliable method to acquire data required for producing a new rail, and concerning the rail production process, it provides a productive way for accurate and fast decision making.     

A virtual actuator and sensor approach for fault tolerant control of LPV systems

In this paper, a fault tolerant control (FTC) strategy using virtual actuators and sensors for linear parameter varying (LPV) systems is proposed. The main idea of this FTC method, initially developed for LTI systems, is to reconfigure the control loop such that the nominal controller could still be used without need of retuning it. The plant with the faulty actuator/sensor is modified adding the virtual actuator/sensor block that masks the actuator/sensor fault. The suggested technique is an active FTC strategy that reconfigures the virtual actuator/sensor on-line taking into account faults and operating point changes. The stability of the reconfigured control loop is guaranteed if the faulty plant is stabilizable/detectable. The LPV virtual actuator/sensor is designed using polytopic LPV techniques and linear matrix inequalities (LMIs). A two-tank system simulator is used to assess the performance of the proposed method. In particular, it is shown that the application of the proposed technique results in an improvement, in terms of performance, with respect to the LTI counterpart.     

一种改进的TLD算法

针对跟踪算法目标遮挡后易出现跟踪漂移的问题,提出了一种跟踪学习检测（TLD）算法与Kalman滤波相结合的手势跟踪方法.在跟踪器跟踪成功后,加入识别窗的方法进行遮挡判定.产生遮挡后目标模型不再更新,学习器不再更新集合分类器.若是部分遮挡,则由TLD学习器处理;若是严重遮挡,则改由Kalman滤波算法预测目标的运动轨迹.该方法在保留TLD算法长期稳定跟踪、适应摄像机快速运动与复杂背景等优点的基础上,改善了目标遮挡后易出现跟踪漂移的问题.实验表明：提出的改进TLD算法比其他常见跟踪方法具有更加优异的性能.     

基于压缩感知的鲁棒性人脸表情识别

为了有效提高噪声背景下的人脸表情识别性能,提出一种基于压缩感知的鲁棒性人脸表情识别方法.先通过对腐蚀的测试样本表情图像进行稀疏表示,再利用压缩感知理论寻求其最稀疏的解,然后采用求得的最稀疏解信息实现人脸表情的分类.在标准的Cohn-Kanade表情数据库的实验测试结果表明,该方法取得的人脸表情识别性能优于最近邻法、支持向量机以及最近邻子空间法.可见,该方法用于人脸表情识别,识别效果较好,鲁棒性较高.     

利用标志点多视图约束实现结构光扫描高精度粗拼接

在采用标志点拼接的结构光扫描系统中,两两相邻视图拼接存在累积误差,导致拼接精度会随拼接次数下降,为此提出一种利用标志点多视图几何约束的高精度拼接方法.首先利用两两视图拼接的方式在扫描过程中构建标志点多视图网络,并利用光束法平差技术优化多视图网络得到高精度全局控制点;在此过程中保存每个视局部坐标系下三维点云,然后将各局部坐标系下点云和全局控制点进行拼接,得到物体表面完整的三维数据.该方法克服了传统拼接过程中累积误差,提高了多视角三维扫描拼接精度;并通过实验证明了所提出算法的有效性.     

Robust discrete-time set-based adaptive predictive control for nonlinear systems

The problem of robust adaptive predictive control for a class of discrete-time nonlinear systems is considered. First, a parameter estimation technique, based on an uncertainty set estimation, is formulated. This technique is able to provide robust performance for nonlinear systems subject to exogenous variables. Second, an adaptive MPC is developed to use the uncertainty estimation in a framework of min–max robust control. A Lipschitz-based approach, which provides a conservative approximation for the min–max problem, is used to solve the control problem, retaining the computational complexity of nominal MPC formulations and the robustness of the min–max approach. Finally, the set-based estimation algorithm and the robust predictive controller are successfully applied in two case studies. The first one is the control of anonisothermal CSTR governed by the van de Vusse reaction. Concentration and temperature regulation is considered with the simultaneous estimation of the frequency (or pre-exponential) factors of the Arrhenius equation. In the second example, a biomedical model for chemotherapy control is simulated using control actions provided by the proposed algorithm. The methods for estimation and control were tested using different disturbances scenarios.     

Sequential virtual motion camouflage method for nonlinear constrained optimal trajectory control

Nonlinear constrained optimal trajectory planning is a challenging and fundamental area of research. This paper proposes bio-inspired fast-time approaches for this type of problems based on the inspiration drawn from the natural phenomenon known as the motion camouflage. Two algorithms are proposed: the virtual motion camouflage (VMC) subspace method and the sequential VMC method. As a hybrid approach, the sequential VMC method works through a two-step structure in each iteration. First, the VMC subspace method will solve for an optimal solution over a selected subspace. Second, an algorithm consisting of a linear programming and a line search will vary the subspace so that the next VMC subspace result will be guaranteed not to be worse than that of the current step. The dimension and time complexities of the algorithms will be analyzed, and the optimality of the solution via the sequential VMC approach will be studied. Through the VMC approaches, the state and control variables in the kinematics or dynamics models of vehicles in the selected subspace can be represented by a single degree-of-freedom vector, called the path control parameter vector. The reduction in dimension and no involvement of equality constraints will in practice make the convergence faster and easier, and a much smaller computational cost is expected. Two simulation examples, the Breakwell problem and a minimum time robot obstacle avoidance problem with different numbers of obstacles, are used to demonstrate the capabilities of the algorithms.