{"id":"https://openalex.org/W2787371296","doi":"https://doi.org/10.1109/la-cci.2017.8285722","title":"Sequential path planning for a formation of mobile robots with split and merge","display_name":"Sequential path planning for a formation of mobile robots with split and merge","publication_year":2017,"publication_date":"2017-11-01","ids":{"openalex":"https://openalex.org/W2787371296","doi":"https://doi.org/10.1109/la-cci.2017.8285722","mag":"2787371296"},"language":"en","primary_location":{"id":"doi:10.1109/la-cci.2017.8285722","is_oa":false,"landing_page_url":"https://doi.org/10.1109/la-cci.2017.8285722","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2017 IEEE Latin American Conference on Computational Intelligence (LA-CCI)","raw_type":"proceedings-article"},"type":"preprint","indexed_in":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/1901.08444","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5032419601","display_name":"Maira Estefan\u00eda Pereyra","orcid":null},"institutions":[{"id":"https://openalex.org/I128590013","display_name":"National Technological University","ror":"https://ror.org/04t730v47","country_code":"AR","type":"education","lineage":["https://openalex.org/I128590013"]}],"countries":["AR"],"is_corresponding":false,"raw_author_name":"M. Estefania Pereyra","raw_affiliation_strings":["Research Centre in Informatics for Engineering, National Technological University, Argentina"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Research Centre in Informatics for Engineering, National Technological University, Argentina","institution_ids":["https://openalex.org/I128590013"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5015222785","display_name":"Gast\u00f3n Aragu\u00e1s","orcid":"https://orcid.org/0000-0002-2478-5477"},"institutions":[{"id":"https://openalex.org/I128590013","display_name":"National Technological University","ror":"https://ror.org/04t730v47","country_code":"AR","type":"education","lineage":["https://openalex.org/I128590013"]}],"countries":["AR"],"is_corresponding":false,"raw_author_name":"R. Gaston Araguas","raw_affiliation_strings":["Research Centre in Informatics for Engineering, National Technological University, Argentina"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Research Centre in Informatics for Engineering, National Technological University, Argentina","institution_ids":["https://openalex.org/I128590013"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5084228715","display_name":"Miroslav Kulich","orcid":"https://orcid.org/0000-0002-0997-5889"},"institutions":[{"id":"https://openalex.org/I44504214","display_name":"Czech Technical University in Prague","ror":"https://ror.org/03kqpb082","country_code":"CZ","type":"education","lineage":["https://openalex.org/I44504214"]}],"countries":["CZ"],"is_corresponding":false,"raw_author_name":"Miroslav Kulich","raw_affiliation_strings":["Miroslav Kulich is with Czech Institute of Informatics, Czech Technical University in Prague, Prague, Czech Republic"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Miroslav Kulich is with Czech Institute of Informatics, Czech Technical University in Prague, Prague, Czech Republic","institution_ids":["https://openalex.org/I44504214"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.1847,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.60452095,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":"1999","issue":null,"first_page":"1","last_page":"6"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9998000264167786,"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.9998000264167786,"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/T10249","display_name":"Distributed Control Multi-Agent Systems","score":0.9994999766349792,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T12784","display_name":"Modular Robots and Swarm Intelligence","score":0.9986000061035156,"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/merge","display_name":"Merge (version control)","score":0.7934443950653076},{"id":"https://openalex.org/keywords/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.7733945846557617},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.7552539706230164},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7185102701187134},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.659209132194519},{"id":"https://openalex.org/keywords/mobile-robot","display_name":"Mobile robot","score":0.5633723139762878},{"id":"https://openalex.org/keywords/any-angle-path-planning","display_name":"Any-angle path planning","score":0.5590283870697021},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5328902006149292},{"id":"https://openalex.org/keywords/graph-traversal","display_name":"Graph traversal","score":0.5283090472221375},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4156700074672699},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4080415666103363},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.3886493146419525},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3268561363220215},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.29911521077156067},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.16401922702789307},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.11178725957870483}],"concepts":[{"id":"https://openalex.org/C197129107","wikidata":"https://www.wikidata.org/wiki/Q1921621","display_name":"Merge (version control)","level":2,"score":0.7934443950653076},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.7733945846557617},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.7552539706230164},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7185102701187134},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.659209132194519},{"id":"https://openalex.org/C19966478","wikidata":"https://www.wikidata.org/wiki/Q4810574","display_name":"Mobile robot","level":3,"score":0.5633723139762878},{"id":"https://openalex.org/C158485040","wikidata":"https://www.wikidata.org/wiki/Q4778119","display_name":"Any-angle path planning","level":4,"score":0.5590283870697021},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5328902006149292},{"id":"https://openalex.org/C96333769","wikidata":"https://www.wikidata.org/wiki/Q907955","display_name":"Graph traversal","level":3,"score":0.5283090472221375},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4156700074672699},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4080415666103363},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.3886493146419525},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3268561363220215},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.29911521077156067},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.16401922702789307},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.11178725957870483}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1109/la-cci.2017.8285722","is_oa":false,"landing_page_url":"https://doi.org/10.1109/la-cci.2017.8285722","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2017 IEEE Latin American Conference on Computational Intelligence (LA-CCI)","raw_type":"proceedings-article"},{"id":"pmh:oai:arXiv.org:1901.08444","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1901.08444","pdf_url":"https://arxiv.org/pdf/1901.08444","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"pmh:oai:zenodo.org:3953591","is_oa":true,"landing_page_url":"https://zenodo.org/record/3953591","pdf_url":null,"source":{"id":"https://openalex.org/S4306400562","display_name":"Zenodo (CERN European Organization for Nuclear Research)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I67311998","host_organization_name":"European Organization for Nuclear Research","host_organization_lineage":["https://openalex.org/I67311998"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"info:eu-repo/semantics/conferencePaper"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:1901.08444","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1901.08444","pdf_url":"https://arxiv.org/pdf/1901.08444","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":23,"referenced_works":["https://openalex.org/W959564729","https://openalex.org/W1993688584","https://openalex.org/W2005389191","https://openalex.org/W2009513211","https://openalex.org/W2023629075","https://openalex.org/W2028617598","https://openalex.org/W2031404716","https://openalex.org/W2033388390","https://openalex.org/W2044526330","https://openalex.org/W2046959847","https://openalex.org/W2047889826","https://openalex.org/W2057933286","https://openalex.org/W2080816053","https://openalex.org/W2090840593","https://openalex.org/W2128044026","https://openalex.org/W2130952857","https://openalex.org/W2132803465","https://openalex.org/W2139623875","https://openalex.org/W2162481101","https://openalex.org/W2165453582","https://openalex.org/W6651663918","https://openalex.org/W6670821121","https://openalex.org/W6684703020"],"related_works":["https://openalex.org/W3209137076","https://openalex.org/W4223969905","https://openalex.org/W2374560440","https://openalex.org/W1490490684","https://openalex.org/W4221129498","https://openalex.org/W2887026015","https://openalex.org/W2361442013","https://openalex.org/W2373384475","https://openalex.org/W4310124294","https://openalex.org/W143403600"],"abstract_inverted_index":{"An":[0],"algorithm":[1,20,58],"for":[2,24,59,73,114,134],"robot":[3],"formation":[4,26,34,106],"path":[5,23],"planning":[6,108],"is":[7,63,88],"presented":[8,86],"in":[9,81,131],"this":[10],"paper.":[11],"Given":[12],"a":[13,22,25,47,71,74],"map":[14],"of":[15,32,42,55,116,118,128,137,139],"the":[16,19,33,43,82,85,129],"working":[17],"environment,":[18],"finds":[21,70],"taking":[27],"into":[28,94],"account":[29],"possible":[30],"split":[31],"and":[35,49,69,100],"its":[36],"consecutive":[37],"merge.":[38],"The":[39,122],"key":[40],"part":[41],"solution":[44,72,87],"works":[45],"on":[46],"graph":[48],"sequentially":[50],"employs":[51],"an":[52,119],"extended":[53],"version":[54],"Dijkstra's":[56],"graph-based":[57],"multiple":[60],"robots.":[61,140],"It":[62],"thus":[64],"deterministic,":[65],"complete,":[66],"computationally":[67],"inexpensive,":[68],"fixed":[75],"source":[76],"node":[77,80],"to":[78,91],"other":[79],"graph.":[83,121],"Moreover,":[84],"general":[89],"enough":[90],"be":[92,112],"incorporated":[93],"high-level":[95],"tasks":[96],"like":[97],"cooperative":[98],"surveillance":[99],"it":[101],"can":[102,111],"benefit":[103],"from":[104],"state-of-the-art":[105],"motion":[107],"approaches,":[109],"which":[110],"used":[113],"evaluation":[115],"edges":[117],"input":[120],"performed":[123],"experimental":[124],"results":[125],"demonstrate":[126],"behavior":[127],"method":[130],"complex":[132],"environments":[133],"formations":[135],"consisting":[136],"tens":[138]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2020,"cited_by_count":2}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2018-02-23T00:00:00"}