1 citations · 1 across the 3 of their papers we have counts for
3 papers
cs.AI2025
A General Framework for Dynamic MAPF using Multi-Shot ASP and Tunnels
Aysu Bogatarkan, Esra Erdem
MAPF problem aims to find plans for multiple agents in an environment within a given time, such that the agents do not collide with each other or obstacles. Motivated by the execut…
cs.AI2021★ 1 cited
Flexible and Explainable Solutions for Multi-Agent Path Finding Problems
Aysu Bogatarkan
The multi-agent path finding (MAPF) problem is a combinatorial search problem that aims at finding paths for multiple agents (e.g., robots) in an environment (e.g., an autonomous w…
cs.AI2020
Explanation Generation for Multi-Modal Multi-Agent Path Finding with Optimal Resource Utilization using Answer Set Programming
Aysu Bogatarkan, Esra Erdem
The multi-agent path finding (MAPF) problem is a combinatorial search problem that aims at finding paths for multiple agents (e.g., robots) in an environment (e.g., an autonomous w…