Get Started
Research questionWhat is the computational complexity of optimal multi-agent path finding on trees?Tree structure simplifies connectivity but does not eliminate conflicts over vertices, paths, and targets. The tractability of optimal planning therefore depends on how agent identity and the objective are modeled.
Multi-agent Systems
Latest papersRecent research connected to this question, newest first.Hardness of Multi-Agent Path Finding on Trees: A Unified ApproachCovers labeled MAPF, two-colored MAPF, and classical Pebble Motion on trees. The supplied results establish NP-hardness across the stated objectives, including on subdivided stars, via reductions from Stack Rearrangement.research paper · Sep 2, 2026
Related questions
How can multi-agent LLM systems sustain autonomous exploration and knowledge accumulation in open-ended discovery?How can multimodal agents collaborate asynchronously under time pressure with split information and imperfect communication?How can multi-agent architectures preserve human-centered values without sacrificing functional performance?How can multimodal models control drones reliably under prompt-defined action protocols and terminate at the right time?
Home
Topics
Search
Library