Roni Stern

Proceedings of the 19th International Conference on Autonomous Agents and Multiagent Systems, 2020

Revisiting Bounded-Suboptimal Safe Interval Path Planning.

[BibT_eX]

[DOI]

Konstantin S. Yakovlev

Anton Andreychuk

Proceedings of the Thirtieth International Conference on Automated Planning and Scheduling, 2020

Privacy Preserving Planning in Stochastic Environments.

[BibT_eX]

[DOI]

Tommy Hefner

Proceedings of the Thirtieth International Conference on Automated Planning and Scheduling, 2020

Algorithm Selection for Optimal Multi-Agent Pathfinding.

[BibT_eX]

[DOI]

Omri Kaduri

Eli Boyarski

Proceedings of the Thirtieth International Conference on Automated Planning and Scheduling, 2020

Solving the Longest Simple Path Problem with Heuristic Search.

[BibT_eX]

[DOI]

Yossi Cohen

Proceedings of the Thirtieth International Conference on Automated Planning and Scheduling, 2020

Probabilistic Robust Multi-Agent Path Finding.

[BibT_eX]

[DOI]

Proceedings of the Thirtieth International Conference on Automated Planning and Scheduling, 2020

AI for Software Quality Assurance Blue Sky Ideas Talk.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence, 2020

2019

Target oriented network intelligence collection: effective exploration of social networks.

[BibT_eX]

[DOI]

World Wide Web, 2019

Goal and Plan Recognition Design for Plan Libraries.

[BibT_eX]

[DOI]

ACM Trans. Intell. Syst. Technol., 2019

Learning Test Traces.

[BibT_eX]

[DOI]

Eyal Hadad

CoRR, 2019

Multi-Agent Pathfinding (MAPF) with Continuous Time.

[BibT_eX]

[DOI]

Anton Andreychuk

Konstantin S. Yakovlev

CoRR, 2019

Probably bounded suboptimal heuristic search.

[BibT_eX]

[DOI]

Gal Dreiman

Artif. Intell., 2019

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

[BibT_eX]

Artif. Intell., 2019

Measuring the Vulnerability of a Multi-Agent Pathfinding Solution.

[BibT_eX]

[DOI]

Rotem Yoeli

Proceedings of the Twelfth International Symposium on Combinatorial Search, 2019

Multi-Agent Pathfinding: Definitions, Variants, and Benchmarks.

[BibT_eX]

[DOI]

Proceedings of the Twelfth International Symposium on Combinatorial Search, 2019

Assigning Suppliers to Meet a Deadline.

[BibT_eX]

[DOI]

Liat Cohen

Tal Grinshpoun

Proceedings of the Twelfth International Symposium on Combinatorial Search, 2019

Probabilistic Robust Multi-Agent Path Finding.

[BibT_eX]

[DOI]

Proceedings of the Twelfth International Symposium on Combinatorial Search, 2019

Multi-Agent Path Finding - An Overview.

[BibT_eX]

[DOI]

Proceedings of the Artificial Intelligence, 2019

Domain-Dependent and Domain-Independent Problem Solving Techniques.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence, 2019

Multi-Agent Pathfinding with Continuous Time.

[BibT_eX]

[DOI]

Anton Andreychuk

Konstantin S. Yakovlev

Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence, 2019

Online Multi-Agent Pathfinding.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence, 2019

Safe Partial Diagnosis from Normal Observations.

[BibT_eX]

[DOI]

Brendan Juba

Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence, 2019

DeBGUer: A Tool for Bug Prediction and Diagnosis.

[BibT_eX]

[DOI]

Amir Elmishali

Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence, 2019

2018

Structural abstraction for model-based diagnosis with a strong fault model.

[BibT_eX]

[DOI]

Orel Elimelech

Knowl. Based Syst., 2018

An Artificial Intelligence paradigm for troubleshooting software bugs.

[BibT_eX]

[DOI]

Amir Elmishali

Eng. Appl. Artif. Intell., 2018

Sequential plan recognition: An iterative approach to disambiguating between hypotheses.

[BibT_eX]

[DOI]

Artif. Intell., 2018

Action dependencies in privacy-preserving multi-agent planning.

[BibT_eX]

[DOI]

Auton. Agents Multi Agent Syst., 2018

Sub-Optimal SAT-Based Approach to Multi-Agent Path-Finding Problem.

[BibT_eX]

[DOI]

Proceedings of the Eleventh International Symposium on Combinatorial Search, 2018

Focused SANA: Speeding Up Network Alignment.

[BibT_eX]

[DOI]

Proceedings of the Eleventh International Symposium on Combinatorial Search, 2018

Bounded Suboptimal Game Tree Search.

[BibT_eX]

[DOI]

Abdallah Saffidine

Proceedings of the Eleventh International Symposium on Combinatorial Search, 2018

Robust Multi-Agent Path Finding.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Neurocomputing, 2017

Diagnosing resource usage failures in multi-agent systems.

[BibT_eX]

[DOI]

Expert Syst. Appl., 2017

How many diagnoses do we need?

[BibT_eX]

[DOI]

Artif. Intell., 2017

Collaborative privacy preserving multi-agent planning - Planners and heuristics.

[BibT_eX]

[DOI]

Auton. Agents Multi Agent Syst., 2017

Modifying Optimal SAT-Based Approach to Multi-Agent Path-Finding Problem to Suboptimal Variants.

[BibT_eX]

[DOI]

Proceedings of the Tenth International Symposium on Combinatorial Search, 2017

Shortest Path for K Goals.

[BibT_eX]

[DOI]

Meir Goldenberg

Proceedings of the Tenth International Symposium on Combinatorial Search, 2017

Dynamic Potential Search on Weighted Graphs.

[BibT_eX]

[DOI]

Daniel Gilon

Proceedings of the Tenth International Symposium on Combinatorial Search, 2017

Search-Based Optimal Solvers for the Multi-Agent Pathfinding Problem: Summary and Challenges.

[BibT_eX]

[DOI]

Proceedings of the Tenth International Symposium on Combinatorial Search, 2017

k-Robust Multi-Agent Path Finding.

[BibT_eX]

[DOI]

Proceedings of the Tenth International Symposium on Combinatorial Search, 2017

Efficient, Safe, and Probably Approximately Complete Learning of Action Models.

[BibT_eX]

[DOI]

Brendan Juba

Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, 2017

Modeling and Solving the Multi-agent Pathfinding Problem in Picat.

[BibT_eX]

[DOI]

Proceedings of the 29th IEEE International Conference on Tools with Artificial Intelligence, 2017

Plan Recognition Design.

[BibT_eX]

[DOI]

Proceedings of the Workshops of the The Thirty-First AAAI Conference on Artificial Intelligence, 2017

2016

Predicting optimal solution costs with bidirectional stratified sampling in regular search spaces.

[BibT_eX]

[DOI]

Shahab Jabbari Arfaee

Sandra Zilles

Robert C. Holte

Artif. Intell., 2016

An Empirical Comparison of the Hardness of Multi-Agent Path Finding under the Makespan and the Sum of Costs Objectives.

[BibT_eX]

[DOI]

Proceedings of the Ninth Annual Symposium on Combinatorial Search, 2016

Batch Repair with Heuristic Search.

[BibT_eX]

[DOI]

Hilla Shinitzky

Proceedings of the Ninth Annual Symposium on Combinatorial Search, 2016

Repair Policies for Not Reopening Nodes in Different Search Settings.

[BibT_eX]

[DOI]

Vitali Sepetnitsky

Proceedings of the Ninth Annual Symposium on Combinatorial Search, 2016

Searching with a Corrupted Heuristic.

[BibT_eX]

[DOI]

Gabriel L. Nazar

Proceedings of the Ninth Annual Symposium on Combinatorial Search, 2016

Dynamic Potential Search - A New Bounded Suboptimal Search.

[BibT_eX]

[DOI]

Daniel Gilon

Proceedings of the Ninth Annual Symposium on Combinatorial Search, 2016

Sequential Plan Recognition.

[BibT_eX]

[DOI]

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

Anticipatory Troubleshooting.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

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).

[BibT_eX]

[DOI]

Proceedings of the 2016 International Conference on Autonomous Agents & Multiagent Systems, 2016

Sequential Plan Recognition: (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the 2016 International Conference on Autonomous Agents & Multiagent Systems, 2016

Stronger Privacy Preserving Projections for Multi-Agent Planning.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Sixth International Conference on Automated Planning and Scheduling, 2016

What's Hot in Heuristic Search.

[BibT_eX]

[DOI]

Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence, 2016

Implementing Troubleshooting with Batch Repair.

[BibT_eX]

[DOI]

Hilla Shinitzky

Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence, 2016

Data-Augmented Software Diagnosis.

[BibT_eX]

[DOI]

Amir Elmishali

Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence, 2016

2015

Conflict-based search for optimal multi-agent pathfinding.

[BibT_eX]

[DOI]

Artif. Intell., 2015

Solving the Snake in the Box Problem with Heuristic Search: First Results.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Proceedings of the Eighth Annual Symposium on Combinatorial Search, 2015

ICBS: The Improved Conflict-Based Search Algorithm for Multi-Agent Pathfinding.

[BibT_eX]

[DOI]

Proceedings of the Eighth Annual Symposium on Combinatorial Search, 2015

Don't Split, Try To Work It Out: Bypassing Conflicts in Multi-Agent Pathfinding.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Fifth International Conference on Automated Planning and Scheduling, 2015

Multi-Agent Pathfinding as a Combinatorial Auction.

[BibT_eX]

[DOI]

Ofra Amir

Guni Sharon

Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence, 2015

2014

A Novel SAT-Based Approach to Model Based Diagnosis.

[BibT_eX]

[DOI]

J. Artif. Intell. Res., 2014

Enhanced Partial Expansion A.

[BibT_eX]

[DOI]

J. Artif. Intell. Res., 2014

Model-based diagnosis techniques for Internet delay diagnosis with dynamic routing.

[BibT_eX]

[DOI]

Appl. Intell., 2014

Predicting optimal solution cost with conditional probabilities - Predicting optimal solution cost.

[BibT_eX]

[DOI]

Ann. Math. Artif. Intell., 2014

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

[BibT_eX]

[DOI]

Artif. Intell., 2014

Max is More than Min: Solving Maximization Problems with Heuristic Search.

[BibT_eX]

[DOI]

Proceedings of the Seventh Annual Symposium on Combinatorial Search, 2014

Extended Framework for Target Oriented Network Intelligence Collection.

[BibT_eX]

[DOI]

Proceedings of the Seventh Annual Symposium on Combinatorial Search, 2014

Solving the Target-Value Search Problem.

[BibT_eX]

[DOI]

Carlos Linares López

Proceedings of the Seventh Annual Symposium on Combinatorial Search, 2014

Estimating Search Tree Size with Duplicate Detection.

[BibT_eX]

[DOI]

Nathan R. Sturtevant

Proceedings of the Seventh Annual Symposium on Combinatorial Search, 2014

A* with Lookahead Re-Evaluated.

[BibT_eX]

[DOI]

Proceedings of the Seventh Annual Symposium on Combinatorial Search, 2014

Privacy Preserving Landmark Detection.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

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).

[BibT_eX]

[DOI]

Yedidya Bar-Zev

Proceedings of the International conference on Autonomous Agents and Multi-Agent Systems, 2014

Using Model-Based Diagnosis to Improve Software Testing.

[BibT_eX]

[DOI]

Tom Zamir

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.

[BibT_eX]

[DOI]

Ofra Amir

Barbara J. Grosz

Proceedings of the Twenty-Eighth AAAI Conference on Artificial Intelligence, 2014

2013

The increasing cost tree search for optimal multi-agent pathfinding.

[BibT_eX]

[DOI]

Artif. Intell., 2013

Target-Value Search Revisited (Extended Abstract).

[BibT_eX]

[DOI]

Carlos Linares López

Proceedings of the Sixth Annual Symposium on Combinatorial Search, 2013

Bounded Suboptimal Heuristic Search in Linear Space.

[BibT_eX]

[DOI]

Matthew Hatem

Wheeler Ruml

Proceedings of the Sixth Annual Symposium on Combinatorial Search, 2013

Multi-Agent Path Finding for Self Interested Agents.

[BibT_eX]

[DOI]

Proceedings of the Sixth Annual Symposium on Combinatorial Search, 2013

Bandit Algorithms for Social Network Queries.

[BibT_eX]

[DOI]

Proceedings of the International Conference on Social Computing, SocialCom 2013, 2013

Target-Value Search Revisited.

[BibT_eX]

[DOI]

Carlos Linares López

Proceedings of the IJCAI 2013, 2013

Collaborative health care plan support.

[BibT_eX]

[DOI]

Proceedings of the International conference on Autonomous Agents and Multi-Agent Systems, 2013

Using Alternative Suboptimality Bounds in Heuristic Search.

[BibT_eX]

[DOI]

Shahab Jabbari Arfaee

Jordan Tyler Thayer

Nathan R. Sturtevant

Proceedings of the Twenty-Third International Conference on Automated Planning and Scheduling, 2013

TONIC: Target Oriented Network Intelligence Collection for the Social Web.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Seventh AAAI Conference on Artificial Intelligence, 2013

Partial Domain Search Tree For Constraint-Satisfaction Problems.

[BibT_eX]

[DOI]

Proceedings of the Late-Breaking Developments in the Field of Artificial Intelligence, 2013

Volatile Multi-Armed Bandits for Guaranteed Targeted Social Crawling.

[BibT_eX]

[DOI]

Proceedings of the Late-Breaking Developments in the Field of Artificial Intelligence, 2013

2012

Reports of the AAAI 2012 Conference Workshops.

[BibT_eX]

[DOI]

Artur S. d'Avila Garcez

AI Mag., 2012

Finding patterns in an unknown graph.

[BibT_eX]

[DOI]

AI Commun., 2012

Alternative Forms of Bounded Suboptimal Search.

[BibT_eX]

[DOI]

Shahab Jabbari Arfaee

Jordan Tyler Thayer

Proceedings of the Fifth Annual Symposium on Combinatorial Search, 2012

Are We There Yet? - Estimating Search Progress.

[BibT_eX]

[DOI]

Jordan Tyler Thayer

Proceedings of the Fifth Annual Symposium on Combinatorial Search, 2012

Search-Aware Conditions for Probably Approximately Correct Heuristic Search.

[BibT_eX]

[DOI]