CPSC 444 Syllabus

Week 1: 1/23-1/25

Topics: introduction; cellular automata

• introduction

• cellular automata

Reference:

• introduction to cellular automata

Examples:

• simple Processing demo

Week 2: 1/28-2/1

Topics: boids, behaviors, and a bit of math

• boids

Reference:

• boids

• behaviors

Reference:

• Steering Behaviors for Autonomous Characters

• behaviors
• action selection

Reference:

• implementing hardcoded FSMs

Week 3: 2/4-2/8

Topics: evolution (genetic algorithms)

• artificial fish
• genetic algorithms (part 1)

Examples:

• The Undersea World of "Jack Cousto"

Reference:

• Artificial Animals for Computer Animation: Biomechanics, Locomotion, Perception, and Behavior (Tu)
• The Evolution of Code (genetic algorithms)
• Genetic Algorithms in Plain English

• genetic algorithms (part 2)

Examples:

• lunar lander

• genetic algorithms (part 3)

Week 4: 2/11-2/15

Topics: genetic algorithms, genetic programming

• genetic algorithms and genetic programming

Examples:

• eaters (genetic algorithm involving a cellular automaton)

Reference:

• A Field Guide to Genetic Programming
• Competition, Coevolution and the Game of Tag
• Evolution of Corridor Following Behavior in a Noisy World

• fitness functions

Week 5: 2/18-2/22

Topics: problem solving: representation, uninformed search

• genetic algorithms wrapup
• problem solving and search

• problem representation examples

• uninformed search (part 1)

Week 6: 2/25-3/1

Topics: problem solving: informed search

• uninformed search (part 2)

• informed search

• informed search and heuristic functions

Week 7:3/4-3/8

Topics: problem solving: adversarial search

• heuristic functions, adversarial search

• adversarial search

• stochastic games, multiple players, and some notes on hw5

Reference:

• Modeling Social Preferences in Multi-player Games

Week 8: 3/11-3/15

Topics: planning: pathfinding

• turn-based strategy games
• pathfinding (part 1)

Spring Break: 3/18-3/22

Week 9: 3/25-3/29

Topics: pathfinding

• hw6 (informed search)
• pathfinding (waypoints)

• pathfinding (navigation meshes, hierarchical pathfinding)

• pathfinding (open goal, dynamic pathfinding, continuous time pathfinding, movement planning)

Week 10: 4/1-4/5

Topics: planning

• classical planning

• classical planning - heuristics

• A Tutorial on Planning Graph-Based Reachability Heuristics

• classical planning - planning graphs

Week 11: 4/8-4/12

Topics: machine learning

Slides:

• beyond classical planning
• machine learning (introduction, rote learning)

• reinforcement learning

• reinforcement learning

Examples:

• solutions for homework #7

Reference:

• reinforcement learning (including temporal differences, Q-learning, and SARSA)

Week 12: 4/15-4/19

Topics: machine learning

Slides:

• neural networks (introduction, back-propagation)

Slides:

• neural networks (back-propagation example, genetic algorithms)

Week 13: 4/22-4/26

Topics: machine learning

• recap, ID3

• ID3 example, wrapup

Week 14: 4/29-5/3

Topics: the state of the art; intelligence; ethical issues

• state of the art

Week 15: 5/6-5/7

Topics: the state of the art; intelligence; ethical issues

• intelligence and ethical issues

Reading Period: 5/8-/10

Exams: 5/11-5/14

last updated: --Mon May 6 13:21:17 EDT 2013--
page owned by: bridgeman@hws.edu