基于改进演化行为树的自主智能体行为建模

Qi Zhang, Kai Xu, Peng Jiao, Quanjun Yin
{"title":"基于改进演化行为树的自主智能体行为建模","authors":"Qi Zhang, Kai Xu, Peng Jiao, Quanjun Yin","doi":"10.1109/DDCLS.2018.8515939","DOIUrl":null,"url":null,"abstract":"In modern training, entertainment and education applications, behavior trees (BTs) have been the fantastic alternative to FSMs to model and control autonomous agents. However, manually creating BTs for various task scenarios is expensive. Recently the genetic programming method has been devised to learn BTs automatically but produced limited success. One of the main reasons is the scalability problem stemming from random space search. This paper proposes a modified evolving behavior trees approach to model agent behavior as a BT. The main features lay on the model free method through dynamic frequent subtree mining to adjust select probability of crossover point then reduce random search in evolution. Preliminary experiments, carried out on the Mario AI benchmark, show that the proposed method outperforms standard evolving behavior tree by achieving better final behavior performance with less learning episodes. Besides, some useful behavior subtrees can be mined to facilitate knowledge engineering.","PeriodicalId":6565,"journal":{"name":"2018 IEEE 7th Data Driven Control and Learning Systems Conference (DDCLS)","volume":"40 1","pages":"1140-1145"},"PeriodicalIF":0.0000,"publicationDate":"2018-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":"{\"title\":\"Behavior Modeling for Autonomous Agents Based on Modified Evolving Behavior Trees\",\"authors\":\"Qi Zhang, Kai Xu, Peng Jiao, Quanjun Yin\",\"doi\":\"10.1109/DDCLS.2018.8515939\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In modern training, entertainment and education applications, behavior trees (BTs) have been the fantastic alternative to FSMs to model and control autonomous agents. However, manually creating BTs for various task scenarios is expensive. Recently the genetic programming method has been devised to learn BTs automatically but produced limited success. One of the main reasons is the scalability problem stemming from random space search. This paper proposes a modified evolving behavior trees approach to model agent behavior as a BT. The main features lay on the model free method through dynamic frequent subtree mining to adjust select probability of crossover point then reduce random search in evolution. Preliminary experiments, carried out on the Mario AI benchmark, show that the proposed method outperforms standard evolving behavior tree by achieving better final behavior performance with less learning episodes. Besides, some useful behavior subtrees can be mined to facilitate knowledge engineering.\",\"PeriodicalId\":6565,\"journal\":{\"name\":\"2018 IEEE 7th Data Driven Control and Learning Systems Conference (DDCLS)\",\"volume\":\"40 1\",\"pages\":\"1140-1145\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-05-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"6\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2018 IEEE 7th Data Driven Control and Learning Systems Conference (DDCLS)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/DDCLS.2018.8515939\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 IEEE 7th Data Driven Control and Learning Systems Conference (DDCLS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/DDCLS.2018.8515939","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 6

摘要

在现代培训、娱乐和教育应用中,行为树(bt)已经成为fsm模型和控制自主代理的绝佳替代品。但是,为各种任务场景手动创建bt的成本很高。近年来,遗传规划方法被设计用于自动学习bt,但收效甚微。其中一个主要原因是随机空间搜索带来的可伸缩性问题。本文提出了一种改进的进化行为树方法来建模智能体行为,其主要特点是通过动态频繁子树挖掘模型自由方法来调整交叉点的选择概率,从而减少进化中的随机搜索。在马里奥AI基准上进行的初步实验表明,该方法以更少的学习集获得更好的最终行为表现,优于标准的进化行为树。此外,还可以挖掘出一些有用的行为子树,以方便知识工程。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Behavior Modeling for Autonomous Agents Based on Modified Evolving Behavior Trees
In modern training, entertainment and education applications, behavior trees (BTs) have been the fantastic alternative to FSMs to model and control autonomous agents. However, manually creating BTs for various task scenarios is expensive. Recently the genetic programming method has been devised to learn BTs automatically but produced limited success. One of the main reasons is the scalability problem stemming from random space search. This paper proposes a modified evolving behavior trees approach to model agent behavior as a BT. The main features lay on the model free method through dynamic frequent subtree mining to adjust select probability of crossover point then reduce random search in evolution. Preliminary experiments, carried out on the Mario AI benchmark, show that the proposed method outperforms standard evolving behavior tree by achieving better final behavior performance with less learning episodes. Besides, some useful behavior subtrees can be mined to facilitate knowledge engineering.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信