{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,18]],"date-time":"2025-12-18T14:20:40Z","timestamp":1766067640588,"version":"3.37.3"},"reference-count":27,"publisher":"IEEE","license":[{"start":{"date-parts":[[2022,10,23]],"date-time":"2022-10-23T00:00:00Z","timestamp":1666483200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,10,23]],"date-time":"2022-10-23T00:00:00Z","timestamp":1666483200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100001659","name":"German Research Foundation","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022,10,23]]},"DOI":"10.1109\/iros47612.2022.9981758","type":"proceedings-article","created":{"date-parts":[[2022,12,26]],"date-time":"2022-12-26T19:38:15Z","timestamp":1672083495000},"page":"13769-13776","source":"Crossref","is-referenced-by-count":4,"title":["FC<sup>3<\/sup>: Feasibility-Based Control Chain Coordination"],"prefix":"10.1109","author":[{"given":"Jason","family":"Harris","sequence":"first","affiliation":[{"name":"Learning &#x0026; Intelligent Systems Lab,TU,Berlin"}]},{"given":"Danny","family":"Driess","sequence":"additional","affiliation":[{"name":"Learning &#x0026; Intelligent Systems Lab,TU,Berlin"}]},{"given":"Marc","family":"Toussaint","sequence":"additional","affiliation":[{"name":"Learning &#x0026; Intelligent Systems Lab,TU,Berlin"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1146\/annurev-control-091420-084139"},{"key":"ref2","doi-asserted-by":"crossref","DOI":"10.1109\/IROS40897.2019.8967861","article-title":"Representing Robot Task Plans as Robust Logical-Dynamical Systems","volume-title":"arXiv:1908.01896 [cs]","author":"Paxton","year":"2019"},{"issue":"3\u20134","key":"ref3","first-page":"189","article-title":"Strips: A new approach to the application of theorem proving to problem solving","volume-title":"Artificial Intelligence","volume":"2","author":"Fikes","year":"1971"},{"key":"ref4","article-title":"Pddl\u2014 the planning domain definition language","author":"Aeronautiques","year":"1998","journal-title":"Technical Report, Tech. Rep."},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TASE.2016.2600527"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA.2017.7989070"},{"key":"ref7","article-title":"Behavior Trees as a Representation for Medical Procedures","volume-title":"arXiv:1808.08954 [cs]","author":"Hannaford","year":"2018"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA.2019.8794128"},{"key":"ref9","article-title":"Logic-geometric programming: An optimization-based approach to combined task and motion planning","author":"Toussaint","year":"2015","journal-title":"IJCAI"},{"key":"ref10","first-page":"215","article-title":"From Skills to Symbols: Learning Symbolic Representations for Abstract High-Level Planning","volume-title":"Journal of Artificial Intelligence Research","volume":"61","author":"Konidaris","year":"2018"},{"key":"ref11","article-title":"Hierarchical Reinforcement Learning with the MAXQ Value Function Decomposition","volume-title":"arXiv:cs\/9905014","author":"Dietterich","year":"1999"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/Humanoids.2011.6100841"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2021.3059912"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/IROS40897.2019.8968557"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1609\/icaps.v20i1.13436"},{"key":"ref16","article-title":"Towards combining htn planning and geometric task planning","volume":"abs\/1307.1482","author":"de Silva","year":"2013","journal-title":"ArXiv"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA.2011.5980160"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/LRA.2020.2965875"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/IROS.2015.7354286"},{"volume-title":"Riemannian Motion Policies","year":"2018","author":"Ratliff","key":"ref20"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA.2019.8794223"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA40945.2020.9196866"},{"volume-title":"RMPflow: A Computational Graph for Automatic Motion Policy Generation","year":"2019","author":"Cheng","key":"ref23"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1007\/s10514-007-9051-x"},{"volume-title":"Newton methods for k-order Markov Constrained Motion Problems","year":"2014","author":"Toussaint","key":"ref25"},{"key":"ref26","doi-asserted-by":"crossref","first-page":"250","DOI":"10.1016\/B978-0-934613-03-3.50022-2","article-title":"Achieving several goals simultaneously","volume-title":"Readings in artificial intelligence","author":"Waldinger","year":"1981"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA.2011.5980391"}],"event":{"name":"2022 IEEE\/RSJ International Conference on Intelligent Robots and Systems (IROS)","start":{"date-parts":[[2022,10,23]]},"location":"Kyoto, Japan","end":{"date-parts":[[2022,10,27]]}},"container-title":["2022 IEEE\/RSJ International Conference on Intelligent Robots and Systems (IROS)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9981026\/9981028\/09981758.pdf?arnumber=9981758","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,1]],"date-time":"2024-02-01T06:09:11Z","timestamp":1706767751000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9981758\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,10,23]]},"references-count":27,"URL":"https:\/\/doi.org\/10.1109\/iros47612.2022.9981758","relation":{},"subject":[],"published":{"date-parts":[[2022,10,23]]}}}