{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,31]],"date-time":"2026-01-31T00:06:07Z","timestamp":1769817967522,"version":"3.49.0"},"reference-count":30,"publisher":"IEEE","license":[{"start":{"date-parts":[[2020,5,1]],"date-time":"2020-05-01T00:00:00Z","timestamp":1588291200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2020,5,1]],"date-time":"2020-05-01T00:00:00Z","timestamp":1588291200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2020,5,1]],"date-time":"2020-05-01T00:00:00Z","timestamp":1588291200000},"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":[[2020,5]]},"DOI":"10.1109\/icra40945.2020.9196719","type":"proceedings-article","created":{"date-parts":[[2020,9,15]],"date-time":"2020-09-15T17:25:46Z","timestamp":1600190746000},"page":"1460-1466","source":"Crossref","is-referenced-by-count":6,"title":["One-Shot Multi-Path Planning for Robotic Applications Using Fully Convolutional Networks"],"prefix":"10.1109","author":[{"given":"Tomas","family":"Kulvicius","sequence":"first","affiliation":[]},{"given":"Sebastian","family":"Herzog","sequence":"additional","affiliation":[]},{"given":"Timo","family":"Luddecke","sequence":"additional","affiliation":[]},{"given":"Minija","family":"Tamosiunaite","sequence":"additional","affiliation":[]},{"given":"Florentin","family":"Worgotter","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/3477.931512"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/s004220050262"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TSSC.1968.300136"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1016\/j.robot.2017.04.006"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1162\/NECO_a_00393"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/ICMA.2012.6284384"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1177\/0278364911406761"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TRO.2011.2159412"},{"key":"ref17","article-title":"A performance comparison of rapidly-exploring random tree and Dijkstra's algorithm for holonomic robot path planning","author":"knispel","year":"2013","journal-title":"Institute for Computer Science and Automation"},{"key":"ref18","volume":"124","author":"latombe","year":"2012","journal-title":"Robot Motion Planning"},{"key":"ref19","article-title":"Rapidly-exploring random trees: A new tool for path planning","author":"lavalle","year":"1998","journal-title":"Technical Report"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/IROS.2017.8202134"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/s10514-012-9275-2"},{"key":"ref27","author":"siciliano","year":"2009","journal-title":"Robotics Modelling Planning and Control"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA.2017.7989037"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1016\/S0005-1098(01)00055-3"},{"key":"ref29","first-page":"55","article-title":"MAPP: A scalable multi-agent path planning algorithm with tractability and completeness guarantees","volume":"42","author":"wang","year":"2011","journal-title":"Journal of Artificial Intelligence Research"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/BF01386390"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/IROS.2014.6942976"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/IROS.2018.8593871"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30501-9_43"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1016\/0893-6080(94)E0045-M"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/IROS40897.2019.8968089"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/LRA.2017.2651371"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1016\/j.procs.2018.01.054"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1155\/2017\/9269742"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA.2018.8460851"},{"key":"ref23","first-page":"2616","article-title":"Probabilistic movement primitives","volume":"26","author":"paraschos","year":"2013","journal-title":"Advances in neural information processing systems"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1038\/srep21142"},{"key":"ref25","article-title":"Motion planning networks","author":"qureshi","year":"2018","journal-title":"CoRR"}],"event":{"name":"2020 IEEE International Conference on Robotics and Automation (ICRA)","location":"Paris, France","start":{"date-parts":[[2020,5,31]]},"end":{"date-parts":[[2020,8,31]]}},"container-title":["2020 IEEE International Conference on Robotics and Automation (ICRA)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9187508\/9196508\/09196719.pdf?arnumber=9196719","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,27]],"date-time":"2022-06-27T20:08:31Z","timestamp":1656360511000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9196719\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,5]]},"references-count":30,"URL":"https:\/\/doi.org\/10.1109\/icra40945.2020.9196719","relation":{},"subject":[],"published":{"date-parts":[[2020,5]]}}}