Can LLMs Prove Robotic Path Planning Optimality? A Benchmark for Research-Level Algorithm Verification
DGX agentarXiv:2603.19464v2 Announce Type: replace Abstract: Robotic path planning problems are often NP-hard, and practical solutions typically rely on approximation algorithms with provable performance guara