Exponential deepening a* for real-time agent-centered search (extended abstract), full version has been accepted to aaai-2014

Guni Sharon; Ariel Felner; Nathan R. Sturtevant

Exponential deepening a* for real-time agent-centered search (extended abstract), full version has been accepted to aaai-2014

Guni Sharon
, Ariel Felner
, Nathan R. Sturtevant

Ben-Gurion University of the Negev
University of Denver

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

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.

Funding

This research was supported by the Israel Science Foundation (ISF) under grant #417/13 to Ariel Felner.

Funders	Funder number
Israel Science Foundation	417/13

Cite this

Sharon, G., Felner, A., & Sturtevant, N. R. (2014). Exponential deepening a* for real-time agent-centered search (extended abstract), full version has been accepted to aaai-2014. In S. Edelkamp, & R. Bartak (Eds.), Proceedings of the 7th Annual Symposium on Combinatorial Search, SoCS 2014 (pp. 209-210). (Proceedings of the 7th Annual Symposium on Combinatorial Search, SoCS 2014; Vol. 2014-January). AAAI press.

Sharon, Guni ; Felner, Ariel ; Sturtevant, Nathan R. / Exponential deepening a* for real-time agent-centered search (extended abstract), full version has been accepted to aaai-2014. Proceedings of the 7th Annual Symposium on Combinatorial Search, SoCS 2014. editor / Stefan Edelkamp ; Roman Bartak. AAAI press, 2014. pp. 209-210 (Proceedings of the 7th Annual Symposium on Combinatorial Search, SoCS 2014).

@inproceedings{5ec7c54a876a4f1d827920d3c419d904,

title = "Exponential deepening a* for real-time agent-centered search (extended abstract), full version has been accepted to aaai-2014",

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.",

author = "Guni Sharon and Ariel Felner and Sturtevant, \{Nathan R.\}",

year = "2014",

language = "אנגלית",

series = "Proceedings of the 7th Annual Symposium on Combinatorial Search, SoCS 2014",

publisher = "AAAI press",

pages = "209--210",

editor = "Stefan Edelkamp and Roman Bartak",

booktitle = "Proceedings of the 7th Annual Symposium on Combinatorial Search, SoCS 2014",

}

Sharon, G, Felner, A & Sturtevant, NR 2014, Exponential deepening a* for real-time agent-centered search (extended abstract), full version has been accepted to aaai-2014. in S Edelkamp & R Bartak (eds), Proceedings of the 7th Annual Symposium on Combinatorial Search, SoCS 2014. Proceedings of the 7th Annual Symposium on Combinatorial Search, SoCS 2014, vol. 2014-January, AAAI press, pp. 209-210, 7th Annual Symposium on Combinatorial Search, SoCS 2014, Prague, Czech Republic, 15/08/14.

Exponential deepening a* for real-time agent-centered search (extended abstract), full version has been accepted to aaai-2014. / Sharon, Guni; Felner, Ariel; Sturtevant, Nathan R.
Proceedings of the 7th Annual Symposium on Combinatorial Search, SoCS 2014. ed. / Stefan Edelkamp; Roman Bartak. AAAI press, 2014. p. 209-210 (Proceedings of the 7th Annual Symposium on Combinatorial Search, SoCS 2014; Vol. 2014-January).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Exponential deepening a* for real-time agent-centered search (extended abstract), full version has been accepted to aaai-2014

AU - Sharon, Guni

AU - Felner, Ariel

AU - Sturtevant, Nathan R.

PY - 2014

Y1 - 2014

N2 - 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.

AB - 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.

UR - https://www.scopus.com/pages/publications/85048713655

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:85048713655

T3 - Proceedings of the 7th Annual Symposium on Combinatorial Search, SoCS 2014

SP - 209

EP - 210

BT - Proceedings of the 7th Annual Symposium on Combinatorial Search, SoCS 2014

A2 - Edelkamp, Stefan

A2 - Bartak, Roman

PB - AAAI press

T2 - 7th Annual Symposium on Combinatorial Search, SoCS 2014

Y2 - 15 August 2014 through 17 August 2014

ER -

Sharon G, Felner A, Sturtevant NR. Exponential deepening a* for real-time agent-centered search (extended abstract), full version has been accepted to aaai-2014. In Edelkamp S, Bartak R, editors, Proceedings of the 7th Annual Symposium on Combinatorial Search, SoCS 2014. AAAI press. 2014. p. 209-210. (Proceedings of the 7th Annual Symposium on Combinatorial Search, SoCS 2014).

Exponential deepening a* for real-time agent-centered search (extended abstract), full version has been accepted to aaai-2014

Abstract

Publication series

Conference

Bibliographical note

Funding

Other files and links

Fingerprint

Cite this