Optimization of Grid-Graphs using Segmentation

Bulbul E., ÇETİN A.

2017 International Artificial Intelligence and Data Processing Symposium (IDAP), Malatya, Türkiye, 16 - 17 Eylül 2017 identifier identifier

  • Yayın Türü: Bildiri / Tam Metin Bildiri
  • Cilt numarası:
  • Doi Numarası: 10.1109/idap.2017.8090173
  • Basıldığı Şehir: Malatya
  • Basıldığı Ülke: Türkiye
  • Anahtar Kelimeler: Shortest pathfinding, Grid-graph, Dijkstra algorithm, A* algorithm, segmentation, optimization
  • Gazi Üniversitesi Adresli: Evet

Özet

This work examines the effects of reducing the number of nodes and edges in a grid-graph, which consists of heterogeneous node blocks. An optimization method that reduces the count of nodes and edges is presented. Approaches that make traversing the graph easier by using this method are explained with examples. Efficiency of the method is observed using different pathfinding algorithms.