{"id":"https://openalex.org/W2167451681","doi":"https://doi.org/10.1109/robot.2009.5152326","title":"A novel approach to path planning for multiple robots in bi-connected graphs","display_name":"A novel approach to path planning for multiple robots in bi-connected graphs","publication_year":2009,"publication_date":"2009-05-01","ids":{"openalex":"https://openalex.org/W2167451681","doi":"https://doi.org/10.1109/robot.2009.5152326","mag":"2167451681"},"language":"en","primary_location":{"id":"doi:10.1109/robot.2009.5152326","is_oa":false,"landing_page_url":"https://doi.org/10.1109/robot.2009.5152326","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2009 IEEE International Conference on Robotics and Automation","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/A5031732925","display_name":"Pavel Surynek","orcid":"https://orcid.org/0000-0001-7200-0542"},"institutions":[{"id":"https://openalex.org/I21250087","display_name":"Charles University","ror":"https://ror.org/024d6js02","country_code":"CZ","type":"education","lineage":["https://openalex.org/I21250087"]}],"countries":["CZ"],"is_corresponding":true,"raw_author_name":"Pavel Surynek","raw_affiliation_strings":["Department of Theoretical Computer Science and Mathematical Logic, Faculty of Mathematics and Physics, Charles University Prague, Praque, Czech Republic"],"affiliations":[{"raw_affiliation_string":"Department of Theoretical Computer Science and Mathematical Logic, Faculty of Mathematics and Physics, Charles University Prague, Praque, Czech Republic","institution_ids":["https://openalex.org/I21250087"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5031732925"],"corresponding_institution_ids":["https://openalex.org/I21250087"],"apc_list":null,"apc_paid":null,"fwci":4.2064,"has_fulltext":false,"cited_by_count":119,"citation_normalized_percentile":{"value":0.94897284,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":95,"max":100},"biblio":{"volume":null,"issue":null,"first_page":"3613","last_page":"3619"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9997000098228455,"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.9997000098228455,"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9944000244140625,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing 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/T12784","display_name":"Modular Robots and Swarm Intelligence","score":0.9937000274658203,"subfield":{"id":"https://openalex.org/subfields/2210","display_name":"Mechanical Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.7182881832122803},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.626426637172699},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6111063957214355},{"id":"https://openalex.org/keywords/abstraction","display_name":"Abstraction","score":0.6015640497207642},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5296756029129028},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5267345905303955},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.510330855846405},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.47578585147857666},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4453858435153961},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3914111852645874},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3488650321960449},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.25431305170059204},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.2322210669517517}],"concepts":[{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.7182881832122803},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.626426637172699},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6111063957214355},{"id":"https://openalex.org/C124304363","wikidata":"https://www.wikidata.org/wiki/Q673661","display_name":"Abstraction","level":2,"score":0.6015640497207642},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5296756029129028},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5267345905303955},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.510330855846405},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.47578585147857666},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4453858435153961},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3914111852645874},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3488650321960449},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.25431305170059204},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.2322210669517517},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/robot.2009.5152326","is_oa":false,"landing_page_url":"https://doi.org/10.1109/robot.2009.5152326","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2009 IEEE International Conference on Robotics and Automation","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.699999988079071,"id":"https://metadata.un.org/sdg/11","display_name":"Sustainable cities and communities"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W119150805","https://openalex.org/W1513808603","https://openalex.org/W1833735476","https://openalex.org/W1930659875","https://openalex.org/W1986164452","https://openalex.org/W2048036606","https://openalex.org/W2083721544","https://openalex.org/W2118382442","https://openalex.org/W2148043549","https://openalex.org/W2149951504","https://openalex.org/W2775798521","https://openalex.org/W4250074066","https://openalex.org/W6604858078","https://openalex.org/W6746813226"],"related_works":["https://openalex.org/W2045155990","https://openalex.org/W4313163053","https://openalex.org/W2359600231","https://openalex.org/W2380019117","https://openalex.org/W3138952546","https://openalex.org/W1987886368","https://openalex.org/W1660309994","https://openalex.org/W2369187583","https://openalex.org/W3197207153","https://openalex.org/W3154539612"],"abstract_inverted_index":{"This":[0],"paper":[1,78],"addresses":[2],"a":[3],"problem":[4,39,49,70,112],"of":[5,40,47,69],"path":[6],"planning":[7],"for":[8,16,66,110],"multiple":[9],"robots.":[10],"An":[11],"abstraction":[12,33],"where":[13],"the":[14,38,48,77,80,85,91,94,100],"environment":[15],"robots":[17,25],"is":[18,30,34,59,71,74],"modeled":[19],"as":[20,37],"an":[21],"undirected":[22],"graph":[23,52],"with":[24,50],"placed":[26],"in":[27,76],"its":[28],"vertices":[29,58],"used":[31],"(this":[32],"also":[35],"known":[36],"pebble":[41],"motion":[42],"on":[43],"graphs).":[44],"A":[45,61],"class":[46,68],"bi-connected":[51],"and":[53],"at":[54],"least":[55],"two":[56],"unoccupied":[57],"defined.":[60],"novel":[62],"polynomial-time":[63],"solution":[64],"algorithm":[65,82,102],"this":[67],"proposed.":[72],"It":[73],"shown":[75],"that":[79,99],"new":[81,101],"significantly":[83],"outperforms":[84],"existing":[86],"state-of-the-art":[87],"techniques":[88],"applicable":[89],"to":[90],"problem.":[92],"Moreover,":[93],"performed":[95],"experimental":[96],"evaluation":[97],"indicates":[98],"scales":[103],"up":[104],"well":[105],"which":[106],"make":[107],"it":[108],"suitable":[109],"practical":[111],"solving.":[113]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":7},{"year":2023,"cited_by_count":8},{"year":2022,"cited_by_count":12},{"year":2021,"cited_by_count":16},{"year":2020,"cited_by_count":7},{"year":2019,"cited_by_count":11},{"year":2018,"cited_by_count":9},{"year":2017,"cited_by_count":7},{"year":2016,"cited_by_count":7},{"year":2015,"cited_by_count":8},{"year":2014,"cited_by_count":7},{"year":2013,"cited_by_count":5},{"year":2012,"cited_by_count":6}],"updated_date":"2026-01-29T23:13:10.619473","created_date":"2025-10-10T00:00:00"}