{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,29]],"date-time":"2024-10-29T13:35:56Z","timestamp":1730208956850,"version":"3.28.0"},"reference-count":27,"publisher":"IEEE","license":[{"start":{"date-parts":[[2019,8,1]],"date-time":"2019-08-01T00:00:00Z","timestamp":1564617600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2019,8,1]],"date-time":"2019-08-01T00:00:00Z","timestamp":1564617600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,8,1]],"date-time":"2019-08-01T00:00:00Z","timestamp":1564617600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019,8]]},"DOI":"10.1109\/coase.2019.8843096","type":"proceedings-article","created":{"date-parts":[[2019,9,20]],"date-time":"2019-09-20T00:08:11Z","timestamp":1568938091000},"page":"1175-1180","source":"Crossref","is-referenced-by-count":1,"title":["Computing Feedback Plans from Dynamical System Composition"],"prefix":"10.1109","author":[{"given":"Alfredo","family":"Bayuelo","sequence":"first","affiliation":[]},{"given":"Tauhidul","family":"Alam","sequence":"additional","affiliation":[]},{"given":"Leonardo","family":"Bobadilla","sequence":"additional","affiliation":[]},{"given":"Luis Fetnando","family":"Nino","sequence":"additional","affiliation":[]},{"given":"Ryan N.","family":"Smith","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1177\/0278364913501564"},{"key":"ref11","first-page":"4195","article-title":"Optimal samplingbased feedback motion trees among obstacles for controllable linear systems with linear constraints","author":"hwan jeon","year":"2015","journal-title":"Proceedings of IEEE International Conference on Robotics and Automation"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1177\/0278364915602958"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.1985.1087242"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1177\/02783649922066385"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1177\/0278364910369189"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1177\/0278364917712421"},{"key":"ref17","first-page":"477","article-title":"Global vector field computation for feedback motion planning","author":"zhang","year":"2009","journal-title":"Proceedings of IEEE International Conference on Robotics and Automation"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/70.163777"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/IRC.2017.23"},{"key":"ref4","volume":"64","author":"hsu","year":"2013","journal-title":"Cell-to-Cell Mapping a Method of Global Analysis for Nonlinear Systems"},{"journal-title":"Reinforcement Learning An Introduction","year":"2018","author":"sutton","key":"ref27"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1613\/jair.301"},{"article-title":"Rapidly-exploring random trees: A new tool for path planning","year":"1998","author":"lavalle","key":"ref6"},{"key":"ref5","doi-asserted-by":"crossref","first-page":"566","DOI":"10.1109\/70.508439","article-title":"Probabilistic roadmaps for path planning in high-dimensional configuration spaces","volume":"12","author":"svestka","year":"1996","journal-title":"IEEE Transactions on Robotics and Automation"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA.2015.7139514"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1177\/0278364911406761"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511546877"},{"key":"ref9","first-page":"5054","article-title":"Kinodynamic RRT7*: Asymptotically optimal motion planning for robots with linear dynamics","author":"webb","year":"2013","journal-title":"Proceedings of IEEE International Conference on Robotics and Automation"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/MRA.2011.941635"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/IRC.2018.00030"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1115\/1.2897620"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/OCEANS.2018.8604762"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1137\/0201010"},{"journal-title":"Introduction to Algorithms","year":"2001","author":"cormen","key":"ref23"},{"key":"ref26","volume":"1","author":"bertsekas","year":"2005","journal-title":"Dynamic Programming and Optimal Control"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TIV.2016.2578706"}],"event":{"name":"2019 IEEE 15th International Conference on Automation Science and Engineering (CASE)","start":{"date-parts":[[2019,8,22]]},"location":"Vancouver, BC, Canada","end":{"date-parts":[[2019,8,26]]}},"container-title":["2019 IEEE 15th International Conference on Automation Science and Engineering (CASE)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8827189\/8842826\/08843096.pdf?arnumber=8843096","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,17]],"date-time":"2022-07-17T21:47:06Z","timestamp":1658094426000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8843096\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,8]]},"references-count":27,"URL":"https:\/\/doi.org\/10.1109\/coase.2019.8843096","relation":{},"subject":[],"published":{"date-parts":[[2019,8]]}}}