Decentralized Multi-tasks Distribution in Heterogeneous Robot Teams by Means of Ant Colony Optimization and Learning Automata
- Cite this paper as:
- de Lope J., Maravall D., Quiñonez Y. (2012) Decentralized Multi-tasks Distribution in Heterogeneous Robot Teams by Means of Ant Colony Optimization and Learning Automata. In: Corchado E., Snášel V., Abraham A., Woźniak M., Graña M., Cho SB. (eds) Hybrid Artificial Intelligent Systems. HAIS 2012. Lecture Notes in Computer Science, vol 7208. Springer, Berlin, Heidelberg
This paper focuses on the general problem of coordinating multiple robots. More specifically, it addresses the self-election of heterogeneous specialized tasks by autonomous robots. In this paper we focus on a specifically distributed or decentralized approach as we are particularly interested on decentralized solution where the robots themselves autonomously and in an individual manner, are responsible of selecting a particular task so that all the existing tasks are optimally distributed and executed. In this regard, we have established an experimental scenario to solve the corresponding multi-tasks distribution problem and we propose a solution using two different approaches by applying Ant Colony Optimization-based deterministic algorithms as well as Learning Automata-based probabilistic algorithms. We have evaluated the robustness of the algorithm, perturbing the number of pending loads to simulate the robot’s error in estimating the real number of pending tasks and also the dynamic generation of loads through time. The paper ends with a critical discussion of experimental results.
KeywordsMulti-robot Systems Stochastic Learning Automata Ant Colony Optimization Multi-tasks Distribution Self-Coordination of Multiple Robots Reinforcement Learning Multi-Heterogeneous Specialized Tasks Distribution
Unable to display preview. Download preview PDF.