{"id":"https://openalex.org/W3035869396","doi":"https://doi.org/10.1109/lra.2020.3002198","title":"Learning Scheduling Policies for Multi-Robot Coordination With Graph Attention Networks","display_name":"Learning Scheduling Policies for Multi-Robot Coordination With Graph Attention Networks","publication_year":2020,"publication_date":"2020-06-15","ids":{"openalex":"https://openalex.org/W3035869396","doi":"https://doi.org/10.1109/lra.2020.3002198","mag":"3035869396"},"language":"en","primary_location":{"id":"doi:10.1109/lra.2020.3002198","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lra.2020.3002198","pdf_url":null,"source":{"id":"https://openalex.org/S4210169774","display_name":"IEEE Robotics and Automation Letters","issn_l":"2377-3766","issn":["2377-3766","2377-3774"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Robotics and Automation Letters","raw_type":"journal-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/A5006775539","display_name":"Zheyuan Wang","orcid":"https://orcid.org/0000-0001-6364-5074"},"institutions":[{"id":"https://openalex.org/I130701444","display_name":"Georgia Institute of Technology","ror":"https://ror.org/01zkghx44","country_code":"US","type":"education","lineage":["https://openalex.org/I130701444"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Zheyuan Wang","raw_affiliation_strings":["Institute for Robotics and Intelligent Machines, Georgia Institute of Technology, Atlanta, USA"],"raw_orcid":"https://orcid.org/0000-0001-6364-5074","affiliations":[{"raw_affiliation_string":"Institute for Robotics and Intelligent Machines, Georgia Institute of Technology, Atlanta, USA","institution_ids":["https://openalex.org/I130701444"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5008211323","display_name":"Matthew Gombolay","orcid":"https://orcid.org/0000-0002-5321-6038"},"institutions":[{"id":"https://openalex.org/I130701444","display_name":"Georgia Institute of Technology","ror":"https://ror.org/01zkghx44","country_code":"US","type":"education","lineage":["https://openalex.org/I130701444"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Matthew Gombolay","raw_affiliation_strings":["Institute for Robotics and Intelligent Machines, Georgia Institute of Technology, Atlanta, USA"],"raw_orcid":"https://orcid.org/0000-0002-5321-6038","affiliations":[{"raw_affiliation_string":"Institute for Robotics and Intelligent Machines, Georgia Institute of Technology, Atlanta, USA","institution_ids":["https://openalex.org/I130701444"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I130701444"],"apc_list":null,"apc_paid":null,"fwci":7.934,"has_fulltext":false,"cited_by_count":90,"citation_normalized_percentile":{"value":0.97505943,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":100},"biblio":{"volume":"5","issue":"3","first_page":"4509","last_page":"4516"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9945999979972839,"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"}},"topics":[{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9945999979972839,"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/T11159","display_name":"Manufacturing Process and Optimization","score":0.980400025844574,"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9745000004768372,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/computer-science","display_name":"Computer science","score":0.7499605417251587},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.6658242344856262},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.6011191606521606},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.5731297135353088},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.5444186925888062},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.5150268077850342},{"id":"https://openalex.org/keywords/dynamic-priority-scheduling","display_name":"Dynamic priority scheduling","score":0.4577317535877228},{"id":"https://openalex.org/keywords/robotics","display_name":"Robotics","score":0.443986713886261},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.4378117620944977},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.43032315373420715},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.4115928113460541},{"id":"https://openalex.org/keywords/machine-learning","display_name":"Machine learning","score":0.35362130403518677},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3381403088569641},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.33097782731056213},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.1538950502872467},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.10291260480880737},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.08705109357833862}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7499605417251587},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.6658242344856262},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6011191606521606},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.5731297135353088},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.5444186925888062},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.5150268077850342},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.4577317535877228},{"id":"https://openalex.org/C34413123","wikidata":"https://www.wikidata.org/wiki/Q170978","display_name":"Robotics","level":3,"score":0.443986713886261},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.4378117620944977},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.43032315373420715},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.4115928113460541},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.35362130403518677},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3381403088569641},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.33097782731056213},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.1538950502872467},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.10291260480880737},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.08705109357833862},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/lra.2020.3002198","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lra.2020.3002198","pdf_url":null,"source":{"id":"https://openalex.org/S4210169774","display_name":"IEEE Robotics and Automation Letters","issn_l":"2377-3766","issn":["2377-3766","2377-3774"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Robotics and Automation Letters","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.5899999737739563,"display_name":"Industry, innovation and infrastructure","id":"https://metadata.un.org/sdg/9"}],"awards":[{"id":"https://openalex.org/G8485760083","display_name":null,"funder_award_id":"GR10006659","funder_id":"https://openalex.org/F4320337345","funder_display_name":"Office of Naval Research"}],"funders":[{"id":"https://openalex.org/F4320337345","display_name":"Office of Naval Research","ror":"https://ror.org/00rk2pe57"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":44,"referenced_works":["https://openalex.org/W106792269","https://openalex.org/W1430617670","https://openalex.org/W1522301498","https://openalex.org/W1585546214","https://openalex.org/W1676141733","https://openalex.org/W1972391046","https://openalex.org/W1977357978","https://openalex.org/W1992985704","https://openalex.org/W2010526786","https://openalex.org/W2011372856","https://openalex.org/W2038228310","https://openalex.org/W2038345112","https://openalex.org/W2044121814","https://openalex.org/W2052856170","https://openalex.org/W2053913299","https://openalex.org/W2056446456","https://openalex.org/W2074074752","https://openalex.org/W2089110971","https://openalex.org/W2112623670","https://openalex.org/W2130182605","https://openalex.org/W2166353350","https://openalex.org/W2537545174","https://openalex.org/W2544041682","https://openalex.org/W2607264901","https://openalex.org/W2786533237","https://openalex.org/W2798405286","https://openalex.org/W2899771611","https://openalex.org/W2905224888","https://openalex.org/W2912555327","https://openalex.org/W2948268323","https://openalex.org/W2951846985","https://openalex.org/W2968986602","https://openalex.org/W3003535010","https://openalex.org/W3005822403","https://openalex.org/W4285723986","https://openalex.org/W6628285262","https://openalex.org/W6631190155","https://openalex.org/W6634919779","https://openalex.org/W6637068679","https://openalex.org/W6684347184","https://openalex.org/W6756040250","https://openalex.org/W6757374366","https://openalex.org/W6758687306","https://openalex.org/W6763777643"],"related_works":["https://openalex.org/W2280422768","https://openalex.org/W3143197806","https://openalex.org/W4252555497","https://openalex.org/W3121175838","https://openalex.org/W3016293053","https://openalex.org/W1690653314","https://openalex.org/W2401723157","https://openalex.org/W2065055572","https://openalex.org/W2784269775","https://openalex.org/W3204654320"],"abstract_inverted_index":{"Increasing":[0],"interest":[1],"in":[2,13,22,121],"integrating":[3],"advanced":[4],"robotics":[5],"within":[6],"manufacturing":[7],"has":[8,39],"spurred":[9],"a":[10,79,122],"renewed":[11],"concentration":[12],"developing":[14,78],"real-time":[15],"scheduling":[16,29,90,130,163],"solutions":[17,155],"to":[18,31,61,69,85,125,139,152,168,188,194],"coordinate":[19],"human-robot":[20],"collaboration":[21],"this":[23],"environment.":[24],"Traditionally,":[25],"the":[26,71,159],"problem":[27],"of":[28,73,89,111,131,158],"agents":[30],"complete":[32],"tasks":[33],"with":[34,43,117,134,182],"temporal":[35],"and":[36,166,186],"spatial":[37],"constraints":[38],"been":[40],"approached":[41],"either":[42],"exact":[44,195],"algorithms,":[45],"which":[46,108,171],"are":[47],"computationally":[48],"intractable":[49],"for":[50,64,100,127,156],"large-scale,":[51],"dynamic":[52],"coordination,":[53],"or":[54],"approximate":[55,176],"methods":[56,76],"that":[57,146],"require":[58],"domain":[59],"experts":[60],"craft":[62],"heuristics":[63],"each":[65],"application.":[66],"We":[67],"seek":[68],"overcome":[70],"limitations":[72],"these":[74],"conventional":[75],"by":[77],"novel":[80],"graph":[81,118],"attention":[82],"network-based":[83,148],"scheduler":[84],"automatically":[86],"learn":[87,97],"features":[88],"problems":[91,161],"towards":[92],"generating":[93],"high-quality":[94,154],"solutions.":[95],"To":[96],"effective":[98],"policies":[99],"combinatorial":[101],"optimization":[102],"problems,":[103,116],"we":[104],"combine":[105],"imitation":[106],"learning,":[107],"makes":[109],"use":[110],"expert":[112],"demonstration":[113],"on":[114],"small":[115],"neural":[119],"networks,":[120],"non-parametric":[123],"framework,":[124],"allow":[126],"fast,":[128],"near-optimal":[129],"robot":[132],"teams":[133],"various":[135],"sizes,":[136],"while":[137],"generalizing":[138],"large,":[140],"unseen":[141],"problems.":[142],"Experimental":[143],"results":[144,179],"showed":[145],"our":[147],"policy":[149],"was":[150],"able":[151],"find":[153],"~90%":[157],"testing":[160],"involving":[162],"2-5":[164],"robots":[165],"up":[167,187],"100":[169],"tasks,":[170],"significantly":[172],"outperforms":[173],"prior":[174],"state-of-the-art,":[175],"methods.":[177],"Those":[178],"were":[180],"achieved":[181],"affordable":[183],"computation":[184,191],"cost":[185],"100\u00d7":[189],"less":[190],"time":[192],"compared":[193],"solvers.":[196]},"counts_by_year":[{"year":2026,"cited_by_count":11},{"year":2025,"cited_by_count":17},{"year":2024,"cited_by_count":10},{"year":2023,"cited_by_count":20},{"year":2022,"cited_by_count":16},{"year":2021,"cited_by_count":11},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":1}],"updated_date":"2026-07-23T08:03:31.855105","created_date":"2025-10-10T00:00:00"}