A Heuristic Search Approach to Planning with Continuous Resources in Stochastic Domains

01/15/2014
by   Nicolas Meuleau, et al.
0

We consider the problem of optimal planning in stochastic domains with resource constraints, where the resources are continuous and the choice of action at each step depends on resource availability. We introduce the HAO* algorithm, a generalization of the AO* algorithm that performs search in a hybrid state space that is modeled using both discrete and continuous state variables, where the continuous variables represent monotonic resources. Like other heuristic search algorithms, HAO* leverages knowledge of the start state and an admissible heuristic to focus computational effort on those parts of the state space that could be reached from the start state by following an optimal policy. We show that this approach is especially effective when resource constraints limit how much of the state space is reachable. Experimental results demonstrate its effectiveness in the domain that motivates our research: automated planning for planetary exploration rovers.

READ FULL TEXT
research
10/01/2022

Nested Search versus Limited Discrepancy Search

Limited Discrepancy Search (LDS) is a popular algorithm to search a stat...
research
01/26/2023

Generalized Planning as Heuristic Search: A new planning search-space that leverages pointers over objects

Planning as heuristic search is one of the most successful approaches to...
research
06/03/2011

The FF Planning System: Fast Plan Generation Through Heuristic Search

We describe and evaluate the algorithmic techniques that are used in the...
research
02/06/2020

Scalable and Probabilistically Complete Planning for Robotic Spatial Extrusion

There is increasing demand for automated systems that can fabricate 3D s...
research
03/15/2012

RAPID: A Reachable Anytime Planner for Imprecisely-sensed Domains

Despite the intractability of generic optimal partially observable Marko...
research
12/03/2021

Heuristic Search Planning with Deep Neural Networks using Imitation, Attention and Curriculum Learning

Learning a well-informed heuristic function for hard task planning domai...
research
03/14/2019

Incremental Learning of Discrete Planning Domains from Continuous Perceptions

We propose a framework for learning discrete deterministic planning doma...

Please sign up or login with your details

Forgot password? Click here to reset