default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLiron Cohen 0002
Person information
- affiliation: University of Southern California, USA
Other persons with the same name
- Liron Cohen 0001
![[0000-0002-6608-3000]](https://dblp.uni-trier.de./img/orcid-mark.12x12.png "0000-0002-6608-3000")
— Ben-Gurion University of the Negev, Beer-Sheva, Israel (and 2 more) - Liron Cohen 0003 — Tel-Aviv University, Israel
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
[c21]Sven Koenig, Tansel Uras, Liron Cohen:
Teaching Undergraduate Artificial Intelligence Classes: An Experiment with an Attendance Requirement. AAAI 2020: 13374-13380- [c20]Eli Boyarski, Ariel Felner, Daniel Harabor, Peter J. Stuckey, Liron Cohen, Jiaoyang Li, Sven Koenig:
Iterative-Deepening Conflict-Based Search. IJCAI 2020: 4084-4090 - [c19]Sriram Gopalakrishnan, Liron Cohen, Sven Koenig, T. K. Satish Kumar:
Embedding Directed Graphs in Potential Fields Using FastMap-D. SOCS 2020: 48-56 - [i10]Sriram Gopalakrishnan, Liron Cohen, Sven Koenig, T. K. Satish Kumar:
Embedding Directed Graphs in Potential Fields Using FastMap-D. CoRR abs/2006.03112 (2020)
2010 – 2019
- 2019
- [c18]Liron Cohen, Tansel Uras, T. K. Satish Kumar, Sven Koenig:
Optimal and Bounded-Suboptimal Multi-Agent Motion Planning. SOCS 2019: 44-51 - [c17]Roni Stern, Nathan R. Sturtevant, Ariel Felner, Sven Koenig, Hang Ma, Thayne T. Walker, Jiaoyang Li, Dor Atzmon, Liron Cohen, T. K. Satish Kumar, Roman Barták, Eli Boyarski:
Multi-Agent Pathfinding: Definitions, Variants, and Benchmarks. SOCS 2019: 151-158 - [i9]Gleb Belov, Liron Cohen, Maria Garcia de la Banda, Daniel Harabor, Sven Koenig, Xinrui Wei:
Position Paper: From Multi-Agent Pathfinding to Pipe Routing. CoRR abs/1905.08412 (2019) - [i8]Roni Stern, Nathan R. Sturtevant, Ariel Felner, Sven Koenig, Hang Ma, Thayne T. Walker, Jiaoyang Li, Dor Atzmon, Liron Cohen, T. K. Satish Kumar, Eli Boyarski, Roman Barták:
Multi-Agent Pathfinding: Definitions, Variants, and Benchmarks. CoRR abs/1906.08291 (2019) - 2018
- [c16]Ariel Felner, Jiaoyang Li, Eli Boyarski, Hang Ma, Liron Cohen, T. K. Satish Kumar, Sven Koenig:
Adding Heuristics to Conflict-Based Search for Multi-Agent Path Finding. ICAPS 2018: 83-87 - [c15]Zhi Wang, Liron Cohen, Sven Koenig, T. K. Satish Kumar:
The Factored Shortest Path Problem and Its Applications in Robotics. ICAPS 2018: 527-531 - [c14]Liron Cohen, Sven Koenig, T. K. Satish Kumar, Glenn Wagner, Howie Choset, David M. Chan, Nathan R. Sturtevant:
Rapid Randomized Restarts for Multi-Agent Path Finding: Preliminary Results. AAMAS 2018: 1909-1911 - [c13]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 - [c12]Liron Cohen, Matias Greco, Hang Ma, Carlos Hernández, Ariel Felner, T. K. Satish Kumar, Sven Koenig:
Anytime Focal Search with Applications. IJCAI 2018: 1434-1441 - [c11]Liron Cohen, Tansel Uras, Shiva Jahangiri, Aliyah Arunasalam, Sven Koenig, T. K. Satish Kumar:
The FastMap Algorithm for Shortest Path Computations. ISAIM 2018 - [c10]Liron Cohen, Glenn Wagner, David M. Chan, Howie Choset, Nathan R. Sturtevant, Sven Koenig, T. K. Satish Kumar:
Rapid Randomized Restarts for Multi-Agent Path Finding Solvers. SOCS 2018: 148-152 - [i7]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
- [j2]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) - [c9]Hang Ma, Jingxing Yang, Liron Cohen, T. K. Satish Kumar, Sven Koenig:
Feasibility Study: Moving Non-Homogeneous Teams in Congested Video Game Environments. AIIDE 2017: 270-272 - [c8]Wolfgang Hönig, T. K. Satish Kumar, Liron Cohen, Hang Ma, Hong Xu, Nora Ayanian, Sven Koenig:
Summary: Multi-Agent Path Finding with Kinematic Constraints. IJCAI 2017: 4869-4873 - [i6]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) - [i5]Wolfgang Hönig, T. K. Satish Kumar, Liron Cohen, Hang Ma, Sven Koenig, Nora Ayanian:
Path Planning with Kinematic Constraints for Robot Groups. CoRR abs/1704.07538 (2017) - [i4]Liron Cohen, T. K. Satish Kumar, Tansel Uras, Sven Koenig:
The FastMap Algorithm for Shortest Path Computations. CoRR abs/1706.02792 (2017) - [i3]Liron Cohen, Glenn Wagner, T. K. Satish Kumar, Howie Choset, Sven Koenig:
Rapid Randomized Restarts for Multi-Agent Path Finding Solvers. CoRR abs/1706.02794 (2017) - [i2]Hang Ma, Jingxing Yang, Liron Cohen, T. K. Satish Kumar, Sven Koenig:
Feasibility Study: Moving Non-Homogeneous Teams in Congested Video Game Environments. CoRR abs/1710.01447 (2017) - 2016
- [c7]Wolfgang Hönig, T. K. Satish Kumar, Liron Cohen, Hang Ma, Hong Xu, Nora Ayanian, Sven Koenig:
Multi-Agent Path Finding with Kinematic Constraints. ICAPS 2016: 477-485 - [c6]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 - [c5]Liron Cohen, Sven Koenig:
Bounded Suboptimal Multi-Agent Path Finding Using Highways. IJCAI 2016: 3978-3979 - 2015
- [j1]Masabumi Furuhata, Kenny Daniel, Sven Koenig, Fernando Ordóñez, Maged M. Dessouky, Marc-Etienne Brunet, Liron Cohen, Xiaoqing Wang:
Online Cost-Sharing Mechanism Design for Demand-Responsive Transport Systems. IEEE Trans. Intell. Transp. Syst. 16(2): 692-707 (2015) - [c4]Liron Cohen, Tansel Uras, Sven Koenig:
Feasibility Study: Using Highways for Bounded-Suboptimal Multi-Agent Path Finding. SOCS 2015: 2-8 - [i1]Bharath Sankaran, Marjan Ghazvininejad, Xinran He, David C. Kale, Liron Cohen:
Learning and Optimization with Submodular Functions. CoRR abs/1505.01576 (2015) - 2014
- [c3]Masabumi Furuhata, Liron Cohen, Sven Koenig, Maged M. Dessouky, Fernando Ordóñez:
Characterizing online cost-sharing mechanisms fordemand responsive transport systems. AAMAS 2014: 1491-1492 - 2013
- [c2]T. K. Satish Kumar, Liron Cohen, Sven Koenig:
Incorrect Lower Bounds for Path Consistency and More. SARA 2013 - [c1]T. K. Satish Kumar, Liron Cohen, Sven Koenig:
Submodular Constraints and Planar Constraint Networks: New Results. SARA 2013
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 2025-01-09 12:50 CET 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:
