{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,16]],"date-time":"2025-10-16T03:48:40Z","timestamp":1760586520580},"reference-count":35,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2010,5,7]],"date-time":"2010-05-07T00:00:00Z","timestamp":1273190400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Auton Agent Multi-Agent Syst"],"published-print":{"date-parts":[[2011,7]]},"DOI":"10.1007\/s10458-010-9131-8","type":"journal-article","created":{"date-parts":[[2010,5,6]],"date-time":"2010-05-06T13:02:42Z","timestamp":1273150962000},"page":"71-113","source":"Crossref","is-referenced-by-count":1,"title":["Planning in stochastic domains for multiple agents with individual continuous resource state-spaces"],"prefix":"10.1007","volume":"23","author":[{"given":"Emmanuel","family":"Benazera","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2010,5,7]]},"reference":[{"key":"9131_CR1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1613\/jair.575","volume":"11","author":"C. Boutilier","year":"1999","unstructured":"Boutilier C., Dean T., Hanks S. (1999) Decision-theoretic planning: Structural assumptions and computational leverage. Journal of Artificial Intelligence Research, 11: 1\u201394","journal-title":"Journal of Artificial Intelligence Research,"},{"key":"9131_CR2","doi-asserted-by":"crossref","DOI":"10.1002\/9780470316887","volume-title":"Markov decision processes","author":"M. L. Puterman","year":"1994","unstructured":"Puterman M. L. (1994) Markov decision processes. John Wiley & Sons, New York, NY"},{"key":"9131_CR3","unstructured":"Boutilier, C. (1999). Sequential optimality and coordination in multiagent systems. In Proceedings of the sixteenth international joint conference on artificial intelligence, pp. 478\u2013485."},{"key":"9131_CR4","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1613\/jair.1427","volume":"22","author":"C. V. Goldman","year":"2004","unstructured":"Goldman C. V., Zilberstein S. (2004) Decentralized control of cooperative systems: categorization and complexity analysis. Journal of Artificial Intelligence Research 22: 143\u2013174","journal-title":"Journal of Artificial Intelligence Research"},{"key":"9131_CR5","unstructured":"Goldman, C. V., & Zilberstein, S. (2004). Goal-oriented DEC-MDPs with direct communication. Technical Report 04-44, University of Massachussetts Amherst."},{"key":"9131_CR6","unstructured":"Boyan, J., & Littman, M. (2000). Exact solutions to time-dependent MDPs. In Neural information processing systems, pp. 1\u20137."},{"key":"9131_CR7","unstructured":"Meuleau, N., Dearden, R., & Washington, R. (2004). Scaling up decision theoretic planning to planetary rover problems. In AAAI-04: Proceedings of the Workshop on Learning and Planning in Markov Processes Advances and Challenges, pp. 66\u201371, Technical Report WS-04-08. AAAI Press, Menlo Park, CA."},{"issue":"2\u20133","key":"9131_CR8","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1023\/A:1017992615625","volume":"49","author":"R. Munos","year":"2002","unstructured":"Munos R., Moore A. (2002) Variable resolution discretization in optimal control. Machine Learning 49(2\u20133): 291\u2013323","journal-title":"Machine Learning"},{"key":"9131_CR9","unstructured":"Younes, H. L. S., & Simmons, R. G. (2004). Policy generation for continuous-time stochastic domains with concurrency. In Proceedings of the fourteenth international conference on automated planning and scheduling."},{"key":"9131_CR10","unstructured":"Feng, Z., Dearden, R., Meuleau, N., & Washington, R. (2004). Dynamic programming for structured continuous Markov decision problems. In Proceedings of the twentieth international conference on uncertainty in artificial intelligence, pp. 154\u2013161."},{"key":"9131_CR11","unstructured":"Li, L., & Littman, M. L. (2005). Lazy approximation for solving continuous finite-horizon MDPs. In Proceedings of the twentieth national conference on artificial intelligence."},{"key":"9131_CR12","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1613\/jair.2085","volume":"27","author":"B. Kveton","year":"2006","unstructured":"Kveton B., Hauskrecht M., Guestrin C. (2006) Solving factored MDPs with hybrid state and action variables. Journal of Artificial Intelligence Research 27: 153\u2013201","journal-title":"Journal of Artificial Intelligence Research"},{"key":"9131_CR13","unstructured":"Marecki, J., Koenig, S., & Tambe, M. (2007). A fast analytical algorithm for solving Markov decision processes with real-valued resources. In Proceedings of the twentieth international joint conference on artificial intelligence."},{"key":"9131_CR14","unstructured":"Bresina, J., Dearden, R., Meuleau, N., Ramakrishnan, S., Smith, D., & Washington R. (2002). Planning under continuous time and uncertainty: A challenge in ai. In Proceedings of the eighteenth international conference on uncertainty in artificial intelligence."},{"key":"9131_CR15","unstructured":"Mausam, Benazera, E., Brafman, R., Meuleau, N., & Hansen, E. A. (2005). Planning with continuous resources in stochastic domains. In Proceedings of the nineteenth international joint conference on artificial intelligence, pp. 1244\u20131251."},{"key":"9131_CR16","volume-title":"Constrained Markov decision processes","author":"E. Altman","year":"1999","unstructured":"Altman E. (1999) Constrained Markov decision processes. Chapman & Hall-CRC, London"},{"issue":"4","key":"9131_CR17","doi-asserted-by":"crossref","first-page":"819","DOI":"10.1287\/moor.27.4.819.297","volume":"27","author":"S. Bernstein D.","year":"2002","unstructured":"Bernstein D. S., Givan R., Immerman N., Zilberstein S. (2002) The complexity of decentralized control of Markov decision processes. Mathematics of Operations Research 27(4): 819\u2013840","journal-title":"Mathematics of Operations Research"},{"key":"9131_CR18","unstructured":"Hansen, E., Bernstein, D. S., & Zilberstein, S. (2004). Dynamic programming for partially observable stochastic games. In Proceedings of the nineteenth national conference on artificial intelligence."},{"key":"9131_CR19","unstructured":"Szer, D., & Charpillet, F. (2006). Point-based dynamic programming for DEC-POMDPs. In Proceedings of the twenty first national conference on artificial intelligence."},{"key":"9131_CR20","unstructured":"Szer, D., Charpillet, F., & Zilberstein, S. (2005). MAA*: A heuristic search algorithm for solving decentralized POMDPs. In Proceedings of the twentieth national conference on artificial intelligence."},{"key":"9131_CR21","doi-asserted-by":"crossref","first-page":"423","DOI":"10.1613\/jair.1497","volume":"22","author":"R. Becker","year":"2004","unstructured":"Becker R., Zilberstein S., Lesser V., Goldman C.V. (2004) Solving transition independent decentralized Markov decision processes. Journal of Artificial Intelligence Research 22: 423\u2013455","journal-title":"Journal of Artificial Intelligence Research"},{"key":"9131_CR22","unstructured":"Smith, D. (2004). Choosing objectives in over-subscription planning. In Proceedings of the fourteenth international conference on automated planning and scheduling, pp. 393\u2013401."},{"key":"9131_CR23","unstructured":"van den Briel, M., Do, M. B., Sanchez, R., & Kambhampati, S. (2004). Effective approaches for partial satisfation (over-subscription) planning. In Proceedings of the nineteenth national conference on artificial intelligence, pp. 562\u2013569."},{"key":"9131_CR24","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1613\/jair.2529","volume":"34","author":"N. Meuleau","year":"2009","unstructured":"Meuleau N., Benazera E., Brafman R., Hansen E., Hansen E. (2009) A heuristic search approach to planning with continuous resources in stochastic domains. Journal of Artificial Intelligence Research 34: 27\u201359","journal-title":"Journal of Artificial Intelligence Research"},{"issue":"3","key":"9131_CR25","doi-asserted-by":"crossref","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. (1977) An algorithm for finding best matches in logarithmic expected time. ACM Transactions on Mathematical Software 3(3): 209\u2013226","journal-title":"ACM Transactions on Mathematical Software"},{"key":"9131_CR26","doi-asserted-by":"crossref","unstructured":"Naylor, B., Amanatides, J., & Thibault, W. (1990). Merging bsp trees yields polyhedral set operations. In Computer Graphics (SIGGRAPH\u201990).","DOI":"10.1145\/97880.97892"},{"key":"9131_CR27","unstructured":"Cassandra, A., Littman, M., & Zhang, N. (1997) Incremental pruning: a simple, fast, exact method for partially observable Markov decision processes. In Proceedings of the thirteenth international conference on uncertainty in artificial intelligence."},{"key":"9131_CR28","doi-asserted-by":"crossref","first-page":"100","DOI":"10.1109\/TSSC.1968.300136","volume":"2","author":"P. E. Hart","year":"1968","unstructured":"Hart P. E., Nilsson N. J., Raphael B. (1968) A formal basis for the heuristic determination of minimum cost paths. IEEE Transactions on Systems Science and Cybernetics SSC4 2: 100\u2013107","journal-title":"IEEE Transactions on Systems Science and Cybernetics SSC4"},{"key":"9131_CR29","unstructured":"Meuleau, N., Brafman, R., & Benazera, E. (2006) Stochastic over-subscription planning using hierarchies of MDPs. In Proceedings of the sixteenth international conference on automated planning and scheduling."},{"key":"9131_CR30","doi-asserted-by":"crossref","first-page":"308","DOI":"10.1093\/comjnl\/7.4.308","volume":"7","author":"J. A. Nelder","year":"1965","unstructured":"Nelder J. A., Mead R. (1965) A simplex method for function minimization. Computer Journal 7: 308\u2013313","journal-title":"Computer Journal"},{"key":"9131_CR31","unstructured":"Munos, R., & Szepesvari, C. (2007). Finite time bounds for sampling-based fitted value iteration. Technical report, INRIA."},{"key":"9131_CR32","unstructured":"Benazera, E. (2008). Collaboration vs. observation: an empirical study in multiagent planning under resource constraint. In International conference on informatics, control and robotics."},{"key":"9131_CR33","unstructured":"Petrik, M., & Zilberstein, S. (2007). Anytime coordination using separable bilinear programs. In Proceedings of the twenty second national conference on artificial intelligence."},{"key":"9131_CR34","unstructured":"Guestrin, C., Hauskrecht, M., & Kveton, B. (2004). Solving factored MDPs with continuous and discrete variables. In Proceedings of the twentieth international conference on uncertainty in artificial intelligence."},{"key":"9131_CR35","unstructured":"Guestrin, C., Koller, D., & Parr, R. (2001). Multiagent planning with factored MDPs. In Neural Information Processing Systems."}],"container-title":["Autonomous Agents and Multi-Agent Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10458-010-9131-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10458-010-9131-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10458-010-9131-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T17:28:26Z","timestamp":1559150906000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10458-010-9131-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,5,7]]},"references-count":35,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2011,7]]}},"alternative-id":["9131"],"URL":"https:\/\/doi.org\/10.1007\/s10458-010-9131-8","relation":{},"ISSN":["1387-2532","1573-7454"],"issn-type":[{"value":"1387-2532","type":"print"},{"value":"1573-7454","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,5,7]]}}}