Human-like Artificial Agents (Summer 2021/22)

In this course, we will study human-like artificial agents, that is autonomous intelligent agents situated in a virtual environment similar to real world that act like humans. The course gives an overview of types of such agents and their architectures with the emphasis on the problem of action selection. The course also focuses on solving practical issues related to real-time and partially observable environments. The course is taught at MFF UK as NAIL068.

History: 20212020201920182017<=2016

This page is containing information about lectures, if you’re looking for labs info, visit Labs web page (coming soon!).


News

Follow the appropriate channel at Gamedev Discord!
https://discord.gg/c49DHBJ


Dates (SIS)

Lectures: Wednesdays, 17:20

Form: Hybrid, Zoom link will be shared via email

Start: 16.2.2022, 17:20


Plan & Slides

No. Date Topic Lecturer Form Slides Target
audience
1. 16.2.2022 Introduction Cyril Brom,
Jakub Gemrot
Video only Slides: -1-, -2-, -3-, -4-
Videos: -1-, -2-, -3-, -4-
All
2. 23.2.2022 Reactive Planning – Part I – If-then and alikes Jakub Gemrot Hybrid – Zoom Slides: PDF All
3. 2.3.2022 Reactive Planning – Part I – Continued Jakub Gemrot Hybrid – Zoom All
4. 9.3.2022 Cancelled
5. 16.3.2022 Reactive Planning – Part II – Finite state machines Jakub Gemrot Hybrid – Zoom Slides: PDF All
6. 23.3.2022 Reactive Planning – Part III – Behavior trees Jakub Gemrot Hybrid – Zoom Slides: PDF Programmers
7. 30.3.2022 Spatial Awareness Jakub Gemrot Video only Slides: PDF (2020)
Video: YT (2020)
All
8. 6.4.2022 Steerings Jakub Gemrot Video only Slides: PDF (2020)
Video: YT (2020)
All
9. 13.4.2022 Ethology-inspired architectures for action selection – Part I Cyril Brom Hybrid – Zoom Video: YT All
10. 20.4.2022 Ethology-inspired architectures for action selection – Part II Cyril Brom Hybrid – Zoom Video: YT All
11. 27.4.2022 Path-finding algorithms – Part I Jakub Gemrot Video only Slides: PDF (2020
Video: YT (2020)
All
12. 4.5.2022 Path-finding algorithms – Part II Jakub Gemrot Video only Slides: PDF (2020)
Video: YT (2020)
All
11.5.2022 Cancelled – Rector’s day
13. 18.5.2022 IVA and Emotions Michal Bída Unfortunately cancelled Slides: PDF (2021) Programmers

Terms

Terms differ according to the field you’re coming from. MFF UK students has different terms from FF UK students and vice versa. While there is also some common part for all.

Common Terms

Both MFF and FF UK students will be required to attend to a play testing targeting “fun aspect” of a game. Details to be filled in later and announced. Then both type of students will have an exam, but that exam will be different for MFF and FF UK students.

Exam for MFF UK Students

Exam for MFF UK students is highly practical. There will be no oral examination (unless you want it as ‘extra’) but you will have to create either a team-oriented behavior either for Pogamut 3 bots or a behavior for a NOTA robot squad. Details are available at Labs webpage (see above).

Exam for non-MFF UK Students

Be able to talk about general ideas behind: finite state machines, if-then rules; path-finding, steering, terrain representation

Labs for non-MFF UK Students

A task in Scratch [https://scratch.mit.edu/] (see below)

You should follow Scratch self-studying and complete the final task as follows:

  1. Go through the basic tutorials [https://scratch.mit.edu/help/videos/#]
    — deadline 20 March
  2. Make a game as described in the tutorial “Make a simple game”
    — deadline 20 March
  3. Contact Cyril Brom; online consultations between 21 March — 03 April, you will show your programs (you can contact Cyril sooner, if needed)
  4. Make the Pong game [https://scratch.mit.edu/projects/editor/?tutorial=getStarted] — Click on Tutorials and Pong game
    — deadline 24 April
  5. Make the Clicker game [https://scratch.mit.edu/projects/editor/?tutorial=getStarted] — Click on Tutorials and Make a clicker game
    — deadline 24 April
  6. THE FINAL TASK for the final evaluation: Make your own virtual garden with
    • a virtual gardener having a simple reactive plan, a few rules
    • a virtual garden that can be dry or wet or something in between
    • a watering can — a barrel with water that can fill in the can when the gardener comes to its proximity
    • a magical button that empties the can instantly and fills the can with water instantly
    • a magical button that makes the garden dry / wet instantly
    • the gardener’s task is to take the watering can, fill it with water and water the garden; but (!), the user can play with magical buttons anytime and the gardener has to react appropriately — deadline 15 May
  7. Contact Cyril Brom; online consultations between 15 May — 22 May

You can contact Cyril sooner, if needed, you will show your programs (at least the watering task)


State Final Exam

Breakdown of the Multi-agent systems state final exam topics (pre 2020/21):

  1. Autonomous agent architectures; agent perception, agent action selection mechanism, agent memory.
    • Covered by lectures in NAIL069 (on reactive planning and neural networks)  and NAIL106
  2. Psychological inspiration.
    • Covered by BDI and Emotion slides in the archive below
  3. Methods for agent control; symbolic and connectionist reactive planning, hybrid approaches.
    • Dtto 1+2 plus concrete examples of algorithms / mechanisms for agent control
  4. Path search problem, steering rules, terrain representation.
    • Covered by NAIL069, concretely lectures on Spatial Awareness, Steerings and the Path-finding algorithms – Part I
  5. Communication and knowledge in multiagent systems, ontologies, speech acts, FIPA-ACL, protocols. Distributed problem solving, cooperation, Nash equilibria, Pareto efficiency, source allocation, auctions. Agent design methodologies, agent languages and environments.
    • Covered mostly by NAIL106
  6. Ethological inspiration, models of population dynamics. Methods for agent learning; reinforcement learning, basic forms of animal learning.

Follows the list of other recommended literature:

  • Michael Wooldridge: An Introduction to MultiAgent Systems. Willey (2002) 1st ed. or 2nd ed. (Wiley)
    • Supplementary: Gerhard Weiss (editor): Multiagent Systems: A Modern Approach to Distributed Artificial Intelligence. (základy: kap 1)
  • Hanna Kokko: Modelling For Field Biologists and Other Interesting People. Cambridge University Press (2007) ch. 1, 2, 7, 8 (Amazon)
  • Leah Edelstein-Keshet: Mathematical Models in Biology. SIAM (2005) ch. 4.1, 4.2, 6.1-6.3 (Epubs)
  • Melanie Mitchell: An Introduction to Genetic Algorithms, MIT Press, 1996 (1st ed), 1998 (2nd ed). ch. 1-4 (Amazon)
  • David E. Goldberg: Genetic Algorithms in Search, Optimization and Machine Learning. Addison-Wesley Pub. Co. 1989. (kap. 1–4)
    • Alternative 1: Zbigniew Michalewicz: Genetic Algorithms + Data Structures = Evolution Programs, Springer-Verlag, Berlin, 1996 (3rd ed). ch. 1-4 is a must; advanced topics in ch. 8, 10, 12, 13 (Springer)
    • Alternative 2: John H. Holland: Adaptation in Natural and Artificial Systems ch. 1-2, 4-5 (MIT)
  • Steve Rabin (ed.): AI Game Programming Wisdom I, Charles River Media, 2002 ch. 4.3 (PDF)
  • Steve Rabin (ed.): AI Game Programming Wisdom IV, Charles River Media, 2008 ch. 2.2, 2.3, 2.5, 2.6 (Amazon)

Slides Archive (2010-2015)

  1. Introduction (in Czech)
  2. Reactive planning, If-then rules, Finite state machines, POSH (updated 130227)
  3. Pathfinding (in Czech)
  4. Steering (updated spring 2012)
  5. Creatures, neural networks, evolutionary algorithms
  6. Tyrrell (free-flow hierarchy)
  7. Computational ethology (in Czech)
  8. Fuzzy approach, emotions (Champandard)
  9. Belief Desire Intention
  10. Representation – logic, RETE, affordances, deictic representation
  11. Agents vs. Animats, Wooldridge, FIPA, speech acts
  12. Soar intro
  13. Storytelling intro
  14. Spatial memory & psychological experiments (updated 130425)
  15. Slides on emotions (2007, in Czech)

https://gamedev.cuni.cz/wp-content/uploads/2018/10/logolink_OP_VVV_hor_barva_eng.jpg

Leave a Reply

Your email address will not be published. Required fields are marked *