Exploració per autor "Ortega, Romeo"

Ara es mostren els items 33-36 de 36

    • Simultaneous Interconnection and Damping Assignment Passivity-Based Control: Two Practical Examples 

      Batlle Arnau, Carles; Dòria Cerezo, Arnau; Espinosa Pérez, Gerardo; Ortega, Romeo (Springer Verlag, 2007-10)
      Capítol de llibre
      Accés obert
      Passivity-based control (PBC) is a generic name given to a family of controller design techniques that achieves system stabilization via the route of passivation, that is, rendering the closed-loop system passive with a ...

    • Study of the stability of a direct stator current controller for a doubly fed induction machine using the complex hurwitz test 

      Dòria Cerezo, Arnau; Bodson, Marc; Batlle Arnau, Carles; Ortega, Romeo (2013-11)
      Article
      Accés restringit per política de l'editorial
      In this brief, a new control scheme is presented for the doubly fed induction machine (DFIM). The proposed control algorithm offers the advantages of proven stability and remarkable simplicity. In contrast to the classical ...

    • Theory and experimental results of two dynamic energy routers 

      Ramirez, Victor; Ortega, Romeo; Griñó Cubero, Robert; Sánchez-Squella, Antonio; Bethoux, Olivier (IEEE Press. Institute of Electrical and Electronics Engineers, 2012)
      Text en actes de congrés
      Accés restringit per política de l'editorial
      Efficient regulation of the energy transfer between generating, storage and load subsystems is a topic of current practical interest. A new strategy to achieve this objective, together with its corresponding power ...

    • Trajectory tracking and consensus of networks of Euler–Lagrange systems 

      Nuño Ortega, Emmanuel; Ortega, Romeo; Basañez Villaluenga, Luis; Hill, David (Curran, 2011)
      Text en actes de congrés
      Accés restringit per política de l'editorial
      This paper addresses the problem of synchronizing networks of nonidentical, nonlinear dynamical systems described by Euler–Lagrange equations. It is assumed that the communication graph is simply connected and that the ...