Piecewise Function Evaluation Method Based on Binary Search Trees and the Approach Removing Saturated Regions in Explicit MPC
محل انتشار: دومین کنفرانس بین المللی مهندسی برق
سال انتشار: 1396
نوع سند: مقاله کنفرانسی
زبان: انگلیسی
مشاهده: 477
فایل این مقاله در 6 صفحه با فرمت PDF قابل دریافت می باشد
- صدور گواهی نمایه سازی
- من نویسنده این مقاله هستم
استخراج به نرم افزارهای پژوهشی:
شناسه ملی سند علمی:
ICELE02_282
تاریخ نمایه سازی: 7 اسفند 1396
چکیده مقاله:
Despite practical obstacles in implementation of explicit model predictive control (MPC), it has consistently been attractive. Complexity reduction approaches for explicit MPC has recently been emerged as techniques to enhance applicability of MPC. Individual deployment of the approaches has not had enough effect on complexity reduction. In this paper, merging the approaches based on complexity reduction is addressed. The binary search tree and complexity reduction via separation are efficient methods which can be confined to small problems, but merging them can result in significant effect and expansion of its applicability. The simulation tests show proposed approach significantly outperforms previous methods
کلیدواژه ها:
نویسندگان
Jamal Arezoo
Department of Automation and Instrumentation, Petroleum University of Technology, Iran
Karim Salahshoor
Department of Automation and Instrumentation, Petroleum University of Technology، Iran