Fall 2024 - CMPT 417 D100
Intelligent Systems (3)
Class Number: 6294
Delivery Method: In Person
Overview
-
Course Times + Location:
Sep 4 – Dec 3, 2024: Thu, 11:30 a.m.–2:20 p.m.
Burnaby
-
Instructor:
Hang Ma
hangma@sfu.ca
-
Prerequisites:
CMPT 225 with a minimum grade of C-.
Description
CALENDAR DESCRIPTION:
Intelligent Systems using modern constraint programming and heuristic search methods. A survey of this rapidly advancing technology as applied to scheduling, planning, design and configuration. An introduction to constraint programming, heuristic search, constructive (backtrack) search, iterative improvement (local) search, mixed-initiative systems and combinatorial optimization.
COURSE DETAILS:
Many real computing applications involve computational problems for which no generally efficient algorithms are known. These problems often involve relatively small inputs, but astronomically-sized search spaces in which solutions may be well hidden. Developing practical software for solving these problems is challenging and costly. This course examines methods for automatically solving these problems based on high-level specifications, much as we use a query language rather than low-level algorithms to answer complex questions about a large data set. The course will pursue two tracks in parallel. In one, we will examine the design and use of real systems that are products of major companies or widely used research tools, including hands-on experience. In the other, we will develop formal foundations to support principled design and analysis of such systems and their use in critical applications, and to understand their strengths and limitations. We will begin with lectures on fundamentals, and toward the end shift to considering current issues and research directions. The course is suitable for students with an interest in research or in tackling problems that are not well solved. A strong discrete math and algorithm background is recommended. Ideally, students should have taken CMPT-307 and CMPT-310, or at least have MACM-201. The individual project requires knowledge of Python programming.
Topics
- Intractable AI and optimization problems
- Improved versions of best-first search, bounded-suboptimal search, local search, etc.
- Advanced techniques: Generating complex heuristics, pattern databases, bidirectional and dual searches, etc.
- A case study of the multi-agent pathfinding problem
- Applications in planning, multi-agent/robot systems, games, etc.
Grading
NOTES:
Individual Project (20%), Late Midterm Exam (30%), Final Project (50%).
Materials
RECOMMENDED READING:
Artificial Intelligence: A Modern Approach
- Third Edition
- Stuart Russell and Peter Norvig
- Pearson/Prentice Hall
ISBN: 9780136042594
REQUIRED READING NOTES:
Your personalized Course Material list, including digital and physical textbooks, are available through the SFU Bookstore website by simply entering your Computing ID at: shop.sfu.ca/course-materials/my-personalized-course-materials.
Registrar Notes:
ACADEMIC INTEGRITY: YOUR WORK, YOUR SUCCESS
SFU’s Academic Integrity website http://www.sfu.ca/students/academicintegrity.html is filled with information on what is meant by academic dishonesty, where you can find resources to help with your studies and the consequences of cheating. Check out the site for more information and videos that help explain the issues in plain English.
Each student is responsible for his or her conduct as it affects the university community. Academic dishonesty, in whatever form, is ultimately destructive of the values of the university. Furthermore, it is unfair and discouraging to the majority of students who pursue their studies honestly. Scholarly integrity is required of all members of the university. http://www.sfu.ca/policies/gazette/student/s10-01.html
RELIGIOUS ACCOMMODATION
Students with a faith background who may need accommodations during the term are encouraged to assess their needs as soon as possible and review the Multifaith religious accommodations website. The page outlines ways they begin working toward an accommodation and ensure solutions can be reached in a timely fashion.