Abstract
In this paper we introduce techniques for state pruning at runtime in a priori unknown domains. We describe how to identify states that can be deleted from the state-space when looking for both optimal and suboptimal solutions. We discuss general graphs and special cases like 8-connected grids. Experimental results show a speed up of up to an order of magnitude when applying our techniques on real-time agentcentered search problems.
| Original language | English |
|---|---|
| Pages | 167-174 |
| Number of pages | 8 |
| State | Published - 2013 |
| Externally published | Yes |
| Event | 6th Annual Symposium on Combinatorial Search, SoCS 2013 - Leavenworth, WA, United States Duration: 11 Jul 2013 → 13 Jul 2013 |
Conference
| Conference | 6th Annual Symposium on Combinatorial Search, SoCS 2013 |
|---|---|
| Country/Territory | United States |
| City | Leavenworth, WA |
| Period | 11/07/13 → 13/07/13 |