{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,16]],"date-time":"2025-12-16T12:18:32Z","timestamp":1765887512815},"reference-count":0,"publisher":"Oxford University Press (OUP)","issue":"6","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["The Computer Journal"],"published-print":{"date-parts":[[2014,6,1]]},"DOI":"10.1093\/comjnl\/bxt067","type":"journal-article","created":{"date-parts":[[2013,7,12]],"date-time":"2013-07-12T01:56:47Z","timestamp":1373594207000},"page":"825-839","source":"Crossref","is-referenced-by-count":9,"title":["Congestion-Aware Multi-Agent Path Planning: Distributed Algorithm and Applications"],"prefix":"10.1093","volume":"57","author":[{"given":"S.","family":"Lim","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"D.","family":"Rus","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"286","published-online":{"date-parts":[[2013,7,11]]},"container-title":["The Computer Journal"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/academic.oup.com\/comjnl\/article-pdf\/57\/6\/825\/1075927\/bxt067.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,8,22]],"date-time":"2017-08-22T21:22:54Z","timestamp":1503436974000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/comjnl\/article-lookup\/doi\/10.1093\/comjnl\/bxt067"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,7,11]]},"references-count":0,"journal-issue":{"issue":"6","published-online":{"date-parts":[[2014,5,21]]},"published-print":{"date-parts":[[2014,6,1]]}},"URL":"https:\/\/doi.org\/10.1093\/comjnl\/bxt067","relation":{},"ISSN":["0010-4620","1460-2067"],"issn-type":[{"value":"0010-4620","type":"print"},{"value":"1460-2067","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,7,11]]}}}