{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,11]],"date-time":"2025-11-11T13:08:48Z","timestamp":1762866528039,"version":"3.28.0"},"reference-count":16,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014,9]]},"DOI":"10.1109\/allerton.2014.7028567","type":"proceedings-article","created":{"date-parts":[[2015,2,5]],"date-time":"2015-02-05T14:24:07Z","timestamp":1423146247000},"page":"1026-1032","source":"Crossref","is-referenced-by-count":3,"title":["Optimal kinodynamic motion planning in environments with unexpected obstacles"],"prefix":"10.1109","author":[{"given":"Beth","family":"Boardman","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Troy","family":"Harden","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sonia","family":"Martinez","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"15","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2010.5717430"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.2307\/2372560"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.2007.363167"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.2000.844730"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1109\/IRDS.2002.1041624"},{"key":"12","first-page":"3411","article-title":"An incremental learning approach to motion planning with roadmap management","volume":"4","author":"li","year":"2002","journal-title":"Proceedings IEEE International Conference on Robotics and Automation"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1007\/BF01840369"},{"key":"2","first-page":"1652","article-title":"The focussed D algorithm for real-time replanning","volume":"95","author":"stentz","year":"1995","journal-title":"Proceedings of the International Joint Conference on Artificial Intelligence"},{"key":"1","first-page":"476","article-title":"D lite","author":"koenig","year":"0","journal-title":"Proceedings of the National Conference on Artificial Intelligence (AAAI)"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.2007.363553"},{"key":"7","first-page":"2421","article-title":"Use of relaxation methods in samplingbased algorithms for optimal motion planning","author":"arslan","year":"2013","journal-title":"IEEE International Conference on Robotics and Automation (ICRA) IEEE"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1177\/0278364911406761"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1109\/70.508439"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511546877"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.2006.1641879"},{"key":"8","article-title":"Fast marching trees: A fast marching sampling-based method for optimal motion planning in many dimensions","author":"janson","year":"2013","journal-title":"International Symposium on Robotics Research"}],"event":{"name":"2014 52nd Annual Allerton Conference on Communication, Control, and Computing (Allerton)","start":{"date-parts":[[2014,9,30]]},"location":"Monticello, IL, USA","end":{"date-parts":[[2014,10,3]]}},"container-title":["2014 52nd Annual Allerton Conference on Communication, Control, and Computing (Allerton)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7008053\/7028426\/07028567.pdf?arnumber=7028567","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,24]],"date-time":"2017-03-24T00:07:48Z","timestamp":1490314068000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7028567\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,9]]},"references-count":16,"URL":"https:\/\/doi.org\/10.1109\/allerton.2014.7028567","relation":{},"subject":[],"published":{"date-parts":[[2014,9]]}}}