اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدMultiple Loop Self-Triggered Model Predictive Control for Network Scheduling and Control
250
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
We present an algorithm for controlling and scheduling multiple linear time-invariant processes on a shared bandwidth limited communication network using adaptive sampling intervals. The controller is centralized and computes at every sampling instant not only the new control command for a process, but also decides the time interval to wait until taking the next sample. The approach relies on model predictive control ideas, where the cost function penalizes the state and control effort as well as the time interval until the next sample is taken. The latter is introduced in order to generate an adaptive sampling scheme for the overall system such that the sampling time increases as the norm of the system state goes to zero. The paper presents a method for synthesizing such a predictive controller and gives explicit sufficient conditions for when it is stabilizing. Further explicit conditions are given which guarantee conflict free transmissions on the network. It is shown that the optimization problem may be solved off-line and that the controller can be implemented as a lookup table of state feedback gains. Simulation studies which compare the proposed algorithm to periodic sampling illustrate potential performance gains.
قيم البحث
اقرأ أيضاً
A stochastic model predictive control (SMPC) approach is presented for discrete-time linear systems with arbitrary time-invariant probabilistic uncertainties and additive Gaussian process noise. Closed-loop stability of the SMPC approach is establish
ed by appropriate selection of the cost function. Polynomial chaos is used for uncertainty propagation through system dynamics. The performance of the SMPC approach is demonstrated using the Van de Vusse reactions.
A new distributed MPC algorithm for the regulation of dynamically coupled subsystems is presented in this paper. The current control action is computed via two robust controllers working in a nested fashion. The inner controller builds a nominal refe
rence trajectory from a decentralized perspective. The outer controller uses this information to take into account the effects of the coupling and generate a distributed control action. The tube-based approach to robustness is employed. A supplementary constraint is included in the outer optimization problem to provide recursive feasibility of the overall controller
In this paper, we propose a new self-triggered formulation of Model Predictive Control for continuous-time linear networked control systems. Our control approach, which aims at reducing the number of transmitting control samples to the plant, is deri
ved by parallelly solving optimal control problems with different sampling time intervals. The controller then picks up one sampling pattern as a transmission decision, such that a reduction of communication load and the stability will be obtained. The proposed strategy is illustrated through comparative simulation examples.
It has been shown that self-triggered control has the ability to reduce computational loads and deal with the cases with constrained resources by properly setting up the rules for updating the system control when necessary. In this paper, self-trigge
red stabilization of Boolean control networks (BCNs), including deterministic BCNs, probabilistic BCNs and Markovian switching BCNs, is first investigated via semi-tensor product of matrices and Lyapunov theory of Boolean networks. The self-triggered mechanism with the aim to determine when the controller should be updated is given based on the decrease of the corresponding Lyapunov functions between two successive sampling times. We show that the self-triggered controllers can be chosen as the conventional controllers without sampling, and also can be optimally constructed based on the triggering conditions.
The coordination of highly automated vehicles (or agents) in road intersections is an inherently nonconvex and challenging problem. In this paper, we propose a distributed motion planning scheme under reasonable vehicle-to-vehicle communication requi
rements. Each agent solves a nonlinear model predictive control problem in real time and transmits its planned trajectory to other agents, which may have conflicting objectives. The problem formulation is augmented with conditional constraints that enable the agents to decide whether to wait at a stopping line, if safe crossing is not possible. The involved nonconvex problems are solved very efficiently using the proximal averaged Newton method for optimal control (PANOC). We demonstrate the efficiency of the proposed approach in a realistic intersection crossing scenario.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
