{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T05:06:05Z","timestamp":1750309565488,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":9,"publisher":"ACM","license":[{"start":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T00:00:00Z","timestamp":1740096000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2025,2,21]]},"DOI":"10.1145\/3728199.3728253","type":"proceedings-article","created":{"date-parts":[[2025,5,28]],"date-time":"2025-05-28T16:35:44Z","timestamp":1748450144000},"page":"326-329","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Investigation of Time-Constrained Multi-Agent Distributed Task Allocation"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0001-4771-8648","authenticated-orcid":false,"given":"Haiwen","family":"Xie","sequence":"first","affiliation":[{"name":"School of Information, North China University of Technology, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2025,5,28]]},"reference":[{"key":"e_1_3_3_1_1_2","doi-asserted-by":"publisher","DOI":"10.1007\/s43154-020-00039-w"},{"key":"e_1_3_3_1_2_2","doi-asserted-by":"publisher","DOI":"10.1109\/TASE.2021.3092560"},{"key":"e_1_3_3_1_3_2","doi-asserted-by":"publisher","DOI":"10.1007\/s13042-020-01213-4"},{"key":"e_1_3_3_1_4_2","volume-title":"Consensus-based decentralized auctions for robust task allocation[J]","author":"Choi H L","year":"2009","unstructured":"Choi H L, Brunet L, How J P. Consensus-based decentralized auctions for robust task allocation[J]. IEEE transactions on robotics, 2009, 25(4): 912-926."},{"key":"e_1_3_3_1_5_2","doi-asserted-by":"publisher","DOI":"10.1109\/TASE.2017.2679278"},{"key":"e_1_3_3_1_6_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.jksuci.2023.101734"},{"key":"e_1_3_3_1_7_2","article-title":"An efficient distributed task allocation method for maximizing task allocations of multirobot systems[J]","author":"Wang S","year":"2023","unstructured":"Wang S, Liu Y, Qiu Y, et al. An efficient distributed task allocation method for maximizing task allocations of multirobot systems[J]. IEEE Transactions on Automation Science and Engineering, 2023.","journal-title":"IEEE Transactions on Automation Science and Engineering"},{"key":"e_1_3_3_1_8_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.ast.2019.06.024"},{"key":"e_1_3_3_1_9_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2022.118279"}],"event":{"name":"CNML 2025: 2025 3rd International Conference on Communication Networks and Machine Learning","acronym":"CNML 2025","location":"Nanjing China"},"container-title":["Proceedings of the 2025 3rd International Conference on Communication Networks and Machine Learning"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3728199.3728253","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3728199.3728253","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T01:19:06Z","timestamp":1750295946000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3728199.3728253"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,2,21]]},"references-count":9,"alternative-id":["10.1145\/3728199.3728253","10.1145\/3728199"],"URL":"https:\/\/doi.org\/10.1145\/3728199.3728253","relation":{},"subject":[],"published":{"date-parts":[[2025,2,21]]},"assertion":[{"value":"2025-05-28","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}