Analysis of selected pathfinding algorithms in 2D porous media with binary representation
Technical Sciences · 25.05.2026
DOI: 10.31648/ts.11919 ↗Kurz gefasst
Fachartikel in der Zeitschrift Technical Sciences, online erschienen am 25.05.2026. Verfasst von FIlip Klimek und 1 weiteren Autor:innen. Die Arbeit nennt 10 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0).
Abstract (Originalsprache)
The article presents an analysis of the influence of geometric parameters of a porous medium represented in a binary form – grid size, obstacle width, and porosity – on the tortuosity of transport paths and the efficiency of pathfinding algorithms. Numerical simulations were carried out for grids of 100-200 nodes, obstacle widths of 1-13 nodes, and porosity values ranging from 0.9 to 0.5, using the Dijkstra, A*, BFS, and Greedy BFS algorithms. The results confirmed the existence of a percolation threshold at ϕ ≈ 0.6 and showed that decreasing porosity increases path tortuosity. For high porosity (ϕ = 0.9), paths were nearly straight (τ ≈ 1.03), while for low porosity (ϕ = 0.5-0.6) they became highly tortuous (τ > 1.3). Among the tested methods, the A* and Greedy BFS algorithms proved to be the most computationally efficient, confirming the effectiveness of heuristic approaches in modeling transport phenomena in porous structures.
Zitieren
APA
Klimek, F., & Sobieski, W. (2026). Analysis of selected pathfinding algorithms in 2D porous media with binary representation. Technical Sciences. https://doi.org/10.31648/ts.11919
Vancouver
Klimek F, Sobieski W. Analysis of selected pathfinding algorithms in 2D porous media with binary representation. Technical Sciences. 2026. doi:10.31648/ts.11919
BibTeX
@article{Klimek2026,
author = {Klimek, FIlip and Sobieski, Wojciech},
title = {Analysis of selected pathfinding algorithms in 2D porous media with binary representation},
journal = {Technical Sciences},
year = {2026},
doi = {10.31648/ts.11919}
}
EUVIMED