Abstract
Behavior Trees (BTs) were invented as a tool to enable modular AI in computer games, but have received an increasing amount of attention in the robotics community in the last decade. With rising demands on agent AI complexity, game programmers found that the Finite State Machines (FSM) that they used scaled poorly and were difficult to extend, adapt and reuse. In BTs, the state transition logic is not dispersed across the individual states, but organized in a hierarchical tree structure, with the states as leaves. This has a significant effect on modularity, which in turn simplifies both synthesis and analysis by humans and algorithms alike. These advantages are needed not only in game AI design, but also in…
Citation impact
247
total citations
- FWCI
- 30.24
- Percentile
- 100%
- References
- 350
Citations per year
Authors
5Topics & keywords
Topics
Keywords
- Computer science
- Robotics
- Modularity (biology)
- Reuse
- Modular design
- Artificial intelligence
- State (computer science)
- Tree (set theory)
No related works found for this paper.