A Mean-based Approach for Real-Time Planning - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2010

A Mean-based Approach for Real-Time Planning

Abstract

In this paper, we introduce a new heuristic search algorithm based on mean values for real-time planning, called MHSP. It consists in associating the principles of UCT, a bandit- based algorithm which gave very good results in computer games, and especially in Computer Go, with heuristic search in order to obtain a real-time planner in the context of clas- sical planning. MHSP is evaluated on di erent planning problems and compared to existing algorithms performing on-line search and learning. Besides, our results highlight the capacity of MHSP to return plans in a real-time manner which tend to an optimal plan over the time which is faster and of better quality compared to existing algorithms in the literature.
Fichier principal
Vignette du fichier
aamas10.pdf (64.09 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-00975972 , version 1 (09-04-2014)

Identifiers

  • HAL Id : hal-00975972 , version 1

Cite

Damien Pellier, Bruno Bouzy, Marc Métivier. A Mean-based Approach for Real-Time Planning. International Conference on Autonomous Agents and Multiagent Systems, May 2010, Toronto, Canada. ⟨hal-00975972⟩

Collections

LIPADE UP-SCIENCES
177 View
83 Download

Share

Gmail Facebook X LinkedIn More