Open Access. Powered by Scholars. Published by Universities.®

Digital Commons Network

Open Access. Powered by Scholars. Published by Universities.®

Articles 1 - 2 of 2

Full-Text Articles in Entire DC Network

Feedback Linearizable Feedforward Systems: A Special Class, Issa Amadou Tall Jul 2010

Feedback Linearizable Feedforward Systems: A Special Class, Issa Amadou Tall

Articles and Preprints

The problem of feedback linearizability of systems in feedforward form is addressed and an algorithm providing explicit coordinates change and feedback given. At each step, the algorithm replaces the involutive conditions of feedback linearization by some, easily checkable. We also reconsider type II subclass of linearizable strict feedforward systems introduced by Krstic and we show that it constitutes the only linearizable among the class of quasilinear strict feedforward systems. Our results allow an easy computation of the linearizing coordinates and thus provide a stabilizing feedback controller for the original system among others. We illustrate by few examples including the VTOL.


On K-Minimum And M-Minimum Edge-Magic Injections Of Graphs, John P. Mcsorley, John A. Trono Jan 2010

On K-Minimum And M-Minimum Edge-Magic Injections Of Graphs, John P. Mcsorley, John A. Trono

Articles and Preprints

An edge-magic total labelling (EMTL) of a graph G with n vertices and e edges is an injection λ:V(G) ∪ E(G)→[n+e], where, for every edge uvE(G), we have wtλ(uv)=kλ, the magic sum of λ. An edge-magic injection (EMI) μ of G is an injection μ : V(G) ∪ E(G) → N with magic sum kμ and largest label mμ. For a graph G we define and study the …