no code implementations • 17 Dec 2023 • Zain Alabedeen Ali, Konstantin Yakovlev
A well-established approach to solve this problem is to reduce it to a special type of a graph search problem, i. e. to the problem of finding a maximum flow on an auxiliary graph induced by the input one.
1 code implementation • 1 Feb 2023 • Zain Alabedeen Ali, Konstantin Yakovlev
Safe Interval Path Planning (SIPP) is a powerful algorithm for solving single-agent pathfinding problem when 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.
no code implementations • 11 Aug 2021 • Zain Alabedeen Ali, Konstantin Yakovlev
In this paper, we present a method that mitigates this issue to a certain extent.