New Results in Bounded-Suboptimal Search.
|
AAAI |
2022 |
2 |
Online Relaxation Refinement for Satisficing Planning: On Partial Delete Relaxation, Complete Hill-Climbing, and Novelty Pruning.
|
JAIR |
2022 |
0 |
Choosing the Initial State for Online Replanning.
|
AAAI |
2021 |
0 |
Bounded-cost Search Using Estimates of Uncertainty.
|
IJCAI |
2021 |
1 |
Novel Is Not Always Better: On the Relation between Novelty and Dominance Pruning.
|
AAAI |
2020 |
1 |
Beliefs We Can Believe in: Replacing Assumptions with Data in Real-Time Search.
|
AAAI |
2020 |
6 |
A Novel Lookahead Strategy for Delete Relaxation Heuristics in Greedy Best-First Search.
|
ICAPS |
2020 |
5 |
Refining Abstraction Heuristics during Real-Time Planning.
|
AAAI |
2019 |
1 |
Unchaining the Power of Partial Delete Relaxation, Part II: Finding Plans with Red-Black State Space Search.
|
IJCAI |
2018 |
1 |
Online Refinement of Cartesian Abstraction Heuristics.
|
SOCS |
2018 |
0 |
Making Hill-Climbing Great Again through Online Relaxation Refinement and Novelty Pruning.
|
SOCS |
2018 |
0 |
Complete Local Search: Boosting Hill-Climbing through Online Relaxation Refinement.
|
ICAPS |
2017 |
12 |
Ranking Conjunctions for Partial Delete Relaxation Heuristics in Planning.
|
SOCS |
2017 |
0 |
Combining the Delete Relaxation with Critical-Path Heuristics: A Direct Characterization.
|
JAIR |
2016 |
12 |
Explicit Conjunctions without Compilation: Computing h
|
ICAPS |
2015 |
0 |