On the Optimal Efficiency of A* with Dominance Pruning

Stackelberg Planning Solving Symbolic Leader Search Net-Benefit Results Conclusions Outline Stackelberg Planning Solving Stackelberg Tasks: Previous Work Symbolic Leader Search Net-Benefit Stackelberg Planning Empirical Results Conclusions Stackelberg Planning Solving Symbolic Leader Search Net-Benefit Results Conclusions DXBB Algorithms UDXBB: Unidirectional, Deterministic, Expansion-based, Black Box Access to the state space Θ only via node expansions Additionally the algorithm is given an admissible heuristic function h →h(s) estimates the distance from s to the goal h * (s), h(s) ≤ h * (s) A10 h2 On the Optimal Efficiency of A * with Dominance Pruning