LLM-generated waypoints guided by landmark distances reduce A* node expansions by ~50% in non-geometric graphs up to 2000 nodes with only marginal path cost increase.
A 1000 timesxfaster LLM- enhanced algorithm for path planning in large-scale grid maps,
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.NI 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
LLM-Aided A* Search in Non-Geometric Network Graphs
LLM-generated waypoints guided by landmark distances reduce A* node expansions by ~50% in non-geometric graphs up to 2000 nodes with only marginal path cost increase.