Teams of interacting and co-operating agents have been proposed as an efficient and robust alternative to monolithic centralized control for carrying out specified tasks in a variety of applications. A number of different team and agent architectures have been investigated, e.g., teams based on single vs multiple behaviorally-distinct types of agents (homogeneous vs heterogeneous teams), simple vs complex agents, direct vs indirect agent-to-agent communication. A consensus is emerging that (1) heterogeneous teams composed of simple agents that communicate indirectly are preferable and (2) automated methods for verifying and designing such teams are necessary. In this paper, we use computational complexity analysis to assess viable algorithmic options for such automated methods for various types of teams. Building on recent complexity analyses addressing related questions in swarm robotics, we prove that automated team verification and design are by large both exact and approximate polynomial-time intractable in general for the most basic types of homogeneous and heterogeneous teams consisting of simple agents that communicate indirectly. Our results suggest that tractability for these problems must be sought relative to additional restrictions on teams, agents, operating environments, and tasks.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.
hi@scite.ai
10624 S. Eastern Ave., Ste. A-614
Henderson, NV 89052, USA
Copyright © 2024 scite LLC. All rights reserved.
Made with 💙 for researchers
Part of the Research Solutions Family.