Bounded Dynamic Programming for Decentralized POMDPs. Amato, C., Carlin, A., & Zilberstein, S. In *Workshop at the International Conference on Autonomous Agents and Multi-Agent Systems*, Honolulu, Hawaii, 2007.

Paper bibtex

Paper bibtex

@inproceedings{Amato2007a, added-at = {2020-05-24T20:36:48.000+0200}, address = {Honolulu, Hawaii}, author = {Amato, Christopher and Carlin, Alan and Zilberstein, Shlomo}, biburl = {https://www.bibsonomy.org/bibtex/26c1b95dd09ef3a536297be60d8aa80fc/marcondg}, booktitle = {Workshop at the International Conference on Autonomous Agents and Multi-Agent Systems}, comment = {Bounded Dynamic Programming (BDP). Bounds values when pruning additional policies in dynamic programming. Given a problem and an error bound, the algorithm will return a solution within that bound when it is able to solve the problem. ---=note-separator=--- Bounded Dynamic Programming (BDP). Bounds values when pruning additional policies in dynamic programming. Given a problem and an error bound, the algorithm will return a solution within that bound when it is able to solve the problem.}, interhash = {bca8a7c34e54ade7ab29d2612812fe78}, intrahash = {6c1b95dd09ef3a536297be60d8aa80fc}, keywords = {approximation, bottom-up, concurrent, dec-pomdp, decentralized, decision-tree, dp, finite-horizon, lim-com, nondet-outcomes, partial-obs}, timestamp = {2020-05-24T20:36:48.000+0200}, title = {Bounded Dynamic Programming for Decentralized {POMDP}s}, url = {http://rbr.cs.umass.edu/shlomo/papers/ACZmsdm07.pdf}, year = 2007 }

Downloads: 0

{"_id":"yRzCnRZziX5qP2aN9","bibbaseid":"amato-carlin-zilberstein-boundeddynamicprogrammingfordecentralizedpomdps-2007","author_short":["Amato, C.","Carlin, A.","Zilberstein, S."],"bibdata":{"bibtype":"inproceedings","type":"inproceedings","added-at":"2020-05-24T20:36:48.000+0200","address":"Honolulu, Hawaii","author":[{"propositions":[],"lastnames":["Amato"],"firstnames":["Christopher"],"suffixes":[]},{"propositions":[],"lastnames":["Carlin"],"firstnames":["Alan"],"suffixes":[]},{"propositions":[],"lastnames":["Zilberstein"],"firstnames":["Shlomo"],"suffixes":[]}],"biburl":"https://www.bibsonomy.org/bibtex/26c1b95dd09ef3a536297be60d8aa80fc/marcondg","booktitle":"Workshop at the International Conference on Autonomous Agents and Multi-Agent Systems","comment":"Bounded Dynamic Programming (BDP). Bounds values when pruning additional policies in dynamic programming. Given a problem and an error bound, the algorithm will return a solution within that bound when it is able to solve the problem. —=note-separator=— Bounded Dynamic Programming (BDP). Bounds values when pruning additional policies in dynamic programming. Given a problem and an error bound, the algorithm will return a solution within that bound when it is able to solve the problem.","interhash":"bca8a7c34e54ade7ab29d2612812fe78","intrahash":"6c1b95dd09ef3a536297be60d8aa80fc","keywords":"approximation, bottom-up, concurrent, dec-pomdp, decentralized, decision-tree, dp, finite-horizon, lim-com, nondet-outcomes, partial-obs","timestamp":"2020-05-24T20:36:48.000+0200","title":"Bounded Dynamic Programming for Decentralized POMDPs","url":"http://rbr.cs.umass.edu/shlomo/papers/ACZmsdm07.pdf","year":"2007","bibtex":"@inproceedings{Amato2007a,\n added-at = {2020-05-24T20:36:48.000+0200},\n address = {Honolulu, Hawaii},\n author = {Amato, Christopher and Carlin, Alan and Zilberstein, Shlomo},\n biburl = {https://www.bibsonomy.org/bibtex/26c1b95dd09ef3a536297be60d8aa80fc/marcondg},\n booktitle = {Workshop at the International Conference on Autonomous Agents and Multi-Agent Systems},\n comment = {Bounded Dynamic Programming (BDP).\nBounds values when pruning additional policies in dynamic programming. \nGiven a problem and an error bound, the algorithm will return a solution within that bound when it is able to solve the problem.\n---=note-separator=---\nBounded Dynamic Programming (BDP). Bounds values when pruning additional policies in dynamic programming. Given a problem and an error bound, the algorithm will return a solution within that bound when it is able to solve the problem.},\n interhash = {bca8a7c34e54ade7ab29d2612812fe78},\n intrahash = {6c1b95dd09ef3a536297be60d8aa80fc},\n keywords = {approximation, bottom-up, concurrent, dec-pomdp, decentralized, decision-tree, dp, finite-horizon, lim-com, nondet-outcomes, partial-obs},\n timestamp = {2020-05-24T20:36:48.000+0200},\n title = {Bounded Dynamic Programming for Decentralized {POMDP}s},\n url = {http://rbr.cs.umass.edu/shlomo/papers/ACZmsdm07.pdf},\n year = 2007\n}\n\n","author_short":["Amato, C.","Carlin, A.","Zilberstein, S."],"key":"Amato2007a","id":"Amato2007a","bibbaseid":"amato-carlin-zilberstein-boundeddynamicprogrammingfordecentralizedpomdps-2007","role":"author","urls":{"Paper":"http://rbr.cs.umass.edu/shlomo/papers/ACZmsdm07.pdf"},"keyword":["approximation","bottom-up","concurrent","dec-pomdp","decentralized","decision-tree","dp","finite-horizon","lim-com","nondet-outcomes","partial-obs"],"metadata":{"authorlinks":{}}},"bibtype":"inproceedings","biburl":"http://www.bibsonomy.org/bib/user/marcondg?items=1000","dataSources":["KmdEXRiKqSHvuDHgs"],"keywords":["approximation","bottom-up","concurrent","dec-pomdp","decentralized","decision-tree","dp","finite-horizon","lim-com","nondet-outcomes","partial-obs"],"search_terms":["bounded","dynamic","programming","decentralized","pomdps","amato","carlin","zilberstein"],"title":"Bounded Dynamic Programming for Decentralized POMDPs","year":2007}