2 papers
cs.RO2026
Can LLMs Prove Robotic Path Planning Optimality? A Benchmark for Research-Level Algorithm Verification
Zhengbang Yang, Md. Tasin Tazwar, Minghan Wei +1
Robotic path planning problems are often NP-hard, and practical solutions typically rely on approximation algorithms with provable performance guarantees for general cases. While d…
cs.CL2026
Constraint-aware Path Planning from Natural Language Instructions Using Large Language Models
Dylan Shim, Minghan Wei
Real-world path planning tasks typically involve multiple constraints beyond simple route optimization, such as the number of routes, maximum route length, depot locations, and tas…