Using performance profile trees to improve deliberation control

Proceedings of the National Conference on Artificial Intelligence

Volumn , Issue , 2004, Pages 73-79

  Larson, Kate ^a   Sandholm, Thomas ^a  

^a Carnegie Mellon University ^*  (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL RESOURCES; DELIBERATION CONTROL; OPTIMIZATION PROBLEMS; PROFILE TREES;

ALGORITHMS; DECISION MAKING; DYNAMIC PROGRAMMING; MULTI AGENT SYSTEMS; OPTIMIZATION; PROBLEM SOLVING;

CONTROL SYSTEM ANALYSIS;

EID: 9444243215     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (21)

1. [Baum and Smith 1997] Eric B Baum and Warren D Smith. A Bayesian approach to relevance in game playing. Artificial Intelligence, 97(1-2): 195-242, 1997.
2. [Boddy and Dean 1994] Mark Boddy and Thomas Dean. Deliberation scheduling for problem solving in time-constrained environments. Artificial Intelligence, 67:245-285, 1994.
3. [Breese and Horvitz 1990] John Breese and Eric Horvitz. Ideal reformulation of belief networks. In Proceedings of UAI'90, pages 129-144, 1990.
4. [Bresina 1996] J. L. Bresina. Heuristic-biased stochastic search.. In Proceedings of AAAI'96, pages 271-278, 1996.
5. [Cicirello and Smith 2002] Vincent Cicirello and Steven Smith. Amplification of search performance through randomization of heuristics. In Principles and Practice of Constraint Programming - CP 2002, pages 124-138, 2002.
6. [Grass and Zilberstein 2000] Joshua Grass and Shlomo Zilberstein. A value-driven system for autonomous information gathering. Journal of Intelligent Information Systems, 4(1):5-27, 2000.
7. [Hansen and Zilberstein 2001] Eric Hansen and Shlomo Zilberstein. Monitoring and control of anytime algorithms: A dynamic programming approach. Artificial Intelligence, 126:139-157, 2001.
8. [Horsch and Poole 1999] Michael Horsch and David Poole. Estimating the value of computation in flexible information refinement. In Proceedings of UAI'99, pages 297-304, 1999.
9. [Horvitz 1988] Eric J. Horvitz. Reasoning under varying and uncertain resource constraints. In Proceedings of AAAI'88, pages 111-116, St. Paul, MN, August 1988.
10. [Horvitz 1990] Eric Horvitz. Computation and actions under bounded resources. PhD thesis, Stanford University, 1990.
11. [Horvitz 2001] Eric Horvitz. Principles and applications of continual computation. Artificial Intelligence, 126:159-196, 2001.
12. [Larson and Sandholm 2001] Kate Larson and Tuomas Sandholm. Bargaining with limited computation: Deliberation equilibrium. Artificial Intelligence, 132(2): 183-217, 2001.
13. [Lee et al. 1997] Y. H. Lee, K. Bhaskaran, and M. Pinedo. A heuristic to minimize the total weighted tardiness with sequence-dependent setups. IIE Transactions, 29:45-52, 1997.
14. [Russell and Subramanian 1995] Stuart Russell and Devika Subramanian. Provably bounded-optimal agents. Journal of Artificial Intelligence Research, 1:1-36, 1995.
15. [Russell and Wefald 1991] Stuart Russell and Eric Wefald. Do the right thing: Studies in Limited Rationality. The MIT Press, 1991.
16. [Russell 1997] Stuart Russell. Rationality and intelligence. Artificial Intelligence, 94(1):57-77, 1997.
17. [Sandholm and Lesser 1997] Tuomas Sandholm and Victor Lesser. Coalitions among computationally bounded agents. Artificial Intelligence, 94(1):99-137, 1997.
18. [Sandholm 1993] Tuomas Sandholm. An implementation of the contract net protocol based on marginal cost calculations. In Proceedings of AAAI'93, pages 256-262, Washington, D.C., July 1993.
19. [Simon 1982] Herbert A Simon. Models of bounded rationality, volume 2. MIT Press, 1982.
20. [Zilberstein and Russell 1996] Shlomo Zilberstein and Stuart Russell. Optimal composition of real-time systems. Artificial Intelligence, 82(1-2):181-213, 1996.
21. [Zilberstein et al. 1999] Shlomo Zilberstein, François Charpillet, and Philippe Chassaing. Real-time problem solving with contract algorithms. In Proceedings of IJCAI'99, pages 1008-1013, Stockholm, Sweden, 1999.