Dealing with numerical information is practically important in many real-world planning domains where the executability of an action can depend on certain numerical conditions, an...
In this paper we propose a suite of techniques for planning with temporally extended preferences (TEPs). To this end, we propose a method for compiling TEP planning problems into ...
Jorge A. Baier, Fahiem Bacchus, Sheila A. McIlrait...
We consider the problem of finding generalized plans for situations where the number of objects may be unknown and unbounded during planning. The input is a domain specification...
Siddharth Srivastava, Neil Immerman, Shlomo Zilber...
Abstract. Interleaved planning and scheduling employs the idea of extending partial plans by regularly heeding to the scheduling constraints during search. One of the techniques us...
cal maps provide a useful abstraction for robotic navigation and planning. Although stochastic mapscan theoreticallybe learned using the Baum-Welch algorithm,without strong prior ...