自主智能系统的上下文感知任务序列规划

A. Botchkaryov
{"title":"自主智能系统的上下文感知任务序列规划","authors":"A. Botchkaryov","doi":"10.23939/acps2018.02.060","DOIUrl":null,"url":null,"abstract":". The problem of context-aware task sequence planning by an autonomous intelligent system (intelligent agent) for a case of independent or loosely coupled tasks is considered. The principle of matching the task to the context was analyzed, the structure of the task sequence planning module and the algorithm of its work were proposed. The paper also proposes an algorithm for calculating the dynamic priority of a task, an algorithm for determining whether a task meets context, and an algorithm for adapting a set of rules for matching tasks to a context based on reinforcement learning in a stationary random environment with context dependence (contextual multi-armed bandit problem). The outline of the reinforcement learning procedure, implemented in the prototype of the task sequence planning module, has been proposed.","PeriodicalId":188480,"journal":{"name":"Advances in Cyber-Physical Systems","volume":"3 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-11-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Context-Aware Task Sequence Planning for Autonomous Intelligent Systems\",\"authors\":\"A. Botchkaryov\",\"doi\":\"10.23939/acps2018.02.060\",\"DOIUrl\":null,\"url\":null,\"abstract\":\". The problem of context-aware task sequence planning by an autonomous intelligent system (intelligent agent) for a case of independent or loosely coupled tasks is considered. The principle of matching the task to the context was analyzed, the structure of the task sequence planning module and the algorithm of its work were proposed. The paper also proposes an algorithm for calculating the dynamic priority of a task, an algorithm for determining whether a task meets context, and an algorithm for adapting a set of rules for matching tasks to a context based on reinforcement learning in a stationary random environment with context dependence (contextual multi-armed bandit problem). The outline of the reinforcement learning procedure, implemented in the prototype of the task sequence planning module, has been proposed.\",\"PeriodicalId\":188480,\"journal\":{\"name\":\"Advances in Cyber-Physical Systems\",\"volume\":\"3 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-11-10\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Advances in Cyber-Physical Systems\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.23939/acps2018.02.060\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Advances in Cyber-Physical Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.23939/acps2018.02.060","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

摘要

. 研究了独立任务或松散耦合任务的自主智能系统(智能体)上下文感知任务序列规划问题。分析了任务与上下文匹配的原理,提出了任务序列规划模块的结构及其工作算法。本文还提出了一种计算任务动态优先级的算法,一种确定任务是否满足上下文的算法,以及一种在具有上下文依赖的平稳随机环境中基于强化学习的一组任务匹配规则的算法(上下文多臂强盗问题)。提出了在任务序列规划模块原型中实现的强化学习过程的概要。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Context-Aware Task Sequence Planning for Autonomous Intelligent Systems
. The problem of context-aware task sequence planning by an autonomous intelligent system (intelligent agent) for a case of independent or loosely coupled tasks is considered. The principle of matching the task to the context was analyzed, the structure of the task sequence planning module and the algorithm of its work were proposed. The paper also proposes an algorithm for calculating the dynamic priority of a task, an algorithm for determining whether a task meets context, and an algorithm for adapting a set of rules for matching tasks to a context based on reinforcement learning in a stationary random environment with context dependence (contextual multi-armed bandit problem). The outline of the reinforcement learning procedure, implemented in the prototype of the task sequence planning module, has been proposed.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信