Artificial intelligence project in jalandhar
-
Upload
deepikakaler1 -
Category
Education
-
view
83 -
download
4
description
Transcript of Artificial intelligence project in jalandhar
![Page 1: Artificial intelligence project in jalandhar](https://reader033.fdocument.pub/reader033/viewer/2022061118/5469d3d6af795925028b6167/html5/thumbnails/1.jpg)
CONTACT US ON- Address- Opp. Phagwara Bus Stand,Above Bella Pizza, Handa City Center,Phagwara
[email protected], [email protected]
Web site-www.e2matrix.com
Contact no-07508509730, 09041262727, 7508509709
![Page 2: Artificial intelligence project in jalandhar](https://reader033.fdocument.pub/reader033/viewer/2022061118/5469d3d6af795925028b6167/html5/thumbnails/2.jpg)
WHAT’S AI? (TO ME)
COMPUTERS MAKING DECISIONS IN REAL-WORLD PROBLEMS
apply
formulate solve
![Page 3: Artificial intelligence project in jalandhar](https://reader033.fdocument.pub/reader033/viewer/2022061118/5469d3d6af795925028b6167/html5/thumbnails/3.jpg)
SEARCH PROBLEMS
LET S BE THE SET OF STATES (STRINGS)
INPUT:
• INITIAL STATE: S0
• NEIGHBOR GENERATOR, N: S 2S
• GOAL FUNCTION, G: S {0,1}
![Page 4: Artificial intelligence project in jalandhar](https://reader033.fdocument.pub/reader033/viewer/2022061118/5469d3d6af795925028b6167/html5/thumbnails/4.jpg)
SEARCH ANSWER
S1,…,SN SUCH THAT:
• S1,…,SN S
• FOR ALL 1IN, SIN(SI-1)
• G(SN) 1
![Page 5: Artificial intelligence project in jalandhar](https://reader033.fdocument.pub/reader033/viewer/2022061118/5469d3d6af795925028b6167/html5/thumbnails/5.jpg)
EXAMPLES
WE’RE VERY IMPRESSED. MEANING?
• RUSH HOUR
• 8-PUZZLE
• LOGISTICS
• 8-QUEENS PROBLEM
• LOGIC PUZZLES
• JOB-SHOP SCHEDULING
![Page 6: Artificial intelligence project in jalandhar](https://reader033.fdocument.pub/reader033/viewer/2022061118/5469d3d6af795925028b6167/html5/thumbnails/6.jpg)
RUSH HOUR
MOVE CARS FORWARD AND BACKWARD TO “ESCAPE”
![Page 7: Artificial intelligence project in jalandhar](https://reader033.fdocument.pub/reader033/viewer/2022061118/5469d3d6af795925028b6167/html5/thumbnails/7.jpg)
SEARCH VERSION
STATES: CONFIGURATIONS OF CARS
N(S): REACHABLE
STATES
G(S): 1 IF RED
CAR AT GATE
![Page 8: Artificial intelligence project in jalandhar](https://reader033.fdocument.pub/reader033/viewer/2022061118/5469d3d6af795925028b6167/html5/thumbnails/8.jpg)
8-PUZZLE
SLIDE TILES INTO ORDER
STATES:
N(S):
G(S):
6
4
2 7
8 1
3 5
6
4
2 7
8 1
3 5
6
4
2 7
8 1
3 5
6 2 7
8 1
3 5
6
4
2 7
8 1
3
1 2 3
5 6
87
![Page 9: Artificial intelligence project in jalandhar](https://reader033.fdocument.pub/reader033/viewer/2022061118/5469d3d6af795925028b6167/html5/thumbnails/9.jpg)
LOGISTICS
VERY SOPHISTICATED. WHAT GOES WHERE WHEN?
DESERT STORM LOGISTICS “PAID FOR AI RESEARCH”
![Page 10: Artificial intelligence project in jalandhar](https://reader033.fdocument.pub/reader033/viewer/2022061118/5469d3d6af795925028b6167/html5/thumbnails/10.jpg)
8 QUEENS PUZZLE
NO CAPTURES
STATES:
N(S):
G(S):
![Page 11: Artificial intelligence project in jalandhar](https://reader033.fdocument.pub/reader033/viewer/2022061118/5469d3d6af795925028b6167/html5/thumbnails/11.jpg)
LOGIC PUZZLES
1. JODY, WHO IS AN APE, WASN’T THE APE WHO RETURNED IMMEDIATELY AFTER TOM AND IMMEDIATELY BEFORE THE ANIMAL WHO APPEARED IN THE MOVIE WITH NO RATING.
2. THE ONLY LIONS THAT WERE USED IN THE MOVIES WERE THE ONE WHO WAS THE THIRD TO RETURN, THE ONE WHO APPEARED IN THE R MOVIE, AND THE ONE WHO APPEARED IN “LUCK”. …
![Page 12: Artificial intelligence project in jalandhar](https://reader033.fdocument.pub/reader033/viewer/2022061118/5469d3d6af795925028b6167/html5/thumbnails/12.jpg)
JOB-SHOP SCHEDULING
INDUSTRIAL PROBLEM:
• ALLOCATE MACHINES AND MACHINISTS TO TIME SLOTS
• CONSTRAINTS ON ORDERS IN WHICH PARTS ARE SERVICED
![Page 13: Artificial intelligence project in jalandhar](https://reader033.fdocument.pub/reader033/viewer/2022061118/5469d3d6af795925028b6167/html5/thumbnails/13.jpg)
SEARCH TEMPLATE
• FRINGE = {(S0, 0)}; /* INITIAL COST */• MARKVISITED(S0);• WHILE (1) {
IF EMPTY(FRINGE), RETURN FAILURE;(S, C) = REMOVEMINCOST(FRINGE);IF G(S) RETURN S;FOREACH S’ IN N(S)
IF UNVISITED(S’)FRINGE = FRINGE U {(S’, COST(S’)};
MARKVISITED(S0);
}
![Page 14: Artificial intelligence project in jalandhar](https://reader033.fdocument.pub/reader033/viewer/2022061118/5469d3d6af795925028b6167/html5/thumbnails/14.jpg)
DATA STRUCTURES
HOW IMPLEMENT THIS EFFICIENTLY?
• REMOVEMINCOST-U-EMPTY?
• MARKVISITED-UNVISITED?
![Page 15: Artificial intelligence project in jalandhar](https://reader033.fdocument.pub/reader033/viewer/2022061118/5469d3d6af795925028b6167/html5/thumbnails/15.jpg)
VARY COST
HOW DOES SEARCH BEHAVIOR CHANGE WITH COST?
• COST(S’) = C + 1
• COST(S’) = C - 1
![Page 16: Artificial intelligence project in jalandhar](https://reader033.fdocument.pub/reader033/viewer/2022061118/5469d3d6af795925028b6167/html5/thumbnails/16.jpg)
GRID EXAMPLE: BFS
ss00
GG
ss00
GG
ss00
GG
ss00
GG
ss00
GG
ss00
GG
![Page 17: Artificial intelligence project in jalandhar](https://reader033.fdocument.pub/reader033/viewer/2022061118/5469d3d6af795925028b6167/html5/thumbnails/17.jpg)
GRID EXAMPLE: DFS
ss00
GG
ss00
GG
ss00
GG
ss00
GG
ss00
GG
ss00
GG
ss00
GG
ss00
GG
ss00
GG
ss00
GG
ss00
GG
![Page 18: Artificial intelligence project in jalandhar](https://reader033.fdocument.pub/reader033/viewer/2022061118/5469d3d6af795925028b6167/html5/thumbnails/18.jpg)
HOW EVALUATE?
WHAT MAKES ONE SEARCH SCHEME BETTER THAN ANOTHER?
• COMPLETENESS: FIND SOLUTION?
• TIME COMPLEXITY: HOW LONG?
• SPACE COMPLEXITY: MEMORY?
• OPTIMALITY: FIND SHORTEST PATH?
![Page 19: Artificial intelligence project in jalandhar](https://reader033.fdocument.pub/reader033/viewer/2022061118/5469d3d6af795925028b6167/html5/thumbnails/19.jpg)
DEPTH VS. BREADTH-FIRST
LET |T(S)| B (BRANCHING FACTOR), GOAL AT DEPTH D
• HOW IMPLEMENT PRIORITY QUEUE?
• COMPLETENESS?
• TIME COMPLEXITY?
• SPACE COMPLEXITY?
• OPTIMALITY?
![Page 20: Artificial intelligence project in jalandhar](https://reader033.fdocument.pub/reader033/viewer/2022061118/5469d3d6af795925028b6167/html5/thumbnails/20.jpg)
BFS
• COMPLETENESS?• YES
• TIME COMPLEXITY?• O(BD)
• SPACE COMPLEXITY?• O(BD)
• OPTIMALITY?• YES
![Page 21: Artificial intelligence project in jalandhar](https://reader033.fdocument.pub/reader033/viewer/2022061118/5469d3d6af795925028b6167/html5/thumbnails/21.jpg)
DFS
• COMPLETENESS?• YES, ASSUMING STATE SPACE FINITE
• TIME COMPLEXITY?• O(|S |), CAN DO WELL IF LOTS OF GOALS
• SPACE COMPLEXITY?• O(N), N DEEPEST POINT OF SEARCH
• OPTIMALITY?• NO
![Page 22: Artificial intelligence project in jalandhar](https://reader033.fdocument.pub/reader033/viewer/2022061118/5469d3d6af795925028b6167/html5/thumbnails/22.jpg)
DEPTH-LIMITED SEARCH
DFS, ONLY EXPAND NODES DEPTH L. • COMPLETENESS?
• NO, IF L D. • TIME COMPLEXITY?
• O(BL)• SPACE COMPLEXITY?
• O(L)• OPTIMALITY?
• NO
![Page 23: Artificial intelligence project in jalandhar](https://reader033.fdocument.pub/reader033/viewer/2022061118/5469d3d6af795925028b6167/html5/thumbnails/23.jpg)
ITERATIVE DEEPENING
DEPTH LIMITED, INCREASING L. • COMPLETENESS?
• YES. • TIME COMPLEXITY?
• O(BD), EVEN WITH REPEATED WORK! • SPACE COMPLEXITY?
• O(D) • OPTIMALITY?
• YES
![Page 24: Artificial intelligence project in jalandhar](https://reader033.fdocument.pub/reader033/viewer/2022061118/5469d3d6af795925028b6167/html5/thumbnails/24.jpg)
BIDIRECTIONAL SEARCH
BFS IN BOTH DIRECTIONS
NEED N-1
HOW COULD THIS HELP?
• BL VS 2BL/2
WHAT MAKES THIS HARD TO IMPLEMENT?
![Page 25: Artificial intelligence project in jalandhar](https://reader033.fdocument.pub/reader033/viewer/2022061118/5469d3d6af795925028b6167/html5/thumbnails/25.jpg)
WHICH DO YOU CHOOSE?
• 8-QUEENS, NEIGHBORS OF S ADD ONE QUEEN TO BOARD
![Page 26: Artificial intelligence project in jalandhar](https://reader033.fdocument.pub/reader033/viewer/2022061118/5469d3d6af795925028b6167/html5/thumbnails/26.jpg)
WHICH DO YOU CHOOSE?
• BIG GRID, GOAL NEARBY
![Page 27: Artificial intelligence project in jalandhar](https://reader033.fdocument.pub/reader033/viewer/2022061118/5469d3d6af795925028b6167/html5/thumbnails/27.jpg)
WHAT TO LEARN
HOW TO EXPRESS PROBLEMS IN THE SEARCH FRAMEWORK
THE BASIC ALGORITHMS FOR SEARCH
STRENGTHS AND WEAKNESSES OF THE BASIC ALGORITHMS