Skip to search formSkip to main contentSkip to account menu
Deterministic planning in the fifth international planning competition: PDDL3 and experimental evaluation of the planners
View via Publisher
Planning Through Stochastic Local Search and Temporal Action Graphs in LPG
TLDR
This paper focuses on temporal planning, introducing TA-graphs and proposing some techniques to guide the search in LPG using this representation, and shows that these techniques can be very effective.
View PDF on arXiv
An Approach to Temporal Planning and Scheduling in Domains with Predictable Exogenous Events
TLDR
This paper proposes an approach to planning in temporal domains with exogenous events that happen at known times, imposing the constraint that certain actions in the plan must be executed during some predefined time windows which integrates constraint-based temporal reasoning into a graph-based planning framework using local search.
View PDF on arXiv
An approach to efficient planning with numerical fluents and multi-criteria plan quality
View via Publisher
Planning in PDDL2.2 Domains with LPG-td
LPG-TD : a Fully Automated Planner for PDDL 2 . 2 Domains
Like the previous version of LPG, the new version is based on a stochastic local search in the space of particular “action graphs” derived from the planning problem specification. In LPG-TD, this…
A Privacy-preserving Model for the Multi-agent Propositional Planning Problem
View via Publisher
An Automatically Configurable Portfolio-based Planner with Macro-actions: PbP
TLDR
P is a multi-planner which automatically configures a portfolio of planners by computing some sets of macro-actions for every planner in the portfolio, selecting a promising combination of planners in the portfolios and relative useful macro- actions, and defining some running time slots for their round-robin scheduling during planning.
View Paper
Case-based Planning for Problems with Real-valued Fluents: Kernel Functions for Effective Plan Retrieval
TLDR
This work proposes some new heuristic techniques for retrieving a plan from a library of existing plans that is promising for a new given planning problem, i.e., that can be efficiently adapted to solve the new problem.
View via Publisher
Fast Planning in Domains with Derived Predicates: An Approach Based on Rule-Action Graphs and Local Search
TLDR
This paper presents some techniques for representing rules and reasoning with them, which are integrated into a method for planning through local search and rule-action graphs, and proposes some new heuristics for guiding the search.
View Paper
...
...
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy, Terms of Service, and Dataset License