Abstract

In this thesis, we show that the problem of designing a switching policy for an adaptive switching control system can be formulated as a problem of Supervisory Control of a Discrete-Event System (DES). Two important problems in switching control are then addressed using the DES formulation and the theory of supervisory control under partial observation. First we examine whether for a given set of controllers, a switching policy satisfying a given set of constraints (on the transitions among controllers) exists. If so, then we design a minimally restrictive switching policy. Next, we introduce an iterative algorithm for finding a minimal set of controllers for which a switching policy satisfying the switching constraints exists. In our study we show that in the supervisory control problem considered in this thesis, limitation on event observation is the factor that essentially restricts supervisory control. In other words, once observation limitations are respected, limitation on control will be automatically satisfied. We use the above result to simplify our iterative algorithm for finding minimal controller set.