Остановите войну!
for scientists:
default search action
Roni Stern
- > Home > Persons > Roni Stern
Publications
- 2023
- [c120]Shao-Hung Chan, Roni Stern, Ariel Felner, Sven Koenig:
Greedy Priority-Based Search for Suboptimal Multi-Agent Path Finding. SOCS 2023: 11-19 - [c119]Jonathan Morag, Roni Stern, Ariel Felner:
Adapting to Planning Failures in Lifelong Multi-Agent Path Finding. SOCS 2023: 47-55 - 2022
- [j32]Pavel Surynek, Roni Stern, Eli Boyarski, Ariel Felner:
Migrating Techniques from Search-based Multi-Agent Path Finding Solvers to SAT-based Approach. J. Artif. Intell. Res. 73: 553-618 (2022) - [c116]Jonathan Morag, Ariel Felner, Roni Stern, Dor Atzmon, Eli Boyarski:
Online Multi-Agent Path Finding: New Results. SOCS 2022: 229-233 - 2021
- [j30]Roni Stern, Meir Goldenberg, Abdallah Saffidine, Ariel Felner:
Heuristic search for one-to-many shortest path queries. Ann. Math. Artif. Intell. 89(12): 1175-1214 (2021) - [c105]Jonathan Morag, Roni Stern, Ariel Felner, Dor Atzmon, Eli Boyarski:
Studying Online Multi-Agent Path Finding. SOCS 2021: 228-230 - 2020
- [j26]Dor Atzmon, Roni Stern, Ariel Felner, Glenn Wagner, Roman Barták, Neng-Fa Zhou:
Robust Multi-Agent Path Finding and Executing. J. Artif. Intell. Res. 67: 549-579 (2020) - [c103]Dor Atzmon, Roni Stern, Ariel Felner, Nathan R. Sturtevant, Sven Koenig:
Probabilistic Robust Multi-Agent Path Finding. ICAPS 2020: 29-37 - [c102]Yossi Cohen, Roni Stern, Ariel Felner:
Solving the Longest Simple Path Problem with Heuristic Search. ICAPS 2020: 75-79 - 2019
- [j22]Rami Puzis, Liron Samama-Kachko, Barak Hagbi, Roni Stern, Ariel Felner:
Target oriented network intelligence collection: effective exploration of social networks. World Wide Web 22(4): 1447-1480 (2019) - [c90]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 - [c89]Dor Atzmon, Ariel Felner, Roni Stern:
Probabilistic Robust Multi-Agent Path Finding. SOCS 2019: 162-163 - [i7]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
- [c86]Dor Atzmon, Roni Stern, Ariel Felner, Glenn Wagner, Roman Barták, Neng-Fa Zhou:
Robust Multi-Agent Path Finding. AAMAS 2018: 1862-1864 - [c85]Dor Atzmon, Roni Stern, Ariel Felner, Glenn Wagner, Roman Barták, Neng-Fa Zhou:
Robust Multi-Agent Path Finding. SOCS 2018: 2-9 - [c83]Pavel Surynek, Ariel Felner, Roni Stern, Eli Boyarski:
Sub-Optimal SAT-Based Approach to Multi-Agent Path-Finding Problem. SOCS 2018: 99-105 - 2017
- [c77]Ariel Felner, Roni Stern, Solomon Eyal Shimony, Eli Boyarski, Meir Goldenberg, Guni Sharon, Nathan R. Sturtevant, Glenn Wagner, Pavel Surynek:
Search-Based Optimal Solvers for the Multi-Agent Pathfinding Problem: Summary and Challenges. SOCS 2017: 29-37 - [c76]Daniel Gilon, Ariel Felner, Roni Stern:
Dynamic Potential Search on Weighted Graphs. SOCS 2017: 119-123 - [c75]Dor Atzmon, Ariel Felner, Roni Stern, Glenn Wagner, Roman Barták, Neng-Fa Zhou:
k-Robust Multi-Agent Path Finding. SOCS 2017: 157-158 - [c74]Roni Tzvi Stern, Meir Goldenberg, Ariel Felner:
Shortest Path for K Goals. SOCS 2017: 167-168 - [c73]Pavel Surynek, Ariel Felner, Roni Stern, Eli Boyarski:
Modifying Optimal SAT-Based Approach to Multi-Agent Path-Finding Problem to Suboptimal Variants. SOCS 2017: 169-170 - [i2]Pavel Surynek, Ariel Felner, Roni Stern, Eli Boyarski:
Modifying Optimal SAT-based Approach to Multi-agent Path-finding Problem to Suboptimal Variants. CoRR abs/1707.00228 (2017) - 2016
- [j13]Levi H. S. Lelis, Roni Stern, Shahab Jabbari Arfaee, Sandra Zilles, Ariel Felner, Robert C. Holte:
Predicting optimal solution costs with bidirectional stratified sampling in regular search spaces. Artif. Intell. 230: 51-73 (2016) - [c67]Pavel Surynek, Ariel Felner, Roni Stern, Eli Boyarski:
Boolean Satisfiability Approach to Optimal Multi-agent Path Finding under the Sum of Costs Objective: (Extended Abstract). AAMAS 2016: 1435-1436 - [c66]Pavel Surynek, Ariel Felner, Roni Stern, Eli Boyarski:
Efficient SAT Approach to Multi-Agent Path Finding Under the Sum of Costs Objective. ECAI 2016: 810-818 - [c63]Daniel Gilon, Ariel Felner, Roni Stern:
Dynamic Potential Search - A New Bounded Suboptimal Search. SOCS 2016: 36-44 - [c61]Vitali Sepetnitsky, Ariel Felner, Roni Stern:
Repair Policies for Not Reopening Nodes in Different Search Settings. SOCS 2016: 81-88 - [c59]Pavel Surynek, Ariel Felner, Roni Stern, Eli Boyarski:
An Empirical Comparison of the Hardness of Multi-Agent Path Finding under the Makespan and the Sum of Costs Objectives. SOCS 2016: 145-146 - 2015
- [j12]Guni Sharon, Roni Stern, Ariel Felner, Nathan R. Sturtevant:
Conflict-based search for optimal multi-agent pathfinding. Artif. Intell. 219: 40-66 (2015) - [c56]Eli Boyarski, Ariel Felner, Guni Sharon, Roni Stern:
Don't Split, Try To Work It Out: Bypassing Conflicts in Multi-Agent Pathfinding. ICAPS 2015: 47-51 - [c55]Eli Boyarski, Ariel Felner, Roni Stern, Guni Sharon, David Tolpin, Oded Betzalel, Solomon Eyal Shimony:
ICBS: Improved Conflict-Based Search Algorithm for Multi-Agent Pathfinding. IJCAI 2015: 740-746 - [c54]Roni Stern, Scott Kiesel, Rami Puzis, Ariel Felner, Wheeler Ruml:
Max Is More than Min: Solving Maximization Problems with Heuristic Search. IJCAI 2015: 4324-4330 - [c51]Yisroel Mirsky, Aviad Cohen, Roni Stern, Ariel Felner, Lior Rokach, Yuval Elovici, Bracha Shapira:
Search Problems in the Domain of Multiplication: Case Study on Anomaly Detection Using Markov Chains. SOCS 2015: 70-77 - [c50]Alon Palombo, Roni Stern, Rami Puzis, Ariel Felner, Scott Kiesel, Wheeler Ruml:
Solving the Snake in the Box Problem with Heuristic Search: First Results. SOCS 2015: 96-104 - [c49]Eli Boyarski, Ariel Felner, Roni Stern, Guni Sharon, Oded Betzalel, David Tolpin, Solomon Eyal Shimony:
ICBS: The Improved Conflict-Based Search Algorithm for Multi-Agent Pathfinding. SOCS 2015: 223-225 - 2014
- [j11]Roni Stern, Ariel Felner, Jur van den Berg, Rami Puzis, Rajat Shah, Ken Goldberg:
Potential-based bounded-cost search and Anytime Non-Parametric A*. Artif. Intell. 214: 1-25 (2014) - [j10]Levi H. S. Lelis, Roni Stern, Ariel Felner, Sandra Zilles, Robert C. Holte:
Predicting optimal solution cost with conditional probabilities - Predicting optimal solution cost. Ann. Math. Artif. Intell. 72(3-4): 267-295 (2014) - [j8]Meir Goldenberg, Ariel Felner, Roni Stern, Guni Sharon, Nathan R. Sturtevant, Robert C. Holte, Jonathan Schaeffer:
Enhanced Partial Expansion A. J. Artif. Intell. Res. 50: 141-187 (2014) - [c44]Max Barer, Guni Sharon, Roni Stern, Ariel Felner:
Suboptimal Variants of the Conflict-Based Search Algorithm for the Multi-Agent Pathfinding Problem. ECAI 2014: 961-962 - [c43]Max Barer, Guni Sharon, Roni Stern, Ariel Felner:
Suboptimal Variants of the Conflict-Based Search Algorithm for the Multi-Agent Pathfinding Problem. SOCS 2014: 19-27 - [c42]Zhaoxing Bu, Roni Stern, Ariel Felner, Robert Craig Holte:
A* with Lookahead Re-Evaluated. SOCS 2014: 44-52 - [c40]Liron Samama-Kachko, Rami Puzis, Roni Stern, Ariel Felner:
Extended Framework for Target Oriented Network Intelligence Collection. SOCS 2014: 131-138 - [c39]Roni Tzvi Stern, Scott Kiesel, Rami Puzis, Ariel Felner, Wheeler Ruml:
Max is More than Min: Solving Maximization Problems with Heuristic Search. SOCS 2014: 148-156 - [c38]Carlos Linares López, Roni Stern, Ariel Felner:
Solving the Target-Value Search Problem. SOCS 2014: 202-203 - 2013
- [j6]Guni Sharon, Roni Stern, Meir Goldenberg, Ariel Felner:
The increasing cost tree search for optimal multi-agent pathfinding. Artif. Intell. 195: 470-495 (2013) - [c37]Zahy Bnaya, Rami Puzis, Roni Stern, Ariel Felner:
Volatile Multi-Armed Bandits for Guaranteed Targeted Social Crawling. AAAI (Late-Breaking Developments) 2013 - [c36]Guni Sharon, Ariel Felner, Roni Stern, Nathan R. Sturtevant:
Partial Domain Search Tree For Constraint-Satisfaction Problems. AAAI (Late-Breaking Developments) 2013 - [c35]Roni Tzvi Stern, Liron Samama, Rami Puzis, Tal Beja, Zahy Bnaya, Ariel Felner:
TONIC: Target Oriented Network Intelligence Collection for the Social Web. AAAI 2013: 1184-1190 - [c32]Carlos Linares López, Roni Stern, Ariel Felner:
Target-Value Search Revisited. IJCAI 2013: 601-607 - [c31]Zahy Bnaya, Rami Puzis, Roni Stern, Ariel Felner:
Bandit Algorithms for Social Network Queries. SocialCom 2013: 148-153 - [c30]Zahy Bnaya, Roni Stern, Ariel Felner, Roie Zivan, Steven Okamoto:
Multi-Agent Path Finding for Self Interested Agents. SOCS 2013: 38-46 - [c28]Carlos Linares López, Roni Stern, Ariel Felner:
Target-Value Search Revisited (Extended Abstract). SOCS 2013: 216-217 - 2012
- [j5]Roni Stern, Meir Kalech, Ariel Felner:
Finding patterns in an unknown graph. AI Commun. 25(3): 229-256 (2012) - [c27]Ariel Felner, Meir Goldenberg, Guni Sharon, Roni Stern, Tal Beja, Nathan R. Sturtevant, Jonathan Schaeffer, Robert Holte:
Partial-Expansion A* with Selective Node Generation. AAAI 2012: 471-477 - [c26]Meir Goldenberg, Ariel Felner, Roni Stern, Guni Sharon, Jonathan Schaeffer:
A* Variants for Optimal Multi-Agent Pathfinding. MAPF@AAAI 2012 - [c25]Guni Sharon, Roni Stern, Ariel Felner, Nathan R. Sturtevant:
Conflict-Based Search For Optimal Multi-Agent Path Finding. AAAI 2012: 563-569 - [c23]Guni Sharon, Roni Stern, Ariel Felner, Nathan R. Sturtevant:
Conflict-Based Search for Optimal Multi-Agent Path Finding. MAPF@AAAI 2012 - [c21]Asher Stern, Roni Stern, Ido Dagan, Ariel Felner:
Efficient Search for Transformation-based Inference. ACL (1) 2012: 283-291 - [c20]Levi Lelis, Roni Stern, Ariel Felner, Sandra Zilles, Robert C. Holte:
Predicting Optimal Solution Cost with Bidirectional Stratified Sampling. ICAPS 2012 - [c19]Jordan Tyler Thayer, Roni Stern, Ariel Felner, Wheeler Ruml:
Faster Bounded-Cost Search Using Inadmissible Estimates. ICAPS 2012 - [c18]Guni Sharon, Roni Stern, Ariel Felner, Nathan R. Sturtevant:
Meta-Agent Conflict-Based Search For Optimal Multi-Agent Path Finding. SOCS 2012: 97-104 - [c17]Roni Tzvi Stern, Ariel Felner, Robert C. Holte:
Search-Aware Conditions for Probably Approximately Correct Heuristic Search. SOCS 2012: 112-119 - [c15]Meir Goldenberg, Ariel Felner, Roni Stern, Jonathan Schaeffer:
A* Variants for Optimal Multi-Agent Pathfinding. SOCS 2012: 157-158 - [c13]Ariel Felner, Meir Goldenberg, Guni Sharon, Roni Stern, Tal Beja, Nathan R. Sturtevant, Robert Holte, Jonathan Schaeffer:
Partial-Expansion A* with Selective Node Generation. SOCS 2012: 180-181 - [c12]Levi H. S. Lelis, Roni Stern, Ariel Felner, Sandra Zilles, Robert C. Holte:
Predicting Optimal Solution Cost with Bidirectional Stratified Sampling (Abstract). SOCS 2012: 186-187 - [c11]Guni Sharon, Roni Stern, Ariel Felner, Nathan R. Sturtevant:
Conflict-Based Search for Optimal Multi-Agent Path Finding. SOCS 2012: 190 - [e1]Ariel Felner, Nathan R. Sturtevant, Kostas E. Bekris, Roni Stern:
Multiagent Pathfinding, Papers from the 2012 AAAI Workshop, MAPF@AAAI 2012, Toronto, Ontario, Canada, July 22, 2012. AAAI Technical Report WS-12-10, AAAI Press 2012, ISBN 978-1-57735-575-5 [contents] - 2011
- [c10]Roni Tzvi Stern, Rami Puzis, Ariel Felner:
Potential Search: A Bounded-Cost Search Algorithm. ICAPS 2011 - [c9]Guni Sharon, Roni Stern, Meir Goldenberg, Ariel Felner:
The Increasing Cost Tree Search for Optimal Multi-Agent Pathfinding. IJCAI 2011: 662-667 - [c7]Guni Sharon, Roni Tzvi Stern, Meir Goldenberg, Ariel Felner:
Pruning Techniques for the Increasing Cost Tree Search for Optimal Multi-agent Pathfinding. SOCS 2011: 150-157 - [c6]Roni Stern, Ariel Felner, Robert Holte:
Probably Approximately Correct Heuristic Search. SOCS 2011: 158-163 - [i1]Asaph Ben-Yair, Ariel Felner, Sarit Kraus, Nathan S. Netanyahu, Roni Stern:
PHA*: Finding the Shortest Path with A* in An Unknown Physical Environment. CoRR abs/1107.0041 (2011) - 2010
- [c5]Roni Stern, Tamar Kulberis, Ariel Felner, Robert Holte:
Using Lookaheads with Optimal Best-First Search. AAAI 2010: 185-190 - [c4]Roni Stern, Meir Kalech, Ariel Felner:
Searching for a k-clique in unknown graphs. AAMAS 2010: 1391-1392 - [c3]Roni Tzvi Stern, Meir Kalech, Ariel Felner:
Searching for a k-Clique in Unknown Graphs. SOCS 2010: 83-89 - [c2]Roni Tzvi Stern, Rami Puzis, Ariel Felner:
Potential Search: A New Greedy Anytime Heuristic Search. SOCS 2010: 119-120 - 2007
- [j3]Ariel Felner, Roni Stern, Jeffrey S. Rosenschein, Alex Pomeransky:
Searching for close alternative plans. Auton. Agents Multi Agent Syst. 14(3): 209 (2007) - [j2]Ariel Felner, Roni Stern, Jeffrey S. Rosenschein, Alex Pomeransky:
Searching for close alternative plans. Auton. Agents Multi Agent Syst. 14(3): 211-237 (2007) - 2004
- [j1]Ariel Felner, Roni Stern, Sarit Kraus, Asaph Ben-Yair, Nathan S. Netanyahu:
PHA*: Finding the Shortest Path with A* in An Unknown Physical Environment. J. Artif. Intell. Res. 21: 631-670 (2004) - 2002
- [c1]Ariel Felner, Roni Stern, Sarit Kraus:
PHA*: performing A* in unknown physical environments. AAMAS 2002: 240-247
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-25 02:04 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint