Tops Artific Intell: Planning Algorithms

Instructor:
Stephen George Ware
660
Credits:
3.0
001
Building:
F Paul Anderson Tower
Room:
Rm.255
Semester:
Spring 2025
Start Date:
End Date:
Name:
Tops Artific Intell: Planning Algorithms
Requisites:

Prereq: CS 505 and CS 560 or consent of instructor.

Class Type:
LEC
2:00 pm
2:50 pm
Days:
MWF
Note:
This is a seminar-style course for computer science graduate students interested in planning, a branch of artificial intelligence research. Planning is thinking before acting. Given a (1) description of the world in some formal logic, (2) a set of actions with preconditions and effects, and (3) a goal, a planning algorithm's task is to find a sequence of those actions which achieves that goal. Planning is computationally intractable, but the research community has developed a number of interesting techniques to mitigate this high cost and solve an impressive array of problems. Throughout this course, students will read important research papers in the field as well as implement and test historically important planning algorithms with guidance from the instructor. The course concludes with a self-defined project that allows students to explore a planning topic of interest. Prerequisites: It is assumed that you have completed CS 463G: Introduction to Artificial Intelligence or some equivalent course., and you are a competent programmer with a solid foundation in data structures and algorithms.

Advanced topics chosen from the following: knowledge representation, knowledge acquisition, problem solving, very high-level programming languages, expert systems, intelligent and deductive databases, automated theorem proving. May be repeated to a maximum of six credits, but only three credits may be earned under the same topic.

Advanced topics chosen from the following: knowledge representation, knowledge acquisition, problem solving, very high-level programming languages, expert systems, intelligent and deductive databases, automated theorem proving. May be repeated to a maximum of six credits, but only three credits may be earned under the same topic.

CS