arrow
返回

Optimal switching with minimum dwell time constraint

delete2017-07-01
delete24
delete
OA
AI
A
Ali Heydari *
DOI:10.1016/j.jfranklin.2017.04.015delete
delete原文链接
delete分享
delete收藏
查看原文
摘要

摘要

En 中文
The problem of optimal switching between different subsystems/configurations with minimum dwell time constraints is investigated in this study and a feedback solution, using the framework of approximate dynamic programming, is proposed. The method calls for a tuning stage in which parameters of a function approximator are tuned. Online control will then be conducted with a computational load as low as evaluating a few scalar-valued functions. Finite-horizon and infinite-horizon cost functions are investigated and convergence and stability are analyzed considering the presence of approximation errors. Moreover, the case of applying a full or partial constraint on the mode sequence, as well as having a mode-dependent minimum dwell time are investigated. Finally, performance of the scheme in handling different challenges is numerically evaluated through different examples. (C) 2017 The Franklin Institute. Published by Elsevier Ltd. All rights reserved.
Keyword:
NONLINEAR-SYSTEMS
CONTROL SCHEME
TRACKING
DESIGN
AI总结

AI总结

对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。

期刊

J
Journal of the Franklin Institute-Engineering and Applied Mathematics
IF:
3.7
论文数:
6.4K
被引数:
1.5W

机构

S
Southern Methodist University
学者数:
3.0K
论文数: 3.5K
被引数: 3.9K
引用论文

引用论文

学者 查看更多内容