{"id":"https://openalex.org/W3088223632","doi":"https://doi.org/10.1109/ssci47803.2020.9308584","title":"Combining Deep Reinforcement Learning with Search Heuristics for Solving Multi-Agent Path Finding in Segment-based Layouts","display_name":"Combining Deep Reinforcement Learning with Search Heuristics for Solving Multi-Agent Path Finding in Segment-based Layouts","publication_year":2020,"publication_date":"2020-12-01","ids":{"openalex":"https://openalex.org/W3088223632","doi":"https://doi.org/10.1109/ssci47803.2020.9308584","mag":"3088223632"},"language":"en","primary_location":{"id":"doi:10.1109/ssci47803.2020.9308584","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ssci47803.2020.9308584","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2020 IEEE Symposium Series on Computational Intelligence (SSCI)","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://pure.tue.nl/ws/files/162254757/IEEESCCI2020_MAPF_Reijnen.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5041725252","display_name":"Robbert Reijnen","orcid":"https://orcid.org/0000-0002-1629-6040"},"institutions":[{"id":"https://openalex.org/I4210089303","display_name":"Arq Psychotrauma Expert Group","ror":"https://ror.org/0081aw162","country_code":"NL","type":"healthcare","lineage":["https://openalex.org/I4210089303"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Robbert Reijnen","raw_affiliation_strings":["Jheronimus Academy of Data Science, \u2019s-Hertogenbosch, The Netherlands","Jheronimus Academy of Data Science, 's-Hertogenbosch, The Netherlands"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Jheronimus Academy of Data Science, \u2019s-Hertogenbosch, The Netherlands","institution_ids":["https://openalex.org/I4210089303"]},{"raw_affiliation_string":"Jheronimus Academy of Data Science, 's-Hertogenbosch, The Netherlands","institution_ids":["https://openalex.org/I4210089303"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5077147157","display_name":"Yingqian Zhang","orcid":"https://orcid.org/0000-0002-5073-0787"},"institutions":[{"id":"https://openalex.org/I83019370","display_name":"Eindhoven University of Technology","ror":"https://ror.org/02c2kyt77","country_code":"NL","type":"education","lineage":["https://openalex.org/I83019370"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Yingqian Zhang","raw_affiliation_strings":["Dept. of Industrial Engineering, Eindhoven University of Technology, Eindhoven, The Netherlands"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dept. of Industrial Engineering, Eindhoven University of Technology, Eindhoven, The Netherlands","institution_ids":["https://openalex.org/I83019370"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5073570057","display_name":"Wim Nuijten","orcid":"https://orcid.org/0000-0003-0351-2768"},"institutions":[{"id":"https://openalex.org/I83019370","display_name":"Eindhoven University of Technology","ror":"https://ror.org/02c2kyt77","country_code":"NL","type":"education","lineage":["https://openalex.org/I83019370"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Wim Nuijten","raw_affiliation_strings":["Dept. of Math. and Computer Science, Eindhoven University of Technology, Eindhoven, The Netherlands"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dept. of Math. and Computer Science, Eindhoven University of Technology, Eindhoven, The Netherlands","institution_ids":["https://openalex.org/I83019370"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5007518961","display_name":"\u00c7a\u011flar \u015eenaras","orcid":"https://orcid.org/0000-0003-4211-4367"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Caglar Senaras","raw_affiliation_strings":["Vanderlande Industries B.V., Veghel, The Netherlands"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Vanderlande Industries B.V., Veghel, The Netherlands","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5058597260","display_name":"Mariana Goldak - Altgassen","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Mariana Goldak - Altgassen","raw_affiliation_strings":["Vanderlande Industries B.V., Veghel, The Netherlands"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Vanderlande Industries B.V., Veghel, The Netherlands","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.4272,"has_fulltext":true,"cited_by_count":13,"citation_normalized_percentile":{"value":0.68770081,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"2647","last_page":"2654"},"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/T12546","display_name":"Smart Parking Systems Research","score":0.9983000159263611,"subfield":{"id":"https://openalex.org/subfields/2215","display_name":"Building and Construction"},"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/T11942","display_name":"Transportation and Mobility Innovations","score":0.9970999956130981,"subfield":{"id":"https://openalex.org/subfields/2203","display_name":"Automotive 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/heuristics","display_name":"Heuristics","score":0.7624064683914185},{"id":"https://openalex.org/keywords/reinforcement-learning","display_name":"Reinforcement learning","score":0.7413769960403442},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6916482448577881},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.6650922298431396},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.6217387318611145},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.5016376972198486},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.47149795293807983},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.4414916932582855},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.4215150773525238},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.13039511442184448},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.12930917739868164},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.0865379273891449}],"concepts":[{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.7624064683914185},{"id":"https://openalex.org/C97541855","wikidata":"https://www.wikidata.org/wiki/Q830687","display_name":"Reinforcement learning","level":2,"score":0.7413769960403442},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6916482448577881},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.6650922298431396},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.6217387318611145},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.5016376972198486},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.47149795293807983},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.4414916932582855},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.4215150773525238},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.13039511442184448},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.12930917739868164},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.0865379273891449},{"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/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1109/ssci47803.2020.9308584","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ssci47803.2020.9308584","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2020 IEEE Symposium Series on Computational Intelligence (SSCI)","raw_type":"proceedings-article"},{"id":"pmh:oai:pure.tue.nl:openaire_cris_publications/6fae48f6-6e44-4ff1-8628-91b65c089e7a","is_oa":true,"landing_page_url":"https://research.tue.nl/en/publications/6fae48f6-6e44-4ff1-8628-91b65c089e7a","pdf_url":"https://pure.tue.nl/ws/files/162254757/IEEESCCI2020_MAPF_Reijnen.pdf","source":{"id":"https://openalex.org/S4406922641","display_name":"TU/e Research Portal","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Reijnen, R, Zhang, Y, Nuijten, W P M, Senaras, C & Goldak, M 2021, Combining Deep Reinforcement Learning with Search Heuristics for Solving Multi-Agent Path Finding in Segment-based Layouts. in 2020 IEEE Symposium Series on Computational Intelligence (SSCI 2020)., 9308584, IEEE Press, pp. 2647-2654, IEEE Symposium Series on Computational Intelligence, IEEE SSCI 2020, Canberra, Australian Capital Territory, Australia, 1/12/20. https://doi.org/10.1109/SSCI47803.2020.9308584","raw_type":"info:eu-repo/semantics/conferenceObject"},{"id":"pmh:tue:oai:pure.tue.nl:publications/6fae48f6-6e44-4ff1-8628-91b65c089e7a","is_oa":true,"landing_page_url":"https://research.tue.nl/nl/publications/6fae48f6-6e44-4ff1-8628-91b65c089e7a","pdf_url":null,"source":{"id":"https://openalex.org/S4306401843","display_name":"Data Archiving and Networked Services (DANS)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1322597698","host_organization_name":"Royal Netherlands Academy of Arts and Sciences","host_organization_lineage":["https://openalex.org/I1322597698"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"2020 IEEE Symposium Series on Computational Intelligence (SSCI 2020), 2647 - 2654","raw_type":"info:eu-repo/semantics/conferencepaper"}],"best_oa_location":{"id":"pmh:oai:pure.tue.nl:openaire_cris_publications/6fae48f6-6e44-4ff1-8628-91b65c089e7a","is_oa":true,"landing_page_url":"https://research.tue.nl/en/publications/6fae48f6-6e44-4ff1-8628-91b65c089e7a","pdf_url":"https://pure.tue.nl/ws/files/162254757/IEEESCCI2020_MAPF_Reijnen.pdf","source":{"id":"https://openalex.org/S4406922641","display_name":"TU/e Research Portal","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Reijnen, R, Zhang, Y, Nuijten, W P M, Senaras, C & Goldak, M 2021, Combining Deep Reinforcement Learning with Search Heuristics for Solving Multi-Agent Path Finding in Segment-based Layouts. in 2020 IEEE Symposium Series on Computational Intelligence (SSCI 2020)., 9308584, IEEE Press, pp. 2647-2654, IEEE Symposium Series on Computational Intelligence, IEEE SSCI 2020, Canberra, Australian Capital Territory, Australia, 1/12/20. https://doi.org/10.1109/SSCI47803.2020.9308584","raw_type":"info:eu-repo/semantics/conferenceObject"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W3088223632.pdf","grobid_xml":"https://content.openalex.org/works/W3088223632.grobid-xml"},"referenced_works_count":22,"referenced_works":["https://openalex.org/W579436346","https://openalex.org/W1488757178","https://openalex.org/W1551562380","https://openalex.org/W1641379095","https://openalex.org/W1973396716","https://openalex.org/W1989407213","https://openalex.org/W2109802566","https://openalex.org/W2123030512","https://openalex.org/W2166462345","https://openalex.org/W2169528473","https://openalex.org/W2294562513","https://openalex.org/W2736601468","https://openalex.org/W2787739227","https://openalex.org/W2892258706","https://openalex.org/W2914296650","https://openalex.org/W2949992533","https://openalex.org/W2964997335","https://openalex.org/W2980480328","https://openalex.org/W3103635569","https://openalex.org/W6629161821","https://openalex.org/W6741002519","https://openalex.org/W6763563180"],"related_works":["https://openalex.org/W2280422768","https://openalex.org/W3143197806","https://openalex.org/W3177062893","https://openalex.org/W3125143773","https://openalex.org/W2007032764","https://openalex.org/W803550684","https://openalex.org/W2483226803","https://openalex.org/W4352977312","https://openalex.org/W1536056491","https://openalex.org/W2041180560"],"abstract_inverted_index":{"A":[0],"multi-agent":[1,90],"path":[2,91,156],"finding":[3,9,92],"(MAPF)":[4],"problem":[5,36,66],"is":[6,67,76,124,162],"concerned":[7],"with":[8,37,70,116,182],"paths":[10],"for":[11,42,54,120,126,154],"multiple":[12],"agents":[13],"such":[14,18],"that":[15,80,110,145],"certain":[16],"objectives,":[17],"as":[19],"minimizing":[20],"makespan,":[21],"are":[22,56,172],"reached":[23],"in":[24,47,73,137,158],"a":[25,33,117,138],"conflict-free":[26],"manner.":[27],"In":[28,101,167],"this":[29,102,168],"paper,":[30,103],"we":[31,104],"solve":[32,99],"practical":[34],"MAPF":[35,55],"automated":[38],"guided":[39],"vehicles":[40,81,171],"(AGVs)":[41],"the":[43,63,88,131,135,146,180],"conveying":[44],"of":[45],"luggage":[46],"segment-based":[48,71,139],"layouts":[49,72],"(MAPF-SL).":[50],"Most":[51],"existing":[52,89],"algorithms":[53,93],"mainly":[57],"focused":[58],"on":[59,83],"grid":[60],"environments.":[61],"However,":[62],"conflict":[64],"prevention":[65],"more":[68],"challenging":[69],"which":[74,159],"software":[75],"constrained":[77],"to":[78,98,174],"oversee":[79],"remain":[82],"predefined":[84],"travel":[85,128],"paths.":[86],"Hence,":[87],"cannot":[94],"be":[95,151],"applied":[96],"directly":[97],"MAPF-SL.":[100,122],"propose":[105],"an":[106],"algorithm,":[107],"called":[108],"WHCA*S-RL,":[109],"combines":[111],"Deep":[112],"Reinforcement":[113],"Learning":[114],"(DRL)":[115],"heuristic":[118,132],"approach":[119,133,149,181],"solving":[121],"DRL":[123],"used":[125,153],"determining":[127],"directions":[129],"while":[130],"oversees":[134],"planning":[136],"layout.":[140],"Our":[141],"experiment":[142],"results":[143],"show":[144],"proposed":[147],"WHCA*S-RL":[148],"can":[150],"successfully":[152],"making":[155],"plans":[157],"traffic":[160],"congestion":[161],"both":[163],"avoided":[164],"and":[165],"relieved.":[166],"way,":[169],"individual":[170],"found":[173],"reach":[175],"goal":[176],"destinations":[177],"faster":[178],"than":[179],"search":[183],"only.":[184]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":4},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":2}],"updated_date":"2026-08-12T21:12:35.861297","created_date":"2025-10-10T00:00:00"}