-
Revisiting Bounded-Suboptimal Safe Interval Path Planning
Safe-interval path planning (SIPP) is a powerful algorithm for finding a...
06/01/2020 ∙ by Konstantin Yakovlev, et al. ∙
0
∙
share
read it
-
Bidding in Spades
We present a Spades bidding algorithm that is superior to recreational h...
12/24/2019 ∙ by Gal Cohensius, et al. ∙
5
∙
share
read it
-
Learning Test Traces
Modern software projects include automated tests written to check the pr...
09/04/2019 ∙ by Eyal Hadad, et al. ∙
0
∙
share
read it
-
Predicting Software Tests Traces
Modern software projects include automated tests written to check the pr...
09/04/2019 ∙ by Eyal Hadad, et al. ∙
0
∙
share
read it
-
Multi-Agent Pathfinding: Definitions, Variants, and Benchmarks
The MAPF problem is the fundamental problem of planning paths for multip...
06/19/2019 ∙ by Roni Stern, et al. ∙
5
∙
share
read it
-
Multi-Agent Pathfinding (MAPF) with Continuous Time
MAPF is the problem of finding paths for multiple agents such that every...
01/16/2019 ∙ by Anton Andreychuk, et al. ∙
0
∙
share
read it
-
Modifying Optimal SAT-based Approach to Multi-agent Path-finding Problem to Suboptimal Variants
In multi-agent path finding (MAPF) the task is to find non-conflicting p...
07/02/2017 ∙ by Pavel Surynek, et al. ∙
0
∙
share
read it
-
Efficient, Safe, and Probably Approximately Complete Learning of Action Models
In this paper we explore the theoretical boundaries of planning in a set...
05/24/2017 ∙ by Roni Stern, et al. ∙
0
∙
share
read it
