Welcome to the InfoSci Platform
Reference Hub1
Behavior Trees: Introduction and Memory-Compact Implementation

Behavior Trees: Introduction and Memory-Compact Implementation

Björn Knafla, Alex J. Champandard
Copyright: © 2012 |Pages: 27
ISBN13: 9781466616349|ISBN10: 1466616342|EISBN13: 9781466616356
DOI: 10.4018/978-1-4666-1634-9.ch003
Cite Chapter Cite Chapter

MLA

Knafla, Björn, and Alex J. Champandard. "Behavior Trees: Introduction and Memory-Compact Implementation." Algorithmic and Architectural Gaming Design: Implementation and Development, edited by Ashok Kumar, et al., IGI Global, 2012, pp. 40-66. https://doi.org/10.4018/978-1-4666-1634-9.ch003

APA

Knafla, B. & Champandard, A. J. (2012). Behavior Trees: Introduction and Memory-Compact Implementation. In A. Kumar, J. Etheredge, & A. Boudreaux (Eds.), Algorithmic and Architectural Gaming Design: Implementation and Development (pp. 40-66). IGI Global. https://doi.org/10.4018/978-1-4666-1634-9.ch003

Chicago

Knafla, Björn, and Alex J. Champandard. "Behavior Trees: Introduction and Memory-Compact Implementation." In Algorithmic and Architectural Gaming Design: Implementation and Development, edited by Ashok Kumar, Jim Etheredge, and Aaron Boudreaux, 40-66. Hershey, PA: IGI Global, 2012. https://doi.org/10.4018/978-1-4666-1634-9.ch003

Export Reference

Mendeley
Favorite

Abstract

Behavior trees (BTs) are increasingly deployed in the games industry for decision making and control of non-player characters (NPCs, also named agents or actors) and gameplay. Behavior trees are incrementally created from reactive and goal-oriented behaviors by hierarchically compositing purposeful sub-behaviors. Composite behaviors (branches in the tree) decide which child behavior to run when and react to changing behavior execution states. Leaf nodes of the behavior tree check conditions, or control the execution of game state affecting actions. This chapter introduces a basic behavior tree concept, describes how behavior tree traversal drives NPC decision making via an example, and sketches a memory-compact implementation.

Request Access

You do not own this content. Please login to recommend this title to your institution's librarian or purchase it from the IGI Global bookstore.