Convergence of ant colony multi-agent swarms

Jarne Ornia, Daniel Jarne; Mazo Espinosa, Manuel

doi:10.1145/3365365.3382199

Convergence of ant colony multi-agent swarms

Conference paper (2020)

Authors

Daniel Jarne Jarne Ornia Team Tamas Keviczky

Manuel Mazo Espinosa Team Tamas Keviczky

Research Group

Team Tamas Keviczky

DOI: https://doi.org/10.1145/3365365.3382199

Random walk Swarm robotics Convergence Ant colony

To reference this document use:

http://resolver.tudelft.nl/uuid:5225c68b-3ecd-494c-bf5c-f6d743739e46

More Info

expand_more

Published Date

2020

Language

English

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.

Research Group

Team Tamas Keviczky

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