Abstract
This article revisits the inverted pendulum-in particular, analyses a simplified model of a Segway, with a view to exploring its capabilities in Control Systems Engineering education. The integration between the theoretic and practical side is achieved through simulation, and in particular by using MathWorks software. We also present a structure for the work to be done in the Laboratory class and propose a solution for the problem.

Abstract
In this paper, a new system identification algorithm is proposed for linear and time invariant systems with multiple input and single output. The system is described by a state-space model in the canonical observable form and represented by a Luenberger observer with a known state matrix. Thence, the identification problem is reduced to the estimation of the system input matrix and the observer gain which can be performed by a simple Least Square Estimator. The quality of the estimator depends on the observer state matrix. In the proposed algorithm, this matrix is found by an iterative process where, in each iteration, a state matrix called curiosity is generated. A weight depending on the value of the Least Square Cost is associated to each curiosity. The optimal state matrix is the barycenter of the curiosities. This iterative process is a free derivative optimization algorithm with its roots in non-iterative barycenter methods previously introduced to solve adaptive control and system identification problems. Although the Barycenter iterative version was recently proposed as an optimization method, here it will be implemented in an identification algorithm for the first time.

Abstract
This article describes a Kernel Principal Component Regressor (KPCR) to identify Auto Regressive eXogenous (ARX) Linear Parmeter Varying (LPV) models. The new method differs from the Least Squares Support Vector Machines (LS-SVM) algorithm in the regularisation of the Least Squares (LS) problem, since the KPCR only keeps the principal components of the Gram matrix while LS-SVM performs the inversion of the same matrix after adding a regularisation factor. Also, in this new approach, the LS problem is formulated in the primal space but it ends up being solved in the dual space overcoming the fact that the regressors are unknown. The method is assessed and compared to the LS-SVM approach through 2 Monte Carlo (MC) experiments. Every experiment consists of 100 runs of a simulated example, and a different noise level is used in each experiment,with Signal to Noise Ratios of 20db and 10db, respectively. The obtained results are twofold, first the performance of the new method is comparable to the LS-SVM, for both noise levels, although the required calculations are much faster for the KPCR. Second, this new method reduces the dimension of the primal space and may convey a way of knowing the number of basis functions required in the Kernel. Furthermore, having a structure very similar to LS-SVM makes it possible to use this method in other types of models, e.g. the LPV state-space model identification.

Abstract
System identification approaches have been used to design an experiment, generate data, and estimate dynamical system models for Just Walk, a behavioral intervention intended to increase physical activity in sedentary adults. The estimated models serve a number of important purposes, such as understanding the factors that influence behavior and as the basis for using control systems as decision algorithms in optimized interventions. A class of identification algorithms known as matchable-observable linear identification has been reformulated and adapted to estimate linear time-invariant models from data obtained from this intervention. The experimental design, estimation algorithms, and validation procedures are described, with the best models estimated from data corresponding to an individual intervention participant. The results provide insights into the individual and the intervention, which can be used to improve the design of future studies.

Abstract
In this paper, the gas dynamics within the pipelines is written as a wave repetitive process, and modified in a way that the dynamics is driven by the boundary conditions. We study controllability of the system through boundary control and every agent, as well as observability of the system being steered by initial and boundary data. Next, we obtain sufficient criteria for the existence and uniqueness of boundary equilibrium controls. From the point of view of some applications, e.g. in high pressure gas pipeline management, it seems to make sense to consider boundary data controls. The same problem is then extended to its infinite counterpart since it may run infinitely and, in this case, we become interested in studying its stabilisation.

Abstract
In this article, an algorithm to identify LPV State Space models for both continuous-time and discrete-time systems is proposed. The LPV state space system is in the Companion Reachable Canonical Form. The output vector coefficients are linear combinations of a set of a possibly infinite number of nonlinear basis functions dependent on the scheduling signal, the state matrix is either time invariant or a linear combination of a finite number of basis functions of the scheduling signal and the input vector is time invariant. This model structure, although simple, can describe accurately the behaviour of many nonlinear SISO systems by an adequate choice of the scheduling signal. It also partially solves the problems of structural bias caused by inaccurate selection of the basis functions and high variance of the estimates due to over-parameterisation. The use of an infinite number of basis functions in the output vector increases the flexibility to describe complex functions and makes it possible to learn the underlying dependencies of these coefficients from the data. A Least Squares Support Vector Machine (LS-SVM) approach is used to address the infinite dimension of the output coefficients. Since there is a linear dependence of the output on the output vector coefficients and, on the other hand, the LS-SVM solution is a nonlinear function of the state and input matrix coefficients, the LPV system is identified by minimising a quadratic function of the output function in a reduced parameter space; the minimisation of the error is performed by a separable approach where the parameters of the fixed matrices are calculated using a gradient method. The derivatives required by this algorithm are the output of either an LTI or an LPV (in the case of a time-varying SS matrix) system, that need to be simulated at every iteration. The effectiveness of the algorithm is assessed on several simulated examples.