{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T22:12:53Z","timestamp":1740175973692,"version":"3.37.3"},"reference-count":19,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"1","license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"name":"Key Laboratory of Software Engineering for Complex Systems"},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62172426"],"award-info":[{"award-number":["62172426"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Robot. Autom. Lett."],"published-print":{"date-parts":[[2022,1]]},"DOI":"10.1109\/lra.2021.3128935","type":"journal-article","created":{"date-parts":[[2021,11,18]],"date-time":"2021-11-18T21:51:43Z","timestamp":1637272303000},"page":"494-501","source":"Crossref","is-referenced-by-count":1,"title":["Towards a Hybrid-ASP Planning Approach With Adjoint Observation for Incomplete Task-Relevant Information"],"prefix":"10.1109","volume":"7","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0176-8383","authenticated-orcid":false,"given":"Shuo","family":"Yang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6003-5748","authenticated-orcid":false,"given":"Xinjun","family":"Mao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuanzhou","family":"Xue","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Huaiyu","family":"Xiao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shuo","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139583923"},{"key":"ref2","first-page":"1623","article-title":"A translation-based approach to contingent planning","volume-title":"Proc. 21st Int. Jont Conf. Artifical Intell.","author":"Albore"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1613\/jair.2708"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2017\/603"},{"key":"ref5","first-page":"5","article-title":"Branching-bounded contingent planning via belief space search","volume-title":"Proc. 2nd ICAPS Workshop Explainable AI Plan. (XAIP19","author":"McAreavey"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v30i1.10406"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-23807-0_20"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1609\/icaps.v25i1.13699"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1609\/icaps.v30i1.6640"},{"key":"ref10","first-page":"3045","article-title":"Factored probabilistic belief tracking","volume-title":"Proc. 25th Int. Joint Conf. Artif. Intell.","author":"Bonet"},{"key":"ref11","article-title":"Generalized answer set planning with incomplete information","volume-title":"Proc. ASPOCP, LPNMR","volume":"1868","author":"Romero"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1017\/S1471068417000321"},{"key":"ref13","first-page":"1294","article-title":"The pela architecture: Integrating planning and learning to improve execution","volume-title":"Proc. Association Advancement Artif. Intelligence","author":"Celorrio"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1613\/jair.1.11567"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/SMC42975.2020.9283277"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1609\/icaps.v20i1.13403"},{"issue":"45","key":"ref17","article-title":"Clingo= asp control: Preliminary report","volume-title":"Proc. 13th Int. Conf. Logic Programming,ICLP, Theory Pract. Log. Program.","volume":"14","author":"Gebser"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-23264-5_7"},{"key":"ref19","first-page":"1772","article-title":"Despot: Online pomdp planning with regularization","volume-title":"Proc. Neural Inf. Process. Syst.","volume":"13","author":"Somani"}],"container-title":["IEEE Robotics and Automation Letters"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7083369\/9568780\/09619949.pdf?arnumber=9619949","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,12]],"date-time":"2024-01-12T00:53:21Z","timestamp":1705020801000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9619949\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,1]]},"references-count":19,"journal-issue":{"issue":"1"},"URL":"https:\/\/doi.org\/10.1109\/lra.2021.3128935","relation":{},"ISSN":["2377-3766","2377-3774"],"issn-type":[{"type":"electronic","value":"2377-3766"},{"type":"electronic","value":"2377-3774"}],"subject":[],"published":{"date-parts":[[2022,1]]}}}