Abstract
This paper introduces Exponential Deepening A* (EDA*), an Iterative Deepening (ID) algorithm where the threshold between successive Depth-First calls is increased exponentially. EDA* can be viewed as a Real-Time Agent-Centered (RTACS) algorithm. Unlike most existing RTACS algorithms, EDA* is proven to hold a worst case bound that is linear in the state space. Experimental results demonstrate up to 5x reduction over existing RTACS solvers wrt distance traveled, states expanded and CPU runtime. Full version of this paper appears in AAAI-14.
Original language | English |
---|---|
Title of host publication | Proceedings of the 7th Annual Symposium on Combinatorial Search, SoCS 2014 |
Editors | Stefan Edelkamp, Roman Bartak |
Publisher | AAAI press |
Pages | 209-210 |
Number of pages | 2 |
ISBN (Electronic) | 9781577356769 |
State | Published - 2014 |
Externally published | Yes |
Event | 7th Annual Symposium on Combinatorial Search, SoCS 2014 - Prague, Czech Republic Duration: 15 Aug 2014 → 17 Aug 2014 |
Publication series
Name | Proceedings of the 7th Annual Symposium on Combinatorial Search, SoCS 2014 |
---|---|
Volume | 2014-January |
Conference
Conference | 7th Annual Symposium on Combinatorial Search, SoCS 2014 |
---|---|
Country/Territory | Czech Republic |
City | Prague |
Period | 15/08/14 → 17/08/14 |
Bibliographical note
Publisher Copyright:© 2014 AAAI press. All Rights Reserved.