Plays as Effective Multiagent Plans Enabling Opponent-Adaptive Play Selection
暂无分享,去创建一个
Brett Browning | Manuela M. Veloso | Michael H. Bowling | M. Veloso | Michael Bowling | B. Browning | Brett Browning
[1] Manfred K. Warmuth,et al. The Weighted Majority Algorithm , 1994, Inf. Comput..
[2] Nicolò Cesa-Bianchi,et al. Gambling in a rigged casino: The adversarial multi-armed bandit problem , 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.
[3] Yoram Singer,et al. Using and combining predictors that specialize , 1997, STOC '97.
[4] Hiroaki Kitano,et al. RoboCup: A Challenge Problem for AI , 1997, AI Mag..
[5] Aaron F. Bobick,et al. A Framework for Recognizing Multi-Agent Action from Visual Evidence , 1999, AAAI/IAAI.
[6] Manuela M. Veloso,et al. Real-time randomized path planning for robot navigation , 2002, IEEE/RSJ International Conference on Intelligent Robots and Systems.
[7] Manuela M. Veloso,et al. Planning for Distributed Execution through Use of Probabilistic Opponent Models , 2002, AIPS.
[8] Brett Browning,et al. Plays as Team Plans for Coordination and Adaptation , 2003, RoboCup.
[9] Brett Browning,et al. Multi-robot team response to a multi-robot opponent team , 2003, 2003 IEEE International Conference on Robotics and Automation (Cat. No.03CH37422).