Study of the connexity of the set of affine controllable systems

Abdelouahab Kadem (Department of Mathematics, Faculty of Sciences, University of Sétif, Sétif, Algeria)

Kybernetes

ISSN: 0368-492X

Publication date: 1 June 2006

Abstract

Purpose

This paper sets out to review a study of the set of affine controllable systems connexity denoted by Ca.

Design/methodology/approach

With each affine system a homogeneous system is associated. Jurdjevic and Sallet proved that, if a homogeneous system is controllable in R2−{0} and, if the affine system has not a fixed point, then the affine system is controllable in R2.

Findings

It is shown that these systems are denoted by S, and are dense in Ca.

Research limitations/implications

Allows one to tackle the problem by using the connexity of a dense set in S.

Originality/value

Succeeds in completing a study of the set of affine controllable systems connexity denoted by Ca.

Keywords

Citation

Kadem, A. (2006), "Study of the connexity of the set of affine controllable systems", Kybernetes, Vol. 35 No. 5, pp. 726-734. https://doi.org/10.1108/03684920610662476

Download as .RIS

Publisher

:

Emerald Group Publishing Limited

Copyright © 2006, Emerald Group Publishing Limited

Please note you might not have access to this content

You may be able to access this content by login via Shibboleth, Open Athens or with your Emerald account.
If you would like to contact us about accessing this content, click the button and fill out the form.
To rent this content from Deepdyve, please click the button.