2019 IEEE Conference on Games (CoG)最新文献

MazeExplorer: A Customisable 3D Benchmark for Assessing Generalisation in Reinforcement Learning MazeExplorer:用于评估强化学习泛化的可定制3D基准

2019 IEEE Conference on Games (CoG) Pub Date : 2019-12-05 DOI: 10.1109/CIG.2019.8848048

Luke Harries, Sebastian Lee, Jaroslaw Rzepecki, Katja Hofmann, Sam Devlin

引用次数: 10

Win or Learn Fast Proximal Policy Optimisation 赢或学快速近端策略优化

2019 IEEE Conference on Games (CoG) Pub Date : 2019-12-05 DOI: 10.1109/CIG.2019.8848100

D. Ratcliffe, Katja Hofmann, Sam Devlin

引用次数: 8

Learning Analytics Should Analyse the Learning: Proposing a Generic Stealth Assessment Tool 学习分析应该分析学习:提出一种通用的隐形评估工具

2019 IEEE Conference on Games (CoG) Pub Date : 2019-09-26 DOI: 10.1109/CIG.2019.8847960

K. Georgiadis, G. V. Lankveld, Kiavash Bahreini, W. Westera

{"title":"Learning Analytics Should Analyse the Learning: Proposing a Generic Stealth Assessment Tool","authors":"K. Georgiadis, G. V. Lankveld, Kiavash Bahreini, W. Westera","doi":"10.1109/CIG.2019.8847960","DOIUrl":"https://doi.org/10.1109/CIG.2019.8847960","url":null,"abstract":"Stealth assessment could radically extend the scope and impact of learning analytics. Stealth assessment refers to the unobtrusive assessment of learners by exploiting emerging data from their digital traces in electronic learning environments through machine learning technologies. So far, stealth assessment has been studied extensively in serious games, but has not been widely applied, as it is a laborious and complex methodology for which no support tools are available. This study proposes a generic tool for the arrangement of stealth assessment to remove its current limitations and pave the road for its wider adoption. It describes the conceptual design of such a tool including its requirements regarding users, functions, and workflow. A prototype was implemented as a basic console application covering the tool's core requirements, including a Gaussian Naïve Bayes Network utility. Generated input files were used for testing and validating the approach. In a controlled test condition the stealth assessment classification accuracy was found to be inherently stable and high (typically above 92%). It is argued that the proposed approach could radically increase the applicability of stealth assessment in serious games and inform current learning analytics approaches with unobtrusive, more detailed and genuine assessments of learning.","PeriodicalId":177208,"journal":{"name":"2019 IEEE Conference on Games (CoG)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-09-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115103285","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 10

Effects of advertisements and questionnaire interruptions on the player experience 广告和问卷调查中断对玩家体验的影响

2019 IEEE Conference on Games (CoG) Pub Date : 2019-08-21 DOI: 10.1109/CIG.2019.8848023

C. Santos, Niels Cornelis Martinus Felicius van Gaans, Vassilis-Javed Khan, P. Markopoulos

引用次数: 2

Remixing Headlines for Context-Appropriate Flavor Text 为上下文适当的味道文本重新混合标题

2019 IEEE Conference on Games (CoG) Pub Date : 2019-08-20 DOI: 10.1109/CIG.2019.8848050

Judith van Stegeren, M. Theune

引用次数: 0

When Are We Done with Games? 我们什么时候结束游戏?

2019 IEEE Conference on Games (CoG) Pub Date : 2019-08-01 DOI: 10.1109/CIG.2019.8847963

Niels Justesen, Michael S. Debus, S. Risi

引用次数: 5

Modelling Player Preferences in AR Mobile Games AR手机游戏中的玩家偏好建模

2019 IEEE Conference on Games (CoG) Pub Date : 2019-08-01 DOI: 10.1109/CIG.2019.8848082

Vivek R. Warriar, John R. Woodward, L. Tokarchuk

引用次数: 8

Timing Interactive Narratives 定时互动叙事

2019 IEEE Conference on Games (CoG) Pub Date : 2019-08-01 DOI: 10.1109/CIG.2019.8847967

T. Cabioch, R. Champagnat, Anne-Gwenn Bosser, Jean-Noël Chiganne, Martín Diéguez

{"title":"Timing Interactive Narratives","authors":"T. Cabioch, R. Champagnat, Anne-Gwenn Bosser, Jean-Noël Chiganne, Martín Diéguez","doi":"10.1109/CIG.2019.8847967","DOIUrl":"https://doi.org/10.1109/CIG.2019.8847967","url":null,"abstract":"Research in Computational Narratives has evidenced the need to provide formal models of narratives integrating action representation together with temporal and causal constraints. Adopting an adequate formalization for narrative actions is critical to the development of generative or interactive systems capable of telling stories whilst ensuring narrative coherence, or dynamic adaptation to user interaction. It may also allow to verify properties of narratives at design time. In this paper, we discuss the issues of interactive story design, verification, and piloting for a specific genre of industrial application, in the field of interactive entertainment: in the games we consider, teams of participants in a Virtual Reality application are guided in real time through a narrative experience by a human storyteller. Like in an escape game, the interactive experience is timed: it should be long enough to provide satisfaction to the players, but come to a conclusion before the game session is over in order to provide closure and a sense of achievement to them. We describe how we integrate narrative time in the story design and use it to the verification of temporal properties of scenarios, building on previous work using Linear Logic and Petri Nets.","PeriodicalId":177208,"journal":{"name":"2019 IEEE Conference on Games (CoG)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125370268","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 1

Multi-Agent non-Overlapping Pathfinding with Monte-Carlo Tree Search 蒙特卡罗树搜索的多智能体无重叠寻路

2019 IEEE Conference on Games (CoG) Pub Date : 2019-08-01 DOI: 10.1109/CIG.2019.8848043

M. Kiarostami, Mohammadreza Daneshvaramoli, Saleh Khalaj Monfared, Dara Rahmati, S. Gorgin

{"title":"Multi-Agent non-Overlapping Pathfinding with Monte-Carlo Tree Search","authors":"M. Kiarostami, Mohammadreza Daneshvaramoli, Saleh Khalaj Monfared, Dara Rahmati, S. Gorgin","doi":"10.1109/CIG.2019.8848043","DOIUrl":"https://doi.org/10.1109/CIG.2019.8848043","url":null,"abstract":"In this work, we propose a novel implementation of Monte-Carlo Tree Search (MCTS) algorithm to solve a multiagent pathfinding (MAPF) problem. We employ an optimization of MCTS with low time-complexity and acceptable reliability to approach the MAPF problems with no time constraint. To examine the efficiency and performance of the proposed approach, the NumberLink problem as a MAPF is investigated. We show that the addressed problem could be characterized as multi-agent pathfinding problem with no overlapping paths for the agents. Furthermore, we define this problem to be a simplified and special case of Multi-commodity flow problem (MCFP). Our MCTS solution utilizes a modified search-tree structure to efficiently solve the problem based on a 2-dimensional search space which performs in quadratic time complexity (O(m4) where input size is m2) and linear memory complexity (O(m2)). To evaluate our algorithm, we investigate the efficiency of the proposed solution for the well-known Flow Free puzzle. Our implementation solves a large 40 × 40 Numberlink puzzle in 21 minutes. To the best of our knowledge, there is no other efficient solution for this puzzle where the size of the problem is considerably large.","PeriodicalId":177208,"journal":{"name":"2019 IEEE Conference on Games (CoG)","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116108334","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 14

Taksim: A Constrained Graph Partitioning Framework for Procedural Content Generation Taksim:程序内容生成的约束图划分框架

2019 IEEE Conference on Games (CoG) Pub Date : 2019-08-01 DOI: 10.1109/CIG.2019.8848065

Ahmed M. Abuzuraiq, Aaron Ferguson, Philippe Pasquier

引用次数: 5