Principles of intention reconsideration
Proceedings of the fifth international conference on Autonomous agents
The computational complexity of boolean and stochastic agent design problems
Proceedings of the first international joint conference on Autonomous agents and multiagent systems: part 2
Reasoning about Evolving Nonmonotonic Knowledge Bases
LPAR '01 Proceedings of the Artificial Intelligence on Logic for Programming
The Use of Models - Making MABS More Informative
MABS '00 Proceedings of the Second International Workshop on Multi-Agent-Based Simulation-Revised and Additional Papers
Complexity of Multi-agent Systems Behavior
JELIA '02 Proceedings of the European Conference on Logics in Artificial Intelligence
The Computational Complexity of Agent Verification
ATAL '01 Revised Papers from the 8th International Workshop on Intelligent Agents VIII
Optimistic and Disjunctive Agent Design Problems
ATAL '00 Proceedings of the 7th International Workshop on Intelligent Agents VII. Agent Theories Architectures and Languages
The complexity of achievement and maintenance problems in agent-based systems
Artificial Intelligence
On feasible cases of checking multi-agent systems behavior
Theoretical Computer Science - Logic and complexity in computer science
Propositional planning in BDI agents
Proceedings of the 2004 ACM symposium on Applied computing
AAMAS '04 Proceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems - Volume 2
Multiagent Planning as Control Synthesis
AAMAS '04 Proceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems - Volume 2
Reasoning about evolving nonmonotonic knowledge bases
ACM Transactions on Computational Logic (TOCL)
The complexity of agent design problems: Determinism and history dependence
Annals of Mathematics and Artificial Intelligence
Maintenance goals of agents in a dynamic environment: Formulation and policy construction
Artificial Intelligence
Controlled experimentation with agents: models and implementations
ESAW'04 Proceedings of the 5th international conference on Engineering Societies in the Agents World
| Hi-index | 0.00 |
This paper investigates the computational complexity of a fundamental problem in multi-agent systems: given an environment together with a specification of some task, can we construct an agent that will successfully achieve the task in the environment? We refer to this problem as agent design. Using an abstract formal model of agents and their environments, we begin by investigating various possible ways of specifying tasks for agents, and identify two important classes of such tasks. Achievement tasks are those in which an agent is required to bring about one of a specified set of goal states, and maintenance tasks are those in which an agent is required to avoid some specified set of states. We prove that in the most general case the agent design problem is PSPACE-complete for both achievement and maintenance tasks. We briefly discuss the automatic synthesis of agents from task environment specifications, and conclude by discussing related work and presenting some conclusions.