Article
Optimal Control of Constrained, Piecewise Affine Systems With
09/2002;
Source: CiteSeer
ABSTRACT
The solution to the problem of optimal control of piecewise affine systems with a bounded disturbance is characterised. Results that allow one to compute the value function, its domain (robustly controllable set) and the optimal control law are presented. The tools that are employed include dynamic programming, polytopic set algebra and parametric programming. When the cost is time (robust timeoptimal control problem) or the stage cost is piecewise affine (robust optimal and robust receding horizon control problems), the value function and the optimal control law are both piecewise affine and each robustly controllable set is the union of a finite set of polytopes. Conditions on the cost and constraints are also proposed in order to ensure that the optimal control laws are robustly stabilising.
 References (0)
 Cited In (4)

 "To solve this problem, we exploit the inherent freedom of the Lyapunov function V , captured by its stability tube: Theorem 3.2 ([8]) "
[Show abstract] [Hide abstract]
ABSTRACT: A given explicit piecewise affine representation of an MPC feedback law is approximated by a single polynomial, computed using linear programming. This polynomial state feedback control law guarantees closedloop stability and constraint satisfaction. The polynomial feedback can be implemented in real time even on very simple devices with severe limitations on memory storage.Automatica 10/2011; 47(10):22922297. DOI:10.1016/j.automatica.2011.08.023 · 3.02 Impact Factor  [Show abstract] [Hide abstract]
ABSTRACT: A cognitive radio network is a multiuser system, in which different users compete for limited resources in an opportunistic manner, interacting with each other for access to the available resources. The fact that both users and spectrum holes (i.e., unused spectrum subbands) can come and go makes a cognitive radio network a highly dynamic and challenging wireless environment. Therefore, finding robust resource allocation algorithms, which are capable of achieving reason ably good solutions fast enough in order to guarantee an acceptable level of performance under worst case interference conditions, is crucial in such environment. The focus of this paper is the transmitpower control in cognitive radio net works, considering a noncooperative framework. Moreover, tools from control theory are used to study both the equilib rium and transient behaviors of the network under dynamically varying conditions.  [Show abstract] [Hide abstract]
ABSTRACT: A cognitive radio network is a multiuser system, in which different users compete for limited resources in an opportunistic manner, interacting with each other for access to the available resources. The fact that both users and spectrum holes (i.e., unused spectrum subbands) can come and go makes a cognitive radio network a highly dynamic and challenging wireless environment. Therefore, finding robust resourceallocation algorithms, which are capable of achieving reasonably good solutions fast enough in order to guarantee an acceptable level of performance under worst case interference conditions, is crucial in such environment. The focus of this paper is the transmitpower control in cognitive radio networks, considering a noncooperative framework. Moreover, tools from control theory are used to study both the equilibrium and transient behaviors of the network under dynamically varying conditions.Proceedings of the IEEE 06/2009; 97(597):915  939. DOI:10.1109/JPROC.2009.2015718 · 4.93 Impact Factor
Similar Publications
Data provided are for informational purposes only. Although carefully collected, accuracy cannot be guaranteed. The impact factor represents a rough estimation of the journal's impact factor and does not reflect the actual current impact factor. Publisher conditions are provided by RoMEO. Differing provisions from the publisher's actual policy or licence agreement may be applicable.