May 2018
Beginner
490 pages
13h 16m
English
The prototype shows a simulation of an itinerary graph based on the SVM recommendations and its weight vector through the following function call:
421:print("SAFE PASSAGE SUGGESTED")MDP_GRAPH(lr,e)
The following graph displays the safest itinerary in red even if it takes longer (time or distance):

For the purpose of the prototype, the SVM was not directly connected to the graph, which would require costly hours. Instead, the following random.randint function was inserted, which simulates the random availability of parking space anyway:
417:for wi in range(6): op=random.randint(0,5) if(W[op]>maxw): lr=op;maxw=W[op] ...
Read now
Unlock full access