default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTansel Uras
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
[c30]Sven Koenig, Tansel Uras, Liron Cohen:
Teaching Undergraduate Artificial Intelligence Classes: An Experiment with an Attendance Requirement. AAAI 2020: 13374-13380- [c29]Jihee Han, Tansel Uras, Sven Koenig:
Toward a String-Pulling Approach to Path Smoothing on Grid Graphs. SOCS 2020: 106-110
2010 – 2019
- 2019
- [c28]Daniel Damir Harabor, Tansel Uras, Peter J. Stuckey, Sven Koenig:
Regarding Jump Point Search and Subgoal Graphs. IJCAI 2019: 1241-1248 - [c27]Liron Cohen, Tansel Uras, T. K. Satish Kumar, Sven Koenig:
Optimal and Bounded-Suboptimal Multi-Agent Motion Planning. SOCS 2019: 44-51 - 2018
- [c26]Liron Cohen, Tansel Uras, Shiva Jahangiri
, Aliyah Arunasalam, Sven Koenig, T. K. Satish Kumar:
The FastMap Algorithm for Shortest Path Computations. IJCAI 2018: 1427-1433 - [c25]Tansel Uras, Sven Koenig:
Understanding Subgoal Graphs by Augmenting Contraction Hierarchies. IJCAI 2018: 1506-1513 - [c24]Liron Cohen, Tansel Uras, Shiva Jahangiri, Aliyah Arunasalam, Sven Koenig, T. K. Satish Kumar:
The FastMap Algorithm for Shortest Path Computations. ISAIM 2018 - [c23]Tansel Uras, Sven Koenig:
Fast Near-Optimal Path Planning on State Lattices with Subgoal Graphs. SOCS 2018: 106-114 - [i3]Hang Ma, Wolfgang Hönig, Liron Cohen, Tansel Uras, Hong Xu, T. K. Satish Kumar, Nora Ayanian, Sven Koenig:
Overview: A Hierarchical Framework for Plan Generation and Execution in Multi-Robot Systems. CoRR abs/1804.00038 (2018) - 2017
- [j3]Hang Ma, Wolfgang Hönig, Liron Cohen, Tansel Uras, Hong Xu, T. K. Satish Kumar, Nora Ayanian, Sven Koenig:
Overview: A Hierarchical Framework for Plan Generation and Execution in Multirobot Systems. IEEE Intell. Syst. 32(6): 6-12 (2017) - [c22]Tansel Uras, Sven Koenig:
Feasibility Study: Subgoal Graphs on State Lattices. SOCS 2017: 100-108 - [i2]Hang Ma, Sven Koenig, Nora Ayanian, Liron Cohen, Wolfgang Hönig, T. K. Satish Kumar, Tansel Uras, Hong Xu, Craig A. Tovey, Guni Sharon:
Overview: Generalizations of Multi-Agent Path Finding to Real-World Scenarios. CoRR abs/1702.05515 (2017) - [i1]Liron Cohen, T. K. Satish Kumar, Tansel Uras, Sven Koenig:
The FastMap Algorithm for Shortest Path Computations. CoRR abs/1706.02792 (2017) - 2016
- [c21]Liron Cohen, Tansel Uras, T. K. Satish Kumar, Hong Xu, Nora Ayanian, Sven Koenig:
Improved Solvers for Bounded-Suboptimal Multi-Agent Path Finding. IJCAI 2016: 3067-3074 - 2015
- [j2]Carlos Hernández, Tansel Uras, Sven Koenig, Jorge A. Baier, Xiaoxun Sun, Pedro Meseguer:
Reusing cost-minimal paths for goal-directed navigation in partially known terrains. Auton. Agents Multi Agent Syst. 29(5): 850-895 (2015) - [c20]James P. Bailey, Craig A. Tovey, Tansel Uras, Sven Koenig, Alex Nash:
Path Planning on Grids: The Effect of Vertex Placement on Path Length. AIIDE 2015: 108-114 - [c19]Tansel Uras, Sven Koenig:
Speeding-Up Any-Angle Path-Planning on Grids. ICAPS 2015: 234-238 - [c18]Liron Cohen, Tansel Uras, Sven Koenig:
Feasibility Study: Using Highways for Bounded-Suboptimal Multi-Agent Path Finding. SOCS 2015: 2-8 - [c17]Tansel Uras, Sven Koenig:
An Empirical Comparison of Any-Angle Path-Planning Algorithms. SOCS 2015: 206-210 - [c16]Nathan R. Sturtevant, Jason M. Traish, James R. Tulip, Tansel Uras, Sven Koenig, Ben Strasser, Adi Botea, Daniel Harabor, Steve Rabin:
The Grid-Based Path Planning Competition: 2014 Entries and Results. SOCS 2015: 241-250 - 2014
- [c15]Tansel Uras, Sven Koenig:
Identifying Hierarchies for Fast Optimal Search. AAAI 2014: 878-884 - [c14]Marcello Cirillo, Federico Pecora, Henrik Andreasson, Tansel Uras, Sven Koenig:
Integrated Motion Planning and Coordination for Industrial Vehicles. ICAPS 2014 - [c13]Marcello Cirillo, Tansel Uras, Sven Koenig:
A lattice-based approach to multi-robot motion planning for non-holonomic vehicles. IROS 2014: 232-239 - [c12]Tansel Uras, Sven Koenig:
Identifying Hierarchies for Fast Optimal Search. SOCS 2014: 211-212 - 2013
- [j1]Esra Erdem, Volkan Patoglu, Zeynep G. Saribatur, Peter Schüller, Tansel Uras:
Finding optimal plans for multiple teams of robots through a mediator: A logic-based approach. Theory Pract. Log. Program. 13(4-5): 831-846 (2013) - [c11]Tansel Uras, Sven Koenig, Carlos Hernández:
Subgoal Graphs for Optimal Pathfinding in Eight-Neighbor Grids. ICAPS 2013 - 2012
- [c10]Carlos Hernández, Jorge A. Baier, Tansel Uras, Sven Koenig:
Time-bounded adaptive A. AAMAS 2012: 997-1006 - [c9]Xiaoxun Sun, Tansel Uras, Sven Koenig, William Yeoh:
Incremental ARA*: An Incremental Anytime Search Algorithm for Moving-Target Search. ICAPS 2012 - [c8]Esra Erdem, Kadir Haspalamutgil, Volkan Patoglu, Tansel Uras:
Causality-based planning and diagnostic reasoning for cognitive factories. ETFA 2012: 1-8 - [c7]Carlos Hernández, Jorge A. Baier, Tansel Uras, Sven Koenig:
Position Paper: Incremental Search Algorithms Considered Poorly Understood. SOCS 2012: 159-161 - [c6]Carlos Hernández, Jorge A. Baier, Tansel Uras, Sven Koenig:
Paper Summary: Time-Bounded Adaptive A. SOCS 2012: 184-185 - [c5]Tansel Uras, Sven Koenig, Carlos Hernández:
Subgoal Graphs for Eight-Neighbor Gridworlds. SOCS 2012: 213-214 - 2011
- [c4]Esra Erdem, Kadir Haspalamutgil, Can Palaz, Volkan Patoglu, Tansel Uras:
Combining high-level causal reasoning with low-level geometric reasoning and motion planning for robotic manipulation. ICRA 2011: 4575-4581 - 2010
- [c3]Tansel Uras, Esra Erdem:
Genome Rearrangement: A Planning Approach. AAAI 2010: 1963-1964 - [c2]Tansel Uras, Esra Erdem:
Genome Rearrangement and Planning: Revisited. ICAPS 2010: 250-253
2000 – 2009
- 2009
- [c1]Mehmet Çelik, Halit Erdogan, Firat Tahaoglu, Tansel Uras, Esra Erdem:
Comparing ASP and CP on Four Grid Puzzles. RCRA@AI*IA 2009
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:20 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
