cs344m autonomous multiagent systems
play

CS344M Autonomous Multiagent Systems Todd Hester Department or - PowerPoint PPT Presentation

CS344M Autonomous Multiagent Systems Todd Hester Department or Computer Science The University of Texas at Austin Good Afternoon, Colleagues Are there any questions? Todd Hester Logistics Readings Todd Hester Logistics Readings


  1. CS344M Autonomous Multiagent Systems Todd Hester Department or Computer Science The University of Texas at Austin

  2. Good Afternoon, Colleagues Are there any questions? Todd Hester

  3. Logistics • Readings Todd Hester

  4. Logistics • Readings – Specify which papers you read! Todd Hester

  5. Logistics • Readings – Specify which papers you read! – 2 case studies and 1 TDP Todd Hester

  6. Logistics • Readings – Specify which papers you read! – 2 case studies and 1 TDP • How to read a research paper Todd Hester

  7. Logistics • Readings – Specify which papers you read! – 2 case studies and 1 TDP • How to read a research paper – Some have too few details... Todd Hester

  8. Logistics • Readings – Specify which papers you read! – 2 case studies and 1 TDP • How to read a research paper – Some have too few details... – Others have too many. Todd Hester

  9. Logistics • Readings – Specify which papers you read! – 2 case studies and 1 TDP • How to read a research paper – Some have too few details... – Others have too many. • Next week’s readings posted Todd Hester

  10. Logistics • Readings – Specify which papers you read! – 2 case studies and 1 TDP • How to read a research paper – Some have too few details... – Others have too many. • Next week’s readings posted • Use the undergrad writing center! – Friday afternoon workshops (3 p.m.) Todd Hester

  11. Overview of the Readings • Darwin: genetic programming approach Todd Hester

  12. Overview of the Readings • Darwin: genetic programming approach • Stone and McAllester: Architecture for action selection Todd Hester

  13. Overview of the Readings • Darwin: genetic programming approach • Stone and McAllester: Architecture for action selection • Riley et al: Coach competition, extracting models Todd Hester

  14. Overview of the Readings • Darwin: genetic programming approach • Stone and McAllester: Architecture for action selection • Riley et al: Coach competition, extracting models • Kuhlmann et al: Learning for coaching Todd Hester

  15. Overview of the Readings • Darwin: genetic programming approach • Stone and McAllester: Architecture for action selection • Riley et al: Coach competition, extracting models • Kuhlmann et al: Learning for coaching • Withopf and Riedmiller: Reinforcement learning Todd Hester

  16. Overview of the Readings • Darwin: genetic programming approach • Stone and McAllester: Architecture for action selection • Riley et al: Coach competition, extracting models • Kuhlmann et al: Learning for coaching • Withopf and Riedmiller: Reinforcement learning • MacAlpine et al: UT Austin Villa 2011 Todd Hester

  17. Overview of the Readings • Darwin: genetic programming approach • Stone and McAllester: Architecture for action selection • Riley et al: Coach competition, extracting models • Kuhlmann et al: Learning for coaching • Withopf and Riedmiller: Reinforcement learning • MacAlpine et al: UT Austin Villa 2011 • Barrett et al: SPL Kicking strategy Todd Hester

  18. Evolutionary Computation • Motivated by biological evolution: GA, GP Todd Hester

  19. Evolutionary Computation • Motivated by biological evolution: GA, GP • Search through a space Todd Hester

  20. Evolutionary Computation • Motivated by biological evolution: GA, GP • Search through a space − Need a representation, fitness function − Probabilistically apply search operators to set of points in search space Todd Hester

  21. Evolutionary Computation • Motivated by biological evolution: GA, GP • Search through a space − Need a representation, fitness function − Probabilistically apply search operators to set of points in search space • Randomized, parallel hill-climbing through space Todd Hester

  22. Evolutionary Computation • Motivated by biological evolution: GA, GP • Search through a space − Need a representation, fitness function − Probabilistically apply search operators to set of points in search space • Randomized, parallel hill-climbing through space • Learning is an optimization problem (fitness) Todd Hester

  23. Evolutionary Computation • Motivated by biological evolution: GA, GP • Search through a space − Need a representation, fitness function − Probabilistically apply search operators to set of points in search space • Randomized, parallel hill-climbing through space • Learning is an optimization problem (fitness) Some slides from Machine Learning [Mitchell, 1997] Todd Hester

  24. Darwin United • More ambitious follow-up to Luke, 97 (made 2nd round) Todd Hester

  25. Darwin United • More ambitious follow-up to Luke, 97 (made 2nd round) • Motivated in part by Peter’s detailed team construction Todd Hester

  26. Darwin United • More ambitious follow-up to Luke, 97 (made 2nd round) • Motivated in part by Peter’s detailed team construction • Evolves whole teams — lexicographic fitness function Todd Hester

  27. Darwin United • More ambitious follow-up to Luke, 97 (made 2nd round) • Motivated in part by Peter’s detailed team construction • Evolves whole teams — lexicographic fitness function • Evolved on huge (at the time) hypercube Todd Hester

  28. Darwin United • More ambitious follow-up to Luke, 97 (made 2nd round) • Motivated in part by Peter’s detailed team construction • Evolves whole teams — lexicographic fitness function • Evolved on huge (at the time) hypercube • Lots of spinning, but figured out dribbling, offsides Todd Hester

  29. Darwin United • More ambitious follow-up to Luke, 97 (made 2nd round) • Motivated in part by Peter’s detailed team construction • Evolves whole teams — lexicographic fitness function • Evolved on huge (at the time) hypercube • Lots of spinning, but figured out dribbling, offsides • 1-1-1 record. Tied a good team, but didn’t advance Todd Hester

  30. Darwin United • More ambitious follow-up to Luke, 97 (made 2nd round) • Motivated in part by Peter’s detailed team construction • Evolves whole teams — lexicographic fitness function • Evolved on huge (at the time) hypercube • Lots of spinning, but figured out dribbling, offsides • 1-1-1 record. Tied a good team, but didn’t advance • Success of the method, but not pursued Todd Hester

  31. Architecture for Action Selection • (other slides, video) Todd Hester

  32. Architecture for Action Selection • (other slides, video) • downsides Todd Hester

  33. Architecture for Action Selection • (other slides, video) • downsides • Keepaway Todd Hester

  34. Coaching • Learn best strategy to play a fixed team Todd Hester

  35. Coaching • Learn best strategy to play a fixed team • Give high level advice to players at low frequency Todd Hester

  36. Coaching • Learn best strategy to play a fixed team • Give high level advice to players at low frequency • Focus on learning formations Todd Hester

  37. Coaching • Learn best strategy to play a fixed team • Give high level advice to players at low frequency • Focus on learning formations • Learn when successful teams passed/kicked Todd Hester

  38. Coaching • Learn best strategy to play a fixed team • Give high level advice to players at low frequency • Focus on learning formations • Learn when successful teams passed/kicked • Learn when opponent will pass and try to block Todd Hester

  39. Coaching • Learn best strategy to play a fixed team • Give high level advice to players at low frequency • Focus on learning formations • Learn when successful teams passed/kicked • Learn when opponent will pass and try to block • What if players switch roles? Todd Hester

  40. Coaching • Learn best strategy to play a fixed team • Give high level advice to players at low frequency • Focus on learning formations • Learn when successful teams passed/kicked • Learn when opponent will pass and try to block • What if players switch roles? • Why just imitate another team? Todd Hester

  41. Coaching • Learn best strategy to play a fixed team • Give high level advice to players at low frequency • Focus on learning formations • Learn when successful teams passed/kicked • Learn when opponent will pass and try to block • What if players switch roles? • Why just imitate another team? • Other slides Todd Hester

  42. Reinforcement Learning • RL Slides Todd Hester

  43. Reinforcement Learning • RL Slides • Extend to grid soccer Todd Hester

  44. Reinforcement Learning • RL Slides • Extend to grid soccer • Large state space, joint actions Todd Hester

  45. Reinforcement Learning • RL Slides • Extend to grid soccer • Large state space, joint actions Todd Hester

  46. UT Austin Villa 2011 • Other slides Todd Hester

  47. UT Austin Villa 2011 • Other slides • Why not use CMA-ES on role positions as well? Todd Hester

  48. UT Austin Villa 2011 • Other slides • Why not use CMA-ES on role positions as well? • Changes for 2012? Todd Hester

  49. Kicking Under Uncertainty • Used by our SPL team Todd Hester

  50. Kicking Under Uncertainty • Used by our SPL team • Kick engine to kick at various distances/headings Todd Hester

  51. Kicking Under Uncertainty • Used by our SPL team • Kick engine to kick at various distances/headings • Adjust to seen ball location Todd Hester

Recommend


More recommend