Research map / Learning theory and algorithms / Combinatorial and search optimization
Fast SSP Solvers Using Short-Sighted Labeling
Luis Pineda, Kyle Wray, Shlomo Zilberstein
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 |
|---|---|---|---|
| use FLARES(0) instead of LRTDP | SSP solver · Grid world | planning time (s): 34.02 -> 1.28 | Improved |
| use FLARES(0) instead of LRTDP | SSP solver · Grid world | expected cost: 135 -> 134.43 ± 0.88 | No clear effect |
| increase horizon t from 0 to 1 in FLARES (ablation) | FLARES · Racetrack ring-5 | average cost: 43.56 ± 1.21 -> 37.81 ± 0.99 | Improved |
| increase horizon t from 0 to 1 in FLARES (ablation) | FLARES · Sailing size=20 goal=corner | average cost: 125.13 ± 6.88 -> 94.31 ± 2.98 | Improved |
| increase horizon t from 0 to 1 in FLARES (ablation) | FLARES · Sailing size=20 goal=corner | planning time (s): 0.33 -> 0.99 | Hurt |
| increase horizon t from 0 to 1 in FLARES (ablation) | FLARES · Racetrack square-4 | planning time (s): 0.43 -> 1.37 | Hurt |
| use FLARES(1) instead of HDP(0) | SSP solver · Racetrack square-4 | planning time (s): 27.00 -> 1.37 | Improved |
| use FLARES(1) instead of HDP(0) | SSP solver · Sailing size=20 goal=corner | average cost: 88.13 ± 2.62 -> 94.31 ± 2.98 | Hurt |
| use FLARES(1) instead of HDP(0) | SSP solver · Sailing size=40 goal=corner | planning time (s): 10.58 -> 7.47 | Improved |
| use FLARES(1) instead of SSiPP(4) | SSP solver · Sailing size=40 goal=corner | average cost: 282.53 ± 11.32 -> 181.45 ± 3.56 | Improved |
| use FLARES(1) instead of SSiPP(4) | SSP solver · Racetrack ring-5 | planning time (s): 1.29 -> 4.51 | Hurt |
| use FLARES(t=4) instead of HDP(0) and SSiPP | SSP solver · Triangle-tireworld, first ten problems | success rate | Improved |
Closest papers by meaning
- Efficient Constraint Generation for Stochastic Shortest Path Problems (AAAI 2024 · similarity 0.86)
- Discovering Options That Minimize Average Planning Time (AAAI 2025 · similarity 0.83)
- Symbolic Numeric Planning with Patterns (AAAI 2024 · similarity 0.83)
- Planning Anything with Rigor: General-Purpose Zero-Shot Planning with LLM-based Formalized Programming (ICLR 2025 · similarity 0.83)
- PDBs Go Numeric: Pattern-Database Heuristics for Simple Numeric Planning (AAAI 2025 · similarity 0.83)
- Theoretical and Empirical Analysis of Cost-Function Merging for Implicit Hitting Set WCSP Solving (AAAI 2024 · similarity 0.83)
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.
