{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,7]],"date-time":"2026-03-07T18:29:37Z","timestamp":1772908177122,"version":"3.50.1"},"reference-count":12,"publisher":"IEEE","license":[{"start":{"date-parts":[[2017,9,1]],"date-time":"2017-09-01T00:00:00Z","timestamp":1504224000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2017,9,1]],"date-time":"2017-09-01T00:00:00Z","timestamp":1504224000000},"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":[[2017,9]]},"DOI":"10.1109\/iros.2017.8206535","type":"proceedings-article","created":{"date-parts":[[2017,12,14]],"date-time":"2017-12-14T22:12:59Z","timestamp":1513289579000},"page":"6313-6318","source":"Crossref","is-referenced-by-count":32,"title":["Online RRT* and online FMT*: Rapid replanning with dynamic cost"],"prefix":"10.1109","author":[{"given":"Bryant","family":"Chandler","sequence":"first","affiliation":[]},{"given":"Michael A.","family":"Goodrich","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA.2011.5980479"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1177\/0278364915577958"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2007.11.009"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/70.508439"},{"key":"ref11","doi-asserted-by":"crossref","first-page":"3310","DOI":"10.1109\/ROBOT.1994.351061","article-title":"Optimal and efficient path planning for partially-known environments","author":"stentz","year":"1994","journal-title":"Robotics and Automation 1994 Proceedings 1994 IEEE International Conference on"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1177\/0278364911406761"},{"key":"ref12","year":"0","journal-title":"Wikipedia A* search algorithm - wikipedia the free encyclopedia"},{"key":"ref8","author":"lavalle","year":"1998","journal-title":"Rapidly-Exploring Random Trees A New Tool for Path Planning"},{"key":"ref7","first-page":"476","article-title":"D* lite","author":"koenig","year":"2002","journal-title":"AAAI\/IAAI"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1007\/BF01386390"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1177\/02783640122067453"},{"key":"ref1","first-page":"212","article-title":"Efficient collision checking in sampling-based motion planning via safety certificates","volume":"26","author":"bialkowski","year":"2010","journal-title":"The International Journal of Robotics Research"}],"event":{"name":"2017 IEEE\/RSJ International Conference on Intelligent Robots and Systems (IROS)","location":"Vancouver, BC, Canada","start":{"date-parts":[[2017,9,24]]},"end":{"date-parts":[[2017,9,28]]}},"container-title":["2017 IEEE\/RSJ International Conference on Intelligent Robots and Systems (IROS)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8119304\/8202121\/08206535.pdf?arnumber=8206535","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,2]],"date-time":"2023-01-02T19:17:54Z","timestamp":1672687074000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8206535\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,9]]},"references-count":12,"URL":"https:\/\/doi.org\/10.1109\/iros.2017.8206535","relation":{},"subject":[],"published":{"date-parts":[[2017,9]]}}}