7 papers · 1 filter
Bidirectional Search for Longest Paths: Case for Front-to-Front Heuristics
Tzur Shubi, Ariel Felner, Solomon Eyal Shimony +1
Bidirectional heuristic search can potentially reduce search effort for problems amenable to backward search. Therein, it is well-known that front-to-front heuristics can reduce th…
RAMP: Hybrid DRL for Online Learning of Numeric Action Models
Yarin Benyamin, Argaman Mordoch, Shahaf S. Shperberg +1
Automated planning algorithms require an action model specifying the preconditions and effects of each action, but obtaining such a model is often hard. Learning action models from…
Bidirectional Bounded-Suboptimal Heuristic Search with Consistent Heuristics
Shahaf S. Shperberg, Natalie Morad, Lior Siag +2
Recent advancements in bidirectional heuristic search have yielded significant theoretical insights and novel algorithms. While most previous work has concentrated on optimal searc…
Beyond Single-Step Updates: Reinforcement Learning of Heuristics with Limited-Horizon Search
Gal Hadar, Forest Agostinelli, Shahaf S. Shperberg
Many sequential decision-making problems can be formulated as shortest-path problems, where the objective is to reach a goal state from a given starting state. Heuristic search is…
Toward PDDL Planning Copilot
Yarin Benyamin, Argaman Mordoch, Shahaf S. Shperberg +1
Large Language Models (LLMs) are increasingly being used as autonomous agents capable of performing complicated tasks. However, they lack the ability to perform reliable long-horiz…
Integrating Reinforcement Learning, Action Model Learning, and Numeric Planning for Tackling Complex Tasks
Yarin Benyamin, Argaman Mordoch, Shahaf S. Shperberg +1
Automated Planning algorithms require a model of the domain that specifies the preconditions and effects of each action. Obtaining such a domain model is notoriously hard. Algorith…