In its general form, Multi-Agent Path Finding (MAPF) is well known to be NP-hard for various optimization objectives. But determining the complexity boundary for restricted topologies remains a key theoretical challenge. This paper investigates the complexity of MAPF on tree topologies. While recent work has establishe...
Daniel Koyfman, Dor Atzmon, Shahaf S. Shperberg et al.· Proceedings of the Internati...· 1 citation
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 (sometimes known as SIPP), the feasibility of being at a particular location can change as the obstacles move. Or, the action of boarding a par...
Devin Wild Thomas, S. E. Shimony, Wheeler Ruml et al.· 0 citations
StochSIPP is presented, an exact contingent planner for temporal roadmaps with uncertain edge and vertex statuses revealed locally during execution that preserves the observed success of safe fixed-path baselines while reducing arrival time, and solves gated scenarios in which conservative fixed-path planners return no...
Ajith Kemisetti, Shahaf S. Shperberg, Yoonchang Sung· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.