CS 470    ARTIFICIAL INTELLIGENCE                    Winter 2009,  Instructor: Jeffrey Horn
 

ANNOUNCEMENTS (Tuesday, March 16, 2009)

  LATEST:

• Assignment 2:  Stimulus-Response
• Quiz 1

OLDER ANNOUNCEMENTS:

• Assignment 1 officially assigned!   See below.
• New links for Scheme below.
• Welcome to class!

 

• Original Course Announcement
• Syllabus

TOPICS (not necessarily complete)

• AI as SEARCH
• Planning
• State Space Search
• Heuristic Search
• Adverserial Search
• STIMULUS-RESPONSE AGENTS
• Look-up tables
• Braitenberg Vehicles
• Classifier Systems
• Prisoners' Dilemma
• NEURAL NETWORKS
• ARTIFICIAL LIFE and EVOLUTION
• ROBOTICS
• AUTOMATED LOGIC
  • Knowledge bases and deduction engines
  • Why HAL went insane:  brittleness
  • Fuzzy logic, an answer to brittleness
• MACHINE LEARNING

LECTURE NOTES

Current:

BOIDS:

• Craig Reynold's web page

SCHEME:

• Download Dr. Scheme from PLT.   
• Here is our code for FWGC problem.
• Here is a some basic LISP (Scheme) background.
• Here is Scheme code for BLOCKS WORLD.   (Note:  See instructions in "README" file)

Future:

• RL500 (robomow) simulator  (here)

• Project 1 :  Automated Planning as State Space Search
  • Take our FWGC code and modify it to implement MISSIONARIES AND CANNIBALS, the general  "n by n" case (n missionaries and n cannibals).
  • For a "B+" at best, implement the general n*n case without loop detection.
  • For a grade up to "A+", implement n*n WITH loop detection!   Here is pseudocode for the loop detection.
  • Here is sample code:
    • (define (count creature side)
                       (if (null? side) 0
                            (if (equal? creature (car side)) (+ 1 (count creature (cdr side)))
                                (+ 0 (count creature (cdr side))))
                       )
           )
      

TESTS AND QUIZES