Abstract. An optimal probabilistic-planning algorithm solves a problem, usually modeled by a Markov decision process, by finding its optimal policy. In this paper, we study the k ...
Markov decision processes (MDPs) are a very popular tool for decision theoretic planning (DTP), partly because of the welldeveloped, expressive theory that includes effective solu...
Let M be a fixed finite monoid. We consider the problem of implementing a data type containing a vector x ϭ ( x1, x2, . . . , xn) ʦ Mn , initially (1, 1, . . . , 1), with two kin...
Gudmund Skovbjerg Frandsen, Peter Bro Miltersen, S...
Planning in domains with temporal and numerical properties is an important research problem. One application of this is the resource production problem in real-time strategy (RTS)...
Hei Chan, Alan Fern, Soumya Ray, Nick Wilson, Chri...
Delay management is an important issue in the daily operations of any railway company. The task is to update the planned timetable to a disposition timetable in such a way that the...