The University of Southampton
University of Southampton Institutional Repository

On reachable sets for positive linear systems under constrained exogenous inputs

On reachable sets for positive linear systems under constrained exogenous inputs
On reachable sets for positive linear systems under constrained exogenous inputs
This paper focuses on positive linear time-invariant systems with constant coefficients and specific exogenous disturbance. The problem of finding a hyper-pyramid to bound the set of the states that are reachable from the origin in the Euclidean space is addressed, subject to inputs whose View the MathML source(1,1)-norm or View the MathML source(?,1)-norm is bounded by a prescribed constant. The Lyapunov approach is applied and a bounding hyper-pyramid is obtained by solving a set of inequalities. Iterative procedures (with an adjustable parameter) for reducing the hyper-volume of the bounding hyper-pyramid for the reachable set are proposed.
0005-1098
230-237
Du, Baozhu
aaaf0aa4-111f-4912-b78e-bf7a841d5728
Lam, James
3eea3836-efda-430c-9ad4-ae4f3d4b8c4a
Shu, Zhan
ea5dc18c-d375-4db0-bbcc-dd0229f3a1cb
Chen, Yong
080582eb-3fa5-414c-bb62-1c60b2fe6498
Du, Baozhu
aaaf0aa4-111f-4912-b78e-bf7a841d5728
Lam, James
3eea3836-efda-430c-9ad4-ae4f3d4b8c4a
Shu, Zhan
ea5dc18c-d375-4db0-bbcc-dd0229f3a1cb
Chen, Yong
080582eb-3fa5-414c-bb62-1c60b2fe6498

Du, Baozhu, Lam, James, Shu, Zhan and Chen, Yong (2016) On reachable sets for positive linear systems under constrained exogenous inputs. Automatica, 74, 230-237. (doi:10.1016/j.automatica.2016.07.048).

Record type: Article

Abstract

This paper focuses on positive linear time-invariant systems with constant coefficients and specific exogenous disturbance. The problem of finding a hyper-pyramid to bound the set of the states that are reachable from the origin in the Euclidean space is addressed, subject to inputs whose View the MathML source(1,1)-norm or View the MathML source(?,1)-norm is bounded by a prescribed constant. The Lyapunov approach is applied and a bounding hyper-pyramid is obtained by solving a set of inequalities. Iterative procedures (with an adjustable parameter) for reducing the hyper-volume of the bounding hyper-pyramid for the reachable set are proposed.

Text
15-1403_03_MS.pdf - Accepted Manuscript
Download (673kB)

More information

Accepted/In Press date: 7 July 2016
e-pub ahead of print date: 3 October 2016
Published date: October 2016
Organisations: Mechatronics

Identifiers

Local EPrints ID: 397968
URI: http://eprints.soton.ac.uk/id/eprint/397968
ISSN: 0005-1098
PURE UUID: 023aa668-db2f-48b3-bc4f-b08b714be713
ORCID for Zhan Shu: ORCID iD orcid.org/0000-0002-5933-254X

Catalogue record

Date deposited: 13 Jul 2016 09:16
Last modified: 07 Oct 2020 05:47

Export record

Altmetrics

Contributors

Author: Baozhu Du
Author: James Lam
Author: Zhan Shu ORCID iD
Author: Yong Chen

University divisions

Download statistics

Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.

View more statistics

Atom RSS 1.0 RSS 2.0

Contact ePrints Soton: eprints@soton.ac.uk

ePrints Soton supports OAI 2.0 with a base URL of http://eprints.soton.ac.uk/cgi/oai2

This repository has been built using EPrints software, developed at the University of Southampton, but available to everyone to use.

We use cookies to ensure that we give you the best experience on our website. If you continue without changing your settings, we will assume that you are happy to receive cookies on the University of Southampton website.

×