{"id":"https://openalex.org/W4416677346","doi":"https://doi.org/10.1109/sbr/wre66973.2025.11249676","title":"Path Planning Based on Visibility Graph with Circular Obstacles for RoboCup Small Size League","display_name":"Path Planning Based on Visibility Graph with Circular Obstacles for RoboCup Small Size League","publication_year":2025,"publication_date":"2025-10-13","ids":{"openalex":"https://openalex.org/W4416677346","doi":"https://doi.org/10.1109/sbr/wre66973.2025.11249676"},"language":null,"primary_location":{"id":"doi:10.1109/sbr/wre66973.2025.11249676","is_oa":false,"landing_page_url":"https://doi.org/10.1109/sbr/wre66973.2025.11249676","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 Brazilian Symposium on Robotics (SBR) and 2025 Workshop on Robotics in Education (WRE)","raw_type":"proceedings-article"},"type":"article","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/A5019218502","display_name":"Marcos R. O. A. M\u00e1ximo","orcid":"https://orcid.org/0000-0003-2944-4476"},"institutions":[{"id":"https://openalex.org/I4210123805","display_name":"Instituto de Aeron\u00e1utica e Espa\u00e7o","ror":"https://ror.org/025n1fp68","country_code":"BR","type":"other","lineage":["https://openalex.org/I4210123805"]}],"countries":["BR"],"is_corresponding":false,"raw_author_name":"Marcos R. O. A. Maximo","raw_affiliation_strings":["Aeronautics Institute of Technology,Autonomous Computational Systems Lab, Computer Science Division,São José dos Campos,Brazil"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Aeronautics Institute of Technology,Autonomous Computational Systems Lab, Computer Science Division,São José dos Campos,Brazil","institution_ids":["https://openalex.org/I4210123805"]}]},{"author_position":"middle","author":{"id":null,"display_name":"Artur D. Ferreira da Silva","orcid":null},"institutions":[{"id":"https://openalex.org/I4210123805","display_name":"Instituto de Aeron\u00e1utica e Espa\u00e7o","ror":"https://ror.org/025n1fp68","country_code":"BR","type":"other","lineage":["https://openalex.org/I4210123805"]}],"countries":["BR"],"is_corresponding":false,"raw_author_name":"Artur D. Ferreira da Silva","raw_affiliation_strings":["Aeronautics Institute of Technology,Autonomous Computational Systems Lab, Computer Science Division,São José dos Campos,Brazil"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Aeronautics Institute of Technology,Autonomous Computational Systems Lab, Computer Science Division,São José dos Campos,Brazil","institution_ids":["https://openalex.org/I4210123805"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5047169473","display_name":"Lu\u00ed\u00ads Neves","orcid":"https://orcid.org/0000-0001-5034-8417"},"institutions":[{"id":"https://openalex.org/I4210123805","display_name":"Instituto de Aeron\u00e1utica e Espa\u00e7o","ror":"https://ror.org/025n1fp68","country_code":"BR","type":"other","lineage":["https://openalex.org/I4210123805"]}],"countries":["BR"],"is_corresponding":false,"raw_author_name":"Lucas G. Neves","raw_affiliation_strings":["Aeronautics Institute of Technology,Autonomous Computational Systems Lab, Computer Science Division,São José dos Campos,Brazil"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Aeronautics Institute of Technology,Autonomous Computational Systems Lab, Computer Science Division,São José dos Campos,Brazil","institution_ids":["https://openalex.org/I4210123805"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5037771082","display_name":"Celso Massaki Hirata","orcid":"https://orcid.org/0000-0002-9746-7605"},"institutions":[{"id":"https://openalex.org/I107428990","display_name":"Instituto Tecnol\u00f3gico de Aeron\u00e1utica","ror":"https://ror.org/05vh67662","country_code":"BR","type":"education","lineage":["https://openalex.org/I107428990"]},{"id":"https://openalex.org/I4210123805","display_name":"Instituto de Aeron\u00e1utica e Espa\u00e7o","ror":"https://ror.org/025n1fp68","country_code":"BR","type":"other","lineage":["https://openalex.org/I4210123805"]}],"countries":["BR"],"is_corresponding":false,"raw_author_name":"Celso M. Hirata","raw_affiliation_strings":["Aeronautics Institute of Technology,Computer Science Division,São José dos Campos,Brazil"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Aeronautics Institute of Technology,Computer Science Division,São José dos Campos,Brazil","institution_ids":["https://openalex.org/I4210123805","https://openalex.org/I107428990"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.32026183,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"176","last_page":"181"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.8605999946594238,"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.8605999946594238,"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/T10191","display_name":"Robotics and Sensor-Based Localization","score":0.020400000736117363,"subfield":{"id":"https://openalex.org/subfields/2202","display_name":"Aerospace 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/T11574","display_name":"Artificial Intelligence in Games","score":0.016300000250339508,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.7425000071525574},{"id":"https://openalex.org/keywords/visibility","display_name":"Visibility","score":0.6039999723434448},{"id":"https://openalex.org/keywords/visibility-graph","display_name":"Visibility graph","score":0.5965999960899353},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5800999999046326},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.5156000256538391},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5108000040054321}],"concepts":[{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.7425000071525574},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.708299994468689},{"id":"https://openalex.org/C123403432","wikidata":"https://www.wikidata.org/wiki/Q654068","display_name":"Visibility","level":2,"score":0.6039999723434448},{"id":"https://openalex.org/C173362246","wikidata":"https://www.wikidata.org/wiki/Q8216024","display_name":"Visibility graph","level":3,"score":0.5965999960899353},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5800999999046326},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.5156000256538391},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5108000040054321},{"id":"https://openalex.org/C158485040","wikidata":"https://www.wikidata.org/wiki/Q4778119","display_name":"Any-angle path planning","level":4,"score":0.46059998869895935},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.4537000060081482},{"id":"https://openalex.org/C207456731","wikidata":"https://www.wikidata.org/wiki/Q660818","display_name":"League","level":2,"score":0.39500001072883606},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.328900009393692},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.2806999981403351},{"id":"https://openalex.org/C31972630","wikidata":"https://www.wikidata.org/wiki/Q844240","display_name":"Computer vision","level":1,"score":0.2793999910354614},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.2777999937534332},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.2621000111103058}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/sbr/wre66973.2025.11249676","is_oa":false,"landing_page_url":"https://doi.org/10.1109/sbr/wre66973.2025.11249676","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 Brazilian Symposium on Robotics (SBR) and 2025 Workshop on Robotics in Education (WRE)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":9,"referenced_works":["https://openalex.org/W2068262213","https://openalex.org/W2110762409","https://openalex.org/W2519453022","https://openalex.org/W3004407706","https://openalex.org/W3009103564","https://openalex.org/W3104753760","https://openalex.org/W3119629976","https://openalex.org/W3135319954","https://openalex.org/W4409602173"],"related_works":[],"abstract_inverted_index":{"The":[0,73],"RoboCup":[1],"Small":[2],"Size":[3],"League":[4],"(SSL)":[5],"demands":[6],"fast":[7],"and":[8,16,64],"efficient":[9],"path":[10,40,75],"planning":[11,41],"due":[12],"to":[13,69],"its":[14],"dynamic":[15],"competitive":[17],"environment.":[18],"While":[19],"sampling-based":[20],"techniques":[21],"have":[22],"been":[23],"widely":[24],"adopted,":[25],"they":[26],"often":[27],"suffer":[28],"from":[29],"inconsistencies":[30],"between":[31],"replans.":[32],"In":[33],"this":[34],"work,":[35],"we":[36,57],"propose":[37],"using":[38,78],"a":[39,45,59],"approach":[42],"based":[43],"on":[44],"visibility":[46],"graph":[47,61],"with":[48],"circular":[49],"obstacles":[50],"in":[51],"SSL.":[52],"To":[53],"ensure":[54],"real-time":[55],"performance,":[56],"implement":[58],"lazy":[60],"construction":[62],"strategy":[63],"extensively":[65],"optimize":[66],"the":[67,79],"code":[68],"reduce":[70],"computational":[71],"overhead.":[72],"shortest":[74],"is":[76],"computed":[77],"A*":[80],"algorithm.":[81],"Experimental":[82],"results":[83],"demonstrate":[84],"that":[85],"our":[86],"method":[87],"provides":[88],"smooth,":[89],"high-performance":[90],"trajectories":[91],"suitable":[92],"for":[93],"SSL":[94],"gameplay.":[95]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-11-25T00:00:00"}