Search Problems
Artificial Intelligence
| Beginner
- 13 videos | 37m 11s
- Includes Assessment
- Earns a Badge
Many problems faced by intelligent agents can be solved using searching methods. Explore search problems and useful methods to solve these problems.
WHAT YOU WILL LEARN
-
Define search problems and how these can be used by ai agentsList some problems that are ideal for searching algorithmsDefine how to represent search problemsDescribe the breadth-first search algorithmDescribe the depth-first search algorithmDescribe depth-limited search and the iterative deepening search algorithmsDescribe the greedy approach for best-first informed searching
-
Define heuristics and their various propertiesDescribe how to create a good heuristic function for a given search problemDescribe the a* search algorithmDescribe local searching and the hill-climbing search algorithmDescribe the simulated annealing search algorithm and how it improves on hill-climbing searchDescribe the three environmental characteristics of search problems, state the function for a consistent heuristic, and state the function for an a* search
IN THIS COURSE
-
5m 27sIn this video, you will learn how to define search problems and how AI agents can use them. FREE ACCESS
-
3m 22sAfter completing this video, you will be able to list some problems that are ideal for search algorithms. FREE ACCESS
-
4m 19sIn this video, you will learn how to represent search problems. FREE ACCESS
-
2m 21sAfter completing this video, you will be able to describe the breadth-first search algorithm. FREE ACCESS
-
1m 30sAfter completing this video, you will be able to describe the depth-first search algorithm. FREE ACCESS
-
2m 58sAfter completing this video, you will be able to describe the depth-limited search and iterative deepening search algorithms. FREE ACCESS
-
3m 2sUpon completion of this video, you will be able to describe the greedy approach for best-first informed searching. FREE ACCESS
-
3m 49sFind out how to define heuristics and their various properties. FREE ACCESS
-
3m 19sUpon completion of this video, you will be able to describe how to create a good heuristic function for a given search problem. FREE ACCESS
-
1m 42sUpon completion of this video, you will be able to describe the A* search algorithm. FREE ACCESS
-
2m 8sAfter completing this video, you will be able to describe local searching and the hill-climbing search algorithm. FREE ACCESS
-
1m 46sUpon completion of this video, you will be able to describe the simulated annealing search algorithm and how it improves upon hill-climbing search. FREE ACCESS
-
1m 31sAfter completing this video, you will be able to describe the three environmental characteristics of search problems, state the function for a consistent heuristic, and state the function for an A* search. FREE ACCESS
EARN A DIGITAL BADGE WHEN YOU COMPLETE THIS COURSE
Skillsoft is providing you the opportunity to earn a digital badge upon successful completion on some of our courses, which can be shared on any social network or business platform.
Digital badges are yours to keep, forever.