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 plan.
Abstract
Safe navigation under uncertain time-dependent blockage requires anticipating observations before committing to motion. We present StochSIPP, an exact contingent planner for temporal roadmaps with uncertain edge and vertex statuses revealed locally during execution. StochSIPP uses SIPP to generate certified-safe macro-actions that terminate at the next observation or the goal, and bounded AND/OR search over a cached action--observation graph to select actions for every reachable observation outcome. Optimistic and robust SIPP relaxations provide admissible lower and upper bounds for bounded AND/OR search. When every interval declared deterministically safe is truly safe, sensing is exact, and execution follows the planned timing, the resulting policy is provably collision-free. With correct independent probabilities and complete action and outcome generation, it minimizes expected arrival time within the roadmap and horizon. Experiments on controlled roadmap instances show that StochSIPP 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 plan. A scalability study further reveals rapid growth as the number of simultaneously observed uncertain statuses increases.
In several stochastic shortest path (SSP) planning domains,
a planner must find a strategy to reach a goal in an
uncertain environment in which some states are
irrecoverable dead-ends. When dead-ends cannot always be
avoided, the planner may face a tension between being safe
and being efficient. Existing policy optimiz...
Matisse Roche, Yoko Watanabe, C. P. Chanel· Proceedings of the Internati...· 0 citations
The Lifelong Multi-Agent Path Finding (LMAPF) problem in practice faces significant challenges due to uncertain delays and the interleaving of planning and execution. Traditional solvers often rely on precise time-step reservations, which are prone to failure when agents deviate from their schedules, leading to inaccur...
Generative planners based on diffusion/flow matching can learn to synthesize long-horizon trajectories from demonstrations. However, real-world deployment requires (i) enforcing safety constraints during execution and (ii) tight online replanning at fast execution rates. Prior safe diffusion/flow planners generate the...
Seunghwan Jang, Jeongyong Yang, Siddharth Ancha et al.· 0 citations
Safe navigation in human crowds requires efficiency and reliability. Learning-based policies run fast but can fail under distribution shift, whereas Hamilton–Jacobi (HJ) reachability offers principled safety guarantees but is computationally expensive. We propose a prediction-conditioned reachability framework that bri...
I. Winata, Junghyun Oh· IEEE Robotics and Automation...· 0 citations
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
Temporary obstacles that may block a robot's planned route create a sequential navigation problem: a robot must decide whether to wait for a blockage to clear, reroute, or acquire more information about the obstacle before acting. We formulate graph navigation among temporary obstacles as a partially observable semi-Ma...
Hshmat Sahak, Ao-Ran Jiao, Nicholas Rhinehart et al.· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.