{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,8,7]],"date-time":"2024-08-07T07:38:49Z","timestamp":1723016329245},"publisher-location":"California","reference-count":0,"publisher":"International Joint Conferences on Artificial Intelligence Organization","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017,8]]},"abstract":"<jats:p>Real-time search algorithms are relevant to time-sensitive decision-making domains such as video games and robotics. In such settings, the agent is required to decide on each action under a constant time bound, regardless of the search space size. Despite recent progress, poor-quality solutions can be produced mainly due to state re-visitation. Different techniques have been developed to reduce such a re-visitation with state pruning showing promise. In this paper, we propose a novel pruning approach applicable to the wide class of real-time search algorithms. Given a local search space of arbitrary size, our technique aggressively prunes away all states in its interior, possibly adding new edges to maintain the connectivity of the search space frontier. An experimental evaluation shows that our pruning often improves the performance of a base real-time search algorithm by over an order of magnitude. \n\nThis allows our implemented system to outperform state-of-the-art real-time search algorithms used in the evaluation.<\/jats:p>","DOI":"10.24963\/ijcai.2017\/72","type":"proceedings-article","created":{"date-parts":[[2017,7,28]],"date-time":"2017-07-28T05:14:07Z","timestamp":1501218847000},"page":"510-516","source":"Crossref","is-referenced-by-count":3,"title":["Online Bridged Pruning for Real-Time Search with Arbitrary Lookaheads"],"prefix":"10.24963","author":[{"given":"Carlos","family":"Hernandez","sequence":"first","affiliation":[{"name":"Universidad Andr\u00e9s Bello, Chile"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Adi","family":"Botea","sequence":"additional","affiliation":[{"name":"IBM Research, Ireland"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jorge A.","family":"Baier","sequence":"additional","affiliation":[{"name":"Pontificia Universidad Cat\u00f3lica de Chile"},{"name":"Chilean Center for Semantic Web Research"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vadim","family":"Bulitko","sequence":"additional","affiliation":[{"name":"University of Alberta, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"10584","event":{"number":"26","sponsor":["International Joint Conferences on Artificial Intelligence Organization (IJCAI)","University of Technology Sydney (UTS)","Australian Computer Society (ACS)"],"acronym":"IJCAI-2017","name":"Twenty-Sixth International Joint Conference on Artificial Intelligence","start":{"date-parts":[[2017,8,19]]},"theme":"Artificial Intelligence","location":"Melbourne, Australia","end":{"date-parts":[[2017,8,26]]}},"container-title":["Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence"],"original-title":[],"deposited":{"date-parts":[[2017,7,28]],"date-time":"2017-07-28T07:52:07Z","timestamp":1501228327000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.ijcai.org\/proceedings\/2017\/72"}},"subtitle":[],"proceedings-subject":"Artificial Intelligence Research Articles","short-title":[],"issued":{"date-parts":[[2017,8]]},"references-count":0,"URL":"https:\/\/doi.org\/10.24963\/ijcai.2017\/72","relation":{},"subject":[],"published":{"date-parts":[[2017,8]]}}}