{"id":"https://openalex.org/W3008680678","doi":"https://doi.org/10.1109/lra.2020.3009074","title":"Collision Avoidance Based on Robust Lexicographic Task Assignment","display_name":"Collision Avoidance Based on Robust Lexicographic Task Assignment","publication_year":2020,"publication_date":"2020-07-14","ids":{"openalex":"https://openalex.org/W3008680678","doi":"https://doi.org/10.1109/lra.2020.3009074","mag":"3008680678"},"language":"en","primary_location":{"id":"doi:10.1109/lra.2020.3009074","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lra.2020.3009074","pdf_url":null,"source":{"id":"https://openalex.org/S4210169774","display_name":"IEEE Robotics and Automation Letters","issn_l":"2377-3766","issn":["2377-3766"],"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":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/2002.11247","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Tony A. Wood","orcid":"https://orcid.org/0000-0002-3928-3306"},"institutions":[{"id":"https://openalex.org/I165779595","display_name":"The University of Melbourne","ror":"https://ror.org/01ej9dk98","country_code":"AU","type":"education","lineage":["https://openalex.org/I165779595"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"Tony A. Wood","raw_affiliation_strings":["Control and Signal Processing Group, University of Melbourne, Parkville, Australia"],"raw_orcid":"https://orcid.org/0000-0002-3928-3306","affiliations":[{"raw_affiliation_string":"Control and Signal Processing Group, University of Melbourne, Parkville, Australia","institution_ids":["https://openalex.org/I165779595"]}]},{"author_position":"middle","author":{"id":null,"display_name":"Mitchell Khoo","orcid":"https://orcid.org/0000-0003-2938-5971"},"institutions":[{"id":"https://openalex.org/I165779595","display_name":"The University of Melbourne","ror":"https://ror.org/01ej9dk98","country_code":"AU","type":"education","lineage":["https://openalex.org/I165779595"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"Mitchell Khoo","raw_affiliation_strings":["Control and Signal Processing Group, University of Melbourne, Parkville, Australia"],"raw_orcid":"https://orcid.org/0000-0003-2938-5971","affiliations":[{"raw_affiliation_string":"Control and Signal Processing Group, University of Melbourne, Parkville, Australia","institution_ids":["https://openalex.org/I165779595"]}]},{"author_position":"middle","author":{"id":null,"display_name":"Elad Michael","orcid":"https://orcid.org/0000-0002-1929-8789"},"institutions":[{"id":"https://openalex.org/I165779595","display_name":"The University of Melbourne","ror":"https://ror.org/01ej9dk98","country_code":"AU","type":"education","lineage":["https://openalex.org/I165779595"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"Elad Michael","raw_affiliation_strings":["Control and Signal Processing Group, University of Melbourne, Parkville, Australia"],"raw_orcid":"https://orcid.org/0000-0002-1929-8789","affiliations":[{"raw_affiliation_string":"Control and Signal Processing Group, University of Melbourne, Parkville, Australia","institution_ids":["https://openalex.org/I165779595"]}]},{"author_position":"middle","author":{"id":null,"display_name":"Chris Manzie","orcid":"https://orcid.org/0000-0002-9969-0982"},"institutions":[{"id":"https://openalex.org/I165779595","display_name":"The University of Melbourne","ror":"https://ror.org/01ej9dk98","country_code":"AU","type":"education","lineage":["https://openalex.org/I165779595"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"Chris Manzie","raw_affiliation_strings":["Control and Signal Processing Group, University of Melbourne, Parkville, Australia"],"raw_orcid":"https://orcid.org/0000-0002-9969-0982","affiliations":[{"raw_affiliation_string":"Control and Signal Processing Group, University of Melbourne, Parkville, Australia","institution_ids":["https://openalex.org/I165779595"]}]},{"author_position":"last","author":{"id":null,"display_name":"Iman Shames","orcid":"https://orcid.org/0000-0001-7308-3546"},"institutions":[{"id":"https://openalex.org/I165779595","display_name":"The University of Melbourne","ror":"https://ror.org/01ej9dk98","country_code":"AU","type":"education","lineage":["https://openalex.org/I165779595"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"Iman Shames","raw_affiliation_strings":["Control and Signal Processing Group, University of Melbourne, Parkville, Australia"],"raw_orcid":"https://orcid.org/0000-0001-7308-3546","affiliations":[{"raw_affiliation_string":"Control and Signal Processing Group, University of Melbourne, Parkville, Australia","institution_ids":["https://openalex.org/I165779595"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":5,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.5873,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.68146616,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"5","issue":"4","first_page":"5693","last_page":"5700"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9610999822616577,"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.9610999822616577,"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/T10249","display_name":"Distributed Control Multi-Agent Systems","score":0.00430000014603138,"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"}},{"id":"https://openalex.org/T11500","display_name":"Evacuation and Crowd Dynamics","score":0.00419999985024333,"subfield":{"id":"https://openalex.org/subfields/2212","display_name":"Ocean 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/robustness","display_name":"Robustness (evolution)","score":0.7396000027656555},{"id":"https://openalex.org/keywords/bottleneck","display_name":"Bottleneck","score":0.6173999905586243},{"id":"https://openalex.org/keywords/assignment-problem","display_name":"Assignment problem","score":0.5831999778747559},{"id":"https://openalex.org/keywords/linear-bottleneck-assignment-problem","display_name":"Linear bottleneck assignment problem","score":0.5817999839782715},{"id":"https://openalex.org/keywords/generalized-assignment-problem","display_name":"Generalized assignment problem","score":0.49410000443458557},{"id":"https://openalex.org/keywords/position","display_name":"Position (finance)","score":0.4514999985694885},{"id":"https://openalex.org/keywords/task","display_name":"Task (project management)","score":0.43209999799728394},{"id":"https://openalex.org/keywords/weapon-target-assignment-problem","display_name":"Weapon target assignment problem","score":0.388700008392334}],"concepts":[{"id":"https://openalex.org/C63479239","wikidata":"https://www.wikidata.org/wiki/Q7353546","display_name":"Robustness (evolution)","level":3,"score":0.7396000027656555},{"id":"https://openalex.org/C2780513914","wikidata":"https://www.wikidata.org/wiki/Q18210350","display_name":"Bottleneck","level":2,"score":0.6173999905586243},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5881999731063843},{"id":"https://openalex.org/C85044808","wikidata":"https://www.wikidata.org/wiki/Q620614","display_name":"Assignment problem","level":2,"score":0.5831999778747559},{"id":"https://openalex.org/C165810428","wikidata":"https://www.wikidata.org/wiki/Q6553416","display_name":"Linear bottleneck assignment problem","level":5,"score":0.5817999839782715},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5437999963760376},{"id":"https://openalex.org/C194146004","wikidata":"https://www.wikidata.org/wiki/Q5532462","display_name":"Generalized assignment problem","level":3,"score":0.49410000443458557},{"id":"https://openalex.org/C198082294","wikidata":"https://www.wikidata.org/wiki/Q3399648","display_name":"Position (finance)","level":2,"score":0.4514999985694885},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.43209999799728394},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3953999876976013},{"id":"https://openalex.org/C30202268","wikidata":"https://www.wikidata.org/wiki/Q7978065","display_name":"Weapon target assignment problem","level":4,"score":0.388700008392334},{"id":"https://openalex.org/C121704057","wikidata":"https://www.wikidata.org/wiki/Q352070","display_name":"Collision","level":2,"score":0.3804999887943268},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.3747999966144562},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.3652999997138977},{"id":"https://openalex.org/C159254197","wikidata":"https://www.wikidata.org/wiki/Q1144915","display_name":"Lexicographical order","level":2,"score":0.3328999876976013},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3133000135421753},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.30250000953674316},{"id":"https://openalex.org/C25343380","wikidata":"https://www.wikidata.org/wiki/Q277521","display_name":"Relation (database)","level":2,"score":0.30000001192092896},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.2800999879837036},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.27730000019073486},{"id":"https://openalex.org/C2780864053","wikidata":"https://www.wikidata.org/wiki/Q5147495","display_name":"Collision avoidance","level":3,"score":0.27549999952316284},{"id":"https://openalex.org/C41550386","wikidata":"https://www.wikidata.org/wiki/Q529909","display_name":"Multi-agent system","level":2,"score":0.2712000012397766},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.2687000036239624},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.262800008058548}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/lra.2020.3009074","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lra.2020.3009074","pdf_url":null,"source":{"id":"https://openalex.org/S4210169774","display_name":"IEEE Robotics and Automation Letters","issn_l":"2377-3766","issn":["2377-3766"],"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"},{"id":"pmh:oai:arXiv.org:2002.11247","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2002.11247","pdf_url":"https://arxiv.org/pdf/2002.11247","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:2002.11247","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2002.11247","pdf_url":"https://arxiv.org/pdf/2002.11247","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G3274957048","display_name":null,"funder_award_id":"MyIP:7562","funder_id":"https://openalex.org/F4320335334","funder_display_name":"Defence Science and Technology Group"},{"id":"https://openalex.org/G4444346701","display_name":null,"funder_award_id":"MyIP:9156","funder_id":"https://openalex.org/F4320335334","funder_display_name":"Defence Science and Technology Group"},{"id":"https://openalex.org/G6653682751","display_name":null,"funder_award_id":"MyIP:7558","funder_id":"https://openalex.org/F4320335334","funder_display_name":"Defence Science and Technology Group"}],"funders":[{"id":"https://openalex.org/F4320335334","display_name":"Defence Science and Technology Group","ror":null}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":20,"referenced_works":["https://openalex.org/W192919555","https://openalex.org/W1964462572","https://openalex.org/W1985706454","https://openalex.org/W1989179252","https://openalex.org/W1993436019","https://openalex.org/W2023403097","https://openalex.org/W2038498300","https://openalex.org/W2048771954","https://openalex.org/W2142544818","https://openalex.org/W2157488300","https://openalex.org/W2476974423","https://openalex.org/W2573311857","https://openalex.org/W2588802774","https://openalex.org/W2782622489","https://openalex.org/W2790268363","https://openalex.org/W2963642217","https://openalex.org/W2968777657","https://openalex.org/W2986240933","https://openalex.org/W3012337428","https://openalex.org/W6632688515"],"related_works":[],"abstract_inverted_index":{"Traditional":[0],"task":[1],"assignment":[2,29,73,78,113],"approaches":[3],"for":[4,23,50,100],"multi-agent":[5],"motion":[6],"control":[7],"do":[8],"not":[9,32],"take":[10],"the":[11,35,90,93,112,119,123,147,165],"possibility":[12],"of":[13,68,70,76,85,92,111,146],"collisions":[14],"into":[15],"account.":[16],"This":[17],"can":[18],"lead":[19],"to":[20,74,89,127,142,144],"challenging":[21],"requirements":[22],"path":[24],"planning.":[25],"We":[26,134,163],"derive":[27],"an":[28,39,71,168],"method":[30,166],"that":[31,125,136,139],"only":[33,116],"minimises":[34],"largest":[36],"distance":[37],"between":[38],"agent":[40,121,138,154],"and":[41,64,115,130],"its":[42],"assigned":[43,141],"destination":[44],"but":[45],"also":[46],"provides":[47],"local":[48,105,160],"constraints":[49,106],"guaranteed":[51],"collision":[52],"avoidance.":[53],"To":[54],"this":[55],"end,":[56],"we":[57,95],"introduce":[58],"a":[59,66,82,108,131],"sequential":[60],"bottleneck":[61],"optimisation":[62],"problem":[63],"define":[65],"notion":[67],"robustness":[69,86],"optimising":[72],"changes":[75],"individual":[77,102],"costs.":[79],"Conditioned":[80],"on":[81,118],"sufficient":[83],"level":[84],"in":[87,167],"relation":[88],"size":[91],"agents,":[94],"construct":[96],"time-varying":[97],"position":[98,161],"bounds":[99],"every":[101],"agent.":[103],"These":[104],"are":[107,126],"direct":[109],"byproduct":[110],"procedure":[114],"depend":[117],"initial":[120],"positions,":[122],"destinations":[124],"be":[128],"visited,":[129],"timing":[132],"parameter.":[133],"prove":[135],"no":[137],"is":[140],"move":[143],"one":[145],"target":[148],"locations":[149],"collides":[150],"with":[151],"any":[152],"other":[153],"if":[155],"all":[156],"agents":[157],"satisfy":[158],"their":[159],"constraints.":[162],"demonstrate":[164],"illustrative":[169],"case":[170],"study.":[171]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2020-03-06T00:00:00"}