Jorge L. Martins de Carvalho
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Jorge L. Martins de Carvalho has a total of 29 co-authors. Here are the top co-authors by number of shared publications:
- Paulo Lopes dos Santos
Faculdade de Engenharia da Universidade do Porto
17 shared publications - Teresa Paula Azevedo Perdicoúlis
Universidade de Trás-os-Montes e Alto Douro, UTAD
10 shared publications - Jose Antonio Tenreiro Machado
Institute of Engineering, Polytechnic of Porto, Department of Electrical Engineering, Porto, Portugal
7 shared publications J. A. Ramos
Farquhar College of Arts and Sciences, Division of Mathematics, Science, and Technology, Nova Southeastern University, 3301 College Avenue, Fort Lauderdale, FL 33314, USA
6 shared publications- Jose A. Ramos
College of Computing and Engineering, Nova Southeastern University, Davie, FL 33314, USA
4 shared publications A.M.F. Galhano
Faculty of Engineering of the University of Porto, Department of Electrical and Computer Engineering, 4099 Porto Codex, Portugal
3 shared publications
Latest Publications
- 1 July 2015
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1107-1112
Deriving mechanical structures in physical coordinates from data-driven state-space realizations
In this article, the problem of deriving a physical model of a mechanical structure from an arbitrary state-space realization is addressed. As an alternative to finite element formulations, the physical parameters of a model may be directly obtained from identified parametric models. However, these methods are limited by the number of available sensors and often lead to poor predictive models. Additionally, the most efficient identification algorithms retrieve models where the physical parameters are hidden. This last difficulty is known in the literature as the inverse vibration problem. In this work, an approach to the inverse vibration problem is proposed. It is based on a similarity transformation and the requirement that every degree of freedom should contain a sensor and an actuator (full instrumented system) is relaxed to a sensor or an actuator per degree of freedom, with at least one co-located pair (partially instrumented system). The physical parameters are extracted from a state-space realization of the former system. It is shown that this system has a symmetric transfer function and this symmetry is exploited to derive a state-space realization from an identified model of the partially instrumented system. A subspace continuous-time system identification algorithm previously proposed by the authors in [1] is used to estimate this model from the IO data.
- 1 July 2015
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1107-1112
Deriving mechanical structures in physical coordinates from data-driven state-space realizations
In this article, the problem of deriving a physical model of a mechanical structure from an arbitrary state-space realization is addressed. As an alternative to finite element formulations, the physical parameters of a model may be directly obtained from identified parametric models. However, these methods are limited by the number of available sensors and often lead to poor predictive models. Additionally, the most efficient identification algorithms retrieve models where the physical parameters are hidden. This last difficulty is known in the literature as the inverse vibration problem. In this work, an approach to the inverse vibration problem is proposed. It is based on a similarity transformation and the requirement that every degree of freedom should contain a sensor and an actuator (full instrumented system) is relaxed to a sensor or an actuator per degree of freedom, with at least one co-located pair (partially instrumented system). The physical parameters are extracted from a state-space realization of the former system. It is shown that this system has a symmetric transfer function and this symmetry is exploited to derive a state-space realization from an identified model of the partially instrumented system. A subspace continuous-time system identification algorithm previously proposed by the authors in [1] is used to estimate this model from the IO data.
- 1 December 2014
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 403 (01912216) , 2548-2554
LPV system identification using a separable least squares support vector machines approach
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.
- 1 December 2014
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 403 (01912216) , 2548-2554
LPV system identification using a separable least squares support vector machines approach
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.
- 1 December 2013
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 4104-4109
Identification of LPV State Space systems by a separable least squares approach
In this article, an algorithm to identify LPV State Space models is proposed. The LPV State Space system is in the companion reachable canonical form. Both the state matrix and the output vector coefficients are linear combinations of a set of nonlinear basis functions dependent on the scheduling signal. This model structure, although simple, can describe accurately the behaviour of many nonlinear systems by an adequate choice of the scheduling signal. The identification algorithm minimises a quadratic criterion of the output error. Since this error is a linear function of the output vector parameters, a separable nonlinear least squares approach is used to minimise the criterion function by a gradient method. The derivatives required by the algorithm are the states of LPV systems that need to be simulated at every iteration. The effectiveness of the algorithm is assessed by two simulated examples.
- 1 December 2013
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 4104-4109
Identification of LPV State Space systems by a separable least squares approach
In this article, an algorithm to identify LPV State Space models is proposed. The LPV State Space system is in the companion reachable canonical form. Both the state matrix and the output vector coefficients are linear combinations of a set of nonlinear basis functions dependent on the scheduling signal. This model structure, although simple, can describe accurately the behaviour of many nonlinear systems by an adequate choice of the scheduling signal. The identification algorithm minimises a quadratic criterion of the output error. Since this error is a linear function of the output vector parameters, a separable nonlinear least squares approach is used to minimise the criterion function by a gradient method. The derivatives required by the algorithm are the states of LPV systems that need to be simulated at every iteration. The effectiveness of the algorithm is assessed by two simulated examples.
- 1 November 2012
- Published by Elsevier in Control Engineering Practice
- Vol. 20 (11) , 1156-1164
Identification of a Benchmark Wiener–Hammerstein: A bilinear and Hammerstein–Bilinear model approach
- 1 November 2012
- Published by Elsevier in Control Engineering Practice
- Vol. 20 (11) , 1156-1164
Identification of a Benchmark Wiener–Hammerstein: A bilinear and Hammerstein–Bilinear model approach
- 1 July 2012
- Published by Elsevier in IFAC Proceedings Volumes
- Vol. 45 (16) , 1755-1760
Identification of LPV Systems with non-white noise scheduling sequences
- 1 July 2012
- Published by Elsevier in IFAC Proceedings Volumes
- Vol. 45 (16) , 1755-1760
Identification of LPV Systems with non-white noise scheduling sequences
- 1 December 2011
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 6463-6468
Indirect continuous-time system identificationA subspace downsampling approach
This article presents a new indirect identification method for continuous-time systems able to resolve the problem of fast sampling. To do this, a Subspace IDentification Down-Sampling (SIDDS) approach that takes into consideration the intermediate sampling instants of the input signal is proposed. This is done by partitioning the data set into m subsets, where m is the downsampling factor. Then, the discrete-time model is identified using a based subspace identification discrete-time algorithm where the data subsets are fused into a single one. Using the algebraic properties of the system, some of the parameters of the continuous-time model are directly estimated. A procedure that secures a prescribed number of zeros for the continuous-time model is used during the estimation process. The algorithm's performance is illustrated through an example of fast sampling, where its performance is compared with the direct methods implemented in Contsid.
- 1 December 2011
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 6463-6468
Indirect continuous-time system identificationA subspace downsampling approach
This article presents a new indirect identification method for continuous-time systems able to resolve the problem of fast sampling. To do this, a Subspace IDentification Down-Sampling (SIDDS) approach that takes into consideration the intermediate sampling instants of the input signal is proposed. This is done by partitioning the data set into m subsets, where m is the downsampling factor. Then, the discrete-time model is identified using a based subspace identification discrete-time algorithm where the data subsets are fused into a single one. Using the algebraic properties of the system, some of the parameters of the continuous-time model are directly estimated. A procedure that secures a prescribed number of zeros for the continuous-time model is used during the estimation process. The algorithm's performance is illustrated through an example of fast sampling, where its performance is compared with the direct methods implemented in Contsid.
- 1 December 2011
- Published by Elsevier in Communications in Nonlinear Science and Numerical Simulation
- Vol. 16 (12) , 4657-4665
Leakage detection and location in gas pipelines through an LPV identification approach
- 1 December 2011
- Published by Elsevier in Communications in Nonlinear Science and Numerical Simulation
- Vol. 16 (12) , 4657-4665
Leakage detection and location in gas pipelines through an LPV identification approach
- Open Access
A note on the state-space realizations equivalence
In this note we resolve the problem of getting a state-space realization compatible with the deterministic state-space realization and the filtering problem.
Open AccessA note on the state-space realizations equivalence
In this note we resolve the problem of getting a state-space realization compatible with the deterministic state-space realization and the filtering problem.
- 1 December 2010
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 3487-3492
A lumped transfer function model for High Pressure Gas Pipelines
In this paper a lumped transfer function (TF) model is derived for High Pressure Natural Gas Pipelines. Departing from a nonlinear partial differential equation (PDE) model a high order continuous state space (SS) linear model is obtained using a finite difference method. An infinite order TF is calculated from the SS representation and finally is approximated by a compact non-rational function. This model is compared with SIMONE ® , a commercial simulator of gas transport and distribution, using a case study, and both exhibit a similar accuracy.
- 1 December 2010
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 3487-3492
A lumped transfer function model for High Pressure Gas Pipelines
In this paper a lumped transfer function (TF) model is derived for High Pressure Natural Gas Pipelines. Departing from a nonlinear partial differential equation (PDE) model a high order continuous state space (SS) linear model is obtained using a finite difference method. An infinite order TF is calculated from the SS representation and finally is approximated by a compact non-rational function. This model is compared with SIMONE ® , a commercial simulator of gas transport and distribution, using a case study, and both exhibit a similar accuracy.
- 14 October 2010
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Control Systems Technology
- Vol. 19 (1) , 77-92
An LPV Modeling and Identification Approach to Leakage Detection in High Pressure Natural Gas Transportation Networks
In this paper a new approach to gas leakage detection in high pressure natural gas transportation networks is proposed. The pipeline is modelled as a Linear Parameter Varying (LPV) System driven by the source node massflow with the gas inventory variation in the pipe (linepack variation, proportional to the pressure variation) as the scheduling parameter. The massflow at the offtake node is taken as the system output. The system is identified by the Successive Approximations LPV System Subspace Identification Algorithm which is also described in this paper. The leakage is detected using a Kalman filter where the fault is treated as an augmented state. Given that the gas linepack can be estimated from the massflow balance equation, a differential method is proposed to improve the leakage detector effectiveness. A small section of a gas pipeline crossing Portugal in the direction South to North is used as a case study. LPV models are identified from normal operational data and their accuracy is analyzed. The proposed LPV Kalman filter based methods are compared with a standard mass balance method in a simulated 10% leakage detection scenario. The Differential Kalman Filter method proved to be highly efficient.
- 14 October 2010
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Control Systems Technology
- Vol. 19 (1) , 77-92
An LPV Modeling and Identification Approach to Leakage Detection in High Pressure Natural Gas Transportation Networks
In this paper a new approach to gas leakage detection in high pressure natural gas transportation networks is proposed. The pipeline is modelled as a Linear Parameter Varying (LPV) System driven by the source node massflow with the gas inventory variation in the pipe (linepack variation, proportional to the pressure variation) as the scheduling parameter. The massflow at the offtake node is taken as the system output. The system is identified by the Successive Approximations LPV System Subspace Identification Algorithm which is also described in this paper. The leakage is detected using a Kalman filter where the fault is treated as an augmented state. Given that the gas linepack can be estimated from the massflow balance equation, a differential method is proposed to improve the leakage detector effectiveness. A small section of a gas pipeline crossing Portugal in the direction South to North is used as a case study. LPV models are identified from normal operational data and their accuracy is analyzed. The proposed LPV Kalman filter based methods are compared with a standard mass balance method in a simulated 10% leakage detection scenario. The Differential Kalman Filter method proved to be highly efficient.