In this work we assume that there is an agent in an unknown environment (domain). This agent has some predefined actions and it can perceive its current state in the environment c...
This paper describes an approach to automatically learn planning operators by observing expert solution traces and to further refine the operators through practice in a learning-b...
In this article, we work towards the goal of developing agents that can learn to act in complex worlds. We develop a a new probabilistic planning rule representation to compactly ...
Hanna M. Pasula, Luke S. Zettlemoyer, Leslie Pack ...
We view dynamic scheduling as a sequential decision problem. Firstly, we introduce a generalized planning operator, the stochastic task model (STM), which predicts the effects of ...
To learn to behave in highly complex domains, agents must represent and learn compact models of the world dynamics. In this paper, we present an algorithm for learning probabilist...
Hanna Pasula, Luke S. Zettlemoyer, Leslie Pack Kae...