{"id":"https://openalex.org/W4389666743","doi":"https://doi.org/10.1109/iros55552.2023.10342073","title":"Learning to Schedule in Multi-Agent Pathfinding","display_name":"Learning to Schedule in Multi-Agent Pathfinding","publication_year":2023,"publication_date":"2023-10-01","ids":{"openalex":"https://openalex.org/W4389666743","doi":"https://doi.org/10.1109/iros55552.2023.10342073"},"language":"en","primary_location":{"id":"doi:10.1109/iros55552.2023.10342073","is_oa":false,"landing_page_url":"http://dx.doi.org/10.1109/iros55552.2023.10342073","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2023 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS)","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/A5019600610","display_name":"Kyuree Ahn","orcid":"https://orcid.org/0000-0002-1687-7523"},"institutions":[{"id":"https://openalex.org/I157485424","display_name":"Korea Advanced Institute of Science and Technology","ror":"https://ror.org/05apxxy63","country_code":"KR","type":"education","lineage":["https://openalex.org/I157485424"]}],"countries":["KR"],"is_corresponding":true,"raw_author_name":"Kyuree Ahn","raw_affiliation_strings":["KAIST,Department of Industrial and Systems Engineering,Korea","Department of Industrial and Systems Engineering, KAIST, Korea"],"affiliations":[{"raw_affiliation_string":"KAIST,Department of Industrial and Systems Engineering,Korea","institution_ids":["https://openalex.org/I157485424"]},{"raw_affiliation_string":"Department of Industrial and Systems Engineering, KAIST, Korea","institution_ids":["https://openalex.org/I157485424"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5104213054","display_name":"Heemang Park","orcid":null},"institutions":[{"id":"https://openalex.org/I157485424","display_name":"Korea Advanced Institute of Science and Technology","ror":"https://ror.org/05apxxy63","country_code":"KR","type":"education","lineage":["https://openalex.org/I157485424"]}],"countries":["KR"],"is_corresponding":false,"raw_author_name":"Heemang Park","raw_affiliation_strings":["KAIST,Department of Industrial and Systems Engineering,Korea","Department of Industrial and Systems Engineering, KAIST, Korea"],"affiliations":[{"raw_affiliation_string":"KAIST,Department of Industrial and Systems Engineering,Korea","institution_ids":["https://openalex.org/I157485424"]},{"raw_affiliation_string":"Department of Industrial and Systems Engineering, KAIST, Korea","institution_ids":["https://openalex.org/I157485424"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5023509025","display_name":"Jinkyoo Park","orcid":"https://orcid.org/0000-0003-2620-1479"},"institutions":[{"id":"https://openalex.org/I157485424","display_name":"Korea Advanced Institute of Science and Technology","ror":"https://ror.org/05apxxy63","country_code":"KR","type":"education","lineage":["https://openalex.org/I157485424"]}],"countries":["KR"],"is_corresponding":false,"raw_author_name":"Jinkyoo Park","raw_affiliation_strings":["KAIST,Department of Industrial and Systems Engineering,Korea","Department of Industrial and Systems Engineering, KAIST, Korea"],"affiliations":[{"raw_affiliation_string":"KAIST,Department of Industrial and Systems Engineering,Korea","institution_ids":["https://openalex.org/I157485424"]},{"raw_affiliation_string":"Department of Industrial and Systems Engineering, KAIST, Korea","institution_ids":["https://openalex.org/I157485424"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5019600610"],"corresponding_institution_ids":["https://openalex.org/I157485424"],"apc_list":null,"apc_paid":null,"fwci":0.1746,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.58698122,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"33","issue":null,"first_page":"7326","last_page":"7332"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10462","display_name":"Reinforcement Learning in Robotics","score":0.9984999895095825,"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"}},"topics":[{"id":"https://openalex.org/T10462","display_name":"Reinforcement Learning in Robotics","score":0.9984999895095825,"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"}},{"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/T10653","display_name":"Robot Manipulation and Learning","score":0.9944999814033508,"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/reinforcement-learning","display_name":"Reinforcement learning","score":0.7471675872802734},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7385239601135254},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.7195730209350586},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.6964284777641296},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.671543538570404},{"id":"https://openalex.org/keywords/pathfinding","display_name":"Pathfinding","score":0.5059921145439148},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.474215030670166},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4563586711883545},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.4491802752017975},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.41796430945396423},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4067825973033905},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.3839173913002014},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.2852039337158203},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.18655875325202942}],"concepts":[{"id":"https://openalex.org/C97541855","wikidata":"https://www.wikidata.org/wiki/Q830687","display_name":"Reinforcement learning","level":2,"score":0.7471675872802734},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7385239601135254},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.7195730209350586},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6964284777641296},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.671543538570404},{"id":"https://openalex.org/C25321074","wikidata":"https://www.wikidata.org/wiki/Q1969601","display_name":"Pathfinding","level":4,"score":0.5059921145439148},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.474215030670166},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4563586711883545},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.4491802752017975},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.41796430945396423},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4067825973033905},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.3839173913002014},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2852039337158203},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.18655875325202942},{"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/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/iros55552.2023.10342073","is_oa":false,"landing_page_url":"http://dx.doi.org/10.1109/iros55552.2023.10342073","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2023 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS)","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":28,"referenced_works":["https://openalex.org/W1488757178","https://openalex.org/W1989407213","https://openalex.org/W2155027007","https://openalex.org/W2607264901","https://openalex.org/W2903998385","https://openalex.org/W2912668883","https://openalex.org/W2914296650","https://openalex.org/W2951846985","https://openalex.org/W2952332632","https://openalex.org/W2962969317","https://openalex.org/W2990626178","https://openalex.org/W3037164939","https://openalex.org/W3097232108","https://openalex.org/W3152770304","https://openalex.org/W3175724379","https://openalex.org/W3185606095","https://openalex.org/W3190828211","https://openalex.org/W3197118877","https://openalex.org/W3206820044","https://openalex.org/W4283786866","https://openalex.org/W4283795314","https://openalex.org/W4295138992","https://openalex.org/W4312858026","https://openalex.org/W4323644168","https://openalex.org/W6683204974","https://openalex.org/W6748487558","https://openalex.org/W6771561114","https://openalex.org/W6785065334"],"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/W2387449920"],"abstract_inverted_index":{"In":[0],"this":[1],"work,":[2],"we":[3,50,76,91],"consider":[4],"the":[5,21,30,35,43,46,58,86,93,100],"problem":[6,22,107],"of":[7,32,45,60,95],"allocating":[8],"tasks":[9],"and":[10,34,75,104],"planning":[11,106],"paths":[12],"for":[13,38],"multiple":[14],"robots":[15,33],"to":[16],"operate":[17],"cooper-atively.":[18],"We":[19,64],"formulate":[20],"as":[23],"a":[24,52,67,109],"bi-level":[25],"optimization":[26],"that":[27,82],"involves":[28],"optimizing":[29],"scheduling":[31,69],"collision-free":[36],"path":[37,105],"each":[39],"robot.":[40],"To":[41],"address":[42],"complexity":[44],"environment":[47],"with":[48,57],"obstacles,":[49],"introduce":[51],"congestion-aware":[53],"state":[54],"representation":[55],"technique":[56],"aid":[59],"graph":[61],"neural":[62],"networks.":[63],"also":[65],"derive":[66],"joint":[68],"policy":[70],"using":[71],"multi-agent":[72],"reinforcement":[73],"learning,":[74],"propose":[77],"an":[78],"additional":[79],"auxiliary":[80],"loss":[81],"promotes":[83],"coordination":[84],"among":[85],"robots.":[87],"Through":[88],"empirical":[89],"evaluation,":[90],"demonstrate":[92],"effectiveness":[94],"our":[96],"approach":[97],"in":[98,108],"solving":[99],"combined":[101],"task":[102],"allocation":[103],"cooperative":[110],"multi-robot":[111],"system.":[112]},"counts_by_year":[{"year":2024,"cited_by_count":1}],"updated_date":"2025-12-21T01:58:51.020947","created_date":"2025-10-10T00:00:00"}