{"id":"https://openalex.org/W4414359376","doi":"https://doi.org/10.24963/ijcai.2025/985","title":"Theoretical Analysis of Evolutionary Algorithms with Quality Diversity for a Classical Path Planning Problem","display_name":"Theoretical Analysis of Evolutionary Algorithms with Quality Diversity for a Classical Path Planning Problem","publication_year":2025,"publication_date":"2025-09-01","ids":{"openalex":"https://openalex.org/W4414359376","doi":"https://doi.org/10.24963/ijcai.2025/985"},"language":"en","primary_location":{"id":"doi:10.24963/ijcai.2025/985","is_oa":false,"landing_page_url":"https://doi.org/10.24963/ijcai.2025/985","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Thirty-Fourth International Joint Conference on Artificial Intelligence","raw_type":"proceedings-article"},"type":"conference-paper","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/A5031492262","display_name":"Duc-Cuong Dang","orcid":"https://orcid.org/0000-0002-6660-6625"},"institutions":[{"id":"https://openalex.org/I186354981","display_name":"University of Passau","ror":"https://ror.org/05ydjnb78","country_code":"DE","type":"education","lineage":["https://openalex.org/I186354981"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Duc-Cuong Dang","raw_affiliation_strings":["University of Passau"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Passau","institution_ids":["https://openalex.org/I186354981"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5001757263","display_name":"Aneta Neumann","orcid":"https://orcid.org/0000-0002-0036-4782"},"institutions":[{"id":"https://openalex.org/I5681781","display_name":"The University of Adelaide","ror":"https://ror.org/00892tw58","country_code":"AU","type":"education","lineage":["https://openalex.org/I5681781"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"Aneta Neumann","raw_affiliation_strings":["University of Adelaide"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Adelaide","institution_ids":["https://openalex.org/I5681781"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5089531887","display_name":"Frank Neumann","orcid":"https://orcid.org/0000-0002-2721-3618"},"institutions":[{"id":"https://openalex.org/I5681781","display_name":"The University of Adelaide","ror":"https://ror.org/00892tw58","country_code":"AU","type":"education","lineage":["https://openalex.org/I5681781"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"Frank Neumann","raw_affiliation_strings":["University of Adelaide"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Adelaide","institution_ids":["https://openalex.org/I5681781"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5081165511","display_name":"Andre Opris","orcid":"https://orcid.org/0000-0002-7730-7831"},"institutions":[{"id":"https://openalex.org/I186354981","display_name":"University of Passau","ror":"https://ror.org/05ydjnb78","country_code":"DE","type":"education","lineage":["https://openalex.org/I186354981"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Andre Opris","raw_affiliation_strings":["University of Passau"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Passau","institution_ids":["https://openalex.org/I186354981"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5018789989","display_name":"Dirk Sudholt","orcid":"https://orcid.org/0000-0001-6020-1646"},"institutions":[{"id":"https://openalex.org/I186354981","display_name":"University of Passau","ror":"https://ror.org/05ydjnb78","country_code":"DE","type":"education","lineage":["https://openalex.org/I186354981"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Dirk Sudholt","raw_affiliation_strings":["University of Passau"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Passau","institution_ids":["https://openalex.org/I186354981"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"8858","last_page":"8866"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9983999729156494,"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.9983999729156494,"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/T11615","display_name":"Control and Dynamics of Mobile Robots","score":0.9210000038146973,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems 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/crossover","display_name":"Crossover","score":0.6703000068664551},{"id":"https://openalex.org/keywords/evolutionary-algorithm","display_name":"Evolutionary algorithm","score":0.6437000036239624},{"id":"https://openalex.org/keywords/leverage","display_name":"Leverage (statistics)","score":0.6434999704360962},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.5778999924659729},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.4474000036716461},{"id":"https://openalex.org/keywords/selection","display_name":"Selection (genetic algorithm)","score":0.43970000743865967},{"id":"https://openalex.org/keywords/task","display_name":"Task (project management)","score":0.41510000824928284}],"concepts":[{"id":"https://openalex.org/C122507166","wikidata":"https://www.wikidata.org/wiki/Q628906","display_name":"Crossover","level":2,"score":0.6703000068664551},{"id":"https://openalex.org/C159149176","wikidata":"https://www.wikidata.org/wiki/Q14489129","display_name":"Evolutionary algorithm","level":2,"score":0.6437000036239624},{"id":"https://openalex.org/C153083717","wikidata":"https://www.wikidata.org/wiki/Q6535263","display_name":"Leverage (statistics)","level":2,"score":0.6434999704360962},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.5778999924659729},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.574999988079071},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4474000036716461},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.44110000133514404},{"id":"https://openalex.org/C81917197","wikidata":"https://www.wikidata.org/wiki/Q628760","display_name":"Selection (genetic algorithm)","level":2,"score":0.43970000743865967},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.41510000824928284},{"id":"https://openalex.org/C2779530757","wikidata":"https://www.wikidata.org/wiki/Q1207505","display_name":"Quality (philosophy)","level":2,"score":0.37229999899864197},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.37220001220703125},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.35249999165534973},{"id":"https://openalex.org/C105902424","wikidata":"https://www.wikidata.org/wiki/Q1197129","display_name":"Evolutionary computation","level":2,"score":0.3384000062942505},{"id":"https://openalex.org/C112972136","wikidata":"https://www.wikidata.org/wiki/Q7595718","display_name":"Stability (learning theory)","level":2,"score":0.3287000060081482},{"id":"https://openalex.org/C2778029271","wikidata":"https://www.wikidata.org/wiki/Q5421931","display_name":"Extension (predicate logic)","level":2,"score":0.32359999418258667},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3222000002861023},{"id":"https://openalex.org/C501734568","wikidata":"https://www.wikidata.org/wiki/Q42918","display_name":"Mutation","level":3,"score":0.31940001249313354},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3163999915122986},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2994999885559082},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.2766999900341034}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.24963/ijcai.2025/985","is_oa":false,"landing_page_url":"https://doi.org/10.24963/ijcai.2025/985","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Thirty-Fourth International Joint Conference on Artificial Intelligence","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Quality":[0],"diversity":[1],"(QD)":[2],"algorithms,":[3,8],"an":[4,127,158],"extension":[5],"of":[6,14,39,81,92,139],"evolutionary":[7,102],"excel":[9],"at":[10],"generating":[11],"diverse":[12],"sets":[13],"high-quality":[15],"solutions":[16,77,135],"for":[17,86,110,161],"complex":[18],"problems":[19],"in":[20,94,114,119,136],"robotics,":[21],"games,":[22],"and":[23],"combinatorial":[24],"optimisation.":[25],"Despite":[26],"their":[27],"success,":[28],"the":[29,52,95,120,140,173],"underlying":[30],"mechanisms":[31],"remain":[32],"poorly":[33],"understood":[34],"due":[35],"to":[36,75,89,126,156,176,184],"a":[37,40,56,67,82,162],"lack":[38],"theoretical":[41],"foundation.":[42],"We":[43],"address":[44],"this":[45],"gap":[46],"by":[47,116,166],"analysing":[48],"QD":[49,69,186],"algorithms":[50,103],"on":[51],"all-pairs-shortest-paths":[53],"(APSP)":[54],"problem,":[55],"classical":[57],"planning":[58],"task":[59],"that":[60,101],"naturally":[61],"seeks":[62],"multiple":[63],"solutions.":[64],"Using":[65],"Map-Elites,":[66],"prominent":[68],"approach,":[70],"we":[71],"leverage":[72],"its":[73],"ability":[74],"evolve":[76],"across":[78],"distinct":[79],"regions":[80,138,155],"behavioural":[83,121,141],"space,":[84],"which":[85],"APSP":[87],"corresponds":[88],"all":[90,111],"pairs":[91,113],"nodes":[93],"graph.":[96],"Our":[97],"analysis":[98],"rigorously":[99],"demonstrates":[100],"using":[104],"Map-Elites":[105],"efficiently":[106],"compute":[107],"shortest":[108,129,169],"paths":[109,152],"node":[112],"parallel":[115],"exploiting":[117],"synergies":[118],"space.":[122,142],"By":[123],"appending":[124],"edges":[125],"existing":[128],"path,":[130],"mutation":[131],"can":[132,149],"create":[133],"optimal":[134,151,159],"other":[137],"Crossover":[143],"is":[144],"particularly":[145],"effective,":[146],"as":[147],"it":[148],"combine":[150],"from":[153],"two":[154,168],"produce":[157],"path":[160],"third":[163],"region":[164],"simply":[165],"concatenating":[167],"paths.":[170],"Finally,":[171],"refining":[172],"parent":[174],"selection":[175],"facilitate":[177],"successful":[178],"crossovers":[179],"exhibits":[180],"significant":[181],"speed-ups":[182],"compared":[183],"standard":[185],"approaches.":[187]},"counts_by_year":[{"year":2026,"cited_by_count":1}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}