0 3 / 0 2 / 2 0 2 2 S i n h g a d C o l l e g e o f E n g i n e e r i n g 1 Presented by…………… Ashwini More B8238586 Punam Nerkar B8238589 Ramola Nikam B8238591 Hierarchical Optimization of Optimal Path Finding for Transportation Applications SINHGAD COLLEGE OF ENGINEERING, PUNE – 41 DEPARTMENT OF INFORMATION TECHNOLOGY
Welcome message from author
This document is posted to help you gain knowledge. Please leave a comment to let me know what you think about it! Share it to your friends and learn new things together.
Transcript
05/01/2023Sinhgad College of Engineering
1Presented by……………
Ashwini More B8238586Punam Nerkar B8238589Ramola Nikam B8238591Shradha Pidhekar B8238605
Hierarchical Optimization of Optimal Path Finding for
Transportation Applications
SINHGAD COLLEGE OF ENGINEERING, PUNE – 41
DEPARTMENT OF INFORMATION TECHNOLOGY
05/01/2023
2
Sinhgad College of Engineering
PROJECT DETAILS
Group No : 28
Category : In house
Project Area : Data Structures
Project Platform : Windows, JAVA
Guided By…...
Prof. U.R.GODASE
05/01/2023
3
Sinhgad College of Engineering
AGENDA Introduction Literature Survey Problem Statement Project Scope Project Analysis Project Design Implementation(Algorithms) Project Plan Conclusions References
05/01/2023
4
Sinhgad College of Engineering
INTRODUCTION
Efficient path query processing
Study the problem in the context of automobile navigation systems
Precomputing Technique were used
Proposed HEPV
05/01/2023
5
Sinhgad College of Engineering
LITERATURE SURVEYSr.no
Dijkstra Transitive Closure
Hierarchical A*
HEPV
1 On demand Precompute Both Precompute and On demand
Both Precompute and On demand
2 No Fragments
No Fragments
Fragments Fragments
3 No OptimalityGuaranteed
No OptimalityGuaranteed
No OptimalityGuaranteed
OptimalityGuaranteed
4 Can’t handle Large graph
Can handle Huge graph
Can handle Huge graph
Can handle Huge graph
05/01/2023
6
Sinhgad College of Engineering
PROBLEM STATEMENT
To find an optimal path for an individual to travel in an alien place such that intermediate nodes are revealed.
05/01/2023Sinhgad College of Engineering
7
PROJECT SCOPE
Propose a hierarchical graph
model
Complete computation of paths
on-demand and precomputed
paths.
05/01/2023
8
ENCODED PATH VIEW STRUCTURE
Sinhgad College of Engineering
05/01/2023
9
Sinhgad College of EngineeringENCODED PATH VIEW
STRUCTURE
a
b c e
d2
3 4
c 2
4
6
PATH a-e
PROPOSED ALGORITHM : HEPV05/01/2023
10
Sinhgad College of Engineering
05/01/2023
11
PROPOSED ALGORITHM : HEPVSinhgad College of Engineering
Border Nodes
Local Nodes
05/01/2023
12
Sinhgad College of Engineering
PROJECT ANALYSIS
Use Case Level 1 Diagram
Additional Diagrams
05/01/2023
13
Sinhgad College of Engineering
PROJECT DESIGN
Data Flow Diagram
Entity Relationship Diagram
Sequence Diagram
State Transition Diagram
05/01/2023
14
Sinhgad College of EngineeringDATA FLOW DIAGRAM
Create Partition
Check Source &
destinationRetrieve
Path
Extract Border Nodes
User
Create supergraph
GUI
Flat Grap
h
Source and destination
Partition
Status ofSource andDestination
Minimum weight and path
BorderNodes
SupergraphPartition
SupergraphPartition
Source & destination
Source & destination
15
Sinhgad College of EngineeringENTITY RELATIONSHIP DIAGRAM
05/01/2023
PARTITION
SOURCE
HOP1
FLAT GRAPH
DEST WEIGHT
HOP
CREATE
SRC
DESTI
LWEIGHT
SUPERGRAPH
SOURCE1
DEST1
WEIGHT1
HOP2
PART NO
CREATE
* 1
*
1
05/01/2023
16
Sinhgad College of Engineering
SEQUENCE DIAGRAM
sd Sequence Diagram Model
User System Partition Supergraph
Path Retrieval
alt
[if source/destination is border node]
[if source/destination is local node]
create_partition
get_border_node
check_link
get_min_wt_and_hop
encode_supergraph
enter_ source_destination
submit_source_destination
retrieve_path
retrieve_path
submit_optimal_path
display_optimal_path
05/01/2023
17
Sinhgad College of Engineering
STATE DIAGRAM
stm State Diagram
Accepting source and destination
Searching source and destination
Searching in partition
Searching in Supergraph
Path retriev ed
Final
start
not found
not found
found
05/01/2023
18
Sinhgad College of EngineeringHEPV CREATION
ALGORITHM
05/01/2023
19
Sinhgad College of Engineering
3
7
4 5
1
51 6
2
4 45
1
HEPV CREATION ALGORITHM
05/01/2023
20
Sinhgad College of EngineeringHEPV CREATION
ALGORITHM
05/01/2023
21
Sinhgad College of Engineering
PATH RETRIEVAL ALGORITHM
05/01/2023
22
Sinhgad College of EngineeringCASE 1
Source Node : Border NodeDestination Node: Border Node
3
7
4 5
1
51 6
2
4 45
1
05/01/2023
23
Sinhgad College of EngineeringCASE 2
Source Node : Border NodeDestination Node: Local Node
3
7
4 5
1
51 6
2
4 45
1
05/01/2023
24
Sinhgad College of EngineeringCASE 3
Source Node : Local NodeDestination Node: Border Node
3
7
4 5
1
51 6
2
4 45
1
05/01/2023
25
Sinhgad College of EngineeringCASE 4
Source Node : Local NodeDestination Node: Local Node
3
7
4 5
1
51 6
2
4 45
1
05/01/2023
26
Sinhgad College of Engineering
HEPV UPDATE ALGORITHM
05/01/2023
27
Sinhgad College of Engineering
PROJECT PLAN Gantt Chart-I
Gantt Chart-II
Project Plan
05/01/2023
28
Sinhgad College of Engineering
CONCLUSIONS
Hierarchical graph model (HEPV) exploits path retrieving strategies
Algorithms are developed to create and maintain HEPV
Shortest path retrieval algorithm developed which can be shown to be optimal
REFERENCES
[1] Ning Jing, Yun-Wu Huang, Elke Rundensteiner, “Hierarchical Optimization of Optimal Path Finding for Transportation Applications.”,pp. 1-8.
[2] R. Agrawal, S. Dar and H. V. Jagadish, “Direct Transitive Closure Algorithms: Design and Performance Evaluation,” ACM TODS, Vol. 15, No. 3, Sep. 1990, pp. 427 – 458.
05/01/2023
29
Sinhgad College of Engineering
05/01/2023
30
Sinhgad College of Engineering
REFERENCES
[3] R. Agrawal and H. V. Jagadish, “Hybrid Transitive Closure Algorithms,” Proc. of the 16th VLDB Conf., 1990, pp. 326 – 334.
[4] T. Cormen, C. Leiserson, and R. L. Rivest, “Introduction to Algorithms,” The MIT Press, 1993.
05/01/2023Sinhgad College of Engineering
31
Thank You…
Related Documents
