Plays as effective multiagent plans enabling opponent-adaptive play selection

Proceedings of the 14th International Conference on Automated Planning and Scheduling, ICAPS 2004

Volumn , Issue , 2004, Pages 376-383

  Bowling, Michael ^a   Browning, Brett ^b   Veloso, Manuela ^b  

^a UNIVERSITY OF ALBERTA   (Canada)

^b Carnegie Mellon University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; EVALUATION; GAME THEORY; PLANNING; ROBOTS;

MONOLITHIC TEAM STRATEGIES; MULTIAGENT PLANS; ROBOT SOCCER;

MULTI AGENT SYSTEMS;

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

References (10)

1. Auer, P.; Cesa-Bianchi, N.; Freund, Y.; and Schapire, R. E. 1995. Gambling in a rigged casino: The adversarial multiarm bandit problem. In 36th Annual Symposium on Foundations of Computer Science, 322-331. Milwaukee, WI: IEEE Computer Society Press.
2. Birk, A.; Coradeschi, S.; and Tadokoro, S., eds. 2002. RoboCup 2001: Robot Soccer World Cup V.
3. Bowling, M.; Browning, B.; Chang, A.; and Veloso, M. 2003. Plays as team plans for cooperation and adaptation. In the IJCAI Workshop on Issues in Designing Physical Agents for Dynamic Real-Time Environments: World Modelling, Planning, Learning, and Communicating.
4. Bruce, J., and Veloso, M. 2002. Real-time randomized path planning for robot navigation. In Proceedings of IROS-2002, 2383-2388.
5. Bruce, J.; Bowling, M.; Browning, B.; and Veloso, M. 2002. Multi-robot team response to a multi-robot opponent team. In ICRA Workshop on Multi-Robot Systems.
6. Freund, Y.; Schapire, R. E.; Singer, Y.; and Warmuth, M. K. 1997. Using and combining predictors that specialize. In Proceedipngs of the Twenty-Ninth Annual ACM Symposium on the Theory of Computing, 334-343.
7. Intille, S., and Bobick, A. 1999. A framework for recognizing multi-agent action from visual evidence. In AAAI-99, 518-525. AAAI Press.
8. Kitano, H.; Kuniyoshi, Y.; Noda, I.; Asada, M.; Matsubara, H.; and Osawa, E. 1997. RoboCup: A challenge problem for AI. AI Magazine 18(1):73-85.
9. Littlestone, N., and Warmuth, M. 1994. The weighted majority algorithm. Information and Computation 108:212-261.
10. Riley, P., and Veloso, M. 2002. Planning for distributed execution through use of probabilistic opponent models. In ICAPS-02.