Tansel Uras

According to our database¹, Tansel Uras authored at least 34 papers between 2009 and 2020.

Collaborative distances:

Dijkstra number² of four.
Erdős number³ of two.

Timeline

Legend:

Book

In proceedings

Article

PhD thesis

Dataset

Other

Links

On csauthors.net:

Bibliography

2020

Toward a String-Pulling Approach to Path Smoothing on Grid Graphs.

[BibT_eX]

[DOI]

Jihee Han

Tansel Uras

Sven Koenig

Proceedings of the Thirteenth International Symposium on Combinatorial Search, 2020

Teaching Undergraduate Artificial Intelligence Classes: An Experiment with an Attendance Requirement.

[BibT_eX]

[DOI]

Sven Koenig

Tansel Uras

Liron Cohen

Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence, 2020

2019

Optimal and Bounded-Suboptimal Multi-Agent Motion Planning.

[BibT_eX]

[DOI]

Proceedings of the Twelfth International Symposium on Combinatorial Search, 2019

Regarding Jump Point Search and Subgoal Graphs.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence, 2019

2018

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

[BibT_eX]

[DOI]

CoRR, 2018

Fast Near-Optimal Path Planning on State Lattices with Subgoal Graphs.

[BibT_eX]

[DOI]

Tansel Uras

Sven Koenig

Proceedings of the Eleventh International Symposium on Combinatorial Search, 2018

Understanding Subgoal Graphs by Augmenting Contraction Hierarchies.

[BibT_eX]

[DOI]

Tansel Uras

Sven Koenig

Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, 2018

The FastMap Algorithm for Shortest Path Computations.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, 2018

2017

Overview: A Hierarchical Framework for Plan Generation and Execution in Multirobot Systems.

[BibT_eX]

[DOI]

IEEE Intell. Syst., 2017

The FastMap Algorithm for Shortest Path Computations.

[BibT_eX]

[DOI]

CoRR, 2017

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

[BibT_eX]

[DOI]

CoRR, 2017

Feasibility Study: Subgoal Graphs on State Lattices.

[BibT_eX]

[DOI]

Tansel Uras

Sven Koenig

Proceedings of the Tenth International Symposium on Combinatorial Search, 2017

2016

Improved Solvers for Bounded-Suboptimal Multi-Agent Path Finding.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, 2016

2015

Reusing cost-minimal paths for goal-directed navigation in partially known terrains.

[BibT_eX]

[DOI]

Auton. Agents Multi Agent Syst., 2015

An Empirical Comparison of Any-Angle Path-Planning Algorithms.

[BibT_eX]

[DOI]

Tansel Uras

Sven Koenig

Proceedings of the Eighth Annual Symposium on Combinatorial Search, 2015

The Grid-Based Path Planning Competition: 2014 Entries and Results.

[BibT_eX]

[DOI]

Proceedings of the Eighth Annual Symposium on Combinatorial Search, 2015

Feasibility Study: Using Highways for Bounded-Suboptimal Multi-Agent Path Finding.

[BibT_eX]

[DOI]

Liron Cohen

Tansel Uras

Sven Koenig

Proceedings of the Eighth Annual Symposium on Combinatorial Search, 2015

Speeding-Up Any-Angle Path-Planning on Grids.

[BibT_eX]

[DOI]

Tansel Uras

Sven Koenig

Proceedings of the Twenty-Fifth International Conference on Automated Planning and Scheduling, 2015

Path Planning on Grids: The Effect of Vertex Placement on Path Length.

[BibT_eX]

[DOI]

Proceedings of the Eleventh AAAI Conference on Artificial Intelligence and Interactive Digital Entertainment, 2015

2014

A lattice-based approach to multi-robot motion planning for non-holonomic vehicles.

[BibT_eX]

[DOI]

Marcello Cirillo

Tansel Uras

Sven Koenig

Proceedings of the 2014 IEEE/RSJ International Conference on Intelligent Robots and Systems, 2014

Integrated Motion Planning and Coordination for Industrial Vehicles.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Fourth International Conference on Automated Planning and Scheduling, 2014

Identifying Hierarchies for Fast Optimal Search.

[BibT_eX]

[DOI]

Tansel Uras

Sven Koenig

Proceedings of the Twenty-Eighth AAAI Conference on Artificial Intelligence, 2014

2013

Finding optimal plans for multiple teams of robots through a mediator: A logic-based approach.

[BibT_eX]

[DOI]

Theory Pract. Log. Program., 2013

Subgoal Graphs for Optimal Pathfinding in Eight-Neighbor Grids.

[BibT_eX]

[DOI]

Tansel Uras

Sven Koenig

Carlos Hernández

Proceedings of the Twenty-Third International Conference on Automated Planning and Scheduling, 2013

2012

Subgoal Graphs for Eight-Neighbor Gridworlds.

[BibT_eX]

[DOI]

Tansel Uras

Sven Koenig

Carlos Hernández

Proceedings of the Fifth Annual Symposium on Combinatorial Search, 2012

Paper Summary: Time-Bounded Adaptive A.

[BibT_eX]

[DOI]

Proceedings of the Fifth Annual Symposium on Combinatorial Search, 2012

Position Paper: Incremental Search Algorithms Considered Poorly Understood.

[BibT_eX]

[DOI]

Proceedings of the Fifth Annual Symposium on Combinatorial Search, 2012

Causality-based planning and diagnostic reasoning for cognitive factories.

[BibT_eX]

[DOI]

Proceedings of 2012 IEEE 17th International Conference on Emerging Technologies & Factory Automation, 2012

Incremental ARA*: An Incremental Anytime Search Algorithm for Moving-Target Search.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Second International Conference on Automated Planning and Scheduling, 2012

Time-bounded adaptive A.

[BibT_eX]

[DOI]

Proceedings of the International Conference on Autonomous Agents and Multiagent Systems, 2012

2011

Combining high-level causal reasoning with low-level geometric reasoning and motion planning for robotic manipulation.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Conference on Robotics and Automation, 2011

2010

Genome Rearrangement and Planning: Revisited.

[BibT_eX]

[DOI]

Tansel Uras

Esra Erdem

Proceedings of the 20th International Conference on Automated Planning and Scheduling, 2010

Genome Rearrangement: A Planning Approach.

[BibT_eX]

[DOI]

Tansel Uras

Esra Erdem

Proceedings of the Twenty-Fourth AAAI Conference on Artificial Intelligence, 2010

2009

Comparing ASP and CP on Four Grid Puzzles.

[BibT_eX]

[DOI]

Proceedings of the 16th RCRA workshop on Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion, 2009

Tansel Uras

Timeline

Legend:

Links

On csauthors.net:

Bibliography

Loading...