{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,19]],"date-time":"2026-02-19T02:01:52Z","timestamp":1771466512879,"version":"3.50.1"},"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":[[2021,8]]},"abstract":"<jats:p>We study the two-player zero-sum extension of the partially observable stochastic shortest-path problem where one agent has only partial information about the environment.\n\nWe formulate this problem as a partially observable stochastic game (POSG): given a set of target states and negative rewards for each transition, the player with imperfect information maximizes the expected undiscounted total reward until a target state is reached. The second player with the perfect information aims for the opposite.\n\nWe base our formalism on POSGs with one-sided observability (OS-POSGs) and give the following contributions:\n\n(1) we introduce a novel heuristic search value iteration algorithm that iteratively solves depth-limited variants of the game,\n\n(2) we derive the bound on the depth guaranteeing an arbitrary precision, (3) we propose a novel upper-bound estimation that allows early terminations, and\n\n(4) we experimentally evaluate the algorithm on a pursuit-evasion game.<\/jats:p>","DOI":"10.24963\/ijcai.2021\/575","type":"proceedings-article","created":{"date-parts":[[2021,8,11]],"date-time":"2021-08-11T11:00:49Z","timestamp":1628679649000},"page":"4182-4189","source":"Crossref","is-referenced-by-count":7,"title":["Solving Partially Observable Stochastic Shortest-Path Games"],"prefix":"10.24963","author":[{"given":"Petr","family":"Tom\u00e1\u0161ek","sequence":"first","affiliation":[{"name":"Artificial Intelligence Center, Dept. of Computer Science, Faculty of Electrical Engineering, Czech Technical University in Prague"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Karel","family":"Hor\u00e1k","sequence":"additional","affiliation":[{"name":"Artificial Intelligence Center, Dept. of Computer Science, Faculty of Electrical Engineering, Czech Technical University in Prague"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Aditya","family":"Aradhye","sequence":"additional","affiliation":[{"name":"Artificial Intelligence Center, Dept. of Computer Science, Faculty of Electrical Engineering, Czech Technical University in Prague"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Branislav","family":"Bo\u0161ansk\u00fd","sequence":"additional","affiliation":[{"name":"Artificial Intelligence Center, Dept. of Computer Science, Faculty of Electrical Engineering, Czech Technical University in Prague"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Krishnendu","family":"Chatterjee","sequence":"additional","affiliation":[{"name":"Institute of Science and Technology Austria"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"10584","event":{"name":"Thirtieth International Joint Conference on Artificial Intelligence {IJCAI-21}","theme":"Artificial Intelligence","location":"Montreal, Canada","acronym":"IJCAI-2021","number":"30","sponsor":["International Joint Conferences on Artificial Intelligence Organization (IJCAI)"],"start":{"date-parts":[[2021,8,19]]},"end":{"date-parts":[[2021,8,27]]}},"container-title":["Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence"],"original-title":[],"deposited":{"date-parts":[[2021,8,11]],"date-time":"2021-08-11T11:04:07Z","timestamp":1628679847000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.ijcai.org\/proceedings\/2021\/575"}},"subtitle":[],"proceedings-subject":"Artificial Intelligence Research Articles","short-title":[],"issued":{"date-parts":[[2021,8]]},"references-count":0,"URL":"https:\/\/doi.org\/10.24963\/ijcai.2021\/575","relation":{},"subject":[],"published":{"date-parts":[[2021,8]]}}}