Jorge L. Martins de Carvalho

Jorge L. Martins de Carvalho

Auto-generated profile, based on publicly available information

Jorge L. Martins de Carvalho

Faculdade de Engenharia da Universidade do Porto, Portugal

Research Focus & Metrics

Academic Career Length

39Years (1988-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
14 October 2010 in IEEE Transactions on Control Systems Technology
Verified
Journal Article
Closed access
PSPaulo Lopes dos Santos
Paulo Lopes dos Santos
Teresa Paula PerdicoúlisTeresa Paula Perdicoúlis
Teresa Paula Perdicoúlis
JRJosé A. Ramos
José A. Ramos
JCJ. L. Martins de Carvalho
J. L. Martins de Carvalho
GJGerhard Jank
Gerhard Jank
JMJ. Milhinhos
J. Milhinhos
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.

30 June 2009 in IEEE Transactions on Control Systems Technology
Verified
Journal Article
Closed access
PSPaulo Lopes dos Santos
Paulo Lopes dos Santos
JRJosé A. Ramos
José A. Ramos
JCJorge L. Martins de Carvalho
Jorge L. Martins de Carvalho
In this technical brief, a new subspace state space system identification algorithm for multi input multi output bilinear systems driven by white noise inputs is introduced. The new algorithm is based on a uniformly convergent Picard sequence of linear deterministic stochastic state space subsystems which are easily identifiable by any linear deterministic stochastic subspace algorithm such as MOESP, N4SID, CVA, or CCA. The key to the proposed algorithm is the fact that the bilinear term is a second order white noise process. Using a standard linear Kalman filter model, the bilinear term can be estimated and combined with the system inputs at each iteration, thus leading to a linear system with extended inputs of dimension m(n + 1), where n is the system order and m is the dimension of the inputs. It is also shown that the model parameters obtained with the new algorithm converge to those of the true bilinear model. Moreover, the proposed algorithm has the same consistency conditions as the linear subspace identification algorithms when i ¿ ¿, where i is the number of block rows in the past/future block Hankel data matrices. Typical bilinear subspace identification algorithms available in the literature cannot handle large values of i, thus leading to biased parameter estimates. Unlike existing bilinear subspace identification algorithms whose row dimensions in the data matrices grow exponentially, and hence suffer from the ¿curse of dimensionality,¿ in the proposed algorithm the dimensions of the data matrices are comparable to those of a linear subspace identification algorithm. A case study is presented with data from a heat exchanger experiment.

1 January 1993 in IEEE Transactions on Education
Verified
Journal Article
Closed access
Jose Antonio Tenreiro MachadoJose Antonio Tenreiro Machado
Jose Antonio Tenreiro Machado
JCJ.L.M. de Carvalho
J.L.M. de Carvalho
Alexandra M.S.F. GalhanoAlexandra M.S.F. Galhano
Alexandra M.S.F. Galhano
A classical analysis of the dynamics of robot manipulators is presented. It is shown that these systems have configuration-dependent properties and can be open-loop unstable. Due to this fact, present day linear controllers are inefficient. On the other hand, nonlinear hardware and software compensation methods also are shown to have some limitations. Controllers based on the direct design algorithm and the computed torque method have superior performances. These algorithms have nonlinear loops, yet it is shown that a linear analysis is still feasible. Therefore, classical design tools can be adopted in order to develop practical implementationsinfo:eu-repo/semantics/publishedVersio

1 December 2011 in Communications in Nonlinear Science and Numerical Simulation
Verified
Journal Article
Closed access
PSP. Lopes dos Santos
P. Lopes dos Santos
Teresa Paula PerdicoúlisTeresa Paula Perdicoúlis
Teresa Paula Perdicoúlis
GJG. Jank
G. Jank
JRJ.A. Ramos
J.A. Ramos
JCJ.L. Martins de Carvalho
J.L. Martins de Carvalho

1 September 2001
Verified
Conference Paper
Closed access
LFLino Figueiredo
Lino Figueiredo
Isabel S. JesusIsabel S. Jesus
Isabel S. Jesus
Jose Antonio Tenreiro MachadoJose Antonio Tenreiro Machado
Jose Antonio Tenreiro Machado
JFJosé Rui Rocha Pinto Ferreira
José Rui Rocha Pinto Ferreira
JCJ. L. Martins de Carvalho
J. L. Martins de Carvalho

1 January 2008
Verified
Conference Paper
Closed access
PSP. Lopes dos Santos
P. Lopes dos Santos
JRJ. A. Ramos
J. A. Ramos
JCJ. L. Martins de Carvalho
J. L. Martins de Carvalho
In this paper a successive approximation approach for MIMO linear parameter varying (LPV) systems with affine parameter dependence is proposed. This new approach is based on an algorithm previously introduced by the authors, which elaborates on a convergent sequence of linear deterministic-stochastic state-space approximations. In the previous algorithm the bilinear term between the time varying parameter vector and the state vector is allowed to behave as a white noise process when the scheduling parameter is a white noise sequence. However, this is a strong limitation in practice since, most often than not, the scheduling parameter is imposed by the process itself and it is typically a non white noise signal. In this paper, the bilinear term is analysed for non white noise scheduling sequences. It is concluded that its behaviour depends on the input sequence itself and it ranges from acting as an independent colored noise source, mostly removed by the identification algorithm, down to a highly input correlated signal that may be incorrectly assumed as being part of the system subspace. Based on the premise that the algorithm performance can be improved by the noise energy reduction, the bilinear term is expressed as a function of past inputs, scheduling parameters, outputs, and states, and the linear terms are included in a new extended input.