4 citations · 4 across the 2 of their papers we have counts for
Showing cs.AIShow all
2 papers · 1 filter
cs.AI2026
Optimal Planning in a Dynamic World
Devin Wild Thomas, Solomon Eyal Shimony, Wheeler Ruml +3
Background: We address the problem of planning when the set of feasible states or actions changes over time. For example, in the problem of path planning among moving obstacles (so…
cs.AI2026
Precomputing Multi-Agent Path Replanning Using Temporal Flexibility
Issa Hanou, Eric Kemmeren, Devin Wild Thomas +1
Executing a multi-agent plan can be challenging when an agent is delayed, because this typically creates conflicts with other agents. So, we need to quickly find a new safe plan. R…