Boğatarkan, Aysu (2026) Flexible, lifelong, explainable, and robust solutions for multi-agent path finding problems. In: 40th AAAI Conference on Artificial Intelligence (AAAI 2026), Singapore
Full text not available from this repository. (Request a copy)
Official URL: https://dx.doi.org/10.1609/aaai.v40i48.42143
Abstract
The multi-agent path finding (MAPF) problem is a combinatorial search problem that aims at finding paths for multiple agents in an environment without collisions, subject to constraints on the lengths of paths. The real-world applications of MAPF require flexible, lifelong, robust and explainable solutions. In this study, these challenges are being addressed.
| Item Type: | Papers in Conference Proceedings |
|---|---|
| Divisions: | Faculty of Engineering and Natural Sciences |
| Depositing User: | Aysu Boğatarkan |
| Date Deposited: | 05 May 2026 15:27 |
| Last Modified: | 05 May 2026 15:27 |
| URI: | https://research.sabanciuniv.edu/id/eprint/53967 |
Actions (login required)
- View Item