{"id":"https://openalex.org/W3083743049","doi":"https://doi.org/10.1109/cec48606.2020.9185585","title":"On the Scalable Multi-Objective Multi-Agent Pathfinding Problem","display_name":"On the Scalable Multi-Objective Multi-Agent Pathfinding Problem","publication_year":2020,"publication_date":"2020-07-01","ids":{"openalex":"https://openalex.org/W3083743049","doi":"https://doi.org/10.1109/cec48606.2020.9185585","mag":"3083743049"},"language":"en","primary_location":{"id":"doi:10.1109/cec48606.2020.9185585","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec48606.2020.9185585","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2020 IEEE Congress on Evolutionary Computation (CEC)","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/A5089280378","display_name":"Jens Weise","orcid":"https://orcid.org/0000-0002-8828-8752"},"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":true,"raw_author_name":"Jens Weise","raw_affiliation_strings":["Computational Intelligence Group, Otto von Guericke University, Magdeburg, Germany"],"affiliations":[{"raw_affiliation_string":"Computational Intelligence Group, Otto von Guericke University, Magdeburg, Germany","institution_ids":["https://openalex.org/I95793202"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5049866480","display_name":"Sebastian Mai","orcid":"https://orcid.org/0000-0002-2255-3277"},"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":"Sebastian Mai","raw_affiliation_strings":["Computational Intelligence Group, Otto von Guericke University, Magdeburg, Germany"],"affiliations":[{"raw_affiliation_string":"Computational Intelligence Group, Otto von Guericke University, Magdeburg, Germany","institution_ids":["https://openalex.org/I95793202"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5010316655","display_name":"Heiner Zille","orcid":"https://orcid.org/0000-0002-7262-9487"},"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":"Heiner Zille","raw_affiliation_strings":["Computational Intelligence Group, Otto von Guericke University, Magdeburg, Germany"],"affiliations":[{"raw_affiliation_string":"Computational Intelligence Group, Otto von Guericke University, Magdeburg, Germany","institution_ids":["https://openalex.org/I95793202"]}]},{"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":["Computational Intelligence Group, Otto von Guericke University, Magdeburg, Germany"],"affiliations":[{"raw_affiliation_string":"Computational Intelligence Group, Otto von Guericke University, Magdeburg, Germany","institution_ids":["https://openalex.org/I95793202"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5089280378"],"corresponding_institution_ids":["https://openalex.org/I95793202"],"apc_list":null,"apc_paid":null,"fwci":2.0517,"has_fulltext":false,"cited_by_count":27,"citation_normalized_percentile":{"value":0.89151039,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"8"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9991999864578247,"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.9991999864578247,"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/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","score":0.9973999857902527,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9873999953269958,"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/scalability","display_name":"Scalability","score":0.7172508239746094},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.6869211792945862},{"id":"https://openalex.org/keywords/solver","display_name":"Solver","score":0.6651610136032104},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6393543481826782},{"id":"https://openalex.org/keywords/pathfinding","display_name":"Pathfinding","score":0.6175577044487},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6156237125396729},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.49801087379455566},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.49213141202926636},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.4018844962120056},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.2485733926296234},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.20107457041740417},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.18518665432929993},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.18479251861572266}],"concepts":[{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.7172508239746094},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.6869211792945862},{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.6651610136032104},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6393543481826782},{"id":"https://openalex.org/C25321074","wikidata":"https://www.wikidata.org/wiki/Q1969601","display_name":"Pathfinding","level":4,"score":0.6175577044487},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6156237125396729},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.49801087379455566},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.49213141202926636},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.4018844962120056},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2485733926296234},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.20107457041740417},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.18518665432929993},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.18479251861572266},{"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/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/cec48606.2020.9185585","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec48606.2020.9185585","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2020 IEEE Congress on Evolutionary Computation (CEC)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/9","score":0.6299999952316284,"display_name":"Industry, innovation and infrastructure"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":45,"referenced_works":["https://openalex.org/W658797333","https://openalex.org/W1559954218","https://openalex.org/W1978151341","https://openalex.org/W2000825106","https://openalex.org/W2022485595","https://openalex.org/W2076054478","https://openalex.org/W2090582776","https://openalex.org/W2106334424","https://openalex.org/W2126105956","https://openalex.org/W2169528473","https://openalex.org/W2313274380","https://openalex.org/W2548023599","https://openalex.org/W2548458395","https://openalex.org/W2577044415","https://openalex.org/W2588764485","https://openalex.org/W2616257225","https://openalex.org/W2726747380","https://openalex.org/W2730530972","https://openalex.org/W2786330044","https://openalex.org/W2898165977","https://openalex.org/W2899793720","https://openalex.org/W2913082070","https://openalex.org/W2913767232","https://openalex.org/W2914089630","https://openalex.org/W2946473772","https://openalex.org/W2949992533","https://openalex.org/W2955452256","https://openalex.org/W2958271860","https://openalex.org/W2959169610","https://openalex.org/W2961841260","https://openalex.org/W2964997335","https://openalex.org/W2967773665","https://openalex.org/W2972285156","https://openalex.org/W3027461786","https://openalex.org/W3039651662","https://openalex.org/W3106832946","https://openalex.org/W3107032938","https://openalex.org/W6633619901","https://openalex.org/W6732326084","https://openalex.org/W6740638739","https://openalex.org/W6762921932","https://openalex.org/W6763563180","https://openalex.org/W6780062511","https://openalex.org/W6786140910","https://openalex.org/W6786807807"],"related_works":["https://openalex.org/W4285687848","https://openalex.org/W4289994039","https://openalex.org/W2240526870","https://openalex.org/W3100156731","https://openalex.org/W2623016776","https://openalex.org/W1967962134","https://openalex.org/W3128311703","https://openalex.org/W3101047024","https://openalex.org/W131718761","https://openalex.org/W2509483197"],"abstract_inverted_index":{"The":[0,12,93],"Multi-Agent":[1],"Pathfinding":[2],"problem":[3,68,95,106,128],"(MAPF)":[4],"has":[5],"several":[6],"applications":[7],"in":[8,32,96],"industry":[9],"and":[10,24,82,134,140,142],"robotics.":[11],"aim":[13],"of":[14,22,30,147],"a":[15,20,28,33,54,65,103,126],"MAPF-solver":[16],"is":[17,51,99],"to":[18,40,86,101,119],"find":[19],"set":[21],"optimal":[23],"non-overlapping":[25],"paths":[26],"for":[27,107,130],"number":[29],"agents":[31],"navigation":[34],"scenario.":[35],"Existing":[36],"approaches":[37],"are":[38,85],"shown":[39],"successfully":[41],"deal":[42],"with":[43],"MAPF,":[44],"where":[45,111],"either":[46],"the":[47,62,90,116,138,148],"makespan":[48],"or":[49],"flow-time":[50,81],"used":[52],"as":[53,64],"single":[55],"objective.":[56],"In":[57,70],"this":[58,71,97],"article,":[59],"we":[60,73,112],"treat":[61],"MAPF":[63],"multi-objective":[66,108],"optimisation":[67,109,132,149],"(MOMAPF).":[69],"paper,":[72],"consider":[74],"three":[75],"different":[76,121],"objective":[77],"functions,":[78],"called":[79],"makespan,":[80],"path-overlaps":[83],"which":[84],"be":[87,102],"optimised":[88],"at":[89],"same":[91],"time.":[92],"MOMAPF":[94,131],"paper":[98],"designed":[100],"scalable":[104],"test":[105],"algorithms,":[110],"can":[113],"scale":[114],"up":[115],"variable":[117],"space":[118],"reflect":[120],"real-world":[122],"scenarios.":[123],"We":[124],"propose":[125],"new":[127],"formulation":[129],"algorithms":[133],"implement":[135],"it":[136],"into":[137],"NSGA-II":[139],"NSGA-III":[141],"provide":[143],"an":[144],"experimental":[145],"evaluation":[146],"results.":[150]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":5},{"year":2023,"cited_by_count":7},{"year":2022,"cited_by_count":5},{"year":2021,"cited_by_count":8},{"year":2020,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}