Exponential deepening A∗ for real-time agent-centered search

Guni Sharon; Ariel Felner; Nathan R. Sturtevant

Exponential deepening A∗ for real-time agent-centered search

Guni Sharon, Ariel Felner, Nathan R. Sturtevant

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

12 Scopus citations

Abstract

In the Real-Time Agent-Centered Search (RTACS) problem, an agent has to arrive at a goal location while acting and reasoning in the physical world. Traditionally, RTACS problems are solved by propagating and updating heuristic values of states visited by the agent. In existing RTACS algorithms the agent may revisit each state many times causing the entire procedure to be quadratic in the state space. We study the Iterative Deepening (ID) approach for solving RTACS and introduce Exponential Deepening A∗ (EDA∗), an RTACS algorithm where the threshold between successive Depth-First calls is increased exponentially. EDA∗ is proven to hold a worst case bound that is linear in the state space. Experimental results supporting this bound are presented and demonstrate up to 10x reduction over existing RTACS solvers wrt distance traveled, states expanded and CPU runtime.

Original language	English
Title of host publication	Proceedings of the National Conference on Artificial Intelligence
Publisher	AI Access Foundation
Pages	871-877
Number of pages	7
ISBN (Electronic)	9781577356783
State	Published - 2014
Externally published	Yes
Event	28th AAAI Conference on Artificial Intelligence, AAAI 2014, 26th Innovative Applications of Artificial Intelligence Conference, IAAI 2014 and the 5th Symposium on Educational Advances in Artificial Intelligence, EAAI 2014 - Quebec City, Canada Duration: 27 Jul 2014 → 31 Jul 2014

Publication series

Name	Proceedings of the National Conference on Artificial Intelligence
Volume	2

Conference

Conference	28th AAAI Conference on Artificial Intelligence, AAAI 2014, 26th Innovative Applications of Artificial Intelligence Conference, IAAI 2014 and the 5th Symposium on Educational Advances in Artificial Intelligence, EAAI 2014
Country/Territory	Canada
City	Quebec City
Period	27/07/14 → 31/07/14

Bibliographical note

Publisher Copyright:
Copyright © 2014, Association for the Advancement of Artificial Intelligence (www.aaai.org). All rights reserved.

Cite this

@inproceedings{261dd342b01c4286ba4817b7383d4495,

title = "Exponential deepening A∗ for real-time agent-centered search",

abstract = "In the Real-Time Agent-Centered Search (RTACS) problem, an agent has to arrive at a goal location while acting and reasoning in the physical world. Traditionally, RTACS problems are solved by propagating and updating heuristic values of states visited by the agent. In existing RTACS algorithms the agent may revisit each state many times causing the entire procedure to be quadratic in the state space. We study the Iterative Deepening (ID) approach for solving RTACS and introduce Exponential Deepening A∗ (EDA∗), an RTACS algorithm where the threshold between successive Depth-First calls is increased exponentially. EDA∗ is proven to hold a worst case bound that is linear in the state space. Experimental results supporting this bound are presented and demonstrate up to 10x reduction over existing RTACS solvers wrt distance traveled, states expanded and CPU runtime.",

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

note = "Publisher Copyright: Copyright {\textcopyright} 2014, Association for the Advancement of Artificial Intelligence (www.aaai.org). All rights reserved.; 28th AAAI Conference on Artificial Intelligence, AAAI 2014, 26th Innovative Applications of Artificial Intelligence Conference, IAAI 2014 and the 5th Symposium on Educational Advances in Artificial Intelligence, EAAI 2014 ; Conference date: 27-07-2014 Through 31-07-2014",

year = "2014",

language = "אנגלית",

series = "Proceedings of the National Conference on Artificial Intelligence",

publisher = "AI Access Foundation",

pages = "871--877",

booktitle = "Proceedings of the National Conference on Artificial Intelligence",

address = "ארצות הברית",

}

Sharon, G, Felner, A & Sturtevant, NR 2014, Exponential deepening A∗ for real-time agent-centered search. in Proceedings of the National Conference on Artificial Intelligence. Proceedings of the National Conference on Artificial Intelligence, vol. 2, AI Access Foundation, pp. 871-877, 28th AAAI Conference on Artificial Intelligence, AAAI 2014, 26th Innovative Applications of Artificial Intelligence Conference, IAAI 2014 and the 5th Symposium on Educational Advances in Artificial Intelligence, EAAI 2014, Quebec City, Canada, 27/07/14.

Exponential deepening A∗ for real-time agent-centered search. / Sharon, Guni; Felner, Ariel; Sturtevant, Nathan R.
Proceedings of the National Conference on Artificial Intelligence. AI Access Foundation, 2014. p. 871-877 (Proceedings of the National Conference on Artificial Intelligence; Vol. 2).

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

TY - GEN

T1 - Exponential deepening A∗ for real-time agent-centered search

AU - Sharon, Guni

AU - Felner, Ariel

AU - Sturtevant, Nathan R.

PY - 2014

Y1 - 2014

N2 - In the Real-Time Agent-Centered Search (RTACS) problem, an agent has to arrive at a goal location while acting and reasoning in the physical world. Traditionally, RTACS problems are solved by propagating and updating heuristic values of states visited by the agent. In existing RTACS algorithms the agent may revisit each state many times causing the entire procedure to be quadratic in the state space. We study the Iterative Deepening (ID) approach for solving RTACS and introduce Exponential Deepening A∗ (EDA∗), an RTACS algorithm where the threshold between successive Depth-First calls is increased exponentially. EDA∗ is proven to hold a worst case bound that is linear in the state space. Experimental results supporting this bound are presented and demonstrate up to 10x reduction over existing RTACS solvers wrt distance traveled, states expanded and CPU runtime.

AB - In the Real-Time Agent-Centered Search (RTACS) problem, an agent has to arrive at a goal location while acting and reasoning in the physical world. Traditionally, RTACS problems are solved by propagating and updating heuristic values of states visited by the agent. In existing RTACS algorithms the agent may revisit each state many times causing the entire procedure to be quadratic in the state space. We study the Iterative Deepening (ID) approach for solving RTACS and introduce Exponential Deepening A∗ (EDA∗), an RTACS algorithm where the threshold between successive Depth-First calls is increased exponentially. EDA∗ is proven to hold a worst case bound that is linear in the state space. Experimental results supporting this bound are presented and demonstrate up to 10x reduction over existing RTACS solvers wrt distance traveled, states expanded and CPU runtime.

UR - http://www.scopus.com/inward/record.url?scp=84908167974&partnerID=8YFLogxK

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

AN - SCOPUS:84908167974

T3 - Proceedings of the National Conference on Artificial Intelligence

SP - 871

EP - 877

BT - Proceedings of the National Conference on Artificial Intelligence

PB - AI Access Foundation

T2 - 28th AAAI Conference on Artificial Intelligence, AAAI 2014, 26th Innovative Applications of Artificial Intelligence Conference, IAAI 2014 and the 5th Symposium on Educational Advances in Artificial Intelligence, EAAI 2014

Y2 - 27 July 2014 through 31 July 2014

ER -

Exponential deepening A∗ for real-time agent-centered search

Abstract

Publication series

Conference

Bibliographical note

Other files and links

Fingerprint

Cite this