{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,20]],"date-time":"2025-11-20T07:00:12Z","timestamp":1763622012793,"version":"3.45.0"},"reference-count":28,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2025]]},"DOI":"10.1109\/access.2025.3630099","type":"journal-article","created":{"date-parts":[[2025,11,7]],"date-time":"2025-11-07T18:11:21Z","timestamp":1762539081000},"page":"193403-193413","source":"Crossref","is-referenced-by-count":0,"title":["Enhancing PIBT for Multi-Agent Path Finding via MLP-Based Candidate Selection and Priority Perturbation"],"prefix":"10.1109","volume":"13","author":[{"ORCID":"https:\/\/orcid.org\/0009-0001-5360-5228","authenticated-orcid":false,"given":"Ping","family":"Du","sequence":"first","affiliation":[{"name":"Institute of Microelectronics, Chinese Academy of Sciences, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gongyan","family":"Li","sequence":"additional","affiliation":[{"name":"Institute of Microelectronics, Chinese Academy of Sciences, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"doi-asserted-by":"publisher","key":"ref1","DOI":"10.1609\/socs.v10i1.18510"},{"doi-asserted-by":"publisher","key":"ref2","DOI":"10.1109\/MSPEC.2008.4547508"},{"doi-asserted-by":"publisher","key":"ref3","DOI":"10.1609\/aiide.v1i1.18726"},{"doi-asserted-by":"publisher","key":"ref4","DOI":"10.1109\/TRO.2018.2853613"},{"doi-asserted-by":"publisher","key":"ref5","DOI":"10.1016\/j.artint.2022.103752"},{"doi-asserted-by":"publisher","key":"ref6","DOI":"10.1016\/j.artint.2014.11.006"},{"doi-asserted-by":"publisher","key":"ref7","DOI":"10.1609\/socs.v5i1.18315"},{"doi-asserted-by":"publisher","key":"ref8","DOI":"10.1609\/aaai.v35i14.17466"},{"doi-asserted-by":"publisher","key":"ref9","DOI":"10.1609\/aaai.v33i01.33017643"},{"doi-asserted-by":"publisher","key":"ref10","DOI":"10.1609\/aaai.v37i10.26377"},{"key":"ref11","first-page":"294","article-title":"Push and swap: Fast cooperative path-finding with completeness guarantees","volume":"11","author":"Luna","year":"2011","journal-title":"IJCAI"},{"doi-asserted-by":"publisher","key":"ref12","DOI":"10.1609\/aaai.v36i9.21266"},{"doi-asserted-by":"publisher","key":"ref13","DOI":"10.1609\/aaai.v35i13.17344"},{"key":"ref14","article-title":"Lifelong multi-agent path finding for online pickup and delivery tasks","author":"Ma","year":"2017","journal-title":"arXiv:1705.10868"},{"doi-asserted-by":"publisher","key":"ref15","DOI":"10.1609\/aaai.v27i1.8541"},{"doi-asserted-by":"publisher","key":"ref16","DOI":"10.1109\/ACCESS.2024.3392305"},{"doi-asserted-by":"publisher","key":"ref17","DOI":"10.1109\/LRA.2019.2903261"},{"doi-asserted-by":"publisher","key":"ref18","DOI":"10.1109\/LRA.2021.3062803"},{"doi-asserted-by":"publisher","key":"ref19","DOI":"10.1609\/aaai.v38i16.29704"},{"doi-asserted-by":"publisher","key":"ref20","DOI":"10.1109\/LRA.2023.3292004"},{"doi-asserted-by":"publisher","key":"ref21","DOI":"10.1109\/LRA.2021.3139145"},{"doi-asserted-by":"publisher","key":"ref22","DOI":"10.1109\/tfuzz.2025.3585934"},{"doi-asserted-by":"publisher","key":"ref23","DOI":"10.1609\/aaai.v38i16.29701"},{"key":"ref24","first-page":"611","article-title":"Learning node-selection strategies in bounded-suboptimal conflict-based search for multi-agent path finding","volume-title":"Proc. 20th Int. Conf. Auto. Agents Multiagent Syst. (AAMAS)","author":"Huang"},{"doi-asserted-by":"publisher","key":"ref25","DOI":"10.1609\/socs.v15i1.21769"},{"key":"ref26","article-title":"Work smarter not harder: Simple imitation learning with CS-PIBT outperforms large scale imitation learning for MAPF","author":"Veerapaneni","year":"2024","journal-title":"arXiv:2409.14491"},{"doi-asserted-by":"publisher","key":"ref27","DOI":"10.1609\/icaps.v34i1.31522"},{"doi-asserted-by":"publisher","key":"ref28","DOI":"10.1017\/S0962492900002919"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/6287639\/10820123\/11231406.pdf?arnumber=11231406","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,20]],"date-time":"2025-11-20T06:18:54Z","timestamp":1763619534000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11231406\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"references-count":28,"URL":"https:\/\/doi.org\/10.1109\/access.2025.3630099","relation":{},"ISSN":["2169-3536"],"issn-type":[{"type":"electronic","value":"2169-3536"}],"subject":[],"published":{"date-parts":[[2025]]}}}