{"id":"https://openalex.org/W7124148161","doi":"https://doi.org/10.1109/codit66093.2025.11321652","title":"Finding Time-Optimal Path Through a Forest of Circles by Graph Search","display_name":"Finding Time-Optimal Path Through a Forest of Circles by Graph Search","publication_year":2025,"publication_date":"2025-07-15","ids":{"openalex":"https://openalex.org/W7124148161","doi":"https://doi.org/10.1109/codit66093.2025.11321652"},"language":null,"primary_location":{"id":"doi:10.1109/codit66093.2025.11321652","is_oa":false,"landing_page_url":"https://doi.org/10.1109/codit66093.2025.11321652","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 11th International Conference on Control, Decision and Information Technologies (CoDIT)","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5116567420","display_name":"Vadim Belotelov","orcid":"https://orcid.org/0009-0004-5450-990X"},"institutions":[{"id":"https://openalex.org/I4210148151","display_name":"Academy of the Federal Security Service of the Russian Federation","ror":"https://ror.org/05kt2wq49","country_code":"RU","type":"education","lineage":["https://openalex.org/I4210148151"]}],"countries":["RU"],"is_corresponding":false,"raw_author_name":"Vadim Belotelov","raw_affiliation_strings":["Computer Science and Control of the Russian Academy of Sciences,Federal Research Center,Moscow,Russia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Computer Science and Control of the Russian Academy of Sciences,Federal Research Center,Moscow,Russia","institution_ids":["https://openalex.org/I4210148151"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5030800154","display_name":"A. N. Daryina","orcid":"https://orcid.org/0000-0002-4187-3954"},"institutions":[{"id":"https://openalex.org/I4210148151","display_name":"Academy of the Federal Security Service of the Russian Federation","ror":"https://ror.org/05kt2wq49","country_code":"RU","type":"education","lineage":["https://openalex.org/I4210148151"]}],"countries":["RU"],"is_corresponding":false,"raw_author_name":"Anna Daryina","raw_affiliation_strings":["Computer Science and Control of the Russian Academy of Sciences,Federal Research Center,Moscow,Russia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Computer Science and Control of the Russian Academy of Sciences,Federal Research Center,Moscow,Russia","institution_ids":["https://openalex.org/I4210148151"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I4210148151"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1672","last_page":"1677"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.4620000123977661,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.4620000123977661,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11615","display_name":"Control and Dynamics of Mobile Robots","score":0.08540000021457672,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T13664","display_name":"Genome Rearrangement Algorithms","score":0.07620000094175339,"subfield":{"id":"https://openalex.org/subfields/1311","display_name":"Genetics"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.5794000029563904},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5748999714851379},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5393999814987183},{"id":"https://openalex.org/keywords/trajectory","display_name":"Trajectory","score":0.5351999998092651},{"id":"https://openalex.org/keywords/kinematics","display_name":"Kinematics","score":0.4943999946117401},{"id":"https://openalex.org/keywords/point","display_name":"Point (geometry)","score":0.4307999908924103},{"id":"https://openalex.org/keywords/mobile-robot","display_name":"Mobile robot","score":0.41839998960494995}],"concepts":[{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.5794000029563904},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5748999714851379},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5393999814987183},{"id":"https://openalex.org/C13662910","wikidata":"https://www.wikidata.org/wiki/Q193139","display_name":"Trajectory","level":2,"score":0.5351999998092651},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5192999839782715},{"id":"https://openalex.org/C39920418","wikidata":"https://www.wikidata.org/wiki/Q11476","display_name":"Kinematics","level":2,"score":0.4943999946117401},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.4307999908924103},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.43070000410079956},{"id":"https://openalex.org/C19966478","wikidata":"https://www.wikidata.org/wiki/Q4810574","display_name":"Mobile robot","level":3,"score":0.41839998960494995},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.38960000872612},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3700999915599823},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.36880001425743103},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.3614000082015991},{"id":"https://openalex.org/C96333769","wikidata":"https://www.wikidata.org/wiki/Q907955","display_name":"Graph traversal","level":3,"score":0.3278999924659729},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3197000026702881},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.29510000348091125},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.2797999978065491},{"id":"https://openalex.org/C831591","wikidata":"https://www.wikidata.org/wiki/Q59750","display_name":"Bidirectional search","level":5,"score":0.2685000002384186},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.26589998602867126},{"id":"https://openalex.org/C158485040","wikidata":"https://www.wikidata.org/wiki/Q4778119","display_name":"Any-angle path planning","level":4,"score":0.25450000166893005}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/codit66093.2025.11321652","is_oa":false,"landing_page_url":"https://doi.org/10.1109/codit66093.2025.11321652","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 11th International Conference on Control, Decision and Information Technologies (CoDIT)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.6446636319160461,"id":"https://metadata.un.org/sdg/15","display_name":"Life in Land"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":6,"referenced_works":["https://openalex.org/W1969483458","https://openalex.org/W2128990851","https://openalex.org/W2169528473","https://openalex.org/W2888468463","https://openalex.org/W3169403394","https://openalex.org/W4298325718"],"related_works":[],"abstract_inverted_index":{"Finding":[0],"optimal":[1,110,131],"path":[2],"is":[3,10,51,80,112],"required":[4],"in":[5],"many":[6],"applications.":[7],"However,":[8],"there":[9],"no":[11],"general":[12,19],"method":[13],"for":[14,105,129],"doing":[15],"it.":[16],"There":[17],"exist":[18],"numerical":[20],"methods":[21,33],"that":[22,60],"optimize":[23],"behavior":[24],"of":[25,46,63,67,77,82,93,108,118],"systems":[26],"according":[27],"to":[28,72],"certain":[29],"criteria,":[30],"but":[31],"these":[32],"do":[34],"not":[35],"provide":[36],"absolute":[37],"optimum.":[38],"In":[39],"current":[40],"article,":[41],"a":[42,47,75,116],"particular":[43],"kinematic":[44],"model":[45],"wheeled":[48],"mobile":[49],"robot":[50],"concerned.":[52],"For":[53],"this":[54,134],"model,":[55],"it":[56],"can":[57],"be":[58],"shown":[59],"the":[61,64,83,88,96,99,109,121,124,130],"solution":[62],"time-optimal":[65],"problem":[66],"moving":[68],"from":[69],"one":[70,81],"point":[71],"another":[73],"through":[74],"forest":[76],"circular":[78,125],"obstacles":[79,126],"locally":[84],"shortest":[85],"paths":[86],"between":[87,120],"two":[89],"points,":[90],"with":[91],"addition":[92],"rotations":[94],"around":[95],"starting":[97],"and":[98,127],"finishing":[100],"point.":[101],"Therefore,":[102],"an":[103],"algorithm":[104],"automatic":[106],"search":[107],"trajectory":[111,132],"proposed.":[113],"It":[114],"creates":[115],"graph":[117,135],"connections":[119],"points":[122],"on":[123,133],"searches":[128],"using":[136],"Dijkstra\u2019s":[137],"approach.":[138]},"counts_by_year":[],"updated_date":"2026-07-15T18:14:33.161393","created_date":"2026-01-15T00:00:00"}