Mean-based Heuristic Search for Real-Time Planning

10/22/2018
by   Damien Pellier, et al.
0

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 classical planning. MHSP is evaluated on different 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.

READ FULL TEXT

page 15

page 16

research
01/23/2014

Avoiding and Escaping Depressions in Real-Time Heuristic Search

Heuristics used for solving hard real-time search problems have regions ...
research
12/16/2009

On Backtracking in Real-time Heuristic Search

Real-time heuristic search algorithms are suitable for situated agents t...
research
10/22/2018

Planification en temps réel avec agenda de buts et sauts

In the context of real-time planning, this paper investigates the contri...
research
09/26/2011

Learning in Real-Time Search: A Unifying Framework

Real-time search methods are suited for tasks in which the agent is inte...
research
05/15/2019

Improved Safe Real-time Heuristic Search

A fundamental concern in real-time planning is the presence of dead-ends...
research
11/04/2022

Achieving mouse-level strategic evasion performance using real-time computational planning

Planning is an extraordinary ability in which the brain imagines and the...
research
03/23/2023

Planning as Theorem Proving with Heuristics

Planning as theorem proving in situation calculus was abandoned 50 years...

Please sign up or login with your details

Forgot password? Click here to reset