Map navigation system based on optimal Dijkstra algorithm

Ruan, Chuang; Luo, Jianping; Wu, Yu Cheng

doi:10.1109/ccis.2014.7175798

Cited by 12 publications

(6 citation statements)

References 0 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Algoritme Dijkstra adalah algoritme yang umum digunakan untuk menyelesaikan masalah terkait rute perjalanan dalam sebuah peta (Zhou, 2019) yang dimodelkan dengan struktur data graf. Penelitian yang dilakukan Salem (2022) menerapkan algoritme Dijkstra dalam menentukan jadwal rute penerbangan pesawat termasuk beberapa penelitian serupa terkait sistem navigasi, baik indoor maupun outdoor, yang menerapkan algoritme Dijkstra juga banyak diteliti oleh beberapa penelitian lainnya (Parulekar, 2013;Ruan, 2014;Xu, 2015;Singh, 2018;Sujatha, 2020;Samah, 2020;Friaswanto, 2021;Nayagam, 2023). Dengan demikian, algoritme Dijkstra ini tepat digunakan sebagai metode yang digunakan untuk menentukan rute perjalanan angkutan umum di Kota Malang yang diteliti dalam penelitian ini.…”

Section: Algoritme Dijkstra Dalam Penentuan Rute Terpendek Transporta...unclassified

Peningkatan Performa Komputasi Sistem Navigasi Transportasi Publik Pada Perangkat Bergerak Melalui Penerapan Teknik Kompresi Data dan Penyederhanaan Graf

Pinandito,

Kharisma,

Akbar

et al. 2024

JTIIK

View full text Add to dashboard Cite

Penelitian ini bertujuan untuk menyelesaikan permasalahan di bidang transportasi terkait penentuan rute perjalanan menggunakan transportasi umum dengan mengembangkan sistem dan aplikasi perangkat bergerak yang mampu merekomendasikan rute perjalanan angkutan umum di kota Malang. Rekomendasi rute perjalanan dihasilkan dari penerapan algoritme Dijkstra dari rute transportasi angkutan umum di Kota Malang yang dimodelkan dalam struktur data graf. Bagian yang akan dinilai pada penelitian ini adalah perbandingan efektivitas penggunaan format JSON terutama pada penghematan bandwidth. Teknik kompresi yang digunakan pada penelitian ini adalah Zlib yang dikombinasikan dengan encoding Base64. Analisis juga dilakukan terhadap beban tambahan dan penggunaan memori akibat proses kompresi serta analisis waktu komputasi dan penggunaan memori akibat penyederhanaan struktur data graf melalui pendekatan visual dengan algoritme Douglas-Peucker. Penggunaan dokumen dalam format JSON terbukti efektif digunakan sebagai media komunikasi, penggunaan kompresi data dapat menghemat penggunaan bandwidth untuk mendistribusikan data di Internet sebesar 64,61%, dan memberikan beban tambahan pada memori yang diperlukan oleh server untuk kompresi data sebesar 0,44%. Selain itu, dengan penyederhanaan graf secara visual, waktu proses yang diperlukan untuk merekomendasikan rute transportasi menjadi lebih singkat 81,24% serta berkurangnya penggunaan memori hingga 72,99%. Abstract This research aims to solve problems in the field of transportation related to determining travel plans using public transportation by developing systems and mobile applications based on Google Android that recommend public transport plans in Malang City. The plans are generated from the implementation of Dijkstra's algorithm, which is modeled in the graph data structure. This study determines the effectiveness of using JSON format, the bandwidth saved for distributing data on the Internet from Zlib data compression and Base64 encoding, and analyzes additional memory usage due to compression and the impact of data simplification through a visual approach on transport network graphs with the Douglas-Peucker algorithm. This study suggested that the use of JSON format is effective as a communication medium, and the use of data compression allows clients to save bandwidth usage by up to 64.61% with an additional 0.44% of memory load for data compression. Additionally, visually simplifying the graph data improved the system's performance; it reduced the average processing time to recommend transportation routes by 81.24% and reduced memory usage by up to 72.99%.

show abstract

Section: Algoritme Dijkstra Dalam Penentuan Rute Terpendek Transporta...unclassified

Peningkatan Performa Komputasi Sistem Navigasi Transportasi Publik Pada Perangkat Bergerak Melalui Penerapan Teknik Kompresi Data dan Penyederhanaan Graf

Pinandito,

Kharisma,

Akbar

et al. 2024

JTIIK

View full text Add to dashboard Cite

show abstract

“…Dijkstra algorithm defines the shortest path to be used in navigation, consuming the data registered in the adjacency matrix [40]. The Dijkstra algorithm followed the four steps:…”

Section: ) Routes Rulesmentioning

confidence: 99%

A Hybrid Indoor Positioning System Using a Linear Weighted Policy Learner and Iterative PDR

et al. 2020

View full text Add to dashboard Cite

show abstract

“…The heuristic used to define the route between reference points was to use an absolute and interval location model, adding the costs associated with the arcs in a polynomial problem. Dijkstra's algorithm makes it possible to apply heuristics by linking the location records in an adjacency matrix [9].…”

Section: Route Rulesmentioning

confidence: 99%

“…In traditional route definition models, it is common to use markers to establish neighborhood relationships and allow the user to provide guidance [9]. In this work, the markers represented the positions of the obstacles, to be used as a reference in identifying the viable path, thus allowing safe navigation and low risk of accidents (collisions).…”

Section: Route Rulesmentioning

confidence: 99%

Audio Guide for Visually Impaired People Based on Combination of Stereo Vision and Musical Tones

Simões

Silva²,

Pio³

et al. 2019

Sensors

View full text Add to dashboard Cite

Indoor navigation systems offer many application possibilities for people who need information about the scenery and the possible fixed and mobile obstacles placed along the paths. In these systems, the main factors considered for their construction and evaluation are the level of accuracy and the delivery time of the information. However, it is necessary to notice obstacles placed above the user’s waistline to avoid accidents and collisions. In this paper, different methodologies are associated to define a hybrid navigation model called iterative pedestrian dead reckoning (i-PDR). i-PDR combines the PDR algorithm with a Kalman linear filter to correct the location, reducing the system’s margin of error iteratively. Obstacle perception was addressed through the use of stereo vision combined with a musical sounding scheme and spoken instructions that covered an angle of 120 degrees in front of the user. The results obtained in the margin of error and the maximum processing time are 0.70 m and 0.09 s, respectively, with obstacles at ground level and suspended with an accuracy equivalent to 90%.

show abstract

Map navigation system based on optimal Dijkstra algorithm

Cited by 12 publications

References 0 publications

Peningkatan Performa Komputasi Sistem Navigasi Transportasi Publik Pada Perangkat Bergerak Melalui Penerapan Teknik Kompresi Data dan Penyederhanaan Graf

Peningkatan Performa Komputasi Sistem Navigasi Transportasi Publik Pada Perangkat Bergerak Melalui Penerapan Teknik Kompresi Data dan Penyederhanaan Graf

A Hybrid Indoor Positioning System Using a Linear Weighted Policy Learner and Iterative PDR

Audio Guide for Visually Impaired People Based on Combination of Stereo Vision and Musical Tones

Contact Info

Product

Resources

About