Discrete-time network-based control under scheduling and actuator constraints
نویسندگان
چکیده
منابع مشابه
Discrete-time network-based control under scheduling and actuator constraints
This paper is concerned with the solution bounds for discrete-time networked control systems via delay-dependent Lyapunov–Krasovskii methods. Solution bounds are widely used for systems with input saturation caused by actuator saturation or by the quantizers with saturation. The time-delay approach has been developed recently for the stabilization of continuous-time networked control systems un...
متن کاملDiscrete-Time Scheduling under Real-Time Constraints
We introduce a new method for scheduling under real-time constraints that is suitable for synchronous system implementations. The input specification is in the form of timing diagrams in which the occurrence times of signal transitions or actions are related by linear constraints, expressing the assumptions on the input actions (the environment) and the commitments on the output actions. Provid...
متن کاملReal-Time Scheduling Under Time-Interval Constraints
This paper presents a new task model where jobs are divided into segments A, B and C. Segment B has a specific time-interval where it should execute to fulfill some application constraints. We consider the execution of B as valid if performed inside that time-interval, otherwise, its contribution may be valueless to its task. We adapt some scheduling approaches from the literature and present a...
متن کاملFlexible job shop scheduling under availability constraints
In this paper, an exact geometric algorithm is presented for solving two-job sequencing and scheduling problems in flexible flow shop and job shop environments while the resources are (un)available in some time periods and processors (un)availability is the same in all work centers. This study seems utterly new and it is applicable to any performance measure based on the completion time. The in...
متن کاملMulticast Rate Control under Discrete Bandwidth Constraints
In this paper, we address the rate control problem for layered multicast sessions, with the objective of solving a generalized throughput/fairness objective. Our approach is based on a combination of Lagrangian relaxation and dynamic programming. Unlike previously proposed dual-based approaches, the algorithm presented in this paper scales well as the number of multicast sessions in the network...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Robust and Nonlinear Control
سال: 2014
ISSN: 1049-8923
DOI: 10.1002/rnc.3179