Zain Alabedeen, Konstatin Yakovlev
We have not lifted any functions out of this paper's repositories yet, so there is nothing we have run. The repositories linked to it are listed below.
Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.
Safe Interval Path Planning (SIPP) is a powerful algorithm for solving a single-agent pathfinding problem where the agent is confined to a graph and certain vertices/edges of this graph are blocked at certain time intervals due to dynamic obstacles that populate the environment. The original SIPP algorithm relies on the assumption that the agent is able to stop instantaneously. However, this assumption often does not hold in practice, e.g. a mobile robot moving at a cruising speed cannot stop immediately but rather requires gradual deceleration to a full stop that takes time. In other words, the robot is subject to kinodynamic constraints. Unfortunately, as we show in this work, in such a case, the original SIPP is incomplete. To this end, we introduce a novel variant of SIPP that is provably complete and optimal for planning with acceleration/deceleration. In the experimental evaluation, we show that the key property of the original SIPP still holds for the modified version: it performs much fewer expansions compared to A* and, as a result, is notably faster.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2302.00776")
get_code_for_paper("2302.00776")
have("2302.00776")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2302.00776.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2302.00776)
Connect an agent — have() is free.