Dynamic expansion of behaviour trees. Fĺorez-Puga, G., Ǵomez-Mart́in, M., D́iaz-Agudo, B., & Gonźalez-Calero, P. In Proceedings of the 4th Artificial Intelligence and Interactive Digital Entertainment Conference, AIIDE 2008, pages 36-41, 2008.
abstract   bibtex   
Artificial intelligence in games is typically used for creating player's opponents. Manual edition of intelligent behaviors for Non-Player Characters (NPCs) of games is a cumbersome task that needs experienced designers. Our research aims to assist designers in this task. Behaviours typically use recurring patterns, so that experience and reuse are crucial aspects for behavior design. The use of hierarchical state machines allows working on different abstraction levels, sharing transitions and reusing pieces from the more detailed levels. However, the static nature of the design process does not release the designer from the burden to completely specify each behaviour. Our approach applies Case-Based Reasoning (CBR) techniques to retrieve and reuse stored behaviors represented as hierarchical state machines (actually, behaviour trees). In this paper we focus on dynamic retrieval of behaviours taking into account the world state and the underlying goals to select the most appropriate state machine to guide the NPC behaviour. The global behaviour of the NPC is dynamically built in run time querying the CBR system. We exemplify our approach through a serious game, developed by our research group, with gameplay elements from First-Person Shooter (FPS) games. Copyright © 2008, Association for the Advancement of Artificial Intelligence.
@inproceedings{
 title = {Dynamic expansion of behaviour trees},
 type = {inproceedings},
 year = {2008},
 identifiers = {[object Object]},
 pages = {36-41},
 id = {7c44ca26-323e-3725-9514-8ce9b1ef4e2b},
 created = {2018-12-19T15:53:20.817Z},
 file_attached = {false},
 profile_id = {7ff3d559-34c5-3dc7-a15e-4809d39e6685},
 group_id = {e7b2acd2-0a56-31de-a28d-2f83f0d66ab8},
 last_modified = {2018-12-19T15:53:20.817Z},
 read = {false},
 starred = {false},
 authored = {false},
 confirmed = {false},
 hidden = {false},
 private_publication = {false},
 abstract = {Artificial intelligence in games is typically used for creating player's opponents. Manual edition of intelligent behaviors for Non-Player Characters (NPCs) of games is a cumbersome task that needs experienced designers. Our research aims to assist designers in this task. Behaviours typically use recurring patterns, so that experience and reuse are crucial aspects for behavior design. The use of hierarchical state machines allows working on different abstraction levels, sharing transitions and reusing pieces from the more detailed levels. However, the static nature of the design process does not release the designer from the burden to completely specify each behaviour. Our approach applies Case-Based Reasoning (CBR) techniques to retrieve and reuse stored behaviors represented as hierarchical state machines (actually, behaviour trees). In this paper we focus on dynamic retrieval of behaviours taking into account the world state and the underlying goals to select the most appropriate state machine to guide the NPC behaviour. The global behaviour of the NPC is dynamically built in run time querying the CBR system. We exemplify our approach through a serious game, developed by our research group, with gameplay elements from First-Person Shooter (FPS) games. Copyright © 2008, Association for the Advancement of Artificial Intelligence.},
 bibtype = {inproceedings},
 author = {Fĺorez-Puga, G. and Ǵomez-Mart́in, M. and D́iaz-Agudo, B. and Gonźalez-Calero, P.A.},
 booktitle = {Proceedings of the 4th Artificial Intelligence and Interactive Digital Entertainment Conference, AIIDE 2008}
}
Downloads: 0