{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,22]],"date-time":"2024-10-22T17:33:03Z","timestamp":1729618383480,"version":"3.28.0"},"reference-count":19,"publisher":"IEEE","license":[{"start":{"date-parts":[[2021,9,27]],"date-time":"2021-09-27T00:00:00Z","timestamp":1632700800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2021,9,27]],"date-time":"2021-09-27T00:00:00Z","timestamp":1632700800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,9,27]],"date-time":"2021-09-27T00:00:00Z","timestamp":1632700800000},"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":[[2021,9,27]]},"DOI":"10.1109\/iros51168.2021.9636067","type":"proceedings-article","created":{"date-parts":[[2021,12,16]],"date-time":"2021-12-16T15:45:38Z","timestamp":1639669538000},"page":"384-389","source":"Crossref","is-referenced-by-count":1,"title":["Spatial Constraint Generation for Motion Planning in Dynamic Environments"],"prefix":"10.1109","author":[{"given":"Han","family":"Hu","sequence":"first","affiliation":[]},{"given":"Peyman","family":"Yadmellat","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/BF01553881"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/BF01975867"},{"key":"ref12","first-page":"262","article-title":"Anytime Dynamic A*: An anytime, replanning algorithm","volume":"5","author":"likhachev","year":"2005","journal-title":"ICAPS"},{"key":"ref13","article-title":"D* Lite","volume":"15","author":"koenig","year":"2002","journal-title":"AAAI\/IAAI"},{"article-title":"The Field D* algorithm for improved path planning and replanning in uniform and non-uniform cost environments","year":"2005","author":"ferguson","key":"ref14"},{"key":"ref15","first-page":"767","article-title":"ARA*: Anytime A* with provable bounds on sub-optimality","author":"likhachev","year":"2004","journal-title":"Advances in neural information processing systems"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA.2019.8794192"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/282918.282923"},{"article-title":"nuScenes: A multimodal dataset for autonomous driving","year":"2019","author":"caesar","key":"ref18"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1016\/0925-7721(94)90010-8"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/2614028.2615399"},{"key":"ref3","first-page":"5168","article-title":"Path planning based on constrained delaunay triangulation","author":"yan","year":"2008","journal-title":"2008 7th World Congress on Intelligent Control and Automation"},{"key":"ref6","first-page":"942","article-title":"Efficient triangulation-based pathfinding","volume":"6","author":"demyen","year":"2006","journal-title":"AAAI"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/s10458-012-9195-8"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1016\/0925-7721(92)90025-N"},{"key":"ref7","doi-asserted-by":"crossref","first-page":"119","DOI":"10.22630\/MGV.2014.23.3.6","article-title":"Dynamic path planning with regular triangulations","volume":"24","author":"broz","year":"2014","journal-title":"Machine Graphics & Vision"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1117\/12.838966"},{"key":"ref1","first-page":"49","article-title":"Path planning in triangulations","author":"kallmann","year":"2005","journal-title":"Proceedings of the IJCAI Workshop on Reasoning Representation and Learning in Computer Games"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1016\/S0098-3004(03)00017-7"}],"event":{"name":"2021 IEEE\/RSJ International Conference on Intelligent Robots and Systems (IROS)","start":{"date-parts":[[2021,9,27]]},"location":"Prague, Czech Republic","end":{"date-parts":[[2021,10,1]]}},"container-title":["2021 IEEE\/RSJ International Conference on Intelligent Robots and Systems (IROS)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9635848\/9635849\/09636067.pdf?arnumber=9636067","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,18]],"date-time":"2023-01-18T17:42:30Z","timestamp":1674063750000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9636067\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,9,27]]},"references-count":19,"URL":"https:\/\/doi.org\/10.1109\/iros51168.2021.9636067","relation":{},"subject":[],"published":{"date-parts":[[2021,9,27]]}}}