Decentralized monitoring of distributed anytime algorithms
作者： Shlomo Zilberstein , Alan Carlin
关键词:
摘要: Anytime algorithms allow a system to trade solution quality for computation time. In previous work, monitoring techniques have been developed agents stop the at "right" time so as optimize given time-dependent utility function. However, these results apply only single-agent case. this paper we analyze problems that arise when several solve components of larger problem, each using an anytime algorithm. Monitoring in case is more challenging agent uncertain about progress made far by others. We develop formal framework decentralized monitoring, establish complexity interesting variants and propose one. Finally, show can be applied flow planning problems.
acm.org
sci-hub.st 参考文章(25)
Mark Boddy, Thomas L Dean, Deliberation scheduling for problem solving in time-constrained environments Artificial Intelligence. ,vol. 67, pp. 245- 285 ,(1994) , 10.1016/0004-3702(94)90054-X
Eric A. Hansen, Shlomo Zilberstein, Monitoring and control of anytime algorithms: a dynamic programming approach Artificial Intelligence. ,vol. 126, pp. 139- 157 ,(2001) , 10.1016/S0004-3702(00)00068-0
Anita Raja, Victor Lesser, A framework for meta-level control in multi-agent systems Autonomous Agents and Multi-Agent Systems. ,vol. 15, pp. 147- 196 ,(2007) , 10.1007/S10458-006-9008-Z
Raphen Becker, Alan Carlin, Victor Lesser, Shlomo Zilberstein, ANALYZING MYOPIC APPROACHES FOR MULTI-AGENT COMMUNICATION computational intelligence. ,vol. 25, pp. 31- 50 ,(2009) , 10.1111/J.1467-8640.2008.01329.X
Shanjun Cheng, Anita Raja, Victor Lesser, Multiagent Meta-level Control for a Network of Weather Radars web intelligence. ,vol. 2, pp. 157- 164 ,(2010) , 10.1109/WI-IAT.2010.97
Daniel S. Bernstein, Robert Givan, Neil Immerman, Shlomo Zilberstein, The Complexity of Decentralized Control of Markov Decision Processes Mathematics of Operations Research. ,vol. 27, pp. 819- 840 ,(2002) , 10.1287/MOOR.27.4.819.297
MARTIJN SCHUT, MICHAEL WOOLDRIDGE, The control of reasoning in resource-bounded agents Knowledge Engineering Review. ,vol. 16, pp. 215- 240 ,(2001) , 10.1017/S0269888901000157
Martin L. Puterman, Markov Decision Processes: Discrete Stochastic Dynamic Programming ,(1994)
Shlomo Zilberstein, Marek Petrik, A bilinear programming approach for multiagent planning Journal of Artificial Intelligence Research. ,vol. 35, pp. 235- 274 ,(2009) , 10.1613/JAIR.2673
J. Tsitsiklis, M. Athans, On the complexity of decentralized decision making and detection problems IEEE Transactions on Automatic Control. ,vol. 30, pp. 440- 446 ,(1985) , 10.1109/TAC.1985.1103988