{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,24]],"date-time":"2026-03-24T15:49:34Z","timestamp":1774367374994,"version":"3.50.1"},"reference-count":30,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"2","license":[{"start":{"date-parts":[[2021,4,1]],"date-time":"2021-04-01T00:00:00Z","timestamp":1617235200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2021,4,1]],"date-time":"2021-04-01T00:00:00Z","timestamp":1617235200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,4,1]],"date-time":"2021-04-01T00:00:00Z","timestamp":1617235200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100001824","name":"Grantov\u00e1 Agentura \u010cesk\u00e9 Republiky","doi-asserted-by":"publisher","award":["19-22555Y"],"award-info":[{"award-number":["19-22555Y"]}],"id":[{"id":"10.13039\/501100001824","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Robot. Autom. Lett."],"published-print":{"date-parts":[[2021,4]]},"DOI":"10.1109\/lra.2021.3068679","type":"journal-article","created":{"date-parts":[[2021,3,24]],"date-time":"2021-03-24T19:34:37Z","timestamp":1616614477000},"page":"4201-4208","source":"Crossref","is-referenced-by-count":52,"title":["Multi-Goal Path Planning Using Multiple Random Trees"],"prefix":"10.1109","volume":"6","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0467-7356","authenticated-orcid":false,"given":"Jaroslav","family":"Janos","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9224-2151","authenticated-orcid":false,"given":"Vojtech","family":"Vonasek","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8549-4932","authenticated-orcid":false,"given":"Robert","family":"Penicka","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/ICMA.2009.5246014"},{"key":"ref10","first-page":"944","article-title":"Lazy evaluation of goal specifications guided by motion planning","author":"hern\u00e1ndez","year":"0","journal-title":"Proc Int Conf Robot Automat"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1177\/0278364911406761"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/70.508439"},{"key":"ref13","first-page":"73","article-title":"Neural collision clearance estimator for batched motion planning","author":"kew","year":"0","journal-title":"Proc Int Worksh Algorithm Found Robot"},{"key":"ref14","first-page":"111","article-title":"On the nearest neighbor algorithms for the traveling salesman problem","author":"kizilate?","year":"0","journal-title":"Proc Adv Comput Sci Eng Inf Technol"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.2000.844730"},{"key":"ref16","article-title":"Rapidly-exploring random trees: A new tool for path planning","author":"lavalle","year":"1998","journal-title":"Tech Rep"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.2004.1308755"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA.2013.6631066"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.23919\/OCEANS.2015.7404372"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.2004.1308756"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.2000.844726"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.2000.846373"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/MESA.2008.4735749"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2014.2302442"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/ETFA.2019.8869521"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/IROS.2014.6942975"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/IROS.2014.6942967"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1177\/0278364913490046"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/IROS.2016.7759489"},{"key":"ref9","article-title":"An Extension of the lin-Kernighan-Helsgaun TSP Solver for Constrained Traveling Salesman and Vehicle Routing Problems","author":"helsgaun","year":"2017"},{"key":"ref1","article-title":"TSP Concorde Solver","year":"2021"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/JOE.2015.2503498"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1002\/net.21818"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2011.2166311"},{"key":"ref24","doi-asserted-by":"crossref","first-page":"3005","DOI":"10.1109\/LRA.2019.2923949","article-title":"Physical orienteering problem for unmanned aerial vehicle data collection planning in environments with obstacles","volume":"4","author":"p?ni?ka","year":"2019","journal-title":"IEEE Robot Autom Lett"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.2012.6256440"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.2003.1242179"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/LRA.2017.2666261"}],"container-title":["IEEE Robotics and Automation Letters"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7083369\/9285111\/09385932.pdf?arnumber=9385932","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,10]],"date-time":"2022-05-10T14:54:29Z","timestamp":1652194469000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9385932\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,4]]},"references-count":30,"journal-issue":{"issue":"2"},"URL":"https:\/\/doi.org\/10.1109\/lra.2021.3068679","relation":{},"ISSN":["2377-3766","2377-3774"],"issn-type":[{"value":"2377-3766","type":"electronic"},{"value":"2377-3774","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,4]]}}}