Admissible heuristic: A heuristic h(s) is admissible, if for every node n, h ( s ) ≤ h * ( s ) is the true cost to reach the goal state from n An admissible heuristic never over estimates the cost to reach the goal. That is optimistic. Sensorless search problem defines by four items. That are given below, 1. Initial state 2. Description of action: successor function h(s) = set of action-state pairs 3. Goal test, can be Explicit Implicit 4 Path cost. It reflects the performance measure. An admissible heuristic can be obtained by taking maximum of h*(s). Since any sequences of actions that solve all states would solve each state, this heuristic is admissible. Inconsistent heuristic: A heuristic function is said to be inconsistent in the analysis of path-finding problems in artificial intelligence , if its approximation is always greater than to the approximate distance from any neighbouring vertex to the target. Inconsistent heuristic can be represented as, h ( N ) > c ( N , p ) + h ( p ) where, h is the consistent heuristic function N is any node of the graph P is any decedent of N G is the goal node c(N,P) is the cost of reaching node P from N

Question

Assume that a string of name & surname is saved in S. The alphabetical characters in S can be in lowercase and/or uppercase letters. Name and surname are assumed to be separated by a space character and the string ends with a full stop "." character. Write an assembly language program that will copy the name to NAME in lowercase and the surname to SNAME in uppercase letters. Assume that name and/or surname cannot exceed 20 characters. The program should be general and work with every possible string with name & surname. However, you can consider the data segment definition given below in your program. .DATA S DB 'Mahmoud Obaid." NAME DB 20 DUP(?) SNAME DB 20 DUP(?) Hint: Uppercase characters are ordered between 'A' (41H) and 'Z' (5AH) and lowercase characters are ordered between 'a' (61H) and 'z' (7AH) in the in the ASCII Code table. For lowercase letters, bit 5 (d5) of the ASCII code is 1 where for uppercase letters it is 0. For example, Letter 'h' Binary ASCII 01101000 68H 'H'…

Answer 1

Question

Chapter 3, Problem 29E

Program Plan Intro

Admissible heuristic:

A heuristic h(s) is admissible, if for every node n, h(s)≤h(s) is the true cost to reach the goal state from n

An admissible heuristic never over estimates the cost to reach the goal. That is optimistic. Sensorless search problem defines by four items. That are given below,

1. Initial state

2. Description of action: successor function h(s) = set of action-state pairs

3. Goal test, can be

Explicit

Implicit

4 Path cost. It reflects the performance measure.

An admissible heuristic can be obtained by taking maximum of h(s). Since any sequences of actions that solve all states would solve each state, this heuristic is admissible.

Inconsistent heuristic:

A heuristic function is said to be inconsistent in the analysis of path-finding problems in artificial intelligence, if its approximation is always greater than to the approximate distance from any neighbouring vertex to the target.

Inconsistent heuristic can be represented as,

h(N)>c(N,p)+h(p)

where,

h is the consistent heuristic function

N is any node of the graph

P is any decedent of N

G is the goal node

c(N,P) is the cost of reaching node P from N

Expert Solution & Answer

Trending nowThis is a popular solution!

See solution

Check out sample textbook solution

Students have asked these similar questions

Assume that a string of name & surname is saved in S. The alphabetical characters in S can be in lowercase and/or uppercase letters. Name and surname are assumed to be separated by a space character and the string ends with a full stop "." character. Write an assembly language program that will copy the name to NAME in lowercase and the surname to SNAME in uppercase letters. Assume that name and/or surname cannot exceed 20 characters. The program should be general and work with every possible string with name & surname. However, you can consider the data segment definition given below in your program. .DATA S DB 'Mahmoud Obaid." NAME DB 20 DUP(?) SNAME DB 20 DUP(?) Hint: Uppercase characters are ordered between 'A' (41H) and 'Z' (5AH) and lowercase characters are ordered between 'a' (61H) and 'z' (7AH) in the in the ASCII Code table. For lowercase letters, bit 5 (d5) of the ASCII code is 1 where for uppercase letters it is 0. For example, Letter 'h' Binary ASCII 01101000 68H 'H'…

What did you find most interesting or surprising about the scientist Lavoiser?

1. Complete the routing table for R2 as per the table shown below when implementing RIP routing Protocol? (14 marks) 195.2.4.0 130.10.0.0 195.2.4.1 m1 130.10.0.2 mo R2 R3 130.10.0.1 195.2.5.1 195.2.5.0 195.2.5.2 195.2.6.1 195.2.6.0 m2 130.11.0.0 130.11.0.2 205.5.5.0 205.5.5.1 R4 130.11.0.1 205.5.6.1 205.5.6.0