Artificial Intelligence Jiangxi University of Technology Luo Huilan

Main content: definition of artificial intelligence, tree search algorithm, information-free search strategy, heuristic search strategy, constraint satisfaction problem solving, game algorithm, Bayesian network, hidden Markov model, Kalman filter.

Features: The teaching time of the artificial intelligence course in the school is 32 hours. It is a required professional course for master's degree students in computer science and technology. Since the basic theory of artificial intelligence involves intelligent search, reasoning, machine learning, etc., it is an essential theoretical foundation for various research directions of current information graduate students, and can lay a good foundation for students to conduct in-depth research in various directions. The ideas can be applied to pattern recognition, intelligent analysis and processing of images and videos, data mining and intelligent processing applications of various information. Since the course teaching focuses on the description of algorithms, students will not find it boring and can master intelligent ideas well through practical exercises combined with programming.

• Chapter 1：artificial intelligence concept (12 minutes and 25 seconds)

• Chapter 2：What is a rational agent (12 minutes and 7 seconds)

• Chapter 3：problem solving agent (8 minutes and 15 seconds)

• Chapter 4：problem formalization (9 minutes and 55 seconds)

• Chapter 5：tree search algorithm (9 minutes and 23 seconds)

• Chapter 6：Implementation of tree search algorithm (14 minutes and 1 seconds)

• Chapter 7：search strategy (8 minutes and 57 seconds)

• Chapter 8：Breadth first search (15 minutes and 11 seconds)

• Chapter 9：Uniform cost search (7 minutes and 19 seconds)

• Chapter 10：depth first search (15 minutes and 45 seconds)

• Chapter 11：limited depth search (17 minutes and 38 seconds)

• Chapter 12：Iterative deep search (15 minutes and 11 seconds)

• Chapter 13：Iterative deep search performance analysis (9 minutes and 26 seconds)

• Chapter 14：Summary of information-free search strategies (14 minutes and 35 seconds)

• Chapter 15：greedy search algorithm (17 minutes and 49 seconds)

• Chapter 16：star search algorithm (10 minutes and 41 seconds)

• Chapter 17：Optimality of star search algorithm (11 minutes and 40 seconds)

• Chapter 18：Adoptable heuristic functions (15 minutes and 6 seconds)

• Chapter 19：Hill Climbing Search Algorithm (16 minutes and 51 seconds)

• Chapter 20：simulated annealing search algorithm (11 minutes and 19 seconds)

• Chapter 21：genetic algorithm (17 minutes and 55 seconds)

• Chapter 22：What is a constraint satisfaction problem? (15 minutes and 27 seconds)

• Chapter 23：A standard search formalization for constraint satisfaction problems (12 minutes and 43 seconds)

• Chapter 24：Backtracking search algorithm (17 minutes and 13 seconds)

• Chapter 25：Variable assignment order strategy for backtracking search (16 minutes and 12 seconds)

• Chapter 26：Forward checking and constraint propagation for backtracking search (15 minutes and 33 seconds)

• Chapter 27：AC-3 Arc Consistency Algorithm (12 minutes and 52 seconds)

• Chapter 28：Local Search Method for Constraint Satisfaction Problems (12 minutes and 16 seconds)

• Chapter 29：Game and Minimax Concepts (16 minutes and 22 seconds)

• Chapter 30：Minimax decision algorithm (15 minutes and 13 seconds)

• Chapter 31：The concept of pruning (10 minutes and 27 seconds)

• Chapter 32：alpha-beta algorithm (14 minutes and 23 seconds)

• Chapter 33：alpha-beta pruning example (14 minutes and 42 seconds)

• Chapter 34：Imperfect real-time decisions (14 minutes and 38 seconds)

• Chapter 35：Uncertainty quantification (10 minutes and 8 seconds)

• Chapter 36：Inference using the complete joint distribution (9 minutes and 46 seconds)

• Chapter 37：Bayes' rule and its applications (11 minutes and 27 seconds)

• Chapter 38：Bayesian Network Inference (13 minutes and 33 seconds)

• Chapter 39：Hidden Markov Model (16 minutes and 27 seconds)

• Chapter 40：Kalman filter (6 minutes and 29 seconds)