Search Problems

Artificial Intelligence    |    Beginner
  • 13 videos | 37m 11s
  • Includes Assessment
  • Earns a Badge
Rating 4.4 of 178 users Rating 4.4 of 178 users (178)
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 agents
    List some problems that are ideal for searching algorithms
    Define how to represent search problems
    Describe the breadth-first search algorithm
    Describe the depth-first search algorithm
    Describe depth-limited search and the iterative deepening search algorithms
    Describe the greedy approach for best-first informed searching
  • Define heuristics and their various properties
    Describe how to create a good heuristic function for a given search problem
    Describe the a* search algorithm
    Describe local searching and the hill-climbing search algorithm
    Describe the simulated annealing search algorithm and how it improves on hill-climbing search
    Describe 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 27s
    In this video, you will learn how to define search problems and how AI agents can use them. FREE ACCESS
  • 3m 22s
    After completing this video, you will be able to list some problems that are ideal for search algorithms. FREE ACCESS
  • Locked
    3.  Representing Search Problems for Search Algorithms
    4m 19s
    In this video, you will learn how to represent search problems. FREE ACCESS
  • Locked
    4.  Breadth-First Search
    2m 21s
    After completing this video, you will be able to describe the breadth-first search algorithm. FREE ACCESS
  • Locked
    5.  Depth-First Search
    1m 30s
    After completing this video, you will be able to describe the depth-first search algorithm. FREE ACCESS
  • Locked
    6.  Iterative Deepening Search
    2m 58s
    After completing this video, you will be able to describe the depth-limited search and iterative deepening search algorithms. FREE ACCESS
  • Locked
    7.  Greedy Best-First Search
    3m 2s
    Upon completion of this video, you will be able to describe the greedy approach for best-first informed searching. FREE ACCESS
  • Locked
    8.  Heuristics
    3m 49s
    Find out how to define heuristics and their various properties. FREE ACCESS
  • Locked
    9.  Making Good Heuristics
    3m 19s
    Upon completion of this video, you will be able to describe how to create a good heuristic function for a given search problem. FREE ACCESS
  • Locked
    10.  A* Search
    1m 42s
    Upon completion of this video, you will be able to describe the A* search algorithm. FREE ACCESS
  • Locked
    11.  Hill-Climbing Search
    2m 8s
    After completing this video, you will be able to describe local searching and the hill-climbing search algorithm. FREE ACCESS
  • Locked
    12.  Simulated Annealing
    1m 46s
    Upon 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
  • Locked
    13.  Exercise: Describe Search Problems
    1m 31s
    After 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.

YOU MIGHT ALSO LIKE

Rating 4.6 of 65 users Rating 4.6 of 65 users (65)
Rating 4.5 of 1358 users Rating 4.5 of 1358 users (1358)
Rating 4.7 of 13 users Rating 4.7 of 13 users (13)

PEOPLE WHO VIEWED THIS ALSO VIEWED THESE

Rating 4.3 of 543 users Rating 4.3 of 543 users (543)
Rating 4.4 of 208 users Rating 4.4 of 208 users (208)
Rating 4.3 of 181 users Rating 4.3 of 181 users (181)