Roni Stern

Orcid: 0000-0003-0043-8179

According to our database1, Roni Stern authored at least 169 papers between 2002 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
How do I find reusable models?
Softw. Syst. Model., February, 2024

Algorithm Selection for Optimal Multi-Agent Path Finding via Graph Embedding.
CoRR, 2024

Optimal and Bounded Suboptimal Any-Angle Multi-agent Pathfinding.
CoRR, 2024

Safe Learning of PDDL Domains with Conditional Effects - Extended Version.
CoRR, 2024

A domain-independent agent architecture for adaptive operation in evolving open worlds.
Artif. Intell., 2024

Optimal and Bounded Suboptimal Any-Angle Multi-agent Pathfinding (Extended Abstract).
Proceedings of the Seventeenth International Symposium on Combinatorial Search, 2024

Prioritised Planning with Guarantees.
Proceedings of the Seventeenth International Symposium on Combinatorial Search, 2024

Crafting a Pogo Stick in Minecraft with Heuristic Search (Extended Abstract).
Proceedings of the Seventeenth International Symposium on Combinatorial Search, 2024

Safe Learning of PDDL Domains with Conditional Effects.
Proceedings of the Thirty-Fourth International Conference on Automated Planning and Scheduling, 2024

Novelty Accommodating Multi-Agent Planning in High Fidelity Simulated Open World.
Proceedings of the ECAI 2024 - 27th European Conference on Artificial Intelligence, 19-24 October 2024, Santiago de Compostela, Spain, 2024

Diagnosing Non-Intermittent Anomalies in Reinforcement Learning Policy Executions (Short Paper).
Proceedings of the 35th International Conference on Principles of Diagnosis and Resilient Systems, 2024

Diagnosing Multi-Agent STRIPS Plans.
Proceedings of the 35th International Conference on Principles of Diagnosis and Resilient Systems, 2024

Learning Safe Action Models with Partial Observability.
Proceedings of the Thirty-Eighth AAAI Conference on Artificial Intelligence, 2024

2023
Enhancing Numeric-SAM for Learning with Few Observations.
CoRR, 2023

A Domain-Independent Agent Architecture for Adaptive Operation in Evolving Open Worlds.
CoRR, 2023

Heuristic Search for Physics-Based Problems: Angry Birds in PDDL+ [Extended Abstract].
Proceedings of the Sixteenth International Symposium on Combinatorial Search, 2023

Adapting to Planning Failures in Lifelong Multi-Agent Path Finding.
Proceedings of the Sixteenth International Symposium on Combinatorial Search, 2023

Greedy Priority-Based Search for Suboptimal Multi-Agent Path Finding.
Proceedings of the Sixteenth International Symposium on Combinatorial Search, 2023

Blame Attribution for Multi-Agent Path Finding Execution Failures.
Proceedings of the ECAI 2023 - 26th European Conference on Artificial Intelligence, September 30 - October 4, 2023, Kraków, Poland, 2023

Multi-Agent Planning and Diagnosis with Commonsense Reasoning.
Proceedings of the Fifth International Conference on Distributed Artificial Intelligence, 2023

Learning to Operate in Open Worlds by Adapting Planning Models.
Proceedings of the 2023 International Conference on Autonomous Agents and Multiagent Systems, 2023

Blame Attribution for Multi-Agent Pathfinding Execution Failures.
Proceedings of the 2023 International Conference on Autonomous Agents and Multiagent Systems, 2023

Multi Agent Path Finding under Obstacle Uncertainty.
Proceedings of the Thirty-Third International Conference on Automated Planning and Scheduling, 2023

Heuristic Search for Physics-Based Problems: Angry Birds in PDDL+.
Proceedings of the Thirty-Third International Conference on Automated Planning and Scheduling, 2023

Synthesizing Priority Planning Formulae for Multi-Agent Pathfinding.
Proceedings of the AAAI Conference on Artificial Intelligence and Interactive Digital Entertainment, 2023

Distributed Spectrum-Based Fault Localization.
Proceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence, 2023

Learning Safe Numeric Action Models.
Proceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence, 2023

2022
An impact-driven approach to predict user stories instability.
Requir. Eng., 2022

Migrating Techniques from Search-based Multi-Agent Path Finding Solvers to SAT-based Approach.
J. Artif. Intell. Res., 2022

An Example of the SAM+ Algorithm for Learning Action Models for Stochastic Worlds.
CoRR, 2022

Multi-agent pathfinding with continuous time.
Artif. Intell., 2022

Reducing disclosed dependencies in privacy preserving planning.
Auton. Agents Multi Agent Syst., 2022

Privacy preserving planning in multi-agent stochastic environments.
Auton. Agents Multi Agent Syst., 2022

Online Multi-Agent Path Finding: New Results.
Proceedings of the Fifteenth International Symposium on Combinatorial Search, 2022

An Online Approach for Multi-Agent Path Finding Under Movement Uncertainty (Extended Abstract).
Proceedings of the Fifteenth International Symposium on Combinatorial Search, 2022

Learning Probably Approximately Complete and Safe Action Models for Stochastic Worlds.
Proceedings of the Thirty-Sixth AAAI Conference on Artificial Intelligence, 2022

2021
Safe Multi-Agent Pathfinding with Time Uncertainty.
J. Artif. Intell. Res., 2021

Playing Angry Birds with a Domain-Independent PDDL+ Planner.
CoRR, 2021

Heuristic search for one-to-many shortest path queries.
Ann. Math. Artif. Intell., 2021

Studying Online Multi-Agent Path Finding.
Proceedings of the Fourteenth International Symposium on Combinatorial Search, 2021

Experimental Evaluation of Classical Multi Agent Path Finding Algorithms.
Proceedings of the Fourteenth International Symposium on Combinatorial Search, 2021

Safe Learning of Lifted Action Models.
Proceedings of the 18th International Conference on Principles of Knowledge Representation and Reasoning, 2021

Prioritized Test Generation Guided by Software Fault Prediction.
Proceedings of the 14th IEEE International Conference on Software Testing, 2021

Model-Based Knowledge Searching.
Proceedings of the Conceptual Modeling - 40th International Conference, 2021

Searching for Class Models.
Proceedings of the Enterprise, Business-Process and Information Systems Modeling, 2021

Partial Disclosure of Private Dependencies in Privacy Preserving Planning.
Proceedings of the AAMAS '21: 20th International Conference on Autonomous Agents and Multiagent Systems, 2021

Towards a Unifying Framework for Formal Theories of Novelty.
Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

Improving Continuous-time Conflict Based Search.
Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

2020
Robust Multi-Agent Path Finding and Executing.
J. Artif. Intell. Res., 2020

Diagnosing Software System Exploits.
IEEE Intell. Syst., 2020

A Unifying Framework for Formal Theories of Novelty: Framework, Examples and Discussion.
CoRR, 2020

Batch repair actions for automated troubleshooting.
Artif. Intell., 2020

Bidding in Spades.
Proceedings of the ECAI 2020 - 24th European Conference on Artificial Intelligence, 29 August-8 September 2020, Santiago de Compostela, Spain, August 29 - September 8, 2020, 2020

Research Challenges and Opportunities in Multi-Agent Path Finding and Multi-Agent Pickup and Delivery Problems.
Proceedings of the 19th International Conference on Autonomous Agents and Multiagent Systems, 2020

Revisiting Bounded-Suboptimal Safe Interval Path Planning.
Proceedings of the Thirtieth International Conference on Automated Planning and Scheduling, 2020

Privacy Preserving Planning in Stochastic Environments.
Proceedings of the Thirtieth International Conference on Automated Planning and Scheduling, 2020

Algorithm Selection for Optimal Multi-Agent Pathfinding.
Proceedings of the Thirtieth International Conference on Automated Planning and Scheduling, 2020

Solving the Longest Simple Path Problem with Heuristic Search.
Proceedings of the Thirtieth International Conference on Automated Planning and Scheduling, 2020

Probabilistic Robust Multi-Agent Path Finding.
Proceedings of the Thirtieth International Conference on Automated Planning and Scheduling, 2020

AI for Software Quality Assurance Blue Sky Ideas Talk.
Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence, 2020

2019
Target oriented network intelligence collection: effective exploration of social networks.
World Wide Web, 2019

Goal and Plan Recognition Design for Plan Libraries.
ACM Trans. Intell. Syst. Technol., 2019

Learning Test Traces.
CoRR, 2019

Multi-Agent Pathfinding (MAPF) with Continuous Time.
CoRR, 2019

Probably bounded suboptimal heuristic search.
Artif. Intell., 2019

Corrigendum to "Sequential plan recognition: An iterative approach to disambiguating between hypotheses" [Artif. Intell. 260 (2018) 51-73].
Artif. Intell., 2019

Measuring the Vulnerability of a Multi-Agent Pathfinding Solution.
Proceedings of the Twelfth International Symposium on Combinatorial Search, 2019

Multi-Agent Pathfinding: Definitions, Variants, and Benchmarks.
Proceedings of the Twelfth International Symposium on Combinatorial Search, 2019

Assigning Suppliers to Meet a Deadline.
Proceedings of the Twelfth International Symposium on Combinatorial Search, 2019

Probabilistic Robust Multi-Agent Path Finding.
Proceedings of the Twelfth International Symposium on Combinatorial Search, 2019

Multi-Agent Path Finding - An Overview.
Proceedings of the Artificial Intelligence, 2019

Domain-Dependent and Domain-Independent Problem Solving Techniques.
Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence, 2019

Multi-Agent Pathfinding with Continuous Time.
Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence, 2019

Online Multi-Agent Pathfinding.
Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence, 2019

Safe Partial Diagnosis from Normal Observations.
Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence, 2019

DeBGUer: A Tool for Bug Prediction and Diagnosis.
Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence, 2019

2018
Structural abstraction for model-based diagnosis with a strong fault model.
Knowl. Based Syst., 2018

An Artificial Intelligence paradigm for troubleshooting software bugs.
Eng. Appl. Artif. Intell., 2018

Sequential plan recognition: An iterative approach to disambiguating between hypotheses.
Artif. Intell., 2018

Action dependencies in privacy-preserving multi-agent planning.
Auton. Agents Multi Agent Syst., 2018

Sub-Optimal SAT-Based Approach to Multi-Agent Path-Finding Problem.
Proceedings of the Eleventh International Symposium on Combinatorial Search, 2018

Focused SANA: Speeding Up Network Alignment.
Proceedings of the Eleventh International Symposium on Combinatorial Search, 2018

Bounded Suboptimal Game Tree Search.
Proceedings of the Eleventh International Symposium on Combinatorial Search, 2018

Robust Multi-Agent Path Finding.
Proceedings of the Eleventh International Symposium on Combinatorial Search, 2018

2017
Fast-CBUS: A fast clustering-based undersampling method for addressing the class imbalance problem.
Neurocomputing, 2017

Diagnosing resource usage failures in multi-agent systems.
Expert Syst. Appl., 2017

How many diagnoses do we need?
Artif. Intell., 2017

Collaborative privacy preserving multi-agent planning - Planners and heuristics.
Auton. Agents Multi Agent Syst., 2017

Modifying Optimal SAT-Based Approach to Multi-Agent Path-Finding Problem to Suboptimal Variants.
Proceedings of the Tenth International Symposium on Combinatorial Search, 2017

Shortest Path for K Goals.
Proceedings of the Tenth International Symposium on Combinatorial Search, 2017

Dynamic Potential Search on Weighted Graphs.
Proceedings of the Tenth International Symposium on Combinatorial Search, 2017

Search-Based Optimal Solvers for the Multi-Agent Pathfinding Problem: Summary and Challenges.
Proceedings of the Tenth International Symposium on Combinatorial Search, 2017

k-Robust Multi-Agent Path Finding.
Proceedings of the Tenth International Symposium on Combinatorial Search, 2017

Efficient, Safe, and Probably Approximately Complete Learning of Action Models.
Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, 2017

Modeling and Solving the Multi-agent Pathfinding Problem in Picat.
Proceedings of the 29th IEEE International Conference on Tools with Artificial Intelligence, 2017

Plan Recognition Design.
Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, 2017

2016
Predicting optimal solution costs with bidirectional stratified sampling in regular search spaces.
Artif. Intell., 2016

An Empirical Comparison of the Hardness of Multi-Agent Path Finding under the Makespan and the Sum of Costs Objectives.
Proceedings of the Ninth Annual Symposium on Combinatorial Search, 2016

Batch Repair with Heuristic Search.
Proceedings of the Ninth Annual Symposium on Combinatorial Search, 2016

Repair Policies for Not Reopening Nodes in Different Search Settings.
Proceedings of the Ninth Annual Symposium on Combinatorial Search, 2016

Searching with a Corrupted Heuristic.
Proceedings of the Ninth Annual Symposium on Combinatorial Search, 2016

Dynamic Potential Search - A New Bounded Suboptimal Search.
Proceedings of the Ninth Annual Symposium on Combinatorial Search, 2016

Sequential Plan Recognition.
Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, 2016

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

Efficient SAT Approach to Multi-Agent Path Finding Under the Sum of Costs Objective.
Proceedings of the ECAI 2016 - 22nd European Conference on Artificial Intelligence, 29 August-2 September 2016, The Hague, The Netherlands, 2016

Boolean Satisfiability Approach to Optimal Multi-agent Path Finding under the Sum of Costs Objective: (Extended Abstract).
Proceedings of the 2016 International Conference on Autonomous Agents & Multiagent Systems, 2016

Sequential Plan Recognition: (Extended Abstract).
Proceedings of the 2016 International Conference on Autonomous Agents & Multiagent Systems, 2016

Stronger Privacy Preserving Projections for Multi-Agent Planning.
Proceedings of the Twenty-Sixth International Conference on Automated Planning and Scheduling, 2016

What's Hot in Heuristic Search.
Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence, 2016

Implementing Troubleshooting with Batch Repair.
Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence, 2016

Data-Augmented Software Diagnosis.
Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence, 2016

2015
Conflict-based search for optimal multi-agent pathfinding.
Artif. Intell., 2015

Solving the Snake in the Box Problem with Heuristic Search: First Results.
Proceedings of the Eighth Annual Symposium on Combinatorial Search, 2015

Search Problems in the Domain of Multiplication: Case Study on Anomaly Detection Using Markov Chains.
Proceedings of the Eighth Annual Symposium on Combinatorial Search, 2015

Max Is More than Min: Solving Maximization Problems with Heuristic Search.
Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, 2015

ICBS: Improved Conflict-Based Search Algorithm for Multi-Agent Pathfinding.
Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, 2015

Don't Split, Try To Work It Out: Bypassing Conflicts in Multi-Agent Pathfinding.
Proceedings of the Twenty-Fifth International Conference on Automated Planning and Scheduling, 2015

Multi-Agent Pathfinding as a Combinatorial Auction.
Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence, 2015

2014
A Novel SAT-Based Approach to Model Based Diagnosis.
J. Artif. Intell. Res., 2014

Enhanced Partial Expansion A.
J. Artif. Intell. Res., 2014

Model-based diagnosis techniques for Internet delay diagnosis with dynamic routing.
Appl. Intell., 2014

Predicting optimal solution cost with conditional probabilities - Predicting optimal solution cost.
Ann. Math. Artif. Intell., 2014

Potential-based bounded-cost search and Anytime Non-Parametric A<sup>*</sup>.
Artif. Intell., 2014

Extended Framework for Target Oriented Network Intelligence Collection.
Proceedings of the Seventh Annual Symposium on Combinatorial Search, 2014

Solving the Target-Value Search Problem.
Proceedings of the Seventh Annual Symposium on Combinatorial Search, 2014

Estimating Search Tree Size with Duplicate Detection.
Proceedings of the Seventh Annual Symposium on Combinatorial Search, 2014

A* with Lookahead Re-Evaluated.
Proceedings of the Seventh Annual Symposium on Combinatorial Search, 2014

Privacy Preserving Landmark Detection.
Proceedings of the ECAI 2014 - 21st European Conference on Artificial Intelligence, 18-22 August 2014, Prague, Czech Republic, 2014

Suboptimal Variants of the Conflict-Based Search Algorithm for the Multi-Agent Pathfinding Problem.
Proceedings of the ECAI 2014 - 21st European Conference on Artificial Intelligence, 18-22 August 2014, Prague, Czech Republic, 2014

Diagnosing faults in a temporal multi-agent resource allocation: (extended abstract).
Proceedings of the International conference on Autonomous Agents and Multi-Agent Systems, 2014

Using Model-Based Diagnosis to Improve Software Testing.
Proceedings of the Twenty-Eighth AAAI Conference on Artificial Intelligence, 2014

To Share or Not to Share? The Single Agent in a Team Decision Problem.
Proceedings of the Twenty-Eighth AAAI Conference on Artificial Intelligence, 2014

2013
The increasing cost tree search for optimal multi-agent pathfinding.
Artif. Intell., 2013

Target-Value Search Revisited (Extended Abstract).
Proceedings of the Sixth Annual Symposium on Combinatorial Search, 2013

Bounded Suboptimal Heuristic Search in Linear Space.
Proceedings of the Sixth Annual Symposium on Combinatorial Search, 2013

Multi-Agent Path Finding for Self Interested Agents.
Proceedings of the Sixth Annual Symposium on Combinatorial Search, 2013

Bandit Algorithms for Social Network Queries.
Proceedings of the International Conference on Social Computing, SocialCom 2013, 2013

Target-Value Search Revisited.
Proceedings of the IJCAI 2013, 2013

Collaborative health care plan support.
Proceedings of the International conference on Autonomous Agents and Multi-Agent Systems, 2013

Using Alternative Suboptimality Bounds in Heuristic Search.
Proceedings of the Twenty-Third International Conference on Automated Planning and Scheduling, 2013

TONIC: Target Oriented Network Intelligence Collection for the Social Web.
Proceedings of the Twenty-Seventh AAAI Conference on Artificial Intelligence, 2013

Partial Domain Search Tree For Constraint-Satisfaction Problems.
Proceedings of the Late-Breaking Developments in the Field of Artificial Intelligence, 2013

Volatile Multi-Armed Bandits for Guaranteed Targeted Social Crawling.
Proceedings of the Late-Breaking Developments in the Field of Artificial Intelligence, 2013

2012
Reports of the AAAI 2012 Conference Workshops.
AI Mag., 2012

Finding patterns in an unknown graph.
AI Commun., 2012

Alternative Forms of Bounded Suboptimal Search.
Proceedings of the Fifth Annual Symposium on Combinatorial Search, 2012

Are We There Yet? - Estimating Search Progress.
Proceedings of the Fifth Annual Symposium on Combinatorial Search, 2012

Search-Aware Conditions for Probably Approximately Correct Heuristic Search.
Proceedings of the Fifth Annual Symposium on Combinatorial Search, 2012

Meta-Agent Conflict-Based Search For Optimal Multi-Agent Path Finding.
Proceedings of the Fifth Annual Symposium on Combinatorial Search, 2012

Predicting Optimal Solution Cost with Bidirectional Stratified Sampling (Abstract).
Proceedings of the Fifth Annual Symposium on Combinatorial Search, 2012

A* Variants for Optimal Multi-Agent Pathfinding.
Proceedings of the Fifth Annual Symposium on Combinatorial Search, 2012

Faster Bounded-Cost Search Using Inadmissible Estimates.
Proceedings of the Twenty-Second International Conference on Automated Planning and Scheduling, 2012

Predicting Optimal Solution Cost with Bidirectional Stratified Sampling.
Proceedings of the Twenty-Second International Conference on Automated Planning and Scheduling, 2012

Efficient Search for Transformation-based Inference.
Proceedings of the 50th Annual Meeting of the Association for Computational Linguistics, Proceedings of the Conference, July 8-14, 2012, Jeju Island, Korea, 2012

Exploring the Duality in Conflict-Directed Model-Based Diagnosis.
Proceedings of the Twenty-Sixth AAAI Conference on Artificial Intelligence, 2012

Conflict-Based Search For Optimal Multi-Agent Path Finding.
Proceedings of the Twenty-Sixth AAAI Conference on Artificial Intelligence, 2012

Compiling Model-Based Diagnosis to Boolean Satisfaction.
Proceedings of the Twenty-Sixth AAAI Conference on Artificial Intelligence, 2012

A* Variants for Optimal Multi-Agent Pathfinding.
Proceedings of the Multiagent Pathfinding, Papers from the 2012 AAAI Workshop, 2012

Partial-Expansion A* with Selective Node Generation.
Proceedings of the Twenty-Sixth AAAI Conference on Artificial Intelligence, 2012

2011
Probably Approximately Correct Heuristic Search.
Proceedings of the Fourth Annual Symposium on Combinatorial Search, 2011

Pruning Techniques for the Increasing Cost Tree Search for Optimal Multi-agent Pathfinding.
Proceedings of the Fourth Annual Symposium on Combinatorial Search, 2011

Predicting Solution Cost with Conditional Probabilities.
Proceedings of the Fourth Annual Symposium on Combinatorial Search, 2011

Potential Search: A Bounded-Cost Search Algorithm.
Proceedings of the 21st International Conference on Automated Planning and Scheduling, 2011

2010
Potential Search: A New Greedy Anytime Heuristic Search.
Proceedings of the Third Annual Symposium on Combinatorial Search, 2010

Searching for a k-Clique in Unknown Graphs.
Proceedings of the Third Annual Symposium on Combinatorial Search, 2010

Using Lookaheads with Optimal Best-First Search.
Proceedings of the Twenty-Fourth AAAI Conference on Artificial Intelligence, 2010

2007
Searching for close alternative plans.
Auton. Agents Multi Agent Syst., 2007

2004
PHA*: Finding the Shortest Path with A* in An Unknown Physical Environment.
J. Artif. Intell. Res., 2004

2002
PHA*: performing A* in unknown physical environments.
Proceedings of the First International Joint Conference on Autonomous Agents & Multiagent Systems, 2002


  Loading...