What means Scheduling in terms of AI?

What means Scheduling in terms of AI?

- How long action takes and When it occurs

- Multiple activities / Constraints

What means Planning in terms of AI?

What means Planning in terms of AI?

- planning what to do and in what order

Example: STRIPS

- automated planning computer system (moving blocks)

- set of actions (move one block at a time) and constraints (block x cannot be on block y)

What are the advantages of Constraint Programming?

What are the advantages of Constraint Programming?

- solve problems more efficiently
- eliminate large portions of Search Space makes the computation faster

Explain the A* search.

Explain the A* search.

- expands most promising paths first
- avoids expanding paths that are, from the beginning, already expensive

- at each step it picks the node using the sum of two other parameters:
g = the movement cost to move from the starting point to a given square
h = the estimated movement cost to move from that given square on the grid to the final destination.

Explain the Heuristic search and two different types of it.

Explain the Heuristic search and two different types of it.

- take the most promising node

- is a way to inform the search about the direction to a goal

Greedy search - best-first

- Takes the best path, from a local point of view

- Greedy - At each step - tries to get as close to the goal as possible

- When a step is taken - Never goes back!

Hill climbing

-Mathematica optimization

-Start with initial solution and pick neighboring solutions and evaluate them

Explain the bidirectional search.

Explain the bidirectional search.

Two simultaneous searches
- From initial state
- From goal state
-> Test if the searches meet = solution

For the goal state - requires a method for computing predecessors. "to search backwards from goal"

Explain depth-first search.

Explain depth-first search.

From the root node:
- explores the deepest nodes first (last generated node)
- moves towards the next deepest node.

Implemented using LIFO queue data structure.

Disadvantage - may not terminate = go into infinitely on one path not guaranteed to find the shortest path - unless it goes through
the whole tree.

Explain breadth-first search and disadvantages of it.

Explain breadth-first search and disadvantages of it.

From the root node:
- explores the neighbor nodes first
- moves towards the next level neighbors.

Implemented using FIFO queue data structure

Disadvantage - each level of nodes is saved for creating next one = consumes a lot of memory space and time

What is the difference between weak AI and strong AI and Super AI?

What is the difference between weak AI and strong AI and Super AI?

Weak AI:
- simulates thinking
- reasons and solves problems within a domain
- uses models for problem-solving

Strong AI:
- demonstrates "human-like" intelligence
- performs intelligent /intellectual tasks
- "Think on a level with humans"
- Learns (Machine Learning)
- has self-awareness

Super AI:
- an intellect that is much smarter than the best human brains in practically every field

Briefly describe the Turing Test.

Briefly describe the Turing Test.

Briefly describe the Turing Test.

- hidden computer A and a person B converse with another person C
- If C is unable to distinguish which he is conversing with, then the computer can be said to be able to "think"