
Embedding Directed Graphs in Potential Fields Using FastMapD
Embedding undirected graphs in a Euclidean space has many computational ...
read it

MultiAgent Pathfinding: Definitions, Variants, and Benchmarks
The MAPF problem is the fundamental problem of planning paths for multip...
read it

Position Paper: From MultiAgent Pathfinding to Pipe Routing
The 2D MultiAgent Path Finding (MAPF) problem aims at finding collision...
read it

Overview: A Hierarchical Framework for Plan Generation and Execution in MultiRobot Systems
The authors present an overview of a hierarchical framework for coordina...
read it

Infinitary and Cyclic Proof Systems for Transitive Closure Logic
We formulate an infinitary proof system for transitive closure logic, wh...
read it

Applicable Mathematics in a Minimal Computational Theory of Sets
In previous papers on this project a general static logical framework fo...
read it

Feasibility Study: Moving NonHomogeneous Teams in Congested Video Game Environments
Multiagent path finding (MAPF) is a wellstudied problem in artificial ...
read it

Rapid Randomized Restarts for MultiAgent Path Finding Solvers
MultiAgent Path Finding (MAPF) is an NPhard problem well studied in ar...
read it

The FastMap Algorithm for Shortest Path Computations
We present a new preprocessing algorithm for embedding the nodes of a gi...
read it

Path Planning with Kinematic Constraints for Robot Groups
Path planning for multiple robots is well studied in the AI and robotics...
read it

Overview: Generalizations of MultiAgent Path Finding to RealWorld Scenarios
Multiagent path finding (MAPF) is wellstudied in artificial intelligen...
read it
Liron Cohen
is this you? claim profile