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 Good Afternoon, Colleagues Are there any questions?


  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. Good Afternoon, Colleagues Are there any questions? • Changes from 2011 to now • Do different formations in different situations? • How does UT’s walk engine work? • Has the formation code been released? copied? • Why does world model give 0s for some players? Unseen? Todd Hester

  4. Good Afternoon, Colleagues Are there any questions? • Changes from 2011 to now • Do different formations in different situations? • How does UT’s walk engine work? • Has the formation code been released? copied? • Why does world model give 0s for some players? Unseen? • Todd: Why not run CMA-ES to optimize role positions too? Todd Hester

  5. Logistics • Assignment 4 due today Todd Hester

  6. Logistics • Assignment 4 due today • Next week’s readings posted Todd Hester

  7. Logistics • Assignment 4 due today • Next week’s readings posted • Final project proposal assigned Todd Hester

  8. Final Projects • Proposal (10/11): 3+ pages • What you’re going to do; graded on writing Todd Hester

  9. Final Projects • Proposal (10/11): 3+ pages • What you’re going to do; graded on writing • Progress Report (11/8): 5+ pages + binaries + logs • What you’ve been doing; graded on writing Todd Hester

  10. Final Projects • Proposal (10/11): 3+ pages • What you’re going to do; graded on writing • Progress Report (11/8): 5+ pages + binaries + logs • What you’ve been doing; graded on writing • Peer Review (11/15): review 2 progress reports • Clear? suggestions?; graded on writing and feedback quality Todd Hester

  11. Final Projects • Team (12/4): source + binaries • The tournament entry; make sure it runs! Todd Hester

  12. Final Projects • Team (12/4): source + binaries • The tournament entry; make sure it runs! • Final Report (12/6): 8+ pages • A term paper; the main component of your grade Todd Hester

  13. Final Projects • Team (12/4): source + binaries • The tournament entry; make sure it runs! • Final Report (12/6): 8+ pages • A term paper; the main component of your grade • Tournament (12/17): nothing due • Oral presentation Todd Hester

  14. Final Projects • Team (12/4): source + binaries • The tournament entry; make sure it runs! • Final Report (12/6): 8+ pages • A term paper; the main component of your grade • Tournament (12/17): nothing due • Oral presentation Due at beginning of classes Todd Hester

  15. Final Project info • All writing is individual! Todd Hester

  16. Final Project info • All writing is individual! • Two hard copies and one electronic copy Todd Hester

  17. Final Project info • All writing is individual! • Two hard copies and one electronic copy • Due at beginning of class Todd Hester

  18. Final Project info • All writing is individual! • Two hard copies and one electronic copy • Due at beginning of class • One idea: Re-implement an idea from one of the readings Todd Hester

  19. Final Project info • All writing is individual! • Two hard copies and one electronic copy • Due at beginning of class • One idea: Re-implement an idea from one of the readings • Be careful with machine learning Todd Hester

  20. Final Project info • All writing is individual! • Two hard copies and one electronic copy • Due at beginning of class • One idea: Re-implement an idea from one of the readings • Be careful with machine learning • Example final report on website Todd Hester

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

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

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

  24. 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

  25. 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

  26. 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

  27. 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

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

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

  30. 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

  31. 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

  32. 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

  33. 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

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

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

  36. 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

  37. 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

  38. 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

  39. 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

  40. 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

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

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

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

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

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

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

  47. 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

Download Presentation
Download Policy: The content available on the website is offered to you 'AS IS' for your personal information and use only. It cannot be commercialized, licensed, or distributed on other websites without prior consent from the author. To download a presentation, simply click this link. If you encounter any difficulties during the download process, it's possible that the publisher has removed the file from their server.

Recommend


More recommend