Reference Output Tracking in Boolean Control Networks

TL;DR

This paper investigates how to track reference output trajectories in Boolean control networks using algebraic methods, extending existing algorithms to handle arbitrary initial conditions and periodic trajectories, with practical illustration.

Contribution

It introduces extended algorithms for reference output tracking in Boolean control networks, accommodating arbitrary initial states and periodic trajectories, improving upon previous methods.

Findings

Extended algorithms successfully handle arbitrary initial conditions.

The approach effectively manages periodic reference trajectories.

Illustrative example demonstrates practical applicability.

Abstract

In this paper, the problem of tracking a given reference output trajectory is investigated for the class of Boolean control networks, by resorting to their algebraic representation. First, the case of a finite-length reference trajectory is addressed, and the analysis and algorithm first proposed in [17] are extended to be able to deal with arbitrary initial conditions and to identify all possible solutions. The approach developed for the finite-length case is then adjusted to cope with periodic reference output trajectories. The results of the paper are illustrated through an example.