{"id":"https://openalex.org/W93645818","doi":"https://doi.org/10.5591/978-1-57735-516-8/ijcai11-059","title":"Push and swap: fast cooperative path-finding with completeness guarantees","display_name":"Push and swap: fast cooperative path-finding with completeness guarantees","publication_year":2011,"publication_date":"2011-07-16","ids":{"openalex":"https://openalex.org/W93645818","doi":"https://doi.org/10.5591/978-1-57735-516-8/ijcai11-059","mag":"93645818"},"language":"en","primary_location":{"id":"mag:93645818","is_oa":false,"landing_page_url":"http://aass.oru.se/~fpa/teaching/Luna-Bekris-2011.pdf","pdf_url":null,"source":{"id":"https://openalex.org/S4306419999","display_name":"International Joint Conference on Artificial Intelligence","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":"conference"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"International Joint Conference on Artificial Intelligence","raw_type":null},"type":"conference-paper","indexed_in":[],"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/A5001357017","display_name":"Ryan Luna","orcid":"https://orcid.org/0000-0002-2930-3254"},"institutions":[{"id":"https://openalex.org/I134113660","display_name":"University of Nevada, Reno","ror":"https://ror.org/01keh0577","country_code":"US","type":"education","lineage":["https://openalex.org/I134113660"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Ryan Luna","raw_affiliation_strings":["UNIVERSITY OF NEVADA\u2010RENO"],"raw_orcid":"https://orcid.org/0000-0002-2930-3254","affiliations":[{"raw_affiliation_string":"UNIVERSITY OF NEVADA\u2010RENO","institution_ids":["https://openalex.org/I134113660"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5010667333","display_name":"Kostas E. Bekris","orcid":"https://orcid.org/0000-0002-0675-3324"},"institutions":[{"id":"https://openalex.org/I134113660","display_name":"University of Nevada, Reno","ror":"https://ror.org/01keh0577","country_code":"US","type":"education","lineage":["https://openalex.org/I134113660"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Kostas E. Bekris","raw_affiliation_strings":["UNIVERSITY OF NEVADA\u2010RENO"],"raw_orcid":"https://orcid.org/0000-0002-0675-3324","affiliations":[{"raw_affiliation_string":"UNIVERSITY OF NEVADA\u2010RENO","institution_ids":["https://openalex.org/I134113660"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I134113660"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":180,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"294","last_page":"300"},"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.992900013923645,"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/T10743","display_name":"Software Testing and Debugging Techniques","score":0.9860000014305115,"subfield":{"id":"https://openalex.org/subfields/1712","display_name":"Software"},"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/swap","display_name":"Swap (finance)","score":0.785359263420105},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.721781313419342},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5819711685180664},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.531958818435669},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4832766354084015},{"id":"https://openalex.org/keywords/completeness","display_name":"Completeness (order theory)","score":0.44968053698539734},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.39021551609039307},{"id":"https://openalex.org/keywords/topology","display_name":"Topology (electrical circuits)","score":0.33845198154449463},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2081069052219391},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.07974141836166382},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.07581868767738342}],"concepts":[{"id":"https://openalex.org/C99821215","wikidata":"https://www.wikidata.org/wiki/Q1136583","display_name":"Swap (finance)","level":2,"score":0.785359263420105},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.721781313419342},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5819711685180664},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.531958818435669},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4832766354084015},{"id":"https://openalex.org/C17231256","wikidata":"https://www.wikidata.org/wiki/Q5156540","display_name":"Completeness (order theory)","level":2,"score":0.44968053698539734},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.39021551609039307},{"id":"https://openalex.org/C184720557","wikidata":"https://www.wikidata.org/wiki/Q7825049","display_name":"Topology (electrical circuits)","level":2,"score":0.33845198154449463},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2081069052219391},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.07974141836166382},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.07581868767738342},{"id":"https://openalex.org/C10138342","wikidata":"https://www.wikidata.org/wiki/Q43015","display_name":"Finance","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"mag:93645818","is_oa":false,"landing_page_url":"http://aass.oru.se/~fpa/teaching/Luna-Bekris-2011.pdf","pdf_url":null,"source":{"id":"https://openalex.org/S4306419999","display_name":"International Joint Conference on Artificial Intelligence","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":"conference"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":"International Joint Conference on Artificial Intelligence","raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":10,"referenced_works":["https://openalex.org/W92902385","https://openalex.org/W119150805","https://openalex.org/W125001008","https://openalex.org/W1777366632","https://openalex.org/W1900710004","https://openalex.org/W2070224057","https://openalex.org/W2137651302","https://openalex.org/W2158883244","https://openalex.org/W2166462345","https://openalex.org/W2914296650"],"related_works":["https://openalex.org/W2914296650","https://openalex.org/W2100695938","https://openalex.org/W1551562380","https://openalex.org/W1986164452","https://openalex.org/W2135939055","https://openalex.org/W1989407213","https://openalex.org/W2167451681","https://openalex.org/W2399153727","https://openalex.org/W2191404279","https://openalex.org/W1973396716","https://openalex.org/W2964211993","https://openalex.org/W146776796","https://openalex.org/W2149951504","https://openalex.org/W2124015815","https://openalex.org/W1510564526","https://openalex.org/W2136644454","https://openalex.org/W2155992093","https://openalex.org/W2123030512","https://openalex.org/W1659382545","https://openalex.org/W126122642"],"abstract_inverted_index":{"Cooperative":[0],"path-finding":[1],"can":[2,28,48,87],"be":[3,88],"abstracted":[4],"as":[5],"computing":[6],"non-colliding":[7],"paths":[8],"for":[9,32,127],"multiple":[10],"agents":[11,59,75,97],"between":[12],"their":[13,78],"start":[14],"and":[15,90,131],"goal":[16],"locations":[17],"on":[18,112],"a":[19,24,33,61,71,91],"graph.":[20],"This":[21],"paper":[22],"proposes":[23],"fast":[25],"algorithm":[26,67,130],"that":[27,84,94,133,139],"provide":[29],"completeness":[30],"guarantees":[31],"general":[34],"class":[35],"of":[36,63,105,115,143,147],"problems":[37,138],"without":[38,101],"any":[39,50],"assumptions":[40],"about":[41],"the":[42,46,82,103,128,134],"graph's":[43],"topology.":[44],"Specifically,":[45],"approach":[47],"address":[49],"solvable":[51],"instance":[52],"where":[53,74],"there":[54],"are":[55,110,125],"at":[56],"most":[57],"n-2":[58],"in":[60],"graph":[62],"size":[64],"n.":[65],"The":[66,123],"employs":[68],"two":[69,96],"primitives:":[70],"push":[72],"operation":[73,93],"move":[76],"towards":[77],"goals":[79],"up":[80],"to":[81,98,137],"point":[83],"no":[85],"progress":[86],"made,":[89],"swap":[99],"allows":[95],"positions":[100],"altering":[102],"configuration":[104],"other":[106],"agents.":[107,148],"Simulated":[108],"experiments":[109],"provided":[111],"hard":[113],"instances":[114],"cooperative":[116],"path-finding,":[117],"including":[118],"comparisons":[119],"against":[120],"alternative":[121],"methods.":[122],"results":[124],"favorable":[126],"proposed":[129],"show":[132],"technique":[135],"scales":[136],"require":[140],"high":[141],"levels":[142],"coordination,":[144],"involving":[145],"hundreds":[146]},"counts_by_year":[{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":7},{"year":2023,"cited_by_count":10},{"year":2022,"cited_by_count":13},{"year":2021,"cited_by_count":31},{"year":2020,"cited_by_count":10},{"year":2019,"cited_by_count":22},{"year":2018,"cited_by_count":15},{"year":2017,"cited_by_count":15},{"year":2016,"cited_by_count":12},{"year":2015,"cited_by_count":6},{"year":2014,"cited_by_count":16},{"year":2013,"cited_by_count":10},{"year":2012,"cited_by_count":10}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}