Minimum-time control of Boolean networks: An algebraic approach

Dmitriy Laschov, Michael Margaliot

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

We consider the problem of steering a Boolean control network (BCN) between two given states in minimal time. Using the algebraic state-space representation (ASSR) of BCNs, we derive several necessary conditions for a control to be time-optimal. In the ASSR, every state and input vector is a canonical vector. Using this special structure yields an explicit state-feedback formula for all time-optimal controls.

Original languageEnglish
Title of host publication53rd IEEE Conference on Decision and Control,CDC 2014
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages1545-1550
Number of pages6
EditionFebruary
ISBN (Electronic)9781479977468
DOIs
StatePublished - 2014
Event2014 53rd IEEE Annual Conference on Decision and Control, CDC 2014 - Los Angeles, United States
Duration: 15 Dec 201417 Dec 2014

Publication series

NameProceedings of the IEEE Conference on Decision and Control
NumberFebruary
Volume2015-February
ISSN (Print)0743-1546
ISSN (Electronic)2576-2370

Conference

Conference2014 53rd IEEE Annual Conference on Decision and Control, CDC 2014
Country/TerritoryUnited States
CityLos Angeles
Period15/12/1417/12/14

Fingerprint

Dive into the research topics of 'Minimum-time control of Boolean networks: An algebraic approach'. Together they form a unique fingerprint.

Cite this