A graph-theoretic approach to the reach control problem

Melkior Ornik, Mireille E. Broucke

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

This paper establishes new necessary and sufficient conditions for the solvability of the Reach Control Problem (RCP). The RCP seeks to drive the trajectories of a control system defined on a simplex to leave this simplex through a predetermined facet. This paper takes a novel approach to the RCP, transforming it into a problem in positive system theory. Using the notions of Z-matrices and graph theory, this results in a number of new necessary and sufficient conditions for the solvability of the RCP. In parallel, we also examine open-loop equilibria in the RCP, and provide a number of necessary and sufficient conditions for their existence.

Original languageEnglish (US)
Title of host publication2017 IEEE 56th Annual Conference on Decision and Control, CDC 2017
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages4952-4957
Number of pages6
ISBN (Electronic)9781509028733
DOIs
StatePublished - Jan 18 2018
Externally publishedYes
Event56th IEEE Annual Conference on Decision and Control, CDC 2017 - Melbourne, Australia
Duration: Dec 12 2017Dec 15 2017

Publication series

Name2017 IEEE 56th Annual Conference on Decision and Control, CDC 2017
Volume2018-January

Other

Other56th IEEE Annual Conference on Decision and Control, CDC 2017
CountryAustralia
CityMelbourne
Period12/12/1712/15/17

ASJC Scopus subject areas

  • Decision Sciences (miscellaneous)
  • Industrial and Manufacturing Engineering
  • Control and Optimization

Fingerprint Dive into the research topics of 'A graph-theoretic approach to the reach control problem'. Together they form a unique fingerprint.

Cite this