Bounded Suboptimal Multi-Agent Path Finding Using Highways
Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence. Pages 3978-3978.
Abstract
The multi-agent path finding (MAPF) problem is defined as follows: Given a graph and a set of agents with unique start and goal vertices, find collision-free paths for all agents from their respective start vertices to their respective goal vertices. Our objective is to minimize the the total arrival time. MAPF has many applications such as video games, traffic control and robotics.
Liron Cohen, and Sven Koenig. 2016. Bounded Suboptimal Multi-Agent Path Finding Using Highways. In Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, IJCAI-16. IJCAI, 3978–3978. https://ijcai.org/proceedings/2016/563
Cohen, L., & Koenig, S. (2016). Bounded Suboptimal Multi-Agent Path Finding Using Highways. In Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, IJCAI-16 (pp. 3978–3978). IJCAI. https://ijcai.org/proceedings/2016/563
@inproceedings{ijcai2016p563,
title = {Bounded Suboptimal Multi-Agent Path Finding Using Highways},
author = {Cohen, Liron and Koenig, Sven},
booktitle = {Proceedings of the Twenty-Fifth International Joint Conference on
Artificial Intelligence, {IJCAI-16}},
publisher = {AAAI Press / International Joint Conferences on Artificial Intelligence},
editor = {Subbarao Kambhampati},
pages = {3978--3978},
year = {2016},
month = {7},
url = {https://ijcai.org/proceedings/2016/563},
}
TY - CPAPER TI - Bounded Suboptimal Multi-Agent Path Finding Using Highways AU - Cohen, Liron AU - Koenig, Sven T2 - Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, IJCAI-16 PB - AAAI Press / International Joint Conferences on Artificial Intelligence PY - 2016 SP - 3978 EP - 3978 UR - https://ijcai.org/proceedings/2016/563 ER -Copied
Machine-readable versions of this paper, for tools and AI agents:
