Print Email Facebook Twitter Convergence of ant colony multi-agent swarms Title Convergence of ant colony multi-agent swarms Author Jarne Ornia, D. (TU Delft Team Tamas Keviczky) Mazo, M. (TU Delft Team Tamas Keviczky) Date 2020 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. Subject ant colonyconvergencerandom walkswarm robotics To reference this document use: http://resolver.tudelft.nl/uuid:5225c68b-3ecd-494c-bf5c-f6d743739e46 DOI https://doi.org/10.1145/3365365.3382199 Publisher Association for Computing Machinery (ACM), New York, NY, USA Embargo date 2020-11-01 ISBN 978-1-4503-7018-9 Source Proceedings of the 23rd International Conference on Hybrid Systems (HSCC 2020): Computation and Control, part of CPS-IoT Week Event HSCC '20: 23rd ACM International Conference on Hybrid Systems: Computation and Control, 2020-04-21 → 2020-04-24, Sydney, Australia Bibliographical note Green Open Access added to TU Delft Institutional Repository ‘You share, we take care!’ – Taverne project https://www.openaccess.nl/en/you-share-we-take-care Otherwise as indicated in the copyright section: the publisher is the copyright holder of this work and the author uses the Dutch legislation to make this work public. Part of collection Institutional Repository Document type conference paper Rights © 2020 D. Jarne Ornia, M. Mazo Files PDF 3365365.3382199.pdf 1.43 MB Close viewer /islandora/object/uuid:5225c68b-3ecd-494c-bf5c-f6d743739e46/datastream/OBJ/view