Matthias Bentert

This work studies Transient Multiagent Pathfinding, in which agents must be routed without collisions and disappear upon reaching their destinations, and shows that the problem is fixed-parameter tractable in the combined parameter k+ζ, where k is the number of agents and ζ=L−λ is the gap between the sequential-routing upper bound L=1+Σdist(si,ti) and the target makespan λ, running in 2^O(k²ζ)·n^O(1) time, complemented by matching lower bounds (W[1]-hardness for k alone, W[1]-hardness for ζ alone when terminals need not be distinct, and no polynomial kernel for k+ζ) and by fixed-parameter tractability in ζ alone when all terminals are pairwise distinct, running in 2^O(ζ³)·n^O(1) time.

This work studies Transient Multiagent Pathfinding, in which agents must be routed without collisions and disappear upon reaching their destinations, and shows that the problem is fixed-parameter tractable in the combined parameter k+ζ, where k is the number of agents and ζ=L−λ is the gap between the sequential-routing upper bound L=1+Σdist(si,ti) and the target makespan λ, running in 2^O(k²ζ)·n^O(1) time, complemented by matching lower bounds (W[1]-hardness for k alone, W[1]-hardness for ζ alone when terminals need not be distinct, and no polynomial kernel for k+ζ) and by fixed-parameter tractability in ζ alone when all terminals are pairwise distinct, running in 2^O(ζ³)·n^O(1) time.