{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:50:24Z","timestamp":1725490224624},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540745648"},{"type":"electronic","value":"9783540745655"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-74565-5_26","type":"book-chapter","created":{"date-parts":[[2007,8,25]],"date-time":"2007-08-25T06:01:04Z","timestamp":1188021664000},"page":"337-351","source":"Crossref","is-referenced-by-count":0,"title":["Solving Decentralized Continuous Markov Decision Problems with Structured Reward"],"prefix":"10.1007","author":[{"given":"Emmanuel","family":"Benazera","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"26_CR1","doi-asserted-by":"crossref","unstructured":"Becker, R., Zilberstein, S., Lesser, V., Goldman, C.V.: Solving transition independent decentralized markov decision processes. Journal of Artificial Intelligence Research\u00a022 (2004)","DOI":"10.1613\/jair.1497"},{"key":"26_CR2","doi-asserted-by":"crossref","unstructured":"Bernstein, D.S., Givan, R., Immerman, N., Zilberstein, S.: The complexity of decentralized control of markov decision processes. Mathematics of Operations Research\u00a027(4) (2002)","DOI":"10.1287\/moor.27.4.819.297"},{"key":"26_CR3","unstructured":"Hansen, E., Bernstein, D.S., Zilberstein, S.: Dynamic programming for partially observable stochastic games. In: Proceedings of the Nineteenth National Conference on Artificial Intelligence (2004)"},{"key":"26_CR4","unstructured":"Feng, Z., Dearden, R., Meuleau, N., Washington, R.: Dynamic programming for structured continuous Markov decision problems. In: Proceedings of the Twentieth International Conference on Uncertainty In Artificial Intelligence, pp. 154\u2013161 (2004)"},{"issue":"3","key":"26_CR5","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1145\/355744.355745","volume":"3","author":"J.H. Friedman","year":"1977","unstructured":"Friedman, J.H., Bentley, J.L., Finkel, R.A.: An algorithm for finding best matches in logarithmic expected time. ACM Trans. Mathematical Software\u00a03(3), 209\u2013226 (1977)","journal-title":"ACM Trans. Mathematical Software"},{"key":"26_CR6","unstructured":"Bresina, J., Dearden, R., Meuleau, N., Ramakrishnan, S., Smith, D., Washington, R.: Planning under continuous time and uncertainty: A challenge in ai. In: Proceedings of the Eighteenth International Conference on Uncertainty In Artificial Intelligence (2002)"},{"key":"26_CR7","unstructured":"Li, L., Littman, M.L.: Lazy approximation for solving continuous finite-horizon mdps. In: Proceedings of the Twentieth National Conference on Artificial Intelligence (2005)"},{"key":"26_CR8","unstructured":"Marecki, J., Koenig, S., Tambe, M.: A fast analytical algorithm for solving markov decision processes with real-valued resources. In: Proceedings of the Twentieth International Joint Conference on Artificial Intelligence (2007)"},{"key":"26_CR9","unstructured":"Mausam, Benazera, E., Brafman, R., Meuleau, N., Hansen, E.A.: Planning with continuous resources in stochastic domains. In: Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence, pp. 1244\u20131251 (2005)"},{"key":"26_CR10","doi-asserted-by":"crossref","unstructured":"Naylor, B., Amanatides, J., Thibault, W.: Merging bsp trees yields polyhedral set operations. In: SIGGRAPH 1990. Computer Graphics (1990)","DOI":"10.1145\/97879.97892"},{"key":"26_CR11","unstructured":"Smith, D.: Choosing objectives in over-subscription planning. In: Proceedings of the Fourteenth International Conference on Automated Planning and Scheduling, pp. 393\u2013401 (2004)"},{"key":"26_CR12","unstructured":"Szer, D., Charpillet, F.: Point-based dynamic programming for dec-pomdps. In: Proceedings of the Twenty First National Conference on Artificial Intelligence (2006)"},{"key":"26_CR13","unstructured":"Szer, D., Charpillet, F., Zilberstein, S.: Maa*: A heuristic search algorithm for solving decentralized pomdps. In: Proceedings of the Twentieth National Conference on Artificial Intelligence (2005)"},{"key":"26_CR14","unstructured":"van den Briel, M., Do, M.B., Sanchez, R., Kambhampati, S.: Effective approaches for partial satisfation (over-subscription) planning. In: Proceedings of the Nineteenth National Conference on Artificial Intelligence, pp. 562\u2013569 (2004)"}],"container-title":["Lecture Notes in Computer Science","KI 2007: Advances in Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-74565-5_26.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T10:24:55Z","timestamp":1619519095000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-74565-5_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540745648","9783540745655"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-74565-5_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}