Modern robots are increasingly capable of performing “basic” activities such as localization,
navigation, and motion planning. However, for a robot to be considered intelligent, we would …

Generalized planning studies the representation, computation and evaluation of solutions
that are valid for multiple planning instances. These are topics studied since the early days …

In this paper we describe COLIN, a forward-chaining heuristic search planner, capable of
reasoning with COntinuous LINear numeric change, in addition to the full temporal …

Many AI applications involve the interaction of multiple autonomous agents, requiring those
agents to reason about their own beliefs, as well as those of other agents. However …

Single-agent planning in partially observable settings is a well understood problem and
existing planners can represent and solve a wide variety of meaningful instances. In the …

During the 60s and 70s, AI researchers explored intuitions about intelligence by writing
programs that displayed intelligent behavior. Many good ideas came out from this work but …

In many usage scenarios of AI Planning technology, users will want not just a plan π but an
explanation of the space of possible plans, justifying π. In particular, in oversubscription …

This paper deals with the problem of classical planning for multiple cooperative agents who
have private information about their local state and capabilities they do not want to reveal …

Generalized Planning: Synthesizing Plans that Work for Multiple Environments Page 1
Generalized Planning: Synthesizing Plans that Work for Multiple Environments Toby Hu (University …

Epistemic planning can be used for decision making in multi-agent situations with distributed
knowledge and capabilities. Recently, Dynamic Epistemic Logic (DEL) has been shown to …