{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,15]],"date-time":"2026-01-15T23:35:17Z","timestamp":1768520117366,"version":"3.49.0"},"reference-count":13,"publisher":"IEEE","license":[{"start":{"date-parts":[[2025,7,15]],"date-time":"2025-07-15T00:00:00Z","timestamp":1752537600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,7,15]],"date-time":"2025-07-15T00:00:00Z","timestamp":1752537600000},"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":[[2025,7,15]]},"DOI":"10.1109\/codit66093.2025.11321652","type":"proceedings-article","created":{"date-parts":[[2026,1,14]],"date-time":"2026-01-14T20:36:48Z","timestamp":1768423008000},"page":"1672-1677","source":"Crossref","is-referenced-by-count":0,"title":["Finding Time-Optimal Path Through a Forest of Circles by Graph Search"],"prefix":"10.1109","author":[{"given":"Vadim","family":"Belotelov","sequence":"first","affiliation":[{"name":"Computer Science and Control of the Russian Academy of Sciences,Federal Research Center,Moscow,Russia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anna","family":"Daryina","sequence":"additional","affiliation":[{"name":"Computer Science and Control of the Russian Academy of Sciences,Federal Research Center,Moscow,Russia"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","first-page":"79","article-title":"Maximum principle in optimal control","author":"Pontryagin","year":"1989","journal-title":"Moscow, Nauka"},{"issue":"2","key":"ref2","first-page":"367","article-title":"Biblioteka programm dlya resheniya zadach optimal\u2019nogo upravleniya","volume":"19","author":"Grachev","year":"1979","journal-title":"[A collection of programs for solving optimal control problems]. Computational Mathematics and Mathematical Physics"},{"key":"ref3","first-page":"488","article-title":"Priblizhennoe resheniye zadach optimal\u2019nogo upravleniya","author":"Fedorenko","year":"1978","journal-title":"[Approximate solving of optimal control problems]. Moscow, Nauka"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/70.508439"},{"key":"ref5","article-title":"Rapidly-exploring random trees: A new tool for path planning","volume-title":"Technical Report TR98-11","author":"LaValle","year":"1998"},{"key":"ref6","volume-title":"Numerical Optimization","author":"Nocedal","year":"2006"},{"key":"ref7","volume-title":"Reinforcement Learning: An Introduction","author":"Sutton","year":"2018"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1134\/S106423071804007X"},{"issue":"2","key":"ref9","first-page":"129138","article-title":"Synthesis of a spatial stabilization for a mobile robot by means of symbolic regression learning","volume":"22","author":"Diveev","year":"2021","journal-title":"Vestnik RUDN, Series: Engineering research"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/j.procs.2021.04.219"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1134\/S0965542522090093"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/BF01386390"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TSSC.1968.300136"}],"event":{"name":"2025 11th International Conference on Control, Decision and Information Technologies (CoDIT)","location":"Split, Croatia","start":{"date-parts":[[2025,7,15]]},"end":{"date-parts":[[2025,7,18]]}},"container-title":["2025 11th International Conference on Control, Decision and Information Technologies (CoDIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/11321217\/11321218\/11321652.pdf?arnumber=11321652","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,15]],"date-time":"2026-01-15T07:32:05Z","timestamp":1768462325000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11321652\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,7,15]]},"references-count":13,"URL":"https:\/\/doi.org\/10.1109\/codit66093.2025.11321652","relation":{},"subject":[],"published":{"date-parts":[[2025,7,15]]}}}