On Polynomial Controllability with Polynomial State for Linear Constant Systems

G. Langholz; A. Ailon; L. Baratchart; J. Grimm; G. Langholz

doi:10.1109/TAC.1986.1104210

On Polynomial Controllability with Polynomial State for Linear Constant Systems

G. Langholz, A. Ailon, L. Baratchart, J. Grimm, G. Langholz

Research output: Contribution to journal › Article › peer-review

18 Scopus citations

Abstract

We prove in this note that for linear, reachable, time independent dynamic systems, control at any given time may be achieved with the additional requirements that both the input and the state be polynomial functions of time. The proof is constructive and elementary, and yields a bound on the degree.

Original language	English
Pages (from-to)	155-156
Number of pages	2
Journal	IEEE Transactions on Automatic Control
Volume	31
Issue number	2
DOIs	https://doi.org/10.1109/TAC.1986.1104210
State	Published - 1 Jan 1986
Externally published	Yes

ASJC Scopus subject areas

Control and Systems Engineering
Computer Science Applications
Electrical and Electronic Engineering

Access to Document

10.1109/TAC.1986.1104210

Cite this

@article{5f36a29b49da4dca8c2611a180c97758,

title = "On Polynomial Controllability with Polynomial State for Linear Constant Systems",

abstract = "We prove in this note that for linear, reachable, time independent dynamic systems, control at any given time may be achieved with the additional requirements that both the input and the state be polynomial functions of time. The proof is constructive and elementary, and yields a bound on the degree.",

author = "G. Langholz and A. Ailon and L. Baratchart and J. Grimm and G. Langholz",

year = "1986",

month = jan,

day = "1",

doi = "10.1109/TAC.1986.1104210",

language = "English",

volume = "31",

pages = "155--156",

journal = "IEEE Transactions on Automatic Control",

issn = "0018-9286",

publisher = "Institute of Electrical and Electronics Engineers",

number = "2",

}

TY - JOUR

T1 - On Polynomial Controllability with Polynomial State for Linear Constant Systems

AU - Langholz, G.

AU - Ailon, A.

AU - Baratchart, L.

AU - Grimm, J.

AU - Langholz, G.

PY - 1986/1/1

Y1 - 1986/1/1

N2 - We prove in this note that for linear, reachable, time independent dynamic systems, control at any given time may be achieved with the additional requirements that both the input and the state be polynomial functions of time. The proof is constructive and elementary, and yields a bound on the degree.

AB - We prove in this note that for linear, reachable, time independent dynamic systems, control at any given time may be achieved with the additional requirements that both the input and the state be polynomial functions of time. The proof is constructive and elementary, and yields a bound on the degree.

UR - http://www.scopus.com/inward/record.url?scp=0022669810&partnerID=8YFLogxK

U2 - 10.1109/TAC.1986.1104210

DO - 10.1109/TAC.1986.1104210

M3 - Article

AN - SCOPUS:0022669810

SN - 0018-9286

VL - 31

SP - 155

EP - 156

JO - IEEE Transactions on Automatic Control

JF - IEEE Transactions on Automatic Control

IS - 2

ER -

On Polynomial Controllability with Polynomial State for Linear Constant Systems

Abstract

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this