AI Networking Cookbook: Practical recipes for AI-assisted network automation and development
3 papers indexed here
We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.
Not the right person? Other researchers publish under this name.
Goal Staying Makes Sum-of-Costs Anonymous Multi-Agent Path Finding NP-Hard
Anonymous Multi-Agent Path Finding (AMAPF) admits polynomial-time network-flow algorithms for several objectives, including makespan, total distance, and sum-of-costs (SoC) when agents disappear upon reaching goals. We show that standard goal-staying AMAPF is fundamentally different. We first formulate SoC minimization...
Unified Branch-and-Bound Search for the Steiner Traveling Salesman Problem on Graphs of Convex Sets
The Steiner Traveling Salesman Problem is formalized on Graphs of Convex Sets (GCS), which seeks a minimum-cost closed trajectory through required convex sets while allowing optional transit vertices and revisits, and a unified branch-and-bound search over rooted walk prefixes is proposed.