To Örebro University

oru.seÖrebro University Publications
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Truncated Counterfactual Learning for Anytime Multi-Agent Path Finding
University of Bayreuth, Germany.
University of Southern California, USA .
Örebro University, School of Science and Technology. University of California, Irvine, USA.
2026 (English)In: Proceedings of the 40th Annual AAAI Conference on Artificial Intelligence: Vol. 40 No. 35: AAAI-26 Technical Tracks 35 / [ed] Sven Koenig; Chad Jenkins; Matthew E. Taylor, AAAI Press, 2026, Vol. 40:35, p. 29633-29641Conference paper, Published paper (Refereed)
Abstract [en]

Anytime multi-agent path finding (MAPF) is a promising approach to scalable and collision-free path optimization in multi-agent systems. MAPF-LNS, based on Large Neighborhood Search (LNS), is the current state-of-the-art approach where a fast initial solution is iteratively optimized by destroying and repairing selected paths, i.e., a neighborhood, of the solution. Delay-based MAPF-LNS has demonstrated particular effectiveness in generating promising neighborhoods via seed agents, according to their delays. Seed agents are selected using handcrafted strategies or online learning, where the former relies on human intuition about underlying structures, while the latter conducts black-box optimization, ignoring any structure. In this paper, we propose Truncated Adaptive Counterfactual K-ranked LEarning (TACKLE) to select seed agents via informed online learning by leveraging handcrafted strategies as human intuition. We show theoretically that TACKLE dominates its handcrafted and black-box learning counterparts in the limit. Our experiments demonstrate cost improvements of at least 60% in instances with one thousand agents, compared with state-of-the-art anytime solvers. 

Place, publisher, year, edition, pages
AAAI Press, 2026. Vol. 40:35, p. 29633-29641
Series
Proceedings of the AAAI Conference on Artificial Intelligence, ISSN 2159-5399, E-ISSN 2374-3468 ; 40:35
National Category
Computer Sciences Artificial Intelligence
Identifiers
URN: urn:nbn:se:oru:diva-130149DOI: 10.1609/aaai.v40i35.40207ISI: 001769422900039ISBN: 9781577359067 (electronic)OAI: oai:DiVA.org:oru-130149DiVA, id: diva2:2087697
Conference
40th AAAI Conference on Artificial Intelligence (AAAI-26), 2026, Singapore, January 20-27, 2026
Available from: 2026-07-22 Created: 2026-07-22 Last updated: 2026-07-22Bibliographically approved

Open Access in DiVA

No full text in DiVA

Other links

Publisher's full text

Authority records

Koenig, Sven

Search in DiVA

By author/editor
Koenig, Sven
By organisation
School of Science and Technology
Computer SciencesArtificial Intelligence

Search outside of DiVA

GoogleGoogle Scholar

doi
isbn
urn-nbn

Altmetric score

doi
isbn
urn-nbn
Total: 17 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf