{"id":"https://openalex.org/W3043887193","doi":"https://doi.org/10.1109/ur49135.2020.9144944","title":"Ant Colony Optimization based Multi-Robot Planner for Combined Task Allocation and Path Finding","display_name":"Ant Colony Optimization based Multi-Robot Planner for Combined Task Allocation and Path Finding","publication_year":2020,"publication_date":"2020-06-01","ids":{"openalex":"https://openalex.org/W3043887193","doi":"https://doi.org/10.1109/ur49135.2020.9144944","mag":"3043887193"},"language":"en","primary_location":{"id":"doi:10.1109/ur49135.2020.9144944","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ur49135.2020.9144944","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2020 17th International Conference on Ubiquitous Robots (UR)","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/A5012041315","display_name":"Agha Ali Haider Qizilbash","orcid":null},"institutions":[{"id":"https://openalex.org/I3018473509","display_name":"Fraunhofer Institute for Manufacturing Engineering and Automation","ror":"https://ror.org/01rvqha10","country_code":"DE","type":"facility","lineage":["https://openalex.org/I3018473509","https://openalex.org/I4923324"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Agha Ali Haider Qizilbash","raw_affiliation_strings":["Fraunhofer IPA,Stuttgart,Germany","Fraunhofer IPA, Stuttgart, Germany"],"affiliations":[{"raw_affiliation_string":"Fraunhofer IPA,Stuttgart,Germany","institution_ids":["https://openalex.org/I3018473509"]},{"raw_affiliation_string":"Fraunhofer IPA, Stuttgart, Germany","institution_ids":["https://openalex.org/I3018473509"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5025195838","display_name":"Christian Henkel","orcid":"https://orcid.org/0000-0001-6250-9695"},"institutions":[{"id":"https://openalex.org/I100066346","display_name":"University of Stuttgart","ror":"https://ror.org/04vnq7t77","country_code":"DE","type":"education","lineage":["https://openalex.org/I100066346"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Christian Henkel","raw_affiliation_strings":["University of Stuttgart, Germany,Stuttgart,Germany","University of Stuttgart, Germany, Stuttgart, Germany"],"affiliations":[{"raw_affiliation_string":"University of Stuttgart, Germany,Stuttgart,Germany","institution_ids":["https://openalex.org/I100066346"]},{"raw_affiliation_string":"University of Stuttgart, Germany, Stuttgart, Germany","institution_ids":["https://openalex.org/I100066346"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5064569017","display_name":"Sanaz Mostaghim","orcid":"https://orcid.org/0000-0002-9917-5227"},"institutions":[{"id":"https://openalex.org/I95793202","display_name":"Otto-von-Guericke University Magdeburg","ror":"https://ror.org/00ggpsq73","country_code":"DE","type":"education","lineage":["https://openalex.org/I95793202"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Sanaz Mostaghim","raw_affiliation_strings":["Otto-von-Guericke-University Magdeburg,Magdeburg,Germany","Otto-von-Guericke-University Magdeburg, Magdeburg, Germany"],"affiliations":[{"raw_affiliation_string":"Otto-von-Guericke-University Magdeburg,Magdeburg,Germany","institution_ids":["https://openalex.org/I95793202"]},{"raw_affiliation_string":"Otto-von-Guericke-University Magdeburg, Magdeburg, Germany","institution_ids":["https://openalex.org/I95793202"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5012041315"],"corresponding_institution_ids":["https://openalex.org/I3018473509"],"apc_list":null,"apc_paid":null,"fwci":0.4885,"has_fulltext":false,"cited_by_count":11,"citation_normalized_percentile":{"value":0.65513359,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"487","last_page":"493"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9993000030517578,"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.9993000030517578,"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/T11814","display_name":"Advanced Manufacturing and Logistics Optimization","score":0.9987999796867371,"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/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9879000186920166,"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/robot","display_name":"Robot","score":0.7815760374069214},{"id":"https://openalex.org/keywords/task","display_name":"Task (project management)","score":0.6679261326789856},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6518343687057495},{"id":"https://openalex.org/keywords/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.6340566277503967},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.6176657676696777},{"id":"https://openalex.org/keywords/planner","display_name":"Planner","score":0.615344762802124},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.6123291254043579},{"id":"https://openalex.org/keywords/ant-colony-optimization-algorithms","display_name":"Ant colony optimization algorithms","score":0.6073559522628784},{"id":"https://openalex.org/keywords/robotics","display_name":"Robotics","score":0.5402706265449524},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.5369508266448975},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4826846122741699},{"id":"https://openalex.org/keywords/mobile-robot","display_name":"Mobile robot","score":0.44564545154571533},{"id":"https://openalex.org/keywords/ant-colony","display_name":"Ant colony","score":0.42438775300979614},{"id":"https://openalex.org/keywords/field","display_name":"Field (mathematics)","score":0.41518527269363403},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.1884024441242218},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.17052200436592102},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.13312679529190063},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.057000577449798584}],"concepts":[{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.7815760374069214},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.6679261326789856},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6518343687057495},{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.6340566277503967},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.6176657676696777},{"id":"https://openalex.org/C2776999362","wikidata":"https://www.wikidata.org/wiki/Q2349274","display_name":"Planner","level":2,"score":0.615344762802124},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.6123291254043579},{"id":"https://openalex.org/C40128228","wikidata":"https://www.wikidata.org/wiki/Q460851","display_name":"Ant colony optimization algorithms","level":2,"score":0.6073559522628784},{"id":"https://openalex.org/C34413123","wikidata":"https://www.wikidata.org/wiki/Q170978","display_name":"Robotics","level":3,"score":0.5402706265449524},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.5369508266448975},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4826846122741699},{"id":"https://openalex.org/C19966478","wikidata":"https://www.wikidata.org/wiki/Q4810574","display_name":"Mobile robot","level":3,"score":0.44564545154571533},{"id":"https://openalex.org/C60891933","wikidata":"https://www.wikidata.org/wiki/Q796575","display_name":"Ant colony","level":3,"score":0.42438775300979614},{"id":"https://openalex.org/C9652623","wikidata":"https://www.wikidata.org/wiki/Q190109","display_name":"Field (mathematics)","level":2,"score":0.41518527269363403},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.1884024441242218},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.17052200436592102},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.13312679529190063},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.057000577449798584},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.0},{"id":"https://openalex.org/C201995342","wikidata":"https://www.wikidata.org/wiki/Q682496","display_name":"Systems engineering","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1109/ur49135.2020.9144944","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ur49135.2020.9144944","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2020 17th International Conference on Ubiquitous Robots (UR)","raw_type":"proceedings-article"},{"id":"pmh:oai:fraunhofer.de:N-615862","is_oa":false,"landing_page_url":"http://publica.fraunhofer.de/documents/N-615862.html","pdf_url":null,"source":{"id":"https://openalex.org/S4306400801","display_name":"Publikationsdatenbank der Fraunhofer-Gesellschaft (Fraunhofer-Gesellschaft)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4923324","host_organization_name":"Fraunhofer-Gesellschaft","host_organization_lineage":["https://openalex.org/I4923324"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Fraunhofer IPA","raw_type":"Conference Paper"},{"id":"pmh:oai:publica.fraunhofer.de:publica/409365","is_oa":false,"landing_page_url":"https://publica.fraunhofer.de/handle/publica/409365","pdf_url":null,"source":{"id":"https://openalex.org/S4306400318","display_name":"Fraunhofer-Publica (Fraunhofer-Gesellschaft)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4923324","host_organization_name":"Fraunhofer-Gesellschaft","host_organization_lineage":["https://openalex.org/I4923324"],"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":"conference paper"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":9,"referenced_works":["https://openalex.org/W1826421496","https://openalex.org/W2044116962","https://openalex.org/W2120124147","https://openalex.org/W2137306753","https://openalex.org/W2395113136","https://openalex.org/W2808475207","https://openalex.org/W6711715578","https://openalex.org/W6752419568","https://openalex.org/W6885154577"],"related_works":["https://openalex.org/W2128280661","https://openalex.org/W2365255133","https://openalex.org/W2033137063","https://openalex.org/W2903765850","https://openalex.org/W6776934","https://openalex.org/W2372339569","https://openalex.org/W3043524154","https://openalex.org/W2980620395","https://openalex.org/W3043887193","https://openalex.org/W2358145941"],"abstract_inverted_index":{"Nature":[0],"has":[1,43,267],"inspired":[2,146],"many":[3],"solutions":[4],"to":[5,46,69,84,110,151,162,165,194],"the":[6,14,28,38,78,93,105,139,177,188,191,195,206,210],"problems":[7,31,59],"in":[8,13,26,118,184,263],"computer":[9],"science":[10],"and":[11,50,75,89,126,239,252,258,266],"recently":[12],"field":[15,39],"of":[16,40,107,171],"robotics":[17],"as":[18,33,225],"well.":[19],"Ant":[20,229,242],"based":[21,232,245],"algorithms":[22],"have":[23],"been":[24,44,268],"successful":[25],"solving":[27],"NP":[29],"hard":[30],"such":[32],"traveling":[34],"salesman":[35],"problem.":[36,155],"In":[37,54,97],"multi-robots":[41],"it":[42],"used":[45],"solve":[47,152],"path":[48],"finding":[49],"task":[51,87,212],"allocation":[52],"problems.":[53],"industrial":[55],"warehouse":[56],"applications,":[57],"these":[58,86],"are":[60],"often":[61],"combined,":[62],"when":[63],"for":[64,115,122,216,235,248,256],"example":[65],"multiple":[66,204],"robots":[67,82,117,218],"need":[68,83],"pick-up":[70,125,257],"objects":[71],"from":[72,147,173,181],"one":[73],"location":[74],"dropoff":[76],"at":[77],"other.":[79],"Multiple":[80],"mobile":[81],"perform":[85],"optimally":[88],"simultaneously":[90],"being":[91,108],"on":[92],"floor":[94],"without":[95],"collisions.":[96],"this":[98,102,153,200,264],"paper,":[99],"we":[100,226],"address":[101],"problem":[103],"keeping":[104],"objective":[106],"able":[109],"obtain":[111],"collision":[112,159],"free":[113,160],"paths":[114,161,215],"all":[116,123,163,217],"a":[119,143,169],"map,":[120],"assigned":[121],"given":[124,220],"drop-off":[127,259],"tasks":[128,164,192,260],"among":[129,219],"themselves":[130],"with":[131,179,214],"an":[132],"optimized":[133],"minimal":[134],"total":[135,196],"distance":[136,197],"traveled":[137],"by":[138],"robots.":[140],"We":[141],"propose":[142],"multi-robot":[144],"planner":[145,157,189,207,223],"ant":[148],"colony":[149],"optimization":[150],"combined":[154],"This":[156,222],"finds":[158],"be":[166],"done":[167],"using":[168],"spread":[170],"ants":[172,183],"each":[174],"robot.":[175],"Ignoring":[176],"ones":[178],"collisions":[180],"other":[182,271],"their":[185],"determined":[186],"paths,":[187],"rates":[190],"according":[193],"traveled.":[198],"Using":[199],"rating":[201],"system":[202],"through":[203],"iterations,":[205],"eventually":[208],"selects":[209],"best":[211],"allocations":[213],"iterations.":[221],"or":[224],"call":[227],"it,":[228],"Colony":[230,243],"Optimization":[231,244],"Multi-Robot":[233,246],"Planner":[234,247],"Combined":[236,249],"Task":[237,250],"Allocation":[238,251],"Path":[240,253],"Finding":[241,254],"(ACTF)":[255],"is":[261],"presented":[262],"paper":[265],"tested":[269],"against":[270],"similar":[272],"planners":[273],"producing":[274],"promising":[275],"results.":[276]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":5},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1}],"updated_date":"2026-02-25T06:17:34.324206","created_date":"2025-10-10T00:00:00"}