Tansel Uras

850 total citations
31 papers, 465 citations indexed

About

Tansel Uras is a scholar working on Computer Vision and Pattern Recognition, Artificial Intelligence and Computer Networks and Communications. According to data from OpenAlex, Tansel Uras has authored 31 papers receiving a total of 465 indexed citations (citations by other indexed papers that have themselves been cited), including 22 papers in Computer Vision and Pattern Recognition, 19 papers in Artificial Intelligence and 9 papers in Computer Networks and Communications. Recurrent topics in Tansel Uras's work include Robotic Path Planning Algorithms (21 papers), AI-based Problem Solving and Planning (9 papers) and Artificial Intelligence in Games (8 papers). Tansel Uras is often cited by papers focused on Robotic Path Planning Algorithms (21 papers), AI-based Problem Solving and Planning (9 papers) and Artificial Intelligence in Games (8 papers). Tansel Uras collaborates with scholars based in United States, Chile and Türkiye. Tansel Uras's co-authors include Sven Koenig, Esra Erdem, Volkan Patoğlu, Liron Cohen, Carlos Hernández, Marcello Cirillo, T. K. Satish Kumar, Hong Xu, Nora Ayanian and Federico Pecora and has published in prestigious journals such as IEEE Intelligent Systems, Autonomous Agents and Multi-Agent Systems and Theory and Practice of Logic Programming.

In The Last Decade

Tansel Uras

29 papers receiving 451 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name h Career Trend Papers Cites
Tansel Uras United States 14 344 220 100 92 80 31 465
Meir Goldenberg Israel 8 326 0.9× 193 0.9× 107 1.1× 36 0.4× 56 0.7× 15 402
Carlos Hernández Chile 11 329 1.0× 214 1.0× 134 1.3× 34 0.4× 85 1.1× 51 439
Alex Nash United States 7 423 1.2× 59 0.3× 70 0.7× 105 1.1× 266 3.3× 9 480
Ryan Luna United States 8 270 0.8× 88 0.4× 99 1.0× 57 0.6× 74 0.9× 12 302
Eli Boyarski Israel 9 371 1.1× 189 0.9× 105 1.1× 20 0.2× 67 0.8× 21 433
Sandip Aine India 10 202 0.6× 157 0.7× 72 0.7× 63 0.7× 96 1.2× 27 306
Trevor Standley United States 4 275 0.8× 170 0.8× 83 0.8× 31 0.3× 47 0.6× 5 361
Kiril Solovey Israel 11 330 1.0× 78 0.4× 125 1.3× 113 1.2× 137 1.7× 32 399
Scott Kiesel United States 8 240 0.7× 96 0.4× 92 0.9× 44 0.5× 64 0.8× 14 340
Venkatraman Narayanan United States 10 260 0.8× 83 0.4× 39 0.4× 101 1.1× 124 1.6× 20 316

Countries citing papers authored by Tansel Uras

Since Specialization
Citations

This map shows the geographic impact of Tansel Uras's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Tansel Uras with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Tansel Uras more than expected).

Fields of papers citing papers by Tansel Uras

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Tansel Uras. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Tansel Uras. The network helps show where Tansel Uras may publish in the future.

Co-authorship network of co-authors of Tansel Uras

This figure shows the co-authorship network connecting the top 25 collaborators of Tansel Uras. A scholar is included among the top collaborators of Tansel Uras based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Tansel Uras. Tansel Uras is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Uras, Tansel & Sven Koenig. (2021). Identifying Hierarchies for Fast Optimal Search. Proceedings of the International Symposium on Combinatorial Search. 5(1). 211–212. 1 indexed citations
2.
Hernández, Carlos, Jorge A. Baier, Tansel Uras, & Sven Koenig. (2021). Position Paper: Incremental Search Algorithms Considered Poorly Understood. Proceedings of the International Symposium on Combinatorial Search. 3(1). 159–161. 1 indexed citations
3.
Uras, Tansel, Sven Koenig, & Carlos Hernández. (2021). Subgoal Graphs for Eight-Neighbor Gridworlds. Proceedings of the International Symposium on Combinatorial Search. 3(1). 213–214. 1 indexed citations
4.
Cohen, Liron, Tansel Uras, T. K. Satish Kumar, & Sven Koenig. (2021). Optimal and Bounded-Suboptimal Multi-Agent Motion Planning. Proceedings of the International Symposium on Combinatorial Search. 10(1). 44–51. 34 indexed citations
5.
Sturtevant, Nathan, Tansel Uras, Sven Koenig, et al.. (2021). The Grid-Based Path Planning Competition: 2014 Entries and Results. Proceedings of the International Symposium on Combinatorial Search. 6(1). 241–250. 15 indexed citations
6.
Uras, Tansel & Sven Koenig. (2021). Fast Near-Optimal Path Planning on State Lattices with Subgoal Graphs. Proceedings of the International Symposium on Combinatorial Search. 9(1). 106–114.
7.
Koenig, Sven, Tansel Uras, & Liron Cohen. (2020). Teaching Undergraduate Artificial Intelligence Classes: An Experiment with an Attendance Requirement. Proceedings of the AAAI Conference on Artificial Intelligence. 34(9). 13374–13380. 3 indexed citations
8.
Harabor, Daniel, Tansel Uras, Peter J. Stuckey, & Sven Koenig. (2019). Regarding Jump Point Search and Subgoal Graphs. 1241–1248. 8 indexed citations
9.
Uras, Tansel & Sven Koenig. (2018). Understanding Subgoal Graphs by Augmenting Contraction Hierarchies. 1506–1513. 4 indexed citations
10.
Cohen, Liron, Tansel Uras, T. K. Satish Kumar, et al.. (2016). Improved solvers for bounded-suboptimal multi-agent path finding. International Joint Conference on Artificial Intelligence. 3067–3074. 32 indexed citations
11.
Bailey, James P., Craig A. Tovey, Tansel Uras, Sven Koenig, & Alex Nash. (2015). Path Planning on Grids: The Effect of Vertex Placement on Path Length. Proceedings of the AAAI Conference on Artificial Intelligence and Interactive Digital Entertainment. 11(1). 108–114. 8 indexed citations
12.
Uras, Tansel & Sven Koenig. (2015). Speeding-Up Any-Angle Path-Planning on Grids. Proceedings of the International Conference on Automated Planning and Scheduling. 25. 234–238. 17 indexed citations
13.
Cirillo, Marcello, Federico Pecora, Henrik Andreasson, Tansel Uras, & Sven Koenig. (2014). Integrated Motion Planning and Coordination for Industrial Vehicles. Proceedings of the International Conference on Automated Planning and Scheduling. 24. 463–471. 31 indexed citations
14.
Hernández, Carlos, Tansel Uras, Sven Koenig, et al.. (2014). Reusing cost-minimal paths for goal-directed navigation in partially known terrains. Autonomous Agents and Multi-Agent Systems. 29(5). 850–895. 5 indexed citations
15.
Uras, Tansel & Sven Koenig. (2014). Identifying Hierarchies for Fast Optimal Search. Proceedings of the AAAI Conference on Artificial Intelligence. 28(1). 16 indexed citations
16.
Erdem, Esra, et al.. (2013). Finding optimal plans for multiple teams of robots through a mediator: A logic-based approach. Theory and Practice of Logic Programming. 13(4-5). 831–846. 15 indexed citations
17.
Hernández, Carlos, Jorge A. Baier, Tansel Uras, & Sven Koenig. (2012). Time-bounded adaptive A*. Adaptive Agents and Multi-Agents Systems. 997–1006. 6 indexed citations
18.
Sun, Xiaoxun, William Yeoh, Tansel Uras, & Sven Koenig. (2012). Incremental ARA*: An Incremental Anytime Search Algorithm for Moving-Target Search. Proceedings of the International Conference on Automated Planning and Scheduling. 22. 243–251. 13 indexed citations
19.
Erdem, Esra, et al.. (2012). Causality-based planning and diagnostic reasoning for cognitive factories. 1–8. 14 indexed citations
20.
Uras, Tansel, et al.. (2010). A tight integration of task planning and motion planning in an execution monitoring framework. Sabanci University. 2 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact

Breakdown of academic impact, for papers by Meir Goldenberg Breakdown of academic impact, for papers by Carlos Hernández Breakdown of academic impact, for papers by Alex Nash Breakdown of academic impact, for papers by Ryan Luna Breakdown of academic impact, for papers by Eli Boyarski Breakdown of academic impact, for papers by Sandip Aine Breakdown of academic impact, for papers by Trevor Standley Breakdown of academic impact, for papers by Kiril Solovey Breakdown of academic impact, for papers by Scott Kiesel Breakdown of academic impact, for papers by Venkatraman Narayanan
Rankless by CCL
2026