Sciweavers

Share
LOGCOM
1998

Applying the Mu-Calculus in Planning and Reasoning about Action

9 years 5 months ago
Applying the Mu-Calculus in Planning and Reasoning about Action
Planning algorithms have traditionally been geared toward achievement goals in single-agent environments. Such algorithms essentially produce plans to reach one of a specified 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 effected 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 effects 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 different 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
Added 22 Dec 2010
Updated 22 Dec 2010
Type Journal
Year 1998
Where LOGCOM
Authors Munindar P. Singh
Comments (0)
books