TT^_𝒞 is a generic family of effectful,
extensional type theories with a...
In machine learning, accurately predicting the probability that a specif...
Machine learning classifiers are probabilistic in nature, and thus inevi...
Embedding undirected graphs in a Euclidean space has many computational
...
The MAPF problem is the fundamental problem of planning paths for multip...
The 2D Multi-Agent Path Finding (MAPF) problem aims at finding collision...
The authors present an overview of a hierarchical framework for coordina...
We formulate an infinitary proof system for transitive closure logic, wh...
In previous papers on this project a general static logical framework fo...
Multi-agent path finding (MAPF) is a well-studied problem in artificial
...
Multi-Agent Path Finding (MAPF) is an NP-hard problem well studied in
ar...
We present a new preprocessing algorithm for embedding the nodes of a gi...
Path planning for multiple robots is well studied in the AI and robotics...
Multi-agent path finding (MAPF) is well-studied in artificial intelligen...