{"id":"https://openalex.org/W2184713855","doi":null,"title":"Speeding Up Distributed Constraint Optimization Search Algorithms","display_name":"Speeding Up Distributed Constraint Optimization Search Algorithms","alternate_titles":[],"publication_year":2014,"publication_date":"2014-01-09","ids":{"openalex":"https://openalex.org/W2184713855","mag":"2184713855"},"language":"en","primary_location":{"id":"mag:2184713855","doi":null,"is_oa":false,"landing_page_url":"https://www.cs.nmsu.edu/~wyeoh/docs/publications/phdthesis.pdf","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null},"parent_works":[],"lineage":["https://openalex.org/W2184713855"],"child_works_count":0,"type":"book","is_traditional":true,"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/A5026549557","display_name":"Sven Koenig","orcid":"https://orcid.org/0000-0002-5458-094X","observed_orcids":["https://orcid.org/0000-0002-5458-094X"]},"institutions":[{"id":"https://openalex.org/I1174212","display_name":"University of Southern California","ror":"https://ror.org/03taz7m60","country_code":"US","type":"education","lineage":["https://openalex.org/I1174212"]}],"countries":["US"],"is_corresponding":false,"contributor_roles":[],"raw_author_name":"Sven Koenig","raw_affiliation_strings":["University  of Southern California"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University  of Southern California","institution_ids":["https://openalex.org/I1174212"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5030505534","display_name":"William Yeoh","orcid":"https://orcid.org/0000-0002-2617-870X","observed_orcids":["https://orcid.org/0000-0002-2617-870X"]},"institutions":[{"id":"https://openalex.org/I1174212","display_name":"University of Southern California","ror":"https://ror.org/03taz7m60","country_code":"US","type":"education","lineage":["https://openalex.org/I1174212"]}],"countries":["US"],"is_corresponding":false,"contributor_roles":[],"raw_author_name":"William Yeoh","raw_affiliation_strings":["University  of Southern California"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University  of Southern California","institution_ids":["https://openalex.org/I1174212"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I1174212"],"apc_list":null,"apc_paid":null,"fwci":0.2441,"has_fulltext":false,"cited_by_count":5,"reviewed_by_count":0,"citation_normalized_percentile":{"value":0.5596222,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":86,"max":93},"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_pulled":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":1.0,"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":1.0,"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/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.0,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.0,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/distributed-constraint-optimization","display_name":"distributed constraint optimization","score":0.9980000257492065},{"id":"https://openalex.org/keywords/adopt","display_name":"ADOPT","score":0.9169999957084656},{"id":"https://openalex.org/keywords/branch-and-bound","display_name":"branch and bound","score":0.7990000247955322},{"id":"https://openalex.org/keywords/best-first-search","display_name":"best-first search","score":0.6639999747276306},{"id":"https://openalex.org/keywords/heuristic-approximation","display_name":"heuristic approximation","score":0.5680000185966492},{"id":"https://openalex.org/keywords/error-bounds","display_name":"error bounds","score":0.7329999804496765},{"id":"https://openalex.org/keywords/memory-reuse","display_name":"memory reuse","score":0.4480000138282776},{"id":"https://openalex.org/keywords/runtime-speedup","display_name":"runtime speedup","score":0.597000002861023},{"id":"https://openalex.org/keywords/multiagent-coordination","display_name":"multi-agent coordination","score":0.765999972820282}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6676902174949646},{"id":"https://openalex.org/C46011968","wikidata":"https://www.wikidata.org/wiki/Q830527","display_name":"Best-first search","level":4,"score":0.6456087827682495},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.6061369776725769},{"id":"https://openalex.org/C19889080","wikidata":"https://www.wikidata.org/wiki/Q2835852","display_name":"Beam search","level":3,"score":0.5921164751052856},{"id":"https://openalex.org/C139979381","wikidata":"https://www.wikidata.org/wiki/Q17056021","display_name":"Incremental heuristic search","level":4,"score":0.5679653882980347},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5152035355567932},{"id":"https://openalex.org/C90189156","wikidata":"https://www.wikidata.org/wiki/Q5615481","display_name":"Guided Local Search","level":3,"score":0.5149913430213928},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.44317489862442017},{"id":"https://openalex.org/C68339613","wikidata":"https://www.wikidata.org/wiki/Q1549489","display_name":"Speedup","level":2,"score":0.4404497742652893},{"id":"https://openalex.org/C194036150","wikidata":"https://www.wikidata.org/wiki/Q4876196","display_name":"Beam stack search","level":5,"score":0.43779534101486206},{"id":"https://openalex.org/C151319957","wikidata":"https://www.wikidata.org/wiki/Q752739","display_name":"Asynchronous communication","level":2,"score":0.4353017807006836},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.4220200181007385},{"id":"https://openalex.org/C14362708","wikidata":"https://www.wikidata.org/wiki/Q1675274","display_name":"Iterative deepening depth-first search","level":5,"score":0.4203583598136902},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4070654511451721},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.38545846939086914},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.23534739017486572},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.13027536869049072},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","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/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"mag:2184713855","doi":null,"is_oa":false,"landing_page_url":"https://www.cs.nmsu.edu/~wyeoh/docs/publications/phdthesis.pdf","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":110,"referenced_works":["https://openalex.org/W12833454","https://openalex.org/W28212458","https://openalex.org/W33481259","https://openalex.org/W38076005","https://openalex.org/W54850713","https://openalex.org/W59411647","https://openalex.org/W93834893","https://openalex.org/W129096101","https://openalex.org/W138242486","https://openalex.org/W164823558","https://openalex.org/W169590971","https://openalex.org/W173558184","https://openalex.org/W176996179","https://openalex.org/W183780713","https://openalex.org/W187834424","https://openalex.org/W199293425","https://openalex.org/W256994565","https://openalex.org/W1488413758","https://openalex.org/W1492104315","https://openalex.org/W1502018424","https://openalex.org/W1502426415","https://openalex.org/W1514722858","https://openalex.org/W1516784847","https://openalex.org/W1526405129","https://openalex.org/W1533824548","https://openalex.org/W1534329790","https://openalex.org/W1535762494","https://openalex.org/W1536258751","https://openalex.org/W1543513027","https://openalex.org/W1548662753","https://openalex.org/W1548955532","https://openalex.org/W1565804266","https://openalex.org/W1570298768","https://openalex.org/W1580115744","https://openalex.org/W1599344755","https://openalex.org/W1622225657","https://openalex.org/W1638204652","https://openalex.org/W1646038686","https://openalex.org/W1723186713","https://openalex.org/W1757671551","https://openalex.org/W1760241490","https://openalex.org/W1796344988","https://openalex.org/W1868145863","https://openalex.org/W1882854987","https://openalex.org/W1968808691","https://openalex.org/W1969483458","https://openalex.org/W1972831857","https://openalex.org/W1982809790","https://openalex.org/W1990823124","https://openalex.org/W1992873389","https://openalex.org/W1993224387","https://openalex.org/W2008759451","https://openalex.org/W2009833344","https://openalex.org/W2013469527","https://openalex.org/W2042872950","https://openalex.org/W2068886975","https://openalex.org/W2084165554","https://openalex.org/W2084577435","https://openalex.org/W2085550081","https://openalex.org/W2089137033","https://openalex.org/W2096258842","https://openalex.org/W2098248004","https://openalex.org/W2104570951","https://openalex.org/W2110116921","https://openalex.org/W2110968736","https://openalex.org/W2111035195","https://openalex.org/W2112119888","https://openalex.org/W2114678164","https://openalex.org/W2114722577","https://openalex.org/W2117344727","https://openalex.org/W2117361904","https://openalex.org/W2117907883","https://openalex.org/W2120494523","https://openalex.org/W2120850108","https://openalex.org/W2122003883","https://openalex.org/W2134039933","https://openalex.org/W2134046083","https://openalex.org/W2134634502","https://openalex.org/W2138881688","https://openalex.org/W2140994944","https://openalex.org/W2141794296","https://openalex.org/W2141837602","https://openalex.org/W2142505627","https://openalex.org/W2143159235","https://openalex.org/W2144836051","https://openalex.org/W2145089737","https://openalex.org/W2147872071","https://openalex.org/W2149489849","https://openalex.org/W2151114562","https://openalex.org/W2152430560","https://openalex.org/W2153850105","https://openalex.org/W2155675331","https://openalex.org/W2155778482","https://openalex.org/W2157213051","https://openalex.org/W2157740753","https://openalex.org/W2160458341","https://openalex.org/W2160938515","https://openalex.org/W2161076907","https://openalex.org/W2165040934","https://openalex.org/W2166146758","https://openalex.org/W2169717584","https://openalex.org/W2171505094","https://openalex.org/W2176812333","https://openalex.org/W2294319407","https://openalex.org/W2296248084","https://openalex.org/W2337098149","https://openalex.org/W2398568171","https://openalex.org/W3121729118","https://openalex.org/W7124166777","https://openalex.org/W7124169210"],"related_works":["https://openalex.org/W7100273028","https://openalex.org/W3121729118","https://openalex.org/W7095997028","https://openalex.org/W7100299819","https://openalex.org/W7100678201","https://openalex.org/W2579956230","https://openalex.org/W129096101","https://openalex.org/W95230853","https://openalex.org/W70326621","https://openalex.org/W7098372389"],"abstract_inverted_index":{"Distributed":[0,67],"constraint":[1,27],"optimization":[2],"(DCOP)":[3],"is":[4,40,71,89],"a":[5,50,55],"model":[6,39],"where":[7],"several":[8],"agents":[9],"coordinate":[10],"with":[11,266,341,450],"each":[12],"other":[13],"to":[14,20,200,248,263,328,430,439,474],"take":[15],"on":[16,32],"values":[17,34,247,280],"so":[18],"as":[19,103,286,375,377,404,406,483],"minimize":[21],"the":[22,25,33,36,74,191,292,315,350,360,367,378,396,407,441],"sum":[23],"of":[24,35,57,73,106,187,194,208,344,398,453,470],"resulting":[26,204,445],"costs,":[28],"which":[29,323],"are":[30,162,289],"dependent":[31],"agents.":[37],"This":[38,256],"becoming":[41],"popular":[42],"for":[43,253],"formulating":[44],"and":[45,147,261,300,318,326,338,352,366,419,428],"solving":[46,85,91,154,435],"agent-coordination":[47],"problems.":[48,157],"As":[49],"result,":[51],"researchers":[52],"have":[53,282,334,479],"developed":[54],"class":[56],"DCOP":[58,76,86,118,156,159,217,229,273,399,437,462,472],"algorithms":[59,78,99,120,161,168,219,231,275,401,464],"that":[60,79,113,169,189,216,220,232,243,272,276,284,306,349,390,425,448,461,465,481],"use":[61,277],"search":[62,77,98,108,119,127,135,160,167,192,199,218,224,230,274,400,463,477],"techniques.":[63],"For":[64],"example,":[65],"Asynchronous":[66],"Constraint":[68],"Optimization":[69],"(ADOPT)":[70],"one":[72,114,206],"pioneering":[75],"has":[80],"been":[81],"widely":[82],"extended.":[83],"Since":[84],"problems":[87,93,438,473],"optimally":[88],"NP-hard,":[90],"large":[92],"efficiently":[94],"becomes":[95],"an":[96,133,185,240,416,420],"issue.\r\nDCOP":[97],"can":[100,115,225,281,394,478],"be":[101,173,226],"viewed":[102],"distributed":[104],"versions":[105],"centralized":[107,126,166],"algorithms.":[109],"Therefore,":[110,384],"I":[111,180,238,313,414],"hypothesize":[112],"speed":[116,355],"up":[117,356,371],"by":[121,131,138,143,149],"applying":[122],"insights":[123,171],"gained":[124,152,433],"from":[125,153,165,196,434,468],"algorithms,":[128],"specifically":[129],"(1)":[130,179],"using":[132,144],"appropriate":[134],"strategy,":[136],"(2)":[137,237],"sacrificing":[139],"solution":[140,251],"optimality,":[141],"(3)":[142,312],"more":[145,335,358,486],"memory,":[146],"(4)":[148,413],"reusing":[150],"information":[151,331,432,454,467],"similar":[155,436,471],"However,":[158],"sufficiently":[163],"different":[164],"these":[170,385],"cannot":[172],"trivially":[174],"applied.\r\nTo":[175],"validate":[176,213,387,458],"my":[177,214,270,388,459],"hypotheses:":[178],"introduce":[181,239,314,415],"Branch-and-Bound":[182],"ADOPT":[183,188,195,260,325,357,427],"(BnB-ADOPT),":[184],"extension":[186],"changes":[190],"strategy":[193],"memory-bounded":[197,234],"best-first":[198,235],"depth-first":[201,222],"branch-and-bound":[202,223],"search,":[203],"in":[205,446],"order":[207],"magnitude":[209],"speedup.":[210],"These":[211,456],"results":[212,347,386,457],"hypothesis":[215,271,389,460],"employ":[221,233],"faster":[227,265,340],"than":[228,359],"search.":[236],"approximation":[241,257,294,304],"mechanism":[242,258,295],"uses":[244],"weighted":[245,278],"heuristic":[246,279],"trade":[249],"off":[250],"costs":[252],"smaller":[254],"runtimes.":[255],"allows":[259],"BnB-ADOPT":[262,327,372,429],"terminate":[264,339],"larger":[267,287,342,451],"weights,":[268],"validating":[269],"runtimes":[283,447],"decrease":[285,449,482],"weights":[288],"used.":[290],"Additionally,":[291],"new":[293],"provides":[296],"relative":[297],"error":[298,310],"bounds":[299],"thus":[301],"complements":[302],"existing":[303],"mechanisms":[305],"only":[307],"provide":[308],"absolute":[309],"bounds.":[311],"MaxPriority,":[316],"MaxEffort":[317,351],"MaxUtility":[319,353],"DCOP-specific":[320,330,391],"caching":[321,364,382,392,411],"schemes,":[322,365],"allow":[324,426],"cache":[329],"when":[332],"they":[333,484],"memory":[336],"available":[337],"amounts":[343,452],"memory.":[345],"Experimental":[346],"show":[348],"schemes":[354,393],"currently":[361,379,408],"used":[362,380,409],"generic":[363,381,410],"MaxPriority":[368],"scheme":[369],"speeds":[370],"at":[373,402],"least":[374,403],"much":[376,405],"schemes.":[383,412],"reduce":[395],"runtime":[397],"incremental":[417,421],"procedure":[418],"pseudo-tree":[422],"reconstruction":[423],"algorithm":[424],"reuse":[431,466,485],"solve":[440],"current":[442],"problem":[443],"faster,":[444],"reuse.":[455],"searches":[469],"guide":[475],"their":[476],"run-times":[480],"information.":[487]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W2184713855","counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2014,"cited_by_count":1}],"updated_date":"2026-11-17T12:49:18.490984","created_date":"2016-06-24T00:00:00"}
