{"id":"https://openalex.org/W2077444422","doi":"https://doi.org/10.1109/iros.2012.6385660","title":"Goal assignment using distance cost in multi-robot exploration","display_name":"Goal assignment using distance cost in multi-robot exploration","publication_year":2012,"publication_date":"2012-10-01","ids":{"openalex":"https://openalex.org/W2077444422","doi":"https://doi.org/10.1109/iros.2012.6385660","mag":"2077444422"},"language":"en","primary_location":{"id":"doi:10.1109/iros.2012.6385660","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iros.2012.6385660","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2012 IEEE/RSJ International Conference on Intelligent Robots and Systems","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/A5073496345","display_name":"Jan Faigl","orcid":"https://orcid.org/0000-0002-6193-0792"},"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":"Jan Faigl","raw_affiliation_strings":["Department of Cybernetics, Faculty of Electrical Engineering, Czech Technical University in Prague, Prague, Czech Republic","Dept. of Cybernetics, Faculty of Electrical Engineering, Czech Technical University in Prague, Technick\u00e1 2, 166 27, Czech Republic"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Cybernetics, Faculty of Electrical Engineering, Czech Technical University in Prague, Prague, Czech Republic","institution_ids":["https://openalex.org/I44504214"]},{"raw_affiliation_string":"Dept. of Cybernetics, Faculty of Electrical Engineering, Czech Technical University in Prague, Technick\u00e1 2, 166 27, Czech Republic","institution_ids":["https://openalex.org/I44504214"]}]},{"author_position":"middle","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":["Department of Cybernetics, Faculty of Electrical Engineering, Czech Technical University in Prague, Prague, Czech Republic","Dept. of Cybernetics, Faculty of Electrical Engineering, Czech Technical University in Prague, Technick\u00e1 2, 166 27, Czech Republic"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Cybernetics, Faculty of Electrical Engineering, Czech Technical University in Prague, Prague, Czech Republic","institution_ids":["https://openalex.org/I44504214"]},{"raw_affiliation_string":"Dept. of Cybernetics, Faculty of Electrical Engineering, Czech Technical University in Prague, Technick\u00e1 2, 166 27, Czech Republic","institution_ids":["https://openalex.org/I44504214"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5004686576","display_name":"Libor P\u0159eu\u010dil","orcid":"https://orcid.org/0000-0002-4286-3870"},"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":"Libor Preucil","raw_affiliation_strings":["Department of Cybernetics, Faculty of Electrical Engineering, Czech Technical University in Prague, Prague, Czech Republic","Dept. of Cybernetics, Faculty of Electrical Engineering, Czech Technical University in Prague, Technick\u00e1 2, 166 27, Czech Republic"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Cybernetics, Faculty of Electrical Engineering, Czech Technical University in Prague, Prague, Czech Republic","institution_ids":["https://openalex.org/I44504214"]},{"raw_affiliation_string":"Dept. of Cybernetics, Faculty of Electrical Engineering, Czech Technical University in Prague, Technick\u00e1 2, 166 27, Czech Republic","institution_ids":["https://openalex.org/I44504214"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":3.0541,"has_fulltext":false,"cited_by_count":68,"citation_normalized_percentile":{"value":0.92506347,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"3741","last_page":"3746"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9998999834060669,"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.9998999834060669,"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/T12288","display_name":"Optimization and Search Problems","score":0.9997000098228455,"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9965999722480774,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.7625560164451599},{"id":"https://openalex.org/keywords/task","display_name":"Task (project management)","score":0.6940490007400513},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6806383728981018},{"id":"https://openalex.org/keywords/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.5464453101158142},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5312155485153198},{"id":"https://openalex.org/keywords/assignment-problem","display_name":"Assignment problem","score":0.42594611644744873},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.3988710045814514},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.13363566994667053},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.12657612562179565},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.10958880186080933}],"concepts":[{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.7625560164451599},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.6940490007400513},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6806383728981018},{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.5464453101158142},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5312155485153198},{"id":"https://openalex.org/C85044808","wikidata":"https://www.wikidata.org/wiki/Q620614","display_name":"Assignment problem","level":2,"score":0.42594611644744873},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.3988710045814514},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.13363566994667053},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.12657612562179565},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.10958880186080933},{"id":"https://openalex.org/C201995342","wikidata":"https://www.wikidata.org/wiki/Q682496","display_name":"Systems engineering","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/iros.2012.6385660","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iros.2012.6385660","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2012 IEEE/RSJ International Conference on Intelligent Robots and Systems","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":20,"referenced_works":["https://openalex.org/W1577083826","https://openalex.org/W1966213627","https://openalex.org/W2051735871","https://openalex.org/W2058626008","https://openalex.org/W2108881911","https://openalex.org/W2110178871","https://openalex.org/W2121734178","https://openalex.org/W2129853306","https://openalex.org/W2131201219","https://openalex.org/W2131244428","https://openalex.org/W2135524320","https://openalex.org/W2140425706","https://openalex.org/W2142924305","https://openalex.org/W2146271069","https://openalex.org/W2151887427","https://openalex.org/W2157488300","https://openalex.org/W2159361280","https://openalex.org/W6676125134","https://openalex.org/W6676388466","https://openalex.org/W6678073246"],"related_works":["https://openalex.org/W1525389557","https://openalex.org/W2361554335","https://openalex.org/W2164188042","https://openalex.org/W2359992618","https://openalex.org/W2495211334","https://openalex.org/W3213722473","https://openalex.org/W2110944602","https://openalex.org/W2352398686","https://openalex.org/W2106580143","https://openalex.org/W2140906272"],"abstract_inverted_index":{"In":[0,39],"this":[1],"paper,":[2],"we":[3,41,75],"discuss":[4],"the":[5,11,21,27,63,70,90,116,119,121,130],"problem":[6,25,67,71],"of":[7,26,49,104,109,118],"goal":[8],"assignment":[9,24],"in":[10,102],"multi-robot":[12,28],"exploration":[13,45,123,127],"task.":[14],"The":[15,93],"presented":[16],"work":[17],"is":[18,32,72,80],"focused":[19],"on":[20,115],"underlying":[22],"optimal":[23],"task":[29],"allocation":[30,48],"that":[31],"addressed":[33],"by":[34],"three":[35,97],"state-of-the":[36],"art":[37],"approaches.":[38,92,132],"addition,":[40],"propose":[42],"a":[43],"novel":[44],"strategy":[46,124],"considering":[47,106],"all":[50],"current":[51],"goals":[52],"(not":[53],"only":[54],"immediate":[55],"goal)":[56],"for":[57],"each":[58],"robot,":[59],"which":[60],"leads":[61],"to":[62,89],"multiple":[64],"traveling":[65],"salesman":[66],"formulation.":[68],"Although":[69],"strongly":[73],"NP-hard,":[74],"show":[76],"its":[77,84],"approximate":[78],"solution":[79],"computationally":[81],"feasible":[82],"and":[83,96,111],"overall":[85],"requirements":[86],"are":[87,100],"competitive":[88],"previous":[91],"proposed":[94,122],"approach":[95],"well-known":[98],"approaches":[99],"compared":[101],"series":[103],"problems":[105],"various":[107],"numbers":[108],"robots":[110],"sensor":[112],"ranges.":[113],"Based":[114],"evaluation":[117],"results":[120],"provides":[125],"shorter":[126],"times":[128],"than":[129],"former":[131]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":4},{"year":2024,"cited_by_count":6},{"year":2023,"cited_by_count":6},{"year":2022,"cited_by_count":8},{"year":2021,"cited_by_count":5},{"year":2020,"cited_by_count":5},{"year":2019,"cited_by_count":8},{"year":2018,"cited_by_count":5},{"year":2017,"cited_by_count":4},{"year":2016,"cited_by_count":4},{"year":2015,"cited_by_count":6},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":3}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}