Robot coalition formation against time-extended multi-robot tasks

Abstract

Purpose Multi-robot coalition formation (MRCF) refers to the formation of robot coalitions against complex tasks requiring multiple robots for execution. Situations, where the robots have to participate in multiple coalitions over time due to a large number of tasks, are called Time-extended MRCF. While being NP-hard, time-extended MRCF also holds the possibility of resource deadlocks due to any cyclic hold-and-wait conditions among the coalitions. Existing schemes compromise on solution quality to form workable, deadlock-free coalitions through instantaneous or incremental allocations. Design/methodology/approach This paper presents an evolutionary algorithm (EA)-based task allocation framework for improved, deadlock-free solutions against time-extended MRCF. The framework simultaneously allocates multiple tasks, allowing the robots to participate in multiple coalitions within their schedule. A directed acyclic graph–based representation of robot plans is used for deadlock detection and avoidance. Findings Allowing the robots to participate in multiple coalitions within their schedule, significantly improves the allocation quality. The improved allocation quality of the EA is validated against two auction schemes inspired by the literature. Originality/value To the best of the author's knowledge, this is the first framework which simultaneously considers multiple MR tasks for deadlock-free allocation while allowing the robots to participate in multiple coalitions within their plans.