Abstract. This paper presents two approaches for generating and executing the plans of cognitive agents. They can be used to define the semantics of programming languages for cogni...
In this paper, we introduce a new heuristic search algorithm based on mean values for anytime planning, called MHSP. It consists in associating the principles of UCT, a bandit-base...
In a large distributed system it is often infeasible or even impossible to perform diagnosis using a single model of the whole system. Instead, several spatially distributed local...
Most BDI agent architectures rely on plan libraries in order to ensure bounded time for means-ends reasoning. Nevertheless, the usage of fast planning algorithms to provide the ag...
Felipe Rech Meneguzzi, Avelino F. Zorzo, Michael C...