{"id":"https://openalex.org/W162201679","doi":null,"title":"Divide and conquer in multi-agent planning","display_name":"Divide and conquer in multi-agent planning","publication_year":1994,"publication_date":"1994-08-01","ids":{"openalex":"https://openalex.org/W162201679","mag":"162201679"},"language":"en","primary_location":{"id":"mag:162201679","doi":null,"is_oa":false,"landing_page_url":"http://dblp.uni-trier.de/db/conf/aaai/aaai94-1.html#EphratiR94","pdf_url":null,"source":{"id":"https://openalex.org/S4306420577","display_name":"National Conference on Artificial Intelligence","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":"National Conference on Artificial Intelligence","raw_type":null},"parent_works":[],"lineage":["https://openalex.org/W162201679"],"child_works_count":0,"type":"conference-paper","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/A5079314657","display_name":"Eithan Ephrati","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I170201317","display_name":"University of Pittsburgh","ror":"https://ror.org/01an3r305","country_code":"US","type":"education","lineage":["https://openalex.org/I170201317"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Eithan Ephrati","raw_affiliation_strings":["Computer Science Dept, University of Pittsburgh, Pittsburgh, PA#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Computer Science Dept, University of Pittsburgh, Pittsburgh, PA#TAB#","institution_ids":["https://openalex.org/I170201317"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5091010876","display_name":"Jeffrey S. Rosenschein","orcid":"https://orcid.org/0000-0002-4042-9739","observed_orcids":["https://orcid.org/0000-0002-4042-9739"]},"institutions":[{"id":"https://openalex.org/I197251160","display_name":"Hebrew University of Jerusalem","ror":"https://ror.org/03qxff017","country_code":"IL","type":"education","lineage":["https://openalex.org/I197251160"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Jeffrey S. Rosenschein","raw_affiliation_strings":[",Institute of Computer Science, The Hebrew University, Jerusalem, Israel#TAB#"],"raw_orcid":"https://orcid.org/0000-0002-4042-9739","affiliations":[{"raw_affiliation_string":",Institute of Computer Science, The Hebrew University, Jerusalem, Israel#TAB#","institution_ids":["https://openalex.org/I197251160"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":4.1549,"has_fulltext":false,"cited_by_count":87,"citation_normalized_percentile":{"value":0.9389413,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":88,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"375","last_page":"380"},"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.8109999895095825,"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.8109999895095825,"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.1754000037908554,"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/T10586","display_name":"Robotic Path Planning Algorithms","score":0.008899999782443047,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems 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/multi-agent-planning","display_name":"multi-agent planning","score":0.9980000257492065},{"id":"https://openalex.org/keywords/divide-and-conquer","display_name":"divide-and-conquer","score":0.843999981880188},{"id":"https://openalex.org/keywords/subgoal-decomposition","display_name":"subgoal decomposition","score":0.6700000166893005},{"id":"https://openalex.org/keywords/heuristic-planning","display_name":"heuristic planning","score":0.800000011920929},{"id":"https://openalex.org/keywords/planning-time-reduction","display_name":"planning time reduction","score":0.6899999976158142},{"id":"https://openalex.org/keywords/branching-factor","display_name":"branching factor","score":0.5730000138282776},{"id":"https://openalex.org/keywords/planning-complexity","display_name":"planning complexity","score":0.7139999866485596}],"concepts":[{"id":"https://openalex.org/C2776505523","wikidata":"https://www.wikidata.org/wiki/Q4785468","display_name":"Plan (archaeology)","level":2,"score":0.8395307064056396},{"id":"https://openalex.org/C2776999362","wikidata":"https://www.wikidata.org/wiki/Q2349274","display_name":"Planner","level":2,"score":0.8297165036201477},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7061676383018494},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.6908734440803528},{"id":"https://openalex.org/C71559656","wikidata":"https://www.wikidata.org/wiki/Q671298","display_name":"Divide and conquer algorithms","level":2,"score":0.6244834065437317},{"id":"https://openalex.org/C2780801425","wikidata":"https://www.wikidata.org/wiki/Q5164392","display_name":"Construct (python library)","level":2,"score":0.545500636100769},{"id":"https://openalex.org/C42475967","wikidata":"https://www.wikidata.org/wiki/Q194292","display_name":"Operations research","level":1,"score":0.33712339401245117},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.27407556772232056},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.12907463312149048},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.11452218890190125},{"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/C95457728","wikidata":"https://www.wikidata.org/wiki/Q309","display_name":"History","level":0,"score":0.0},{"id":"https://openalex.org/C166957645","wikidata":"https://www.wikidata.org/wiki/Q23498","display_name":"Archaeology","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"mag:162201679","doi":null,"is_oa":false,"landing_page_url":"http://dblp.uni-trier.de/db/conf/aaai/aaai94-1.html#EphratiR94","pdf_url":null,"source":{"id":"https://openalex.org/S4306420577","display_name":"National Conference on Artificial Intelligence","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":"National Conference on Artificial Intelligence","raw_type":null},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.7.6797","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.7.6797","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ftp://ftp.cs.huji.ac.il/users/jeff/aaai94eithan.ps.gz","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":11,"referenced_works":["https://openalex.org/W4789806","https://openalex.org/W24783311","https://openalex.org/W25642012","https://openalex.org/W81666571","https://openalex.org/W138166063","https://openalex.org/W1491690797","https://openalex.org/W1577254100","https://openalex.org/W2061753121","https://openalex.org/W2068849896","https://openalex.org/W2084335986","https://openalex.org/W2166996723"],"related_works":["https://openalex.org/W2184591264","https://openalex.org/W1889721679","https://openalex.org/W2605181103","https://openalex.org/W7097450923","https://openalex.org/W101155114","https://openalex.org/W3039963759","https://openalex.org/W2184693122","https://openalex.org/W184622412","https://openalex.org/W59850112","https://openalex.org/W7101022504"],"abstract_inverted_index":{"In":[0],"this":[1],"paper,":[2],"we":[3],"suggest":[4],"an":[5],"approach":[6,43],"to":[7,23],"multiagent":[8],"planning":[9,47,95,99,113,131],"that":[10,53,59,139],"contains":[11],"heuristic":[12],"elements.":[13],"Our":[14],"method":[15],"makes":[16],"use":[17],"of":[18,82,111,129,136,158],"subgoals,":[19],"and":[20,49,96,152],"derived":[21,63],"sub-plans,":[22,32],"construct":[24],"a":[25,38,51,65,80,85,101,112,144,149],"global":[26,39,57],"plan.":[27,40],"Agents":[28],"solve":[29],"their":[30],"individual":[31],"which":[33],"are":[34],"then":[35],"merged":[36],"into":[37],"The":[41,77,88,109],"suggested":[42],"may":[44],"reduce":[45],"overall":[46],"time":[48,119],"derives":[50],"plan":[52,58],"approximates":[54],"the":[55,118,126,130,156,159],"optimal":[56],"would":[60],"have":[61],"been":[62],"by":[64,117,147],"central":[66],"planner,":[67],"given":[68,145],"those":[69],"original":[70],"subgoals.":[71],"We":[72],"consider":[73],"two":[74],"different":[75],"scenarios.":[76],"first":[78],"involves":[79],"group":[81],"agents":[83,92],"with":[84],"common":[86],"goal.":[87,105],"second":[89],"considers":[90],"how":[91],"can":[93,140],"interleave":[94],"execution":[97],"when":[98],"towards":[100],"common,":[102],"though":[103],"dynamic,":[104],"Decomposition":[106],"Reducing":[107],"Complexity":[108],"complexity":[110],"process":[114],"is":[115],"measured":[116],"(and":[120],"space)":[121],"consumed.":[122],"Let":[123],"b":[124],"be":[125,141],"branching":[127],"factor":[128],"problem":[132],"(the":[133],"average":[134],"number":[135],"new":[137],"states":[138],"generated":[142],"from":[143],"state":[146],"applying":[148],"single":[150],"operator),":[151],"let":[153],"d":[154],"denote":[155],"depth":[157],"proble...":[160]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":2},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":2}],"updated_date":"2026-11-15T12:55:33.944570","created_date":"2016-06-24T00:00:00"}