The following pages link to Sven Koenig (Q198292):
Displaying 23 items.
- Performance bounds for planning in unknown terrain (Q814477) (← links)
- Lifelong planning \(\text{A}^*\) (Q814587) (← links)
- A warning propagation-based linear-time-and-space algorithm for the minimum vertex cover problem on giant graphs (Q1626790) (← links)
- The effect of representation and knowledge on goal-directed exploration with reinforcement-learning algorithms (Q1911346) (← links)
- The Nemhauser-Trotter reduction and lifted message passing for the weighted CSP (Q2011611) (← links)
- Path-length analysis for grid-based path planning (Q2060684) (← links)
- Pairwise symmetry reasoning for multi-agent path finding search (Q2060696) (← links)
- Multi-agent path finding with mutex propagation (Q2082515) (← links)
- A FastMap-based algorithm for block modeling (Q2170199) (← links)
- Quadratic reformulation of nonlinear pseudo-Boolean functions via the constraint composite graph (Q2327292) (← links)
- A New Solver for the Minimum Weighted Vertex Cover Problem (Q2815127) (← links)
- Theta*: Any-Angle Path Planning on Grids (Q3055815) (← links)
- A Near-Tight Approximation Algorithm for the Robot Localization Problem (Q3558011) (← links)
- BnB-ADOPT: An Asynchronous Branch-and-Bound DCOP Algorithm (Q3563097) (← links)
- A near-tight approximation lower bound and algorithm for the kidnapped robot problem (Q3581575) (← links)
- (Q4389785) (← links)
- (Q4411518) (← links)
- (Q4473085) (← links)
- The interaction of representations and planning objectives for decision-theoretic planning tasks (Q4808100) (← links)
- IDB-ADOPT: A Depth-First Search DCOP Algorithm (Q5191411) (← links)
- Bounds on the Travel Cost of a Mars Rover Prototype Search Heuristic (Q5470770) (← links)
- Minimax real-time heuristic search (Q5941315) (← links)
- Conflict-tolerant and conflict-free multi-agent meeting (Q6136090) (← links)
