IMPLEMENTATION OF SHORTEST PATHALGORITHM IN A GIVEN MAZE AND STUDYINGTHE ALGORITHM’S TIME AND SPACECOMPLEXITY        By- A...
THE SEARCH SPACE We have implemented an algorithm for finding  the shortest path avoiding obstacles and dis-  continuity ...
THE APPROACH The approach includes feature extraction from  an image of the search space i.e. lines, nodes  and obstacles...
 An optimum path is produced by minimizing the  cost function taking into account the catenated  matrix of the nodes and ...
A FLOWCHART FOR MAKING A CATENATED MATRIXOF NODES
A FLOWCHART FOR MAKING THE ADJACENCYMATRIX
SAMPLE SEARCH SPACES WITH ASSOCIATEDOPTIMUM PATH FROM SOURCE                Figure 1
Figure 2   Figure 3
GRAPH DEPICTING VARIATION OF COMPUTATIONTIME FOR BFS SEARCH WITH DEPTH OF GOAL NODE
GRAPH DEPICTING VARIATION OF COMPUTATIONTIME FOR DFS SEARCH WITH DEPTH OF GOAL NODE
THANK YOU!
Upcoming SlideShare
Loading in...5
×

Implementation of shortest path algorithm in a given

1,480
-1

Published on

Published in: Education
0 Comments
0 Likes
Statistics
Notes
  • Be the first to comment

  • Be the first to like this

No Downloads
Views
Total Views
1,480
On Slideshare
0
From Embeds
0
Number of Embeds
0
Actions
Shares
0
Downloads
34
Comments
0
Likes
0
Embeds 0
No embeds

No notes for slide

Implementation of shortest path algorithm in a given

  1. 1. IMPLEMENTATION OF SHORTEST PATHALGORITHM IN A GIVEN MAZE AND STUDYINGTHE ALGORITHM’S TIME AND SPACECOMPLEXITY By- Abhas Vyas Guide- Prof. G.R Brindha
  2. 2. THE SEARCH SPACE We have implemented an algorithm for finding the shortest path avoiding obstacles and dis- continuity in a search space which is a single source single destination type. The initial point is in red and the final point is in green.
  3. 3. THE APPROACH The approach includes feature extraction from an image of the search space i.e. lines, nodes and obstacles. Thereafter, finding the adjacency matrix of each node based on Euclidean distance and pixel information of the path between the nodes. The graph created for the implementation is labeled and is of variable branching factor and for which an average branching factor is calculated.
  4. 4.  An optimum path is produced by minimizing the cost function taking into account the catenated matrix of the nodes and path connecting them. The optimum path is obtained by applying Breadth-first Search, Depth-first Search and A* algorithm and their time and space complexity are compared.
  5. 5. A FLOWCHART FOR MAKING A CATENATED MATRIXOF NODES
  6. 6. A FLOWCHART FOR MAKING THE ADJACENCYMATRIX
  7. 7. SAMPLE SEARCH SPACES WITH ASSOCIATEDOPTIMUM PATH FROM SOURCE Figure 1
  8. 8. Figure 2 Figure 3
  9. 9. GRAPH DEPICTING VARIATION OF COMPUTATIONTIME FOR BFS SEARCH WITH DEPTH OF GOAL NODE
  10. 10. GRAPH DEPICTING VARIATION OF COMPUTATIONTIME FOR DFS SEARCH WITH DEPTH OF GOAL NODE
  11. 11. THANK YOU!
  1. A particular slide catching your eye?

    Clipping is a handy way to collect important slides you want to go back to later.

×