
Explore the fundamentals of artificial intelligence, from intelligent agents and problem solving to searching methods like breadth-first and A* search, plus supervised, unsupervised and reinforcement learning, neural networks, and ethics.
Explore AI applications to enhance problem solving in artificial intelligence through practical strategies and real-world use cases.
Explore problem solving agents in artificial intelligence and their role in solving tasks in practice.
Explore how search algorithms solve problems in artificial intelligence, applying problem-solving strategies to navigate solution spaces efficiently.
Investigate uninformed search algorithms within problem solving in artificial intelligence. Understand how these algorithms contribute to finding solutions in artificial intelligence challenges.
Explore local search algorithms for optimization in large spaces, including hill climbing, simulated annealing, local beam search, genetic algorithms, and tabu search, with state space, neighborhood, and objective function concepts.
Explore constraint satisfaction problems (CSPs), where you assign values to variables within domains to satisfy constraints and applying backtracking, constraint propagation, and heuristics to real-world tasks like scheduling and sudoku.
Explore how uncertainty arises from incomplete data and ambiguity in ai, and how probabilistic and fuzzy methods, Bayesian networks, Monte Carlo, and mdps build robust, explainable ai for autonomous systems.
Explore Bayesian networks, their components, and exact and approximate inference methods, including causal networks, with real-time applications in medicine, weather, robotics, and fraud detection.
This course will teach you about the basic problem-solving and search algorithms used in Artificial Intelligence (AI). They will learn how to model difficult problems and use uninformed and informed search methods to find good solutions. Uninformed search methods, like Breadth-First Search and Depth-First Search, will be presented as organized ways to look into problem spaces without knowing much about them beforehand. On the other hand, smart search algorithms like A* and Greedy Best-First Search will show how rules can help people solve problems quickly. Constraint Satisfaction Problems (CSPs) are also covered in the course. Students learn to use variables, domains, and constraints to model and answer real-world problems. Methods like backtracking, forward checking, and heuristic ordering will be discussed to improve answers. Students will work on real-world problems like pathfinding, scheduling, and optimization while learning how to judge the success of an algorithm in terms of how complete, optimal, and efficient it is. Students will be able to formalize problems, choose the right algorithms, and put AI-based answers into action by the end of the course. This class is great for people who want to learn a lot about AI problem-solving, which is used in robotics, game creation, and systems that make decisions.