arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1406.2744eess.SYcs.SY
收藏

通过爬山方法实现快速控制选择

Rapid Control Selection through Hill-Climbing Methods

University of Calgary(卡尔加里大学)

Krispin A. Davies, Alejandro Ramirez-Serrano, Graeme N. Wilson, Mahmoud Mustafa

AI总结:

本文研究了在复杂动态和环境场景中,通过爬山方法替代传统系统或随机搜索算法进行控制选择,证明其在高维控制空间中具有更高的搜索效率。

摘要:

本文研究了在复杂动态和环境场景中,通过爬山方法替代传统系统或随机搜索算法进行控制选择的问题。由于模型预测控制(MPC)的性能高度依赖于其所采用的搜索算法的效率,本文考察了爬山方法作为传统系统或随机搜索算法的替代方案。在一系列系统测试和现实世界控制场景中,对比了候选爬山算法与代表性系统和随机算法的相对性能。这些测试表明,当控制空间具有大量维度或每个维度的划分较多时,爬山方法能显著提高搜索效率。此外,这还表明,考虑的控制配置数量显著增加时,搜索时间的增加非常有限。

英文摘要:

Consider the problem of control selection in complex dynamical and environmental scenarios where model predictive control (MPC) proves particularly effective. As the performance of MPC is highly dependent on the efficiency of its incorporated search algorithm, this work examined hill climbing as an alternative to traditional systematic or random search algorithms. The relative performance of a candidate hill climbing algorithm was compared to representative systematic and random algorithms in a set of systematic tests and in a real-world control scenario. These tests indicated that hill climbing can provide significantly improved search efficiency when the control space has a large number of dimensions or divisions along each dimension. Furthermore, this demonstrated that there was little increase in search times associated with a significant increase in the number of control configurations considered.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑