官术网_书友最值得收藏!

Finite State Machines

Finite State Machines (FSM) can be considered one of the simplest AI models, and they are commonly used in games. A state machine basically consists of a set number of states that are connected in a graph by the transitions between them. A game entity starts with an initial state and then looks out for the events and rules that will trigger a transition to another state. A game entity can only be in exactly one state at any given time.

For example, let's take a look at an AI guard character in a typical shooting game. Its states could be as simple as patrolling, chasing, and shooting:

There are basically four components in a simple FSM:

  • States: This component defines a set of distinct states that a game entity or an NPC can choose from (patrol, chase, and shoot)
  • Transitions: This component defines relations between different states
  • Rules: This component is used to trigger a state transition (player on sight, close enough to attack, and lost/killed player)
  • Events: This is the component that will trigger to check the rules (guard's visible area, distance to the player, and so on)

FSMs are commonly used go-to AI patterns in game development because they are relatively easy to implement, visualize, and understand. Using simple if/else statements or switch statements, we can easily implement an FSM. It can get messy as we start to have more states and more transitions. We'll look at how to manage a simple FSM more in depth in Chapter 2, Finite State Machines and You.

主站蜘蛛池模板: 左权县| 琼结县| 宁晋县| 红河县| 江陵县| 石家庄市| 东城区| 澄江县| 常州市| 定结县| 霍邱县| 阿坝县| 龙岩市| 通海县| 杂多县| 兰溪市| 汾西县| 西贡区| 苍山县| 色达县| 错那县| 鲜城| 荆门市| 共和县| 白水县| 安康市| 方山县| 寻甸| 巴林右旗| 芮城县| 福清市| 阳山县| 喜德县| 尉氏县| 常州市| 区。| 那坡县| 普宁市| 万荣县| 工布江达县| 嘉义县|