▎Loyal Wingman
Finite State Machines/ FSM
Classical state-and-transition control model for bounded autonomous behavior.
Definition
FSMs encode agent behavior as a graph of named states with explicit transitions. They are simple to verify and certify but become brittle as logic complexity grows. CCA-class autonomy stacks typically reserve FSMs for the outermost mode controller (e.g., GROUND, TAXI, AIRBORNE, ENGAGED, RTB) while delegating in-mode tactics to behavior trees or HTN planners.
Reference attributes
- Pattern
- States + guarded transitions
- Strength
- Verifiability
- Weakness
- Combinatorial growth
Related terms
#control#autonomy