{"id":"https://openalex.org/W2124254247","doi":null,"title":"From one to many: planning for loosely coupled multi-agent systems","display_name":"From one to many: planning for loosely coupled multi-agent systems","publication_year":2008,"publication_date":"2008-09-14","ids":{"openalex":"https://openalex.org/W2124254247","mag":"2124254247"},"language":"en","primary_location":{"id":"pmh:oai:CiteSeerX.psu:10.1.1.139.6129","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.139.6129","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://iew3.technion.ac.il/~dcarmel/Papers/Sources/icaps08c.pdf","raw_type":"text"},"volume":null,"type":"article","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/A5007883545","display_name":"Ronen I. Brafman","orcid":"https://orcid.org/0000-0001-8227-5646","observed_orcids":["https://orcid.org/0000-0001-8227-5646"]},"institutions":[{"id":"https://openalex.org/I124227911","display_name":"Ben-Gurion University of the Negev","ror":"https://ror.org/05tkyf982","country_code":"IL","type":"education","lineage":["https://openalex.org/I124227911"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Ronen I. Brafman","raw_affiliation_strings":["Dept. of Computer Science, Ben-Gurion University, Israel#TAB#"],"raw_orcid":"https://orcid.org/0000-0001-8227-5646","affiliations":[{"raw_affiliation_string":"Dept. of Computer Science, Ben-Gurion University, Israel#TAB#","institution_ids":["https://openalex.org/I124227911"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5054417849","display_name":"Carmel Domshlak","orcid":"https://orcid.org/0009-0008-0943-0329","observed_orcids":["https://orcid.org/0009-0008-0943-0329"]},"institutions":[{"id":"https://openalex.org/I174306211","display_name":"Technion \u2013 Israel Institute of Technology","ror":"https://ror.org/03qryx823","country_code":"IL","type":"education","lineage":["https://openalex.org/I174306211"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Carmel Domshlak","raw_affiliation_strings":["Faculty of Industrial Engineering, Technion, Israel"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Faculty of Industrial Engineering, Technion, Israel","institution_ids":["https://openalex.org/I174306211"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":8.855,"has_fulltext":false,"cited_by_count":188,"citation_normalized_percentile":{"value":0.97619934,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":93,"max":100},"biblio":{"volume":null,"issue":null,"first_page":"28","last_page":"35"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10906","display_name":"AI-based Problem Solving and Planning","score":0.5541999936103821,"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/T10906","display_name":"AI-based Problem Solving and Planning","score":0.5541999936103821,"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/T10456","display_name":"Multi-Agent Systems and Negotiation","score":0.4018999934196472,"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.019099999219179153,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/multi-agent-planning","display_name":"multi-agent planning","score":0.9589999914169312},{"id":"https://openalex.org/keywords/loosely-coupled-systems","display_name":"loosely coupled systems","score":0.800000011920929},{"id":"https://openalex.org/keywords/computational-complexity","display_name":"computational complexity","score":0.8059999942779541}],"concepts":[{"id":"https://openalex.org/C132010649","wikidata":"https://www.wikidata.org/wiki/Q189222","display_name":"Intuition","level":2,"score":0.7518528699874878},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6379546523094177},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5650608539581299},{"id":"https://openalex.org/C149728462","wikidata":"https://www.wikidata.org/wiki/Q751319","display_name":"Minimax","level":2,"score":0.5636909008026123},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.5308682918548584},{"id":"https://openalex.org/C41550386","wikidata":"https://www.wikidata.org/wiki/Q529909","display_name":"Multi-agent system","level":2,"score":0.5148888826370239},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5040987730026245},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.47117096185684204},{"id":"https://openalex.org/C131584629","wikidata":"https://www.wikidata.org/wiki/Q4308705","display_name":"Coupling (piping)","level":2,"score":0.4250802993774414},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3231516480445862},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.26301300525665283},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.21275243163108826},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.207828551530838},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.06941381096839905},{"id":"https://openalex.org/C78519656","wikidata":"https://www.wikidata.org/wiki/Q101333","display_name":"Mechanical engineering","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"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/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"pmh:oai:CiteSeerX.psu:10.1.1.139.6129","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.139.6129","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://iew3.technion.ac.il/~dcarmel/Papers/Sources/icaps08c.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.218.3076","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.218.3076","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.bgu.ac.il/~brafman/icaps08.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.581.3155","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.581.3155","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"https://www.aaai.org/Papers/ICAPS/2008/ICAPS08-004.pdf","raw_type":"text"},{"id":"mag:2124254247","doi":null,"is_oa":false,"landing_page_url":"https://aaaipress.org/Papers/ICAPS/2008/ICAPS08-004.pdf","pdf_url":null,"source":{"id":"https://openalex.org/S4306419157","display_name":"International Conference on Automated Planning and Scheduling","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"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 Conference on Automated Planning and Scheduling","raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":16,"referenced_works":["https://openalex.org/W181086409","https://openalex.org/W1493940792","https://openalex.org/W1576780029","https://openalex.org/W1596399146","https://openalex.org/W1600548379","https://openalex.org/W2011911122","https://openalex.org/W2055486654","https://openalex.org/W2070878381","https://openalex.org/W2100988719","https://openalex.org/W2115181241","https://openalex.org/W2133429202","https://openalex.org/W2337098149","https://openalex.org/W2337392266","https://openalex.org/W2847412131","https://openalex.org/W2913589689","https://openalex.org/W3022732795"],"related_works":["https://openalex.org/W7100857762","https://openalex.org/W2184693122","https://openalex.org/W1689701263","https://openalex.org/W2492629261","https://openalex.org/W7097804738","https://openalex.org/W3148169355","https://openalex.org/W7095505458","https://openalex.org/W1555489626","https://openalex.org/W59850112","https://openalex.org/W2082315935"],"abstract_inverted_index":{"Loosely":[0],"coupled":[1],"multi-agent":[2,38,165],"systems":[3],"are":[4],"perceived":[5],"as":[6,139],"easier":[7],"to":[8,25,82,93,144,152,162],"plan":[9],"for":[10,169],"because":[11],"they":[12],"require":[13],"less":[14],"coordination":[15],"between":[16],"agent":[17,91],"sub-plans.":[18],"In":[19],"this":[20,27,143],"paper":[21],"we":[22,136],"set":[23],"out":[24],"formalize":[26],"intuition.":[28],"We":[29,141],"establish":[30],"an":[31],"upper":[32],"bound":[33],"on":[34,44,55,102,107,115],"the":[35,48,67,73,85,95,99,103,108,112,116,119,148,155,176,179],"complexity":[36],"of":[37,50,70,88,105,111,118,147,157,178],"planning":[39,166],"problems":[40],"that":[41],"depends":[42],"exponentially":[43],"two":[45],"parameters":[46,57],"quantifying":[47],"level":[49,69],"agents":[51,120,158],"\u2019":[52,121,159],"coupling,":[53,160],"and":[54,64,79,114,161],"these":[56],"only.":[58],"The":[59,75],"first":[60,149],"parameter":[61],"is":[62,77,123,128],"problem-independent,":[63],"it":[65,80],"measures":[66],"inherent":[68],"coupling":[71,171],"within":[72],"system.":[74],"second":[76],"problem-specific":[78],"has":[81],"do":[83],"with":[84,175],"minmax":[86],"number":[87,104],"action-commitments":[89],"per":[90],"required":[92],"solve":[94],"problem.":[96,180],"Most":[97],"importantly,":[98],"di-rect":[100],"dependence":[101],"agents,":[106],"overall":[109],"size":[110,177],"problem,":[113],"length":[117],"plans,":[122],"only":[124],"polynomial.":[125],"This":[126],"result":[127],"obtained":[129],"using":[130],"a":[131,164],"new":[132],"algorithmic":[133],"methodology":[134],"which":[135],"call":[137],"\u201cplanning":[138],"CSP+planning\u201d.":[140],"believe":[142],"be":[145],"one":[146],"formal":[150],"results":[151],"both":[153],"quantify":[154],"notion":[156],"demonstrate":[163],"algorithm":[167],"that,":[168],"fixed":[170],"levels,":[172],"scales":[173],"polynomially":[174]},"counts_by_year":[{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":5},{"year":2022,"cited_by_count":10},{"year":2021,"cited_by_count":14},{"year":2020,"cited_by_count":8},{"year":2019,"cited_by_count":12},{"year":2018,"cited_by_count":20},{"year":2017,"cited_by_count":14},{"year":2016,"cited_by_count":21},{"year":2015,"cited_by_count":26},{"year":2014,"cited_by_count":15},{"year":2013,"cited_by_count":10},{"year":2012,"cited_by_count":12}],"updated_date":"2026-11-04T10:54:05.112534","created_date":"2016-06-24T00:00:00"}