A Survey of LLM-based Deep Search Agents Adaptive Path Planning via Weighted A* and Heuristic Rewards

Adaptive Path Planning via Weighted A* and Heuristic Rewards When I first read these two papers, my immediate thought was how closely they relate to the concepts we learn in our Artificial Intelligence course, especially search algorithms and intelligent agents. In class we usually study algorithms like BFS, DFS, Best-First Search, and A* using small graph examples. At first these problems can feel very academic. However, while reading these papers, I realized that the same ideas are actively be...