activity
20112026
most citedPHA*: Finding the Shortest Path with A* in An Unknown Physical Environment

26 citations · 43 across the 25 of their papers we have counts for

collaborators
Showing 2024Show all

5 papers · 1 filter

cs.MA2024

Transient Multi-Agent Path Finding for Lifelong Navigation in Dense Environments

Jonathan Morag, Noy Gabay, Daniel koyfman +1

Multi-Agent Path Finding (MAPF) deals with finding conflict-free paths for a set of agents from an initial configuration to a given target configuration. The Lifelong MAPF (LMAPF)…

cs.MA2024

Multi-Agent Corridor Generating Algorithm

Arseniy Pertzovsky, Roni Stern, Roie Zivan +1

In this paper, we propose the Multi-Agent Corridor Generating Algorithm (MACGA) for solving the Multi-agent Pathfinding (MAPF) problem, where a group of agents need to find non-col…

cs.AI2024

Algorithm Selection for Optimal Multi-Agent Path Finding via Graph Embedding

Carmel Shabalin, Omri Kaduri, Roni Stern

Multi-agent path finding (MAPF) is the problem of finding paths for multiple agents such that they do not collide. This problem manifests in numerous real-world applications such a…

cs.AI2024

Optimal and Bounded Suboptimal Any-Angle Multi-agent Pathfinding

Konstantin Yakovlev, Anton Andreychuk, Roni Stern

Multi-agent pathfinding (MAPF) is the problem of finding a set of conflict-free paths for a set of agents. Typically, the agents' moves are limited to a pre-defined graph of possib…

cs.AI2024★ 1 cited

Safe Learning of PDDL Domains with Conditional Effects -- Extended Version

Argaman Mordoch, Enrico Scala, Roni Stern +1

Powerful domain-independent planners have been developed to solve various types of planning problems. These planners often require a model of the acting agent's actions, given in s…