#### Filter Results:

- Full text PDF available (51)

#### Publication Year

2000

2019

- This year (12)
- Last 5 years (66)
- Last 10 years (99)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Guni Sharon, Roni Stern, Ariel Felner, Nathan R. Sturtevant
- MAPF@AAAI
- 2012

The task in the multi-agent path finding problem (MAPF) is to find paths for multiple agents, each with a different start and goal position, such that agents do not collide. It is possible to solveâ€¦ (More)

- Guni Sharon, Roni Stern, Meir Goldenberg, Ariel Felner
- IJCAI
- 2011

We address the problem of optimal path finding for multiple agents where agents must not collide and their total travel cost should be minimized. Previous work used traditional single-agent searchâ€¦ (More)

- Max Barer, Guni Sharon, Roni Stern, Ariel Felner
- ECAI
- 2014

The task in the multi-agent path finding problem (MAPF) is to find paths for multiple agents, each with a different start and goal position, such that agents do not collide. A successful optimal MAPFâ€¦ (More)

- Eli Boyarski, Ariel Felner, +4 authors Solomon Eyal Shimony
- IJCAI
- 2015

A Multi-Agent Path Finding (MAPF) problem is defined by a graph, G = (V,E) and a set of k agents labeled a1 . . . ak, where each agent ai has a start position si âˆˆ V and a goal position gi âˆˆ V . Atâ€¦ (More)

- Roni Stern, Rami Puzis, Ariel Felner
- ICAPS
- 2011

In this paper we address the following search task: find a goal with cost smaller than or equal to a given fixed constant. This task is relevant in scenarios where a fixed budget is available toâ€¦ (More)

- Jordan Tyler Thayer, Roni Stern, Ariel Felner, Wheeler Ruml
- ICAPS
- 2012

Many important problems are too difficult to solve optimally. A traditional approach to such problems is bounded suboptimal search, which guarantees solution costs within a userspecified factor ofâ€¦ (More)

- Ariel Felner, Meir Goldenberg, +5 authors Robert C. Holte
- AAAI
- 2012

A* is often described as being â€˜optimalâ€™, in that it expands the minimum number of unique nodes. But, A* may generate many extra nodes which are never expanded. This is a performance loss, especiallyâ€¦ (More)

- Roni Stern, Meir Kalech, Alexander Feldman, Gregory M. Provan
- AAAI
- 2012

A model-based diagnosis problem occurs when an observation is inconsistent with the assumption that the diagnosed system is not faulty. The task of a diagnosis engine is to compute diagnoses, whichâ€¦ (More)

- Pavel Surynek, Ariel Felner, Roni Stern, Eli Boyarski
- ECAI
- 2016

In the multi-agent path finding (MAPF) the task is to find non-conflicting paths for multiple agents. In this paper we present the first SAT-solver for the sum-of-costs variant of MAPF which wasâ€¦ (More)

- Meir Goldenberg, Ariel Felner, +4 authors Jonathan Schaeffer
- J. Artif. Intell. Res.
- 2014

High performance of A* has been traditionally associated with its optimality with respect to the number of expanded nodes [Dechter and Pearl, 1985]. In practice, however, the performance of A* isâ€¦ (More)