@inproceedings{Dibangoye2009,
  added-at = {2020-05-24T20:36:48.000+0200},
  author = {Dibangoye, Jilles S. and Mouaddib, Abdel-Illah and Chai Draa, Brahim},
  biburl = {https://www.bibsonomy.org/bibtex/2cea3535a75d831df565de28682685744/marcondg},
  booktitle = {International Conference on Autonomous Agents and Multiagent Systems},
  comment = {Point Based Incremental Pruning (PBIP).
Replaces the backup step with a branch-and-bound search in the space of joint policies.
---=note-separator=---
Point Based Incremental Pruning (PBIP). Replaces the backup step with a branch-and-bound search in the space of joint policies.},
  interhash = {39212593d1e52e8005d8ea0af1ffce1c},
  intrahash = {cea3535a75d831df565de28682685744},
  keywords = {bottom-up, concurrent, dec-pomdp, decentralized, decision-tree, dp, exact, finite-horizon, lim-com, mbdp, nondet-outcomes, partial-obs, point-based},
  pages = {569--576},
  timestamp = {2020-05-24T20:36:48.000+0200},
  title = {{Point-Based Incremental Pruning Heuristic for Solving Finite-Horizon DEC-POMDPs}},
  url = {http://www.aamas-conference.org/Proceedings/aamas09/pdf/01\_Full\%20Papers/09\_48\_FP\_0211.pdf},
  year = 2009
}

{"_id":"rNwCssrfzoy3gN23f","bibbaseid":"dibangoye-mouaddib-chaidraa-pointbasedincrementalpruningheuristicforsolvingfinitehorizondecpomdps-2009","author_short":["Dibangoye, J. S.","Mouaddib, A.","Chai Draa, B."],"bibdata":{"bibtype":"inproceedings","type":"inproceedings","added-at":"2020-05-24T20:36:48.000+0200","author":[{"propositions":[],"lastnames":["Dibangoye"],"firstnames":["Jilles","S."],"suffixes":[]},{"propositions":[],"lastnames":["Mouaddib"],"firstnames":["Abdel-Illah"],"suffixes":[]},{"propositions":[],"lastnames":["Chai","Draa"],"firstnames":["Brahim"],"suffixes":[]}],"biburl":"https://www.bibsonomy.org/bibtex/2cea3535a75d831df565de28682685744/marcondg","booktitle":"International Conference on Autonomous Agents and Multiagent Systems","comment":"Point Based Incremental Pruning (PBIP). Replaces the backup step with a branch-and-bound search in the space of joint policies. —=note-separator=— Point Based Incremental Pruning (PBIP). Replaces the backup step with a branch-and-bound search in the space of joint policies.","interhash":"39212593d1e52e8005d8ea0af1ffce1c","intrahash":"cea3535a75d831df565de28682685744","keywords":"bottom-up, concurrent, dec-pomdp, decentralized, decision-tree, dp, exact, finite-horizon, lim-com, mbdp, nondet-outcomes, partial-obs, point-based","pages":"569–576","timestamp":"2020-05-24T20:36:48.000+0200","title":"Point-Based Incremental Pruning Heuristic for Solving Finite-Horizon DEC-POMDPs","url":"http://www.aamas-conference.org/Proceedings/aamas09/pdf/01_Full%20Papers/09_48_FP_0211.pdf","year":"2009","bibtex":"@inproceedings{Dibangoye2009,\n added-at = {2020-05-24T20:36:48.000+0200},\n author = {Dibangoye, Jilles S. and Mouaddib, Abdel-Illah and Chai Draa, Brahim},\n biburl = {https://www.bibsonomy.org/bibtex/2cea3535a75d831df565de28682685744/marcondg},\n booktitle = {International Conference on Autonomous Agents and Multiagent Systems},\n comment = {Point Based Incremental Pruning (PBIP).\nReplaces the backup step with a branch-and-bound search in the space of joint policies.\n---=note-separator=---\nPoint Based Incremental Pruning (PBIP). Replaces the backup step with a branch-and-bound search in the space of joint policies.},\n interhash = {39212593d1e52e8005d8ea0af1ffce1c},\n intrahash = {cea3535a75d831df565de28682685744},\n keywords = {bottom-up, concurrent, dec-pomdp, decentralized, decision-tree, dp, exact, finite-horizon, lim-com, mbdp, nondet-outcomes, partial-obs, point-based},\n pages = {569--576},\n timestamp = {2020-05-24T20:36:48.000+0200},\n title = {{Point-Based Incremental Pruning Heuristic for Solving Finite-Horizon DEC-POMDPs}},\n url = {http://www.aamas-conference.org/Proceedings/aamas09/pdf/01\\_Full\\%20Papers/09\\_48\\_FP\\_0211.pdf},\n year = 2009\n}\n\n","author_short":["Dibangoye, J. S.","Mouaddib, A.","Chai Draa, B."],"key":"Dibangoye2009","id":"Dibangoye2009","bibbaseid":"dibangoye-mouaddib-chaidraa-pointbasedincrementalpruningheuristicforsolvingfinitehorizondecpomdps-2009","role":"author","urls":{"Paper":"http://www.aamas-conference.org/Proceedings/aamas09/pdf/01_Full%20Papers/09_48_FP_0211.pdf"},"keyword":["bottom-up","concurrent","dec-pomdp","decentralized","decision-tree","dp","exact","finite-horizon","lim-com","mbdp","nondet-outcomes","partial-obs","point-based"],"metadata":{"authorlinks":{}}},"bibtype":"inproceedings","biburl":"http://www.bibsonomy.org/bib/user/marcondg?items=1000","dataSources":["KmdEXRiKqSHvuDHgs"],"keywords":["bottom-up","concurrent","dec-pomdp","decentralized","decision-tree","dp","exact","finite-horizon","lim-com","mbdp","nondet-outcomes","partial-obs","point-based"],"search_terms":["point","based","incremental","pruning","heuristic","solving","finite","horizon","dec","pomdps","dibangoye","mouaddib","chai draa"],"title":"Point-Based Incremental Pruning Heuristic for Solving Finite-Horizon DEC-POMDPs","year":2009}