Search Results for author: Tansel Uras

Found 3 papers, 0 papers with code

Overview: A Hierarchical Framework for Plan Generation and Execution in Multi-Robot Systems

no code implementations30 Mar 2018 Hang Ma, Wolfgang Hönig, Liron Cohen, Tansel Uras, Hong Xu, T. K. Satish Kumar, Nora Ayanian, Sven Koenig

In the plan-generation phase, the framework provides a computationally scalable method for generating plans that achieve high-level tasks for groups of robots and take some of their kinematic constraints into account.

The FastMap Algorithm for Shortest Path Computations

no code implementations8 Jun 2017 Liron Cohen, Tansel Uras, Shiva Jahangiri, Aliyah Arunasalam, Sven Koenig, T. K. Satish Kumar

We present a new preprocessing algorithm for embedding the nodes of a given edge-weighted undirected graph into a Euclidean space.

Overview: Generalizations of Multi-Agent Path Finding to Real-World Scenarios

no code implementations17 Feb 2017 Hang Ma, Sven Koenig, Nora Ayanian, Liron Cohen, Wolfgang Hoenig, T. K. Satish Kumar, Tansel Uras, Hong Xu, Craig Tovey, Guni Sharon

Multi-agent path finding (MAPF) is well-studied in artificial intelligence, robotics, theoretical computer science and operations research.

Multi-Agent Path Finding

Cannot find the paper you are looking for? You can Submit a new open access paper.