Research map / Learning theory and algorithms / Combinatorial and search optimization
Dominance Pruning and Heuristics in Optimal Adversarial Non-Deterministic Planning
Rasmus G. Tollund, Álvaro Torralba
Read the paperCheck your idea against 137,217 papers
AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Measured effects reported in the paper
| What was changed | Where | Measured | Effect |
|---|---|---|---|
| add dominance pruning (PruneOutcome + PruneSource) (ablation) | BLDFS with blind heuristic · Adversarial FOND benchmarks | total coverage: 601 -> 710 | Improved |
| add PruneSource (ablation) | BLDFS with blind heuristic · Adversarial FOND benchmarks | total coverage: 601 -> 666 | Improved |
| add PruneOutcome (ablation) | BLDFS with blind heuristic · Adversarial FOND benchmarks | total coverage: 601 -> 639 | Improved |
| add PruneInit (ablation) | BLDFS with blind heuristic · Adversarial FOND benchmarks | total coverage: 601 -> 589 | Hurt |
| add PruneAction (ablation) | BLDFS with blind heuristic · Adversarial FOND benchmarks | total coverage: 601 -> 610 | Mixed |
| add dominance pruning (ablation) | BLDFS with blind heuristic · miner | coverage: 11 -> 41 | Improved |
| add dominance pruning (ablation) | BLDFS with blind heuristic · rectangle-tireworld | coverage: 28 -> 16 | Hurt |
| add dominance pruning (ablation) | BLDFS with blind heuristic · food-delivery | coverage: 62 -> 62 | No clear effect |
| use single-outcome determinization (first outcome) instead of all-outcome (ablation) | LMCut heuristic · Adversarial FOND benchmarks | total coverage: 635 -> 725 | Improved |
| use single-outcome determinization (random outcome) instead of all-outcome (ablation) | LMCut with dominance pruning · Adversarial FOND benchmarks | total coverage: 728 -> 773 | Improved |
| add dominance pruning to LMCut with first-outcome determinization (ablation) | LMCut · Adversarial FOND benchmarks | total coverage: 725 -> 771 | Improved |
Closest papers by meaning
- Policy-Guided Heuristic Search with Guarantees (AAAI 2021 · similarity 0.89)
- Adversarial Actor-Critic Method for Task and Motion Planning Problems Using Planning Experience (AAAI 2019 · similarity 0.87)
- Best-Effort Policies for Robust Markov Decision Processes (AAAI 2026 · similarity 0.86)
- Robust and Diverse Multi-Agent Learning via Rational Policy Gradient (NeurIPS 2025 · similarity 0.86)
- Learning Domain-Independent Heuristics for Grounded and Lifted Planning (AAAI 2024 · similarity 0.85)
- Adversarial Policy Optimization for Offline Preference-based Reinforcement Learning (ICLR 2025 · similarity 0.85)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.
