Publication at Faculty of Mathematics and Physics |
2020
Abstract
The paper shows how to encode Multi-Agent Path Finding problem as a sequential planning problem, specifically, how to encode various collision constraints and parallel actions.
The paper shows how to encode Multi-Agent Path Finding problem as a sequential planning problem, specifically, how to encode various collision constraints and parallel actions.