Random grids plus Dijkstra's algorithm find deterministic minimum-resistance paths on energy landscapes without the angle-dependent bias of regular grids.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cond-mat.stat-mech 1years
2024 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Deterministic Path Search Algorithm on Free-Energy Landscape using Random Grids
Random grids plus Dijkstra's algorithm find deterministic minimum-resistance paths on energy landscapes without the angle-dependent bias of regular grids.