Boolean goal variables are introduced in symbolic algorithms for LTLf synthesis to compactly represent exponentially many combinations of potentially conflicting properties. They enable efficient computation of realizable goal sets and synthesis of strategies achieving maximal sets.
Boolean goal variables are a clever way to handle many complex goals in AI planning and control, especially when not all goals can be met at once. They allow algorithms to quickly figure out which goals are achievable and how to achieve the most possible, making the process much faster than older methods.
Was this definition helpful?