9 articles tagged with #pathfinding. AI-curated summaries with sentiment analysis and key takeaways from 50+ sources.
Researchers develop L-NAMOA*dr-mvh, a novel algorithm that safely integrates multi-valued heuristics with dimensionality reduction in multi-objective shortest-path problems. The breakthrough addresses theoretical correctness challenges and achieves over 10x speedups by better capturing trade-off structures in search optimization.
Researchers propose an LLM-aided A* algorithm that uses large language models to generate intermediate waypoints for finding shortest paths in non-geometric network graphs where traditional geometric heuristics don't apply. The approach reduces node expansion by ~50% while maintaining near-optimal path costs, demonstrating that combining LLMs with classical algorithms can enhance network optimization.
Researchers introduce Front-to-Attractors (F2A), a new heuristic class that optimizes bidirectional search algorithms by replacing computationally expensive pairwise frontier evaluations with estimates to a small set of dynamically maintained attractor states. The approach achieves 11.2x reduction in pairwise evaluations while maintaining performance gains over simpler heuristics.
Researchers introduce GONDOR, a memory-efficient extension of Greedy Best-First Search that enables planning algorithms to operate under strict memory constraints by compressing search trees while retaining sparse anchor states. The algorithm reconstructs paths through re-searching between these states, with experiments showing consistent improvements in coverage on low-memory devices compared to standard approaches.
Researchers propose a decoupled iterative framework for multi-agent coordination that separates target assignment from pathfinding, achieving better scalability than existing conflict-based approaches. The method leverages fast suboptimal solvers like LaCAM and feedback-driven reassignment to handle larger agent systems while maintaining acceptable solution quality.
Researchers introduce Spatial-Gym, a benchmarking environment that evaluates AI models on spatial reasoning tasks through step-by-step pathfinding in 2D grids rather than one-shot generation. Testing eight models reveals a significant performance gap, with the best model achieving only 16% solve rate versus 98% for humans, exposing critical limitations in how AI systems scale reasoning effort and process spatial information.
Researchers developed UPath, a universal AI-powered pathfinding algorithm that improves A* search performance by up to 2.2x across diverse grid environments. The deep learning model generalizes across different map types without retraining, achieving near-optimal solutions within 3% of optimal cost on unseen tasks.
Researchers present a novel framework using Generative Flow Networks (GFlowNets) to solve shortest path problems in graphs. The method proves that minimizing total flow forces GFlowNets to traverse only shortest paths, demonstrating competitive performance in pathfinding tasks including solving Rubik's Cubes with smaller search budgets than existing approaches.
Researchers propose Mixed Guidance Graph Optimization (MGGO) to improve multi-agent pathfinding systems by optimizing both edge directions and weights in guidance graphs. The paper introduces two MGGO methods, including one using Quality Diversity algorithms with neural networks, to provide stricter guidance for agent movement in lifelong scenarios.
