Multi-Agent Navigation Using Path-Based Vector Fields

* Final gross prices may vary according to local VAT.

Get Access

Abstract

We present an approach to multi-agent navigation, that is based on generating potential-fields from A*-paths. We will introduce and compare two algorithms: 1) a geometrical algorithm that is based on quads, and 2) an images-based algorithm. We show empirically that the images-based algorithm is more memory-consuming, but has better performance.