Convergence of ant colony multi-agent swarms

Conference Paper (2020)
Author(s)

D. Jarne Ornia (TU Delft - Team Tamas Keviczky)

M Mazo Jr. (TU Delft - Team Tamas Keviczky)

Research Group
Team Tamas Keviczky
Copyright
© 2020 D. Jarne Ornia, M. Mazo
DOI related publication
https://doi.org/10.1145/3365365.3382199
More Info
expand_more
Publication Year
2020
Language
English
Copyright
© 2020 D. Jarne Ornia, M. Mazo
Research Group
Team Tamas Keviczky
ISBN (electronic)
978-1-4503-7018-9
Reuse Rights

Other than for strictly personal use, it is not permitted to download, forward or distribute the text or part of it, without the consent of the author(s) and/or copyright holder(s), unless the work is under an open content license such as Creative Commons.

Abstract

Ant Colony algorithms are a set of biologically inspired algorithms used commonly to solve distributed optimization problems. Convergence has been proven in the context of optimization processes, but these proofs are not applicable in the framework of robotic control. In order to use Ant Colony algorithms to control robotic swarms, we present in this work more general results that prove asymptotic convergence of a multi-agent Ant Colony swarm moving in a weighted graph.

Files

3365365.3382199.pdf
(pdf | 1.43 Mb)
- Embargo expired in 01-11-2020
License info not available