91 citations · 177 across the 11 of their papers we have counts for
15 papers
: a Family of Extensional Type Theories with Effectful Realizers of Continuity
Liron Cohen, Vincent Rahli
is a generic family of effectful, extensional type theories with a forcing interpretation parameterized by modalities. This paper identifies a subcl…
Uncertainty Estimation based on Geometric Separation
Gabriella Chouraqui, Liron Cohen, Gil Einziger +1
In machine learning, accurately predicting the probability that a specific input is correct is crucial for risk management. This process, known as uncertainty (or confidence) estim…
A Geometric Method for Improved Uncertainty Estimation in Real-time
Gabriella Chouraqui, Liron Cohen, Gil Einziger +1
Machine learning classifiers are probabilistic in nature, and thus inevitably involve uncertainty. Predicting the probability of a specific input to be correct is called uncertaint…
Embedding Directed Graphs in Potential Fields Using FastMap-D
Sriram Gopalakrishnan, Liron Cohen, Sven Koenig +1
Embedding undirected graphs in a Euclidean space has many computational benefits. FastMap is an efficient embedding algorithm that facilitates a geometric interpretation of problem…
Multi-Agent Pathfinding: Definitions, Variants, and Benchmarks
Roni Stern, Nathan Sturtevant, Ariel Felner +9
The MAPF problem is the fundamental problem of planning paths for multiple agents, where the key constraint is that the agents will be able to follow these paths concurrently witho…
Position Paper: From Multi-Agent Pathfinding to Pipe Routing
Gleb Belov, Liron Cohen, Maria Garcia de la Banda +3
The 2D Multi-Agent Path Finding (MAPF) problem aims at finding collision-free paths for a number of agents, from a set of start locations to a set of goal positions in a known 2D e…
Overview: A Hierarchical Framework for Plan Generation and Execution in Multi-Robot Systems
Hang Ma, Wolfgang Hönig, Liron Cohen +5
The authors present an overview of a hierarchical framework for coordinating task- and motion-level operations in multirobot systems. Their framework is based on the idea of using…
Infinitary and Cyclic Proof Systems for Transitive Closure Logic
Liron Cohen, Reuben N. S. Rowe
Transitive closure logic is a known extension of first-order logic obtained by introducing a transitive closure operator. While other extensions of first-order logic with inductive…
Applicable Mathematics in a Minimal Computational Theory of Sets
Arnon Avron, Liron Cohen
In previous papers on this project a general static logical framework for formalizing and mechanizing set theories of different strength was suggested, and the power of some predic…
Feasibility Study: Moving Non-Homogeneous Teams in Congested Video Game Environments
Hang Ma, Jingxing Yang, Liron Cohen +2
Multi-agent path finding (MAPF) is a well-studied problem in artificial intelligence, where one needs to find collision-free paths for agents with given start and goal locations. I…
Rapid Randomized Restarts for Multi-Agent Path Finding Solvers
Liron Cohen, Glenn Wagner, T. K. Satish Kumar +2
Multi-Agent Path Finding (MAPF) is an NP-hard problem well studied in artificial intelligence and robotics. It has many real-world applications for which existing MAPF solvers use…
The FastMap Algorithm for Shortest Path Computations
Liron Cohen, Tansel Uras, Shiva Jahangiri +3
We present a new preprocessing algorithm for embedding the nodes of a given edge-weighted undirected graph into a Euclidean space. The Euclidean distance between any two nodes in t…
Path Planning with Kinematic Constraints for Robot Groups
Wolfgang Hönig, T. K. Satish Kumar, Liron Cohen +3
Path planning for multiple robots is well studied in the AI and robotics communities. For a given discretized environment, robots need to find collision-free paths to a set of spec…
Overview: Generalizations of Multi-Agent Path Finding to Real-World Scenarios
Hang Ma, Sven Koenig, Nora Ayanian +7
Multi-agent path finding (MAPF) is well-studied in artificial intelligence, robotics, theoretical computer science and operations research. We discuss issues that arise when genera…
Learning and Optimization with Submodular Functions
Bharath Sankaran, Marjan Ghazvininejad, Xinran He +2
In many naturally occurring optimization problems one needs to ensure that the definition of the optimization problem lends itself to solutions that are tractable to compute. In ca…