A Heuristic Search Approach to Planning with Continuous Resources in Stochastic Domains
원문 초록
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.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
SQL-o1: Automatic Text-to-SQL Program Synthesis via Self-Reward Heuristic Search
A Survey on Mathematical Reasoning and Optimization with Large Language Models
KBQA-o1: Agentic Knowledge Base Question Answering with Monte Carlo Tree Search
On Parallel External-Memory Bidirectional Search
LLM-Virus: Evolutionary Jailbreak Attack on Large Language Models
HSEvo: Elevating Automatic Heuristic Design with Diversity-Driven Harmony Search and Genetic Algorithm Using LLMs
토론
이 논문과 연결된 포럼 글이 아직 없습니다.