By Topic

Managing time-storage complexity in point location problem: Application to explicit model predictive control

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Farhad Bayat ; Department of Electrical Engineering, Iran University of Science and Technology, Narmak, 1684613114 Tehran, Iran ; Tor Arne Johansen ; Ali Akbar Jalali

The online computational burden of linear model predictive control (MPC) can be moved offline by using multi-parametric programming, so called explicit MPC. The explicit MPC is a piecewise affine (PWA) function defined over a polyhedral subdivision of the set of feasible states. The online evaluation of such a control law needs to determine the polyhedral region in which the current state lies. This procedure is called the point location problem and its computational complexity is challenging. In this paper a new flexible algorithm is proposed which enables the designer to tradeoff between time and storage complexities. Utilizing the concept of hash tables and the associate hash functions the proposed method is modified to solve an aggregated point location problem in processing complexity independent of the number of polyhedral regions while the storage needs remains tractable. The effectiveness of this approach is supported by several numerical examples.

Published in:

Control & Automation (MED), 2010 18th Mediterranean Conference on

Date of Conference:

23-25 June 2010