不确定条件下鲁棒解的人工智能辅助优化

Ravi kiran Inapakurthi, K. Mitra
{"title":"不确定条件下鲁棒解的人工智能辅助优化","authors":"Ravi kiran Inapakurthi, K. Mitra","doi":"10.1109/ICSTCC55426.2022.9931860","DOIUrl":null,"url":null,"abstract":"Uncertainty in process conditions makes the optimal solution from the deterministic optimization case infeasible or suboptimal. This mandates a special treatment for process uncertainty. The advent of unsupervised machine learning technique like clustering can be used to address this problem. Data arising from process conditions is meager and, to perform robust optimization, it is necessary to have enough representation of the uncertain region. For this, the collected data from process conditions is clustered using Support Vector Clustering (SVC). The hyper-parameters of SVC play a crucial role in clustering exercise. To promote this, a novel algorithm for determining optimal SVC models, is proposed. The proposed algorithm is used to cluster the uncertain process data and once clustered, can be used to sample additional data points inside each cluster using the convex hull. The additionally sampled data points in each cluster increases the cluster representativeness. The proposed methodology is implemented on industrial grinding circuits for performing Optimization Under Uncertainty (OUU) for the worst-case scenario and tested against the budget-uncertainty set based OUU.","PeriodicalId":220845,"journal":{"name":"2022 26th International Conference on System Theory, Control and Computing (ICSTCC)","volume":"295 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-10-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Artificial Intelligence Assisted Optimization Under Uncertainty for Robust Solutions\",\"authors\":\"Ravi kiran Inapakurthi, K. Mitra\",\"doi\":\"10.1109/ICSTCC55426.2022.9931860\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Uncertainty in process conditions makes the optimal solution from the deterministic optimization case infeasible or suboptimal. This mandates a special treatment for process uncertainty. The advent of unsupervised machine learning technique like clustering can be used to address this problem. Data arising from process conditions is meager and, to perform robust optimization, it is necessary to have enough representation of the uncertain region. For this, the collected data from process conditions is clustered using Support Vector Clustering (SVC). The hyper-parameters of SVC play a crucial role in clustering exercise. To promote this, a novel algorithm for determining optimal SVC models, is proposed. The proposed algorithm is used to cluster the uncertain process data and once clustered, can be used to sample additional data points inside each cluster using the convex hull. The additionally sampled data points in each cluster increases the cluster representativeness. The proposed methodology is implemented on industrial grinding circuits for performing Optimization Under Uncertainty (OUU) for the worst-case scenario and tested against the budget-uncertainty set based OUU.\",\"PeriodicalId\":220845,\"journal\":{\"name\":\"2022 26th International Conference on System Theory, Control and Computing (ICSTCC)\",\"volume\":\"295 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2022-10-19\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2022 26th International Conference on System Theory, Control and Computing (ICSTCC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICSTCC55426.2022.9931860\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 26th International Conference on System Theory, Control and Computing (ICSTCC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICSTCC55426.2022.9931860","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

工艺条件的不确定性使得确定性优化情况下的最优解不可行或次优。这要求对过程不确定性进行特殊处理。像聚类这样的无监督机器学习技术的出现可以用来解决这个问题。由过程条件产生的数据是贫乏的,为了进行鲁棒优化,有必要对不确定区域有足够的表示。为此,从过程条件中收集的数据使用支持向量聚类(SVC)进行聚类。SVC的超参数在聚类过程中起着至关重要的作用。为此,提出了一种确定最优SVC模型的新算法。该算法用于对不确定过程数据进行聚类,一旦聚类,可以使用凸包对每个聚类内的附加数据点进行采样。每个簇中额外采样的数据点增加了簇的代表性。提出的方法在工业磨削电路中实现了最坏情况下的不确定优化(OUU),并针对基于预算不确定集的OUU进行了测试。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Artificial Intelligence Assisted Optimization Under Uncertainty for Robust Solutions
Uncertainty in process conditions makes the optimal solution from the deterministic optimization case infeasible or suboptimal. This mandates a special treatment for process uncertainty. The advent of unsupervised machine learning technique like clustering can be used to address this problem. Data arising from process conditions is meager and, to perform robust optimization, it is necessary to have enough representation of the uncertain region. For this, the collected data from process conditions is clustered using Support Vector Clustering (SVC). The hyper-parameters of SVC play a crucial role in clustering exercise. To promote this, a novel algorithm for determining optimal SVC models, is proposed. The proposed algorithm is used to cluster the uncertain process data and once clustered, can be used to sample additional data points inside each cluster using the convex hull. The additionally sampled data points in each cluster increases the cluster representativeness. The proposed methodology is implemented on industrial grinding circuits for performing Optimization Under Uncertainty (OUU) for the worst-case scenario and tested against the budget-uncertainty set based OUU.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信