Applying the Mu-Calculus in Planning and Reasoning about Action

13 years 4 months ago

Download www.csc.ncsu.edu

Planning algorithms have traditionally been geared toward achievement goals in single-agent environments. Such algorithms essentially produce plans to reach one of a speciﬁed set of states. More general approaches for planning based on temporal logic (TL) are emerging. Current approaches tend to use linear TL, and can handle sets of sequences of states. However, they assume deterministic actions with all changes eﬀected solely by one agent. By contrast, we use a branching model of time that can express concurrent actions by multiple agents and the environment, leading to nondeterministic eﬀects of an agent’s actions. For this reason, we view plans not as sequences of actions, but as decision graphs describing the agent’s actions in diﬀerent situations. Thus, although we consider single-agent decision graphs, our approach is better suited to multiagent systems. We also consider an expressive formalism, which allows a wider variety of goals, including achievement and mainten...

Munindar P. Singh

Real-time Traffic