{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,3]],"date-time":"2026-07-03T17:04:26Z","timestamp":1783098266719,"version":"3.54.6"},"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":[[2018,7]]},"abstract":"<jats:p>Multi-agent pathfinding (MAPF) has applications\n\nin navigation, robotics, games and planning. Most\n\nwork on search-based optimal algorithms for\n\nMAPF has focused on simple domains with unit\n\ncost actions and unit time steps. Although these\n\nconstraints keep many aspects of the algorithms\n\nsimple, they also severely limit the domains that\n\ncan be used. In this paper we introduce a new definition\n\nof the MAPF problem for non-unit cost and\n\nnon-unit time step domains along with new multiagent\n\nstate successor generation schemes for these\n\ndomains. Finally, we define an extended version\n\nof the increasing cost tree search algorithm (ICTS)\n\nfor non-unit costs, with two new sub-optimal variants\n\nof ICTS: epsilon-ICTS and w-ICTS. Our experiments\n\nshow that higher quality sub-optimal solutions\n\nare achievable in domains with finely discretized\n\nmovement models in no more time than\n\nlower-quality, optimal solutions in domains with\n\ncoarsely discretized movement models.<\/jats:p>","DOI":"10.24963\/ijcai.2018\/74","type":"proceedings-article","created":{"date-parts":[[2018,7,5]],"date-time":"2018-07-05T01:49:10Z","timestamp":1530755350000},"page":"534-540","source":"Crossref","is-referenced-by-count":41,"title":["Extended Increasing Cost Tree Search for Non-Unit Cost Domains"],"prefix":"10.24963","author":[{"given":"Thayne T.","family":"Walker","sequence":"first","affiliation":[{"name":"University of Denver, Denver CO, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Nathan R.","family":"Sturtevant","sequence":"additional","affiliation":[{"name":"University of Denver, Denver CO, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ariel","family":"Felner","sequence":"additional","affiliation":[{"name":"Ben-Gurion University, Be`er-Sheva, Israel"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"10584","event":{"name":"Twenty-Seventh International Joint Conference on Artificial Intelligence {IJCAI-18}","theme":"Artificial Intelligence","location":"Stockholm, Sweden","acronym":"IJCAI-2018","number":"27","sponsor":["International Joint Conferences on Artificial Intelligence Organization (IJCAI)"],"start":{"date-parts":[[2018,7,13]]},"end":{"date-parts":[[2018,7,19]]}},"container-title":["Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence"],"original-title":[],"deposited":{"date-parts":[[2018,7,5]],"date-time":"2018-07-05T01:49:41Z","timestamp":1530755381000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.ijcai.org\/proceedings\/2018\/74"}},"subtitle":[],"proceedings-subject":"Artificial Intelligence Research Articles","short-title":[],"issued":{"date-parts":[[2018,7]]},"references-count":0,"URL":"https:\/\/doi.org\/10.24963\/ijcai.2018\/74","relation":{},"subject":[],"published":{"date-parts":[[2018,7]]}}}