{"id":"https://openalex.org/W85998123","doi":"https://doi.org/10.1609/icaps.v19i1.13355","title":"Incremental Policy Generation for Finite-Horizon DEC-POMDPs","display_name":"Incremental Policy Generation for Finite-Horizon DEC-POMDPs","publication_year":2009,"publication_date":"2009-10-16","ids":{"openalex":"https://openalex.org/W85998123","doi":"https://doi.org/10.1609/icaps.v19i1.13355","mag":"85998123"},"language":"en","primary_location":{"id":"doi:10.1609/icaps.v19i1.13355","doi":"https://doi.org/10.1609/icaps.v19i1.13355","is_oa":true,"landing_page_url":"https://doi.org/10.1609/icaps.v19i1.13355","pdf_url":"https://ojs.aaai.org/index.php/ICAPS/article/download/13355/13203","source":{"id":"https://openalex.org/S4387283601","display_name":"Proceedings of the International Conference on Automated Planning and Scheduling","issn_l":"2334-0835","issn":["2334-0835","2334-0843"],"is_oa":true,"is_in_doaj":false,"is_core":true,"listed_in":["cwts-core","jufo-1"],"host_organization":"https://openalex.org/P4310320058","host_organization_name":"Association for the Advancement of Artificial Intelligence","host_organization_lineage":["https://openalex.org/P4310320058"],"host_organization_lineage_names":["Association for the Advancement of Artificial Intelligence"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the International Conference on Automated Planning and Scheduling","raw_type":"journal-article"},"volume":null,"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://ojs.aaai.org/index.php/ICAPS/article/download/13355/13203","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5033129735","display_name":"Christopher Amato","orcid":"https://orcid.org/0000-0002-6786-7384","observed_orcids":["https://orcid.org/0000-0002-6786-7384"]},"institutions":[{"id":"https://openalex.org/I24603500","display_name":"University of Massachusetts Amherst","ror":"https://ror.org/0072zz521","country_code":"US","type":"education","lineage":["https://openalex.org/I24603500"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Christopher Amato","raw_affiliation_strings":["University of Massachusetts, Amherst","Dept of Computer Science, University of Massachusetts, Amherst, MA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Massachusetts, Amherst","institution_ids":["https://openalex.org/I24603500"]},{"raw_affiliation_string":"Dept of Computer Science, University of Massachusetts, Amherst, MA","institution_ids":["https://openalex.org/I24603500"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5032392204","display_name":"Jilles Dibangoye","orcid":"https://orcid.org/0000-0001-8826-4438","observed_orcids":["https://orcid.org/0000-0001-8826-4438"]},"institutions":[{"id":"https://openalex.org/I1294671590","display_name":"Centre National de la Recherche Scientifique","ror":"https://ror.org/02feahw73","country_code":"FR","type":"government","lineage":["https://openalex.org/I1294671590"]},{"id":"https://openalex.org/I4210139483","display_name":"GREYC","ror":"https://ror.org/043749971","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I194210350","https://openalex.org/I4210105918","https://openalex.org/I4210139483","https://openalex.org/I4210159245","https://openalex.org/I98702875"]},{"id":"https://openalex.org/I43406934","display_name":"Universit\u00e9 Laval","ror":"https://ror.org/04sjchr03","country_code":"CA","type":"education","lineage":["https://openalex.org/I43406934"]},{"id":"https://openalex.org/I98702875","display_name":"Universit\u00e9 de Caen Normandie","ror":"https://ror.org/051kpcy16","country_code":"FR","type":"education","lineage":["https://openalex.org/I4210105918","https://openalex.org/I98702875"]}],"countries":["CA","FR"],"is_corresponding":false,"raw_author_name":"Jilles Dibangoye","raw_affiliation_strings":["Laval University","Laval University, Greyc-CNRS UMR, University of Caen Basse-Normandie#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Laval University","institution_ids":["https://openalex.org/I43406934"]},{"raw_affiliation_string":"Laval University, Greyc-CNRS UMR, University of Caen Basse-Normandie#TAB#","institution_ids":["https://openalex.org/I1294671590","https://openalex.org/I4210139483","https://openalex.org/I98702875"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5027224308","display_name":"Shlomo Zilberstein B","orcid":"https://orcid.org/0000-0001-9817-7848","observed_orcids":["https://orcid.org/0000-0001-9817-7848"]},"institutions":[{"id":"https://openalex.org/I24603500","display_name":"University of Massachusetts Amherst","ror":"https://ror.org/0072zz521","country_code":"US","type":"education","lineage":["https://openalex.org/I24603500"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Shlomo Zilberstein","raw_affiliation_strings":["University of Massachusetts, Amherst","Dept of Computer Science, University of Massachusetts, Amherst, MA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Massachusetts, Amherst","institution_ids":["https://openalex.org/I24603500"]},{"raw_affiliation_string":"Dept of Computer Science, University of Massachusetts, Amherst, MA","institution_ids":["https://openalex.org/I24603500"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":5,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":3.5193,"has_fulltext":true,"cited_by_count":60,"citation_normalized_percentile":{"value":0.93580589,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"19","issue":null,"first_page":"2","last_page":"9"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10462","display_name":"Reinforcement Learning in Robotics","score":0.6298999786376953,"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/T10462","display_name":"Reinforcement Learning in Robotics","score":0.6298999786376953,"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/T10906","display_name":"AI-based Problem Solving and Planning","score":0.29910001158714294,"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.024000000208616257,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/dec-pomdp","display_name":"Dec-POMDP","score":0.8429999947547913},{"id":"https://openalex.org/keywords/multi-agent-planning","display_name":"multi-agent planning","score":0.8009999990463257},{"id":"https://openalex.org/keywords/dynamic-programming","display_name":"dynamic programming","score":0.699999988079071},{"id":"https://openalex.org/keywords/reachability-analysis","display_name":"reachability analysis","score":0.9760000109672546},{"id":"https://openalex.org/keywords/finite-horizon-planning","display_name":"finite-horizon planning","score":0.8519999980926514},{"id":"https://openalex.org/keywords/approximate-dynamic-programming","display_name":"approximate dynamic programming","score":0.7319999933242798},{"id":"https://openalex.org/keywords/scalability","display_name":"scalability","score":0.7200000286102295}],"concepts":[{"id":"https://openalex.org/C37404715","wikidata":"https://www.wikidata.org/wiki/Q380679","display_name":"Dynamic programming","level":2,"score":0.8177587389945984},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7408065795898438},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.7181041240692139},{"id":"https://openalex.org/C136643341","wikidata":"https://www.wikidata.org/wiki/Q1361526","display_name":"Reachability","level":2,"score":0.6914291977882385},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6285757422447205},{"id":"https://openalex.org/C48103436","wikidata":"https://www.wikidata.org/wiki/Q599031","display_name":"State (computer science)","level":2,"score":0.579243540763855},{"id":"https://openalex.org/C72434380","wikidata":"https://www.wikidata.org/wiki/Q230930","display_name":"State space","level":2,"score":0.4990549087524414},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.46841922402381897},{"id":"https://openalex.org/C2780945871","wikidata":"https://www.wikidata.org/wiki/Q194274","display_name":"Backup","level":2,"score":0.4659123718738556},{"id":"https://openalex.org/C159176650","wikidata":"https://www.wikidata.org/wiki/Q43261","display_name":"Horizon","level":2,"score":0.4236191511154175},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.23427557945251465},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.14220812916755676},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1609/icaps.v19i1.13355","doi":"https://doi.org/10.1609/icaps.v19i1.13355","is_oa":true,"landing_page_url":"https://doi.org/10.1609/icaps.v19i1.13355","pdf_url":"https://ojs.aaai.org/index.php/ICAPS/article/download/13355/13203","source":{"id":"https://openalex.org/S4387283601","display_name":"Proceedings of the International Conference on Automated Planning and Scheduling","issn_l":"2334-0835","issn":["2334-0835","2334-0843"],"is_oa":true,"is_in_doaj":false,"is_core":true,"listed_in":["cwts-core","jufo-1"],"host_organization":"https://openalex.org/P4310320058","host_organization_name":"Association for the Advancement of Artificial Intelligence","host_organization_lineage":["https://openalex.org/P4310320058"],"host_organization_lineage_names":["Association for the Advancement of Artificial Intelligence"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the International Conference on Automated Planning and Scheduling","raw_type":"journal-article"},{"id":"pmh:oai:ojs.aaai.org:article/13355","doi":null,"is_oa":true,"landing_page_url":"https://ojs.aaai.org/index.php/ICAPS/article/view/13355","pdf_url":"https://ojs.aaai.org/index.php/ICAPS/article/view/13355","source":{"id":"https://openalex.org/S4306400155","display_name":"AAAI Publications (The Association for the Advancement of Artificial Intelligence (AAAI))","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I2801652627","host_organization_name":"Association for the Advancement of Artificial Intelligence","host_organization_lineage":["https://openalex.org/I2801652627"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Proceedings of the International Conference on Automated Planning and Scheduling; Vol. 19 No. 1 (2009): Nineteenth International Conference on Automated Planning and Scheduling","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.148.995","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.148.995","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://rbrserver.cs.umass.edu/~camato/publications/icaps09-final.pdf","raw_type":"text"}],"best_oa_location":{"id":"doi:10.1609/icaps.v19i1.13355","doi":"https://doi.org/10.1609/icaps.v19i1.13355","is_oa":true,"landing_page_url":"https://doi.org/10.1609/icaps.v19i1.13355","pdf_url":"https://ojs.aaai.org/index.php/ICAPS/article/download/13355/13203","source":{"id":"https://openalex.org/S4387283601","display_name":"Proceedings of the International Conference on Automated Planning and Scheduling","issn_l":"2334-0835","issn":["2334-0835","2334-0843"],"is_oa":true,"is_in_doaj":false,"is_core":true,"listed_in":["cwts-core","jufo-1"],"host_organization":"https://openalex.org/P4310320058","host_organization_name":"Association for the Advancement of Artificial Intelligence","host_organization_lineage":["https://openalex.org/P4310320058"],"host_organization_lineage_names":["Association for the Advancement of Artificial Intelligence"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the International Conference on Automated Planning and Scheduling","raw_type":"journal-article"},"sustainable_development_goals":[],"study_designs":[],"awards":[{"id":"https://openalex.org/G5096399469","display_name":"RI-Small: Decision-Theoretic Planning for Multi-Agent Systems","funder_award_id":"0812149","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W85998123.pdf","grobid_xml":"https://content.openalex.org/works/W85998123.grobid-xml"},"referenced_works_count":16,"referenced_works":["https://openalex.org/W12258761","https://openalex.org/W156814138","https://openalex.org/W1491973539","https://openalex.org/W1554448638","https://openalex.org/W1559536003","https://openalex.org/W1560489415","https://openalex.org/W1579579904","https://openalex.org/W1798373787","https://openalex.org/W1805286982","https://openalex.org/W1908253641","https://openalex.org/W2029280655","https://openalex.org/W2103541323","https://openalex.org/W2121754545","https://openalex.org/W2121943493","https://openalex.org/W2128371572","https://openalex.org/W3104860527"],"related_works":["https://openalex.org/W2128371572","https://openalex.org/W7124153738","https://openalex.org/W2397892782","https://openalex.org/W1543886905","https://openalex.org/W7097367670","https://openalex.org/W7099341815","https://openalex.org/W1575232410","https://openalex.org/W1587799697","https://openalex.org/W7099747039","https://openalex.org/W2170500753"],"abstract_inverted_index":{"Solving":[0],"multiagent":[1],"planning":[2,104],"problems":[3],"modeled":[4],"as":[5],"DEC-POMDPs":[6,155],"is":[7,47],"an":[8,70],"important":[9],"challenge.":[10],"These":[11],"models":[12],"are":[13],"often":[14],"solved":[15],"by":[16,84,160],"using":[17],"dynamic":[18,37,97,124,151],"programming,":[19],"but":[20],"the":[21,34,54,95,134,147,162],"high":[22],"resource":[23,115],"usage":[24],"of":[25,36,53,87,149],"current":[26],"approaches":[27],"results":[28,144],"in":[29,114],"limited":[30],"scalability.":[31],"To":[32,127],"improve":[33],"efficiency":[35],"programming":[38,98,125,152],"algorithms,":[39],"we":[40,60,130],"propose":[41],"a":[42,50,88,111],"new":[43],"backup":[44],"algorithm":[45,137],"that":[46,103,146],"based":[48],"on":[49],"reachability":[51],"analysis":[52],"state":[55,77],"space.":[56],"This":[57,117],"method,":[58],"which":[59],"call":[61],"incremental":[62,163],"policy":[63,164],"generation,":[64],"can":[65,81,106],"be":[66,82,107,157],"used":[67],"to":[68,110],"produce":[69],"optimal":[71,96],"solution":[72],"for":[73,154],"any":[74],"possible":[75],"initial":[76],"or":[78],"further":[79],"scalability":[80],"achieved":[83],"making":[85],"use":[86],"known":[89],"start":[90],"state.":[91],"When":[92],"incorporated":[93],"into":[94,133],"algorithm,":[99],"our":[100],"experiments":[101],"show":[102,139],"horizon":[105],"increased":[108],"due":[109],"marked":[112],"reduction":[113],"consumption.":[116],"approach":[118],"also":[119],"fits":[120],"nicely":[121],"with":[122],"approximate":[123],"algorithms.":[126],"demonstrate":[128],"this,":[129],"incorporate":[131],"it":[132],"state-of-the-art":[135],"PBIP":[136],"and":[138],"significant":[140],"performance":[141,148],"gains.":[142],"The":[143],"suggest":[145],"other":[150],"algorithms":[153],"could":[156],"similarly":[158],"improved":[159],"integrating":[161],"generation":[165],"approach.":[166]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":7},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":4},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":4},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":4},{"year":2013,"cited_by_count":7},{"year":2012,"cited_by_count":4}],"updated_date":"2026-10-16T09:59:22.235173","created_date":"2016-06-24T00:00:00"}