In this work we extend the work of Dean, Kaelbling, Kirman and Nicholson on planning under time constraints in stochastic domains to handle more complicated scheduling problems. I...
We present exact algorithms for identifying deterministic-actions' effects and preconditions in dynamic partially observable domains. They apply when one does not know the ac...
This paper presents mathematical results that can sometimes be used to simplify the task of reasoning about a default theory, by \splitting it into parts." These so-called Sp...
The last few years have seen great maturation in understanding how to use computer graphics technology to portray 3D embodied characters or virtual humans. Unlike the off-line, an...
Norman I. Badler, Jan M. Allbeck, Liwei Zhao, Meer...
In planning tasks an agent may often find himself in a situation demanding that he choose an action that would prevent some unwanted event from occurring. Similarly, in tasks invo...