19 citations · 54 across the 20 of their papers we have counts for
Showing 2021Show all
2 papers · 1 filter
cs.AI2021
Towards Time-Optimal Any-Angle Path Planning With Dynamic Obstacles
Konstantin Yakovlev, Anton Andreychuk
Path finding is a well-studied problem in AI, which is often framed as graph search. Any-angle path finding is a technique that augments the initial graph with additional edges to…
cs.AI2021
Improving Continuous-time Conflict Based Search
Anton Andreychuk, Konstantin Yakovlev, Eli Boyarski +1
Conflict-Based Search (CBS) is a powerful algorithmic framework for optimally solving classical multi-agent path finding (MAPF) problems, where time is discretized into the time st…