Ariel Felner

Orcid: 0000-0003-0065-2757

According to our database1, Ariel Felner authored at least 211 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
Clique Analysis and Bypassing in Continuous-Time Conflict-Based Search.
Proceedings of the Seventeenth International Symposium on Combinatorial Search, 2024

Efficient Set Dominance Checks in Multi-Objective Shortest-Path Algorithms via Vectorized Operations.
Proceedings of the Seventeenth International Symposium on Combinatorial Search, 2024

On Parallel External-Memory Bidirectional Search (Extended Abstract).
Proceedings of the Seventeenth International Symposium on Combinatorial Search, 2024

On the Properties of All-Pair Heuristics.
Proceedings of the Seventeenth International Symposium on Combinatorial Search, 2024

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

Minimizing State Exploration While Searching Graphs with Unknown Obstacles (Extended Abstract).
Proceedings of the Seventeenth International Symposium on Combinatorial Search, 2024

A-A*pex: Efficient Anytime Approximate Multi-Objective Search.
Proceedings of the Seventeenth International Symposium on Combinatorial Search, 2024

Speeding Up Dominance Checks in Multi-Objective Search: New Techniques and Data Structures.
Proceedings of the Seventeenth International Symposium on Combinatorial Search, 2024

Theoretical Study on Multi-objective Heuristic Search.
Proceedings of the Thirty-Third International Joint Conference on Artificial Intelligence, 2024

Bounded-Suboptimal Weight-Constrained Shortest-Path Search via Efficient Representation of Paths.
Proceedings of the Thirty-Fourth International Conference on Automated Planning and Scheduling, 2024

Tightest Admissible Shortest Path.
Proceedings of the Thirty-Fourth International Conference on Automated Planning and Scheduling, 2024

On Parallel External-Memory Bidirectional Search.
Proceedings of the ECAI 2024 - 27th European Conference on Artificial Intelligence, 19-24 October 2024, Santiago de Compostela, Spain, 2024

Minimizing State Exploration While Searching Graphs with Unknown Obstacles.
Proceedings of the 23rd International Conference on Autonomous Agents and Multiagent Systems, 2024

2023
Conflict-tolerant and conflict-free multi-agent meeting.
Artif. Intell., September, 2023

Towards Effective Multi-Valued Heuristics for Bi-objective Shortest-Path Algorithms via Differential Heuristics.
Proceedings of the Sixteenth International Symposium on Combinatorial Search, 2023

Must-Expand Nodes in Multi-Objective Search [Extended Abstract].
Proceedings of the Sixteenth International Symposium on Combinatorial Search, 2023

Comparing Front-to-Front and Front-to-End Heuristics in Bidirectional Search.
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

Front-to-End Bidirectional Heuristic Search with Consistent Heuristics: Enumerating and Evaluating Algorithms and Bounds.
Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, 2023

Heuristic-Search Approaches for the Multi-Objective Shortest-Path Problem: Progress and Research Opportunities.
Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, 2023

A Generalization of the Shortest Path Problem to Graphs with Multiple Edge-Cost Estimates.
Proceedings of the ECAI 2023 - 26th European Conference on Artificial Intelligence, September 30 - October 4, 2023, Kraków, Poland, 2023

Optimally Solving the Multiple Watchman Route Problem with Heuristic Search.
Proceedings of the 2023 International Conference on Autonomous Agents and Multiagent Systems, 2023

Efficient Multi-Query Bi-Objective Search via Contraction Hierarchies.
Proceedings of the Thirty-Third International Conference on Automated Planning and Scheduling, 2023

W-restrained Bidirectional Bounded-Suboptimal Heuristic Search.
Proceedings of the Thirty-Third International Conference on Automated Planning and Scheduling, 2023

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

Solving the Watchman Route Problem with Heuristic Search.
J. Artif. Intell. Res., 2022

Anytime Approximate Bi-Objective Search.
Proceedings of the Fifteenth International Symposium on Combinatorial Search, 2022

Meeting at the Border of Two Separate Domains.
Proceedings of the Fifteenth International Symposium on Combinatorial Search, 2022

Bounded-Cost Bi-Objective Heuristic Search.
Proceedings of the Fifteenth International Symposium on Combinatorial Search, 2022

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

Optimally Solving the Multiple Watchman Route Problem with Heuristic Search (Extended Abstract).
Proceedings of the Fifteenth International Symposium on Combinatorial Search, 2022

Optimal Search with Neural Networks: Challenges and Approaches.
Proceedings of the Fifteenth International Symposium on Combinatorial Search, 2022

Generalized Longest Path Problems.
Proceedings of the Fifteenth International Symposium on Combinatorial Search, 2022

On Merging Agents in Multi-Agent Pathfinding Algorithms.
Proceedings of the Fifteenth International Symposium on Combinatorial Search, 2022

A*pex: Efficient Approximate Multi-Objective Search on Graphs.
Proceedings of the Thirty-Second International Conference on Automated Planning and Scheduling, 2022

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

Suboptimally Solving the Watchman Route Problem on a Grid with Heuristic Search.
Proceedings of the Fourteenth International Symposium on Combinatorial Search, 2021

Iterative-Deepening Bidirectional Heuristic Search with Restricted Memory.
Proceedings of the Fourteenth International Symposium on Combinatorial Search, 2021

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

The Closed List is an Obstacle Too.
Proceedings of the Fourteenth International Symposium on Combinatorial Search, 2021

Further Improved Heuristics For Conflict-Based Search.
Proceedings of the Fourteenth International Symposium on Combinatorial Search, 2021

Conflict-Free Multi-Agent Meeting.
Proceedings of the Fourteenth International Symposium on Combinatorial Search, 2021

Conflict-Based Increasing Cost Search.
Proceedings of the Thirty-First International Conference on Automated Planning and Scheduling, 2021

f-Aware Conflict Prioritization & Improved Heuristics For 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

On the Differences and Similarities of fMM and GBFHS.
Proceedings of the Thirteenth International Symposium on Combinatorial Search, 2020

Solving the Watchman Route Problem on a Grid with Heuristic Search.
Proceedings of the Thirteenth International Symposium on Combinatorial Search, 2020

F-Cardinal Conflicts in Conflict-Based Search.
Proceedings of the Thirteenth International Symposium on Combinatorial Search, 2020

Generalizing Multi-Agent Path Finding for Heterogeneous Agents.
Proceedings of the Thirteenth International Symposium on Combinatorial Search, 2020

Multi-Directional Search.
Proceedings of the Thirteenth International Symposium on Combinatorial Search, 2020

Moving Agents in Formation in Congested Environments.
Proceedings of the Thirteenth International Symposium on Combinatorial Search, 2020

Bidirectional Heuristic Search: Expanding Nodes by a Lower Bound.
Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence, 2020

Iterative-Deepening Conflict-Based Search.
Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence, 2020

Multi-Directional Heuristic Search.
Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence, 2020

Predicting the Effectiveness of Bidirectional Heuristic Search.
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

Generalized and Sub-Optimal Bipartite Constraints for Conflict-Based Search.
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

Unbounded Sub-Optimal Conflict-Based Search in Complex Domains.
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

Enriching Non-Parametric Bidirectional Search Algorithms - Extended Abstract.
Proceedings of the Twelfth International Symposium on Combinatorial Search, 2019

Improving Bidirectional Heuristic Search by Bounds Propagation.
Proceedings of the Twelfth International Symposium on Combinatorial Search, 2019

Improved Heuristics for Multi-Agent Path Finding with Conflict-Based Search: Preliminary Results.
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

Optimally Efficient Bidirectional Search.
Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence, 2019

Improved Heuristics for Multi-Agent Path Finding with Conflict-Based Search.
Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence, 2019

New Goal Recognition Algorithms Using Attack Graphs.
Proceedings of the Cyber Security Cryptography and Machine Learning, 2019

Using FastMap to Solve Graph Problems in a Euclidean Space.
Proceedings of the Twenty-Ninth International Conference on Automated Planning and Scheduling, 2019

Enriching Non-Parametric Bidirectional Search Algorithms.
Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence, 2019

Multi-Agent Path Finding for Large Agents.
Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence, 2019

2018
Rational deployment of multiple heuristics in optimal state-space search.
Artif. Intell., 2018

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

Minimizing Node Expansions in Bidirectional Search with Consistent Heuristics.
Proceedings of the Eleventh International Symposium on Combinatorial Search, 2018

Position Paper: Using Early Goal Test in A.
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

Extended Increasing Cost Tree Search for Non-Unit Cost Domains.
Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, 2018

Anytime Focal Search with Applications.
Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, 2018

Multi-Agent Path Finding with Deadlines.
Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, 2018

Multi-Agent Path Finding with Deadlines: Preliminary Results.
Proceedings of the 17th International Conference on Autonomous Agents and MultiAgent Systems, 2018

Adding Heuristics to Conflict-Based Search for Multi-Agent Path Finding.
Proceedings of the Twenty-Eighth International Conference on Automated Planning and Scheduling, 2018

A Brief History and Recent Achievements in Bidirectional Search.
Proceedings of the Thirty-Second AAAI Conference on Artificial Intelligence, 2018

2017
The compressed differential heuristic.
AI Commun., 2017

MM: A bidirectional search algorithm that is guaranteed to meet in the middle.
Artif. Intell., 2017

Monte-Carlo Tree Search using Batch Value of Perfect Information.
Proceedings of the Thirty-Third Conference on Uncertainty in Artificial Intelligence, 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

The Minimal Set of States that Must Be Expanded in a Front-to-End Bidirectional Search.
Proceedings of the Tenth International Symposium on Combinatorial Search, 2017

On Variable Dependencies and Compressed Pattern Databases.
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

Variants of Independence Detection in SAT-Based Optimal Multi-agent Path Finding.
Proceedings of the Agents and Artificial Intelligence - 9th International Conference, 2017

Integration of Independence Detection into SAT-based Optimal Multi-Agent Path Finding - A Novel SAT-based Optimal MAPF Solver.
Proceedings of the 9th International Conference on Agents and Artificial Intelligence, 2017

Value Compression of Pattern Databases.
Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, 2017

2016
The Israeli AI Community.
AI Mag., 2016

Optimally solving permutation sorting problems with efficient partial expansion bidirectional heuristic search.
AI Commun., 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

Extended Abstract: An Improved Priority Function for Bidirectional 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

Dynamic Potential Search - A New Bounded Suboptimal Search.
Proceedings of the Ninth Annual Symposium on Combinatorial Search, 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

Bidirectional Search That Is Guaranteed to Meet in the Middle.
Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence, 2016

2015
A Summary of the Twenty-Ninth AAAI Conference on Artificial Intelligence.
AI Mag., 2015

Repeated-task Canadian Traveler Problem.
AI Commun., 2015

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

To Reopen or Not To Reopen in the Context of Weighted A*. Classifications of Different Trends (Extended Abstract).
Proceedings of the Eighth Annual Symposium on Combinatorial Search, 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

Position Paper: The Collapse Macro in Best-First Search Algorithms and an Iterative Variant of RBFS.
Proceedings of the Eighth Annual Symposium on Combinatorial Search, 2015

Confidence Backup Updates for Aggregating MDP State Values in Monte-Carlo Tree Search.
Proceedings of the Eighth Annual Symposium on Combinatorial Search, 2015

Type System Based Rational Lazy IDA.
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

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

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

The Fifth Annual Symposium on Combinatorial Search.
AI Commun., 2014

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

Exploiting the Rubik's Cube 12-Edge PDB by Combining Partial Pattern Databases and Bloom Filters.
Proceedings of the Seventh Annual Symposium on Combinatorial Search, 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

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

Conflict-Oriented Windowed Hierarchical Cooperative A∗.
Proceedings of the 2014 IEEE International Conference on Robotics and Automation, 2014

Rational Deployment of Multiple Heuristics in IDA.
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

Exponential Deepening A* for Real-Time Agent-Centered Search.
Proceedings of the Twenty-Eighth AAAI Conference on Artificial Intelligence, 2014

2013
Towards Rational Deployment of Multiple Heuristics in A*
CoRR, 2013

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

Towards Rational Deployment of Multiple Heuristics in A* (Extended Abstract).
Proceedings of the Sixth Annual Symposium on Combinatorial Search, 2013

Online Detection of Dead States in Real-Time Agent-Centered Search.
Proceedings of the Sixth Annual Symposium on Combinatorial Search, 2013

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

Optimal-Generation Variants of EPEA.
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

Toward Rational Deployment of Multiple Heuristics in A.
Proceedings of the IJCAI 2013, 2013

Target-Value Search Revisited.
Proceedings of the IJCAI 2013, 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
Finding patterns in an unknown graph.
AI Commun., 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

Efficient Single Frontier Bidirectional Search.
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

Heuristic Search Comes of Age.
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

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
The MP-MIX Algorithm: Dynamic Search Strategy Selection in Multiplayer Adversarial Search.
IEEE Trans. Comput. Intell. AI Games, 2011

Inconsistent heuristics in theory and practice.
Artif. Intell., 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

Position Paper: Dijkstra's Algorithm versus Uniform Cost Search or a Case Against Dijkstra's Algorithm.
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

The Compressed Differential Heuristic.
Proceedings of the Twenty-Fifth AAAI Conference on Artificial Intelligence, 2011

2010
Predicting the Performance of IDA* using Conditional Distributions.
J. Artif. Intell. Res., 2010

BnB-ADOPT: An Asynchronous Branch-and-Bound DCOP Algorithm.
J. Artif. Intell. Res., 2010

Theta*: Any-Angle Path Planning on Grids.
J. Artif. Intell. Res., 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

Portal-Based True-Distance Heuristics for Path Finding.
Proceedings of the Third Annual Symposium on Combinatorial Search, 2010

Cost Benefit Deployment of DNIPS.
Proceedings of IEEE International Conference on Communications, 2010

Ants meeting algorithms.
Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2010), 2010

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

Search Space Reduction Using Swamp Hierarchies.
Proceedings of the Twenty-Fourth AAAI Conference on Artificial Intelligence, 2010

Single-Frontier Bidirectional Search.
Proceedings of the Twenty-Fourth AAAI Conference on Artificial Intelligence, 2010

2009
Abstraction-Based Heuristics with True Distance Computations.
Proceedings of the Eighth Symposium on Abstraction, Reformulation, and Approximation, 2009

Mixing Search Strategies for Multi-Player Games.
Proceedings of the IJCAI 2009, 2009

A* Search with Inconsistent Heuristics.
Proceedings of the IJCAI 2009, 2009

Memory-Based Heuristics for Explicit State Spaces.
Proceedings of the IJCAI 2009, 2009

Canadian Traveler Problem with Remote Sensing.
Proceedings of the IJCAI 2009, 2009

2008
A General Theory of Additive State Space Abstractions.
J. Artif. Intell. Res., 2008

Duality in permutation state spaces and the dual search algorithm.
Artif. Intell., 2008

Compressing Pattern Databases with Learning.
Proceedings of the ECAI 2008, 2008

IDB-ADOPT: A Depth-First Search DCOP Algorithm.
Proceedings of the Recent Advances in Constraints, 2008

Predicting the Performance of IDA* with Conditional Distributions.
Proceedings of the Twenty-Third AAAI Conference on Artificial Intelligence, 2008

Learning from Multiple Heuristics.
Proceedings of the Twenty-Third AAAI Conference on Artificial Intelligence, 2008

2007
Compressed Pattern Databases.
J. Artif. Intell. Res., 2007

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

Combining Perimeter Search and Pattern Database Abstractions.
Proceedings of the Abstraction, 2007

Recent Progress in Heuristic Search: A Case Study of the Four-Peg Towers of Hanoi Problem.
Proceedings of the IJCAI 2007, 2007

Inconsistent Heuristics.
Proceedings of the Twenty-Second AAAI Conference on Artificial Intelligence, 2007

2006
Reports on the Twenty-First National Conference on Artificial Intelligence (AAAI-06) Workshop Program.
AI Mag., 2006

Maximizing over multiple pattern databases speeds up heuristic search.
Artif. Intell., 2006

Multi-agent Physical A* with Large Pheromones.
Auton. Agents Multi Agent Syst., 2006

Distributed navigation in an unknown physical environment.
Proceedings of the 5th International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS 2006), 2006

Dual Search in Permutation State Spaces.
Proceedings of the Proceedings, 2006

2005
Finding optimal solutions to the graph partitioning problem with heuristic search.
Ann. Math. Artif. Intell., 2005

Solving the 24 Puzzle with Instance Dependent Pattern Databases.
Proceedings of the Abstraction, 2005

Dual Lookups in Pattern Databases.
Proceedings of the IJCAI-05, Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence, Edinburgh, Scotland, UK, July 30, 2005

Utility-based multi-agent system for performing repeated navigation tasks.
Proceedings of the 4th International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS 2005), 2005

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

Additive Pattern Database Heuristics.
J. Artif. Intell. Res., 2004

Blockage Detection in Pawn Endgames.
J. Int. Comput. Games Assoc., 2004

Blockage Detection in Pawn Endings.
Proceedings of the Computers and Games, 4th International Conference, 2004

Multi-Agent Physical A* Using Large Pheromones.
Proceedings of the 3rd International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS 2004), 2004

Large Pheromones: A Case Study with Multi-agent Physical A*.
Proceedings of the Ant Colony Optimization and Swarm Intelligence, 2004

Multiple Pattern Databases.
Proceedings of the Fourteenth International Conference on Automated Planning and Scheduling (ICAPS 2004), 2004

Compressing Pattern Databases.
Proceedings of the Nineteenth National Conference on Artificial Intelligence, 2004

2003
KBFS: K-Best-First Search.
Ann. Math. Artif. Intell., 2003

Searching for an alternative plan.
Proceedings of the Second International Joint Conference on Autonomous Agents & Multiagent Systems, 2003

2002
Disjoint pattern database heuristics.
Artif. Intell., 2002

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


  Loading...