{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,12]],"date-time":"2025-12-12T13:34:09Z","timestamp":1765546449820,"version":"3.37.3"},"reference-count":37,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/OAPA.html"}],"funder":[{"DOI":"10.13039\/501100005085","name":"Beijing Institute of Technology","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100005085","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2019]]},"DOI":"10.1109\/access.2019.2915541","type":"journal-article","created":{"date-parts":[[2019,5,8]],"date-time":"2019-05-08T20:04:36Z","timestamp":1557345876000},"page":"60348-60358","source":"Crossref","is-referenced-by-count":2,"title":["Generating the Minimal Optimal Language for Cooperative Agents"],"prefix":"10.1109","volume":"7","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6125-6972","authenticated-orcid":false,"given":"Li","family":"Wang","sequence":"first","affiliation":[]},{"given":"Qiao","family":"Guo","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1016\/S0004-3702(99)00052-1"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1016\/0004-3702(94)00076-D"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1016\/0004-3702(94)00077-E"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/P17-1022"},{"article-title":"The planning domain definition language","year":"1998","author":"mcdermott","key":"ref37"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1016\/0004-3702(94)90081-7"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/TSSC.1968.300136"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1613\/jair.5575"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-32552-1_53"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1613\/jair.1427"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2010.09.008"},{"key":"ref13","first-page":"2544","article-title":"Contact: Deciding to communicate during time-critical collaborative tasks in unknown, deterministic domains","author":"unhelkar","year":"2016","journal-title":"Proc AAAI"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/544741.544830"},{"key":"ref15","first-page":"197","article-title":"Distributed planning in hierarchical factored MDPs","author":"guestrin","year":"2002","journal-title":"Proc UAI"},{"key":"ref16","first-page":"1323","article-title":"A general, fully distributed multi-agent planning algorithm","author":"nissim","year":"2010","journal-title":"Proc AAMAS"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2004.834113"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2018.2868715"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TCST.2014.2314460"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1145\/1228716.1228724"},{"key":"ref4","volume":"194","author":"petcu","year":"2009","journal-title":"A Class of Algorithms for Distributed Constraint Optimization"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA.2018.8460754"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.7551\/mitpress\/9780262527347.001.0001"},{"key":"ref6","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1609\/icaps.v26i1.13770","article-title":"A formal analysis of required cooperation in multi-agent planning","author":"zhang","year":"2016","journal-title":"Proc ICAPS"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2018\/1"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TSMCC.2007.913919"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1126\/science.1254295"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1115\/1.2766721"},{"journal-title":"From abstractions to ‘natural languages’ for planning agents","year":"2019","author":"zhang","key":"ref2"},{"journal-title":"An Introduction to Multiagent Systems","year":"2009","author":"wooldridge","key":"ref9"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/PL00013712"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2005.864190"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2019.2893645"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2011.2174666"},{"key":"ref24","first-page":"1030","article-title":"ARTIMIS: Natural dialogue meets rational agency","author":"sadek","year":"1997","journal-title":"Proc IJCAI"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1145\/191246.191322"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.15607\/RSS.2014.X.024"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1007\/978-981-13-2622-6_47"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/8600701\/08709764.pdf?arnumber=8709764","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,16]],"date-time":"2023-09-16T10:51:21Z","timestamp":1694861481000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8709764\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"references-count":37,"URL":"https:\/\/doi.org\/10.1109\/access.2019.2915541","relation":{},"ISSN":["2169-3536"],"issn-type":[{"type":"electronic","value":"2169-3536"}],"subject":[],"published":{"date-parts":[[2019]]}}}