Using temporal logics to express search control knowledge for planning

By Fahiem Bacchus, Froduald Kabanza. Artificial Intelligence, 2000

696 citations recorded by the source corpus.

View Paper: https://www.semanticscholar.org/paper/e0e76d0b1b384d43afa02f110a2b558b06a7d193

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Artificial Intelligence

Citations in the corpus

Deterministic planning in the fifth international planning competition: PDDL3 and experimental evaluation of the planners (2009, background): “, in [3, 48], p ossibly making its exploration faster or guiding the planner towards better quality solutions.”
Validating Plans in the Context of Processes and Exogenous Events (2005, methodology): “It might appear that this constraint implies that events could be modelled using conditional effects or delayed effects ( Bacchus & Kabanza 2000a ).”
Practical solution techniques for first-order MDPs (2009, positive): “Another approach would be to consider domain-specific control knowledge enco ded as temporal logic constraints as in TLPlan ( Bacchus and Kabanza, 2000 ), program constraints as in Golog (Levesque et al., 1997) (both TLPlan and Golog are deterministic planners) or decision-theoretic extensions such ”
Plan Constraints and Preferences in PDDL3 (2006, methodology): “We propose a semantics for the modal operators that is the same basic interpretation as is used in TLPlan (Bacchus & Kabanza 2000) for LT and other standard LTL treatments.”
Learning Generalized Policies from Planning Examples Using Concept Languages (2004, background): “Planners that rely on domain-dependent control knowledge can outperform the best domain-independent planners [4, 5] but such knowledge is not always easy to provide.”
Approximate Policy Iteration with a Policy Language Bias: Solving Relational Markov Decision Processes (2011, methodology): “We perform experiments in seven familiar STRIPS planning domains including those used in the AIPS-2000 planning competition, those used to evaluate TL-Plan in Bacchus and Kabanza (2000), and the Gripper domain.”
SHOP: Simple Hierarchical Ordered Planner (1999, methodology): “We have tested SHOP against two other planners: Blackbox [Kautz and Selman, 1998], which was one of the two fastest planners in the A1PS-98 planning competition [McDermott, 1998]; and TLplan [Bacchus and Kabanza, 1998] , which outperformed Blackbox by several orders of magnitude in Bacchus and Kaban”
Bridging the gap between planning and scheduling (2000, background): “However, there are two recent and notable exceptions: Bacchus and Kabanza (1999) and Bacchus and Teh (1998) use formulas in temporal logic to provide domain speci®c guidance for a forward state space planning system, and Bonet and Ge ner (1999b) automatically derive strong heuristic guidance by…”
LTL2Action: Generalizing LTL Instructions for Multi-Task RL (2021, methodology): “To prove Theorem 3.1, we use a theorem from Bacchus & Kabanza (2000), which shows the correctness of LTL progression: Theorem A.1.”
The Situation Calculus: A Case for Modal Logic (2010, background): “As shown in [2,18], this can significantly improve the performance of forward-search planners.”
PDDL2.1: An Extension to PDDL for Expressing Temporal Planning Domains (2003, background): “Most recent work on temporal planning (Smith & Weld, 1999; Bacchus & Kabanza, 2000; Do & Kambhampati, 2001) has been based on various forms of durative action.”
Approximate Policy Iteration with a Policy Language Bias (2003, methodology): “We also demonstrate that our techni que is able to iteratively improve policies that correspond to previously published han d-coded control knowledge (for TL-plan [3]) and policies learned by Yoon et al.”
A review of generalized planning (2019, background): “Since the beginning of research in planning, control knowledge has shown effective to improve the scalability of planners [5, 66].”
Temporal Planning with Preferences and Time-Dependent Continuous Costs (2012, background): “While temporal planning has long held the interest of the planning community (c.f., Zeno (Penberthy and Weld 1994), TGP (Smith and Weld 1999), TLPlan (Bacchus and Kabanza 2000), Sapa (Do and Kambhampati 2003), LPG (Gerevini et al. 2006), CRIKEY (Coles et al. 2008), TFD (Eyerich et. al.))”
Planning as heuristic search (2001, methodology): “7 Those results were obtained on a SPARC Ultra 2 with a 296 MHz clock and 256 M of RAM [5].”