On Finite State Machines and Reusability

 

On Finite State Machines and Reusability

Theoretically speaking, finite state machines (FSM) provide a specific type of logic, similar to regular grammars recognized by finite state automata. In practice also, FSMs are highly tuned to the problemthey solve.

This is both a blessing and a curse for games — most of which use FSMs. They start off very simple, but can become very challenging to manage as they grow. It’s important to understand why this is the case if you want to build something better for the logic of your AI characters.

What is a State?

A finite state machine is based on the concept of a state, which typically consists of two things:

  1. A set of actions running at the same time (e.g. playing an animation, a sound, or waiting for a certain amount of time).

  2. A set of transitions with a conditional check to determine when to engage the next state.

States can be made quite generic and robust by adding many transitions to support all the desired cases. For simple problems, this is fine, but for large problems you need a more scalable approach.

Reusable Behaviors in Games

The challenge of game AI involves scheduling behaviors in a context sensitive way, and this requires increasingly large FSMs. The logic must work:

  • Depending on dynamic goals and tasks of the actor.

  • Adapting to the current status of the actor (e.g. health, emotions).

When using FSMs, the hard part is preventing the logic of each state from exploding in complexity with each new context you want to add, while at the same time keeping the number of states down to a minimum.

To do that effectively, you need to be able to divide up the responsibility among multiple states, and reuse the logic of states in different contexts.

States Break Modularity

The problem with states in a traditional FSM is that the logic is not reusable as-is. States perform a very specific role inside a state machine:

  • Transitions are hardwired and must assume a certain context; you can’t use parts of a FSM to solve a different problem unless you designed it that way.

  • Transitions rely on specific states and transitions, so the FSM fails if the required logic is not provided.

Because of this, you can’t treat a state as a modular block and reference it from a different context in the logic. You have no choice but to make a new state with different transitions specifically for that new context.

Reusable Logic

The question is, how easily can you reuse chunks of logic to make new states? Both hierarchical FSM and behaviors trees take a very different approach to this.

The next few articles in this series examines how this works in practice.


Game AI Character

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
自动控制节水灌溉技术的高低代表着农业现代化的发展状况,灌溉系统自动化水平较低是制约我国高效农业发展的主要原因。本文就此问题研究了单片机控制的滴灌节水灌溉系统,该系统可对不同土壤的湿度进行监控,并按照作物对土壤湿度的要求进行适时、适量灌水,其核心是单片机和PC机构成的控制部分,主要对土壤湿度与灌水量之间的关系、灌溉控制技术及设备系统的硬件、软件编程各个部分进行了深入的研究。 单片机控制部分采用上下位机的形式。下位机硬件部分选用AT89C51单片机为核心,主要由土壤湿度传感器,信号处理电路,显示电路,输出控制电路,故障报警电路等组成,软件选用汇编语言编程。上位机选用586型以上PC机,通过MAX232芯片实现同下位机的电平转换功能,上下位机之间通过串行通信方式进行数据的双向传输,软件选用VB高级编程语言以建立友好的人机界面。系统主要具有以下功能:可在PC机提供的人机对话界面上设置作物要求的土壤湿度相关参数;单片机可将土壤湿度传感器检测到的土壤湿度模拟量转换成数字量,显示于LED显示器上,同时单片机可采用串行通信方式将此湿度值传输到PC机上;PC机通过其内设程序计算出所需的灌水量和灌水时间,且显示于界面上,并将有关的灌水信息反馈给单片机,若需灌水,则单片机系统启动鸣音报警,发出灌水信号,并经放大驱动设备,开启电磁阀进行倒计时定时灌水,若不需灌水,即PC机上显示的灌水量和灌水时间均为0,系统不进行灌水。
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值