Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userOptimal Scheduling for Linear-Rate Multi-Mode Systems
145
0
0.0
(
0
)
Added by
Dominik Wojtczak
Publication date
2013
fields
Informatics Engineering
and research's language is
English
Authors
Dominik Wojtczak
Ask ChatGPT about the research
No Arabic abstract
Linear-Rate Multi-Mode Systems is a model that can be seen both as a subclass of switched linear systems with imposed global safety constraints and as hybrid automata with no guards on transitions. We study the existence and design of a controller for this model that keeps the state of the system within a given safe set for the whole time. A sufficient and necessary condition is given for such a controller to exist as well as an algorithm that finds one in polynomial time. We further generalise the model by adding costs on modes and present an algorithm that constructs a safe controller which minimises the peak cost, the average-cost or any cost expressed as a weighted sum of these two. Finally, we present numerical simulation results based on our implementation of these algorithms.
rate research
Read More
In this paper, an optimal output consensus problem is studied for discrete-time linear multiagent systems subject to external disturbances. Each agent is assigned with a local cost function which is known only to itself. Distributed protocols are to be designed to guarantee an output consensus for these high-order agents and meanwhile minimize the aggregate cost as the sum of these local costs. To overcome the difficulties brought by high-order dynamics and external disturbances, we develop an embedded design and constructively present a distributed rule to solve this problem. The proposed control includes three terms: an optimal signal generator under a directed information graph, an observer-based compensator to reject these disturbances, and a reference tracking controller for these linear agents. It is shown to solve the formulated problem with some mild assumptions. A numerical example is also provided to illustrate the effectiveness of our proposed distributed control laws.
This article treats three problems of sparse and optimal multiplexing a finite ensemble of linear control systems. Given an ensemble of linear control systems, multiplexing of the controllers consists of an algorithm that selects, at each time (t), only one from the ensemble of linear systems is actively controlled whereas the other systems evolve in open-loop. The first problem treated here is a ballistic reachability problem where the control signals are required to be maximally sparse and multiplexed, the second concerns sparse and optimally multiplexed linear quadratic control, and the third is a sparse and optimally multiplexed Mayer problem. Numerical experiments are provided to demonstrate the efficacy of the techniques developed here.
The design of provably correct controllers for continuous-state stochastic systems crucially depends on approximate finite-state abstractions and their accuracy quantification. For this quantification, one generally uses approximate stochastic simulation relations, whose constant precision limits the achievable guarantees on the control design. This limitation especially affects higher dimensional stochastic systems and complex formal specifications. This work allows for variable precision by defining a simulation relation that contains multiple precision layers. For bi-layered simulation relations, we develop a robust dynamic programming approach yielding a lower bound on the satisfaction probability of temporal logic specifications. We illustrate the benefit of bi-layered simulation relations for linear stochastic systems in an example.
This paper investigates an optimal consensus problem for a group of uncertain linear multi-agent systems. All agents are allowed to possess parametric uncertainties that range over an arbitrarily large compact set. The goal is to collectively minimize a sum of local costs in a distributed fashion and finally achieve an output consensus on this optimal point using only output information of agents. By adding an optimal signal generator to generate the global optimal point, we convert this problem to several decentralized robust tracking problems. Output feedback integral control is constructively given to achieve an optimal consensus under a mild graph connectivity condition. The efficacy of this control is verified by a numerical example.
This study considers the problem of periodic event-triggered (PET) cooperative output regulation for a class of linear multi-agent systems. The advantage of the PET output regulation is that the data transmission and triggered condition are only needed to be monitored at discrete sampling instants. It is assumed that only a small number of agents can have access to the system matrix and states of the leader. Meanwhile, the PET mechanism is considered not only in the communication between various agents, but also in the sensor-to-controller and controller-to-actuator transmission channels for each agent. The above problem set-up will bring some challenges to the controller design and stability analysis. Based on a novel PET distributed observer, a PET dynamic output feedback control method is developed for each follower. Compared with the existing works, our method can naturally exclude the Zeno behavior, and the inter-event time becomes multiples of the sampling period. Furthermore, for every follower, the minimum inter-event time can be determined textit{a prior}, and computed directly without the knowledge of the leader information. An example is given to verify and illustrate the effectiveness of the new design scheme.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
