Write Algorithm to Decision-making for a wumpus hunter using influence maps. in: current room v ∈ V out: action
a ∈ {shoot, move}, u ∈ neighbourhood(v) constant: threshold ts for shooting an arrow local: influence maps bats, pit, wumpus, and visited (initially ∀ u ∈ V : bats(u) = pit(u) = wumpus(u) = visited(u) = 1)

Consider eight points on the Cartesian two-dimensional x-y plane. a g C For each pair of vertices u and v, the weight of edge uv is the Euclidean (Pythagorean) distance between those two points. For example, dist(a, h) : V4? + 1? = /17 and dist(a, b) = v2? + 0² = 2. Because many pairs of points have identical distances (e.g. dist(h, c) V5), the above diagram has more than one minimum-weight spanning tree. dist(h, b) = dist(h, f) Determine the total number of minimum-weight spanning trees that exist in the above diagram. Clearly justify your answer.

In these days, drones and robots are being used commercially to deliver the packages to aspecific location. A departmental store needs to develop an application so that when the sourceand destination is known, the robot/drone moves in the ordered direction by following the shortest path to keep delivering the package in a minimum amount of time. Initially store hasidentified few areas and a directed weighted graph G is made of with different routes.Here G = (V, E), where V is the set of locations as V = {H, A, B, C, D, E, F} and H is the sourcenode. E is the set of routes with weights (distances), shown in table with respective edges.Edge HA HB AC CF BD DF HE BE EC FEWeight 6 7 3 8 2 9 X 1 1 YHERE X=10 for EVEN roll# and X=5 for ODD roll# and Y= (roll# mod X) + 5Hint: Suppose roll# is 2018-CS-312, since 312 is even, X=10 and Y= (312 mod 10) + 5 = (2) + 5= 7You will need to cover following tasks1. Draw the graph G:2. Apply Dijkstra’s Algorithm and find out the Shortest Path3.…

Alert dont submit AI generated answer.