Главная
Study mode:
on
1
- Intro
2
- A2 Demo
3
- Powerpoint Start
4
- New in Assignment 2
5
- Environment and Action Costs
6
- Legal Actions
7
- Diagonal / Cardinal Action Relationship
8
- Paths
9
- Heuristic Functions
10
- Connected States
11
- Computing Connectivity
12
- Connectivity Check / canFit
13
- Connected Sector Sizes
14
- Optimization: Connected Sector Checking
15
- Optimization: Legal Action Relationship
16
- Optimization: Legal Action Precomputation
17
- Optimization: Closed List Grid
18
- Optimization: Open List BinaryHeap
19
- Optimization: BFS Queue Simulation
20
- Tie-Breaking F Values
21
- Bidirectional Search
22
- Assignment Code
23
- Search_Student.js
24
- Bidirectional Search Optimality
25
- Marking Scheme
Description:
Save Big on Coursera Plus. 7,000+ courses at $160 off. Limited Time Only! Grab it Explore a comprehensive lecture on artificial intelligence focusing on Assignment 2 topics. Delve into environment and action costs, legal actions, diagonal and cardinal action relationships, paths, and heuristic functions. Learn about connected states, computing connectivity, and various optimization techniques including connected sector checking, legal action relationships, and precomputation. Discover the intricacies of closed list grids, open list binary heaps, and BFS queue simulation. Examine tie-breaking F values and bidirectional search, including its optimality. Gain insights into the assignment code, particularly Search_Student.js, and understand the marking scheme. This lecture, part of the COMP6980 Intro to Artificial Intelligence course at Memorial University, provides essential knowledge for tackling Assignment 2 and deepening your understanding of AI problem-solving techniques.

Introduction to Artificial Intelligence - Assignment 2 Overview - Lecture 7

Dave Churchill
Add to list
0:00 / 0:00