Deploying Reinforcement Learning for Efficient Runtime Decision-Making in Autonomous Systems

IF 0.5 Q4 COMPUTER SCIENCE, SOFTWARE ENGINEERING
Melika Dastranj, Mehran Alidoost Nia, M. Kargahi
{"title":"Deploying Reinforcement Learning for Efficient Runtime Decision-Making in Autonomous Systems","authors":"Melika Dastranj, Mehran Alidoost Nia, M. Kargahi","doi":"10.1109/rtest56034.2022.9850141","DOIUrl":null,"url":null,"abstract":"Autonomous systems need to effectively react to runtime changes in the environment and the system itself. The capability to analyze both the environment and the system is theoretically feasible through the model-based approach. How-ever, the limitations like model size are serious obstacles to autonomous decision-making process. The incremental approximation is a technique to partition the model to tackle this issue. A partition must be updated/re-verified at a reasonable cost when some change occurs. The paper suggests a policy-based analysis technique to find the optimal partitioning criteria through a set of available policies with respect to our proposed metrics, namely Balancing and Variation. Using the incremental approximation scheme, the metrics evaluate each component quantitatively according to their size and frequency. The proposed method is augmented with a reinforcement learning approach so that the autonomous system can learn how to find the best partitioning policy at runtime. Since the most time-consuming parts of this approach are done at the design time, the proposed method is efficient and meets the runtime resource requirements of the autonomous systems. We analyze the correctness of the proposed system via a few theoretical investigations and experimental results applied to a case study on energy-harvesting self-adaptive systems. The outcome illustrates the correctness of the proposed system in terms of efficiency and accuracy.","PeriodicalId":38446,"journal":{"name":"International Journal of Embedded and Real-Time Communication Systems (IJERTCS)","volume":"318 1","pages":"1-9"},"PeriodicalIF":0.5000,"publicationDate":"2022-05-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Journal of Embedded and Real-Time Communication Systems (IJERTCS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/rtest56034.2022.9850141","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, SOFTWARE ENGINEERING","Score":null,"Total":0}
引用次数: 0

Abstract

Autonomous systems need to effectively react to runtime changes in the environment and the system itself. The capability to analyze both the environment and the system is theoretically feasible through the model-based approach. How-ever, the limitations like model size are serious obstacles to autonomous decision-making process. The incremental approximation is a technique to partition the model to tackle this issue. A partition must be updated/re-verified at a reasonable cost when some change occurs. The paper suggests a policy-based analysis technique to find the optimal partitioning criteria through a set of available policies with respect to our proposed metrics, namely Balancing and Variation. Using the incremental approximation scheme, the metrics evaluate each component quantitatively according to their size and frequency. The proposed method is augmented with a reinforcement learning approach so that the autonomous system can learn how to find the best partitioning policy at runtime. Since the most time-consuming parts of this approach are done at the design time, the proposed method is efficient and meets the runtime resource requirements of the autonomous systems. We analyze the correctness of the proposed system via a few theoretical investigations and experimental results applied to a case study on energy-harvesting self-adaptive systems. The outcome illustrates the correctness of the proposed system in terms of efficiency and accuracy.
在自治系统中部署强化学习以实现高效的运行时决策
自治系统需要有效地响应环境和系统本身的运行时变化。通过基于模型的方法,分析环境和系统的能力在理论上是可行的。然而,模型大小等限制是自主决策过程的严重障碍。增量逼近是一种划分模型来解决这个问题的技术。当发生某些更改时,必须以合理的成本更新/重新验证分区。本文提出了一种基于策略的分析技术,通过一组关于我们提出的度量(即平衡和变化)的可用策略来找到最优划分标准。使用增量逼近方案,度量根据它们的大小和频率定量地评估每个组件。该方法通过强化学习方法得到增强,使自治系统能够学习如何在运行时找到最佳的分区策略。由于该方法中最耗时的部分是在设计时完成的,因此所提出的方法是有效的,并且满足自治系统的运行时资源需求。通过一些理论研究和应用于能量收集自适应系统的实验结果,分析了所提出系统的正确性。结果表明,所提出的系统在效率和准确性方面是正确的。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
CiteScore
1.70
自引率
14.30%
发文量
17
×
引用
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学术官方微信