No article text was recorded for this version.
dead-end detection
Version 2 of 2136 papers202 conceptsfrozen 2026-10-04
Papers in this version
- Blog: Traps, Invariants, and Dead-Ends
- Blog: Handling non-local dead-ends in Agent Planning Programs
- Blog: Search and Learn: On Dead-End Detectors, the Traps they Set, and Trap Learning
- Blog: PRP Rebooted: Advancing the State of the Art in FOND Planning
- Blog: mGPT: A Probabilistic Planner Based on Heuristic Search
- Blog: A Monte Carlo Tree Search Player for Birds of a Feather Solitaire
- Blog: Fact-Alternating Mutex Groups for Classical Planning (Extended Abstract)
- Blog: From State Spaces to Semigroups: Leveraging Algebraic Formalism for Automated Planning
- Blog: On Methods To Decide Solvability of Transformation Problems
- Blog: A Best-First Search Algorithm for FOND Planning and Heuristic Functions to Optimize Decompressed Solution Size
- Blog: From FOND to Robust Probabilistic Planning: Computing Compact Policies that Bypass Avoidable Deadends
- Blog: The First Probabilistic Track of the International Planning Competition
- Blog: PRP Rebooted: Advancing the State of the Art in FOND Planning
- Blog: Revisiting Goal Probability Analysis in Probabilistic Planning
- Blog: Towards Automated Planning Domain Models Generation
- Blog: Improved Non-Deterministic Planning by Exploiting State Relevance
- Blog: Learning Where You Are Going and from Whence You Came:
- Blog: Real-Time Search in Non-Deterministic Domains
- Blog: Heuristic Strategies for Accelerating Multi-Agent Epistemic Planning
- Blog: Domain-Dependent Single-Agent Search Enhancements
- Blog: Towards Scalable MDP Algorithms
- Blog: Improving Cost-Optimal Domain-Independent Symbolic Planning
- Blog: A Study of Search Methods: The Effect of Constraint Satisfaction and Adventurousness
- Blog: Left Heavy Tails and the Effectiveness of the Policy and Value Networks in DNN-based best-first search for Sokoban Planning
- Blog: Efficient Solving of Birds of a Feather Puzzles
- Blog: Computational Intractability and Solvability for the Birds of a Feather Game
- Blog: Operator Counting Heuristics for Probabilistic Planning
- Blog: A Theory of Goal-Oriented MDPs with Dead Ends
- Blog: Forward-Chaining Planning in Nondeterministic Domains
- Blog: Learning Where You Are Going and from Whence You Came: h- and g-Cost Learning in Real-Time Heuristic Search
- Blog: Using Pre-Computed Knowledge for Goal Allocation in Multi-Agent Planning
- Blog: Compliant Conditions for Polynomial Time Approximation of Operator Counts
- Blog: Classical Planning with Avoid Conditions
- Blog: Proving the Impossible is Impossible is Possible: Disproofs Based on Hereditary Partitions
- Blog: Learning to Rank for Synthesizing Planning Heuristics
- Blog: Goal Probability Analysis in Probabilistic Planning: Exploring and Enhancing the State of the Art
- Blog: Plan-Space Explanation via Plan-Property Dependencies: Faster Algorithms & More Powerful Properties
- Blog: Extending Classical Planning Heuristics to Probabilistic Planning with Dead-Ends
- Blog: Red-Black Relaxed Plan Heuristics Reloaded
- Blog: Property Persistence in the Situation Calculus
- Blog: Speeding up the Parti-Game Algorithm
- Blog: Contingent Planning as AND/OR Forward Search with Disjunctive Representation
- Blog: Compiling Planning Problems with Non-deterministic Events into FOND Planning
- Blog: Non-Deterministic Planning With Conditional Effects
- Blog: Learning to Rank for Synthesizing Planning Heuristics
- Blog: Using Backwards Generated Goals for Heuristic Planning
- Blog: Inferring Implicit Goals Across Differing Task Models
- Blog: New Optimization Functions for Potential Heuristics
- Blog: SixthSense: Fast and Reliable Recognition of Dead Ends in MDPs
- Blog: Bidirectional Search while Ensuring Meet-In-The-Middle via Effective and Efficient-to-Compute Termination Conditions
- Blog: Egocentric Planning for Scalable Embodied Task Achievement
- Blog: LP Heuristics over Conjunctions: Compilation, Convergence, Nogood Learning
- Blog: Efficient Recovery of Missing Events
- Blog: Iterative Depth-First Search for FOND Planning
- Blog: Determining Solvability in the Birds of a Feather Card Game
- Blog: Flexible and Scalable Partially Observable Planning with Linear Translations
- Blog: Learning Classical Planning Strategies with Policy Gradient
- Blog: A Cognitive Approach to solve Water Jugs Problem
- Blog: V-MIN: Efficient Reinforcement Learning through Demonstrations and Relaxed Reward Demands
- Blog: Synthesizing Plant Controllers Using Real-time Goals
Showing 60 of 136 papers.
History & citation
Current · Permanent link
Cite this direction
Latest version (a living page):
@misc{lacuna_dead_end_detection_ab540146,
title = {dead-end detection},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/dead-end-detection/rdr_ab54014650344b6cbb688d36afbf166b},
note = {Latest version of a living research direction; cite a version for a fixed text. Accessed 2026-11-20},
}This exact version (version 2, frozen text):
@misc{lacuna_dead_end_detection_ab540146_v2,
title = {dead-end detection},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/dead-end-detection/rdr_ab54014650344b6cbb688d36afbf166b/v/2},
note = {Version 2, frozen 2026-10-04. Accessed 2026-11-20},
}