Article

Optimistic and Disjunctive Agent Design Problems

Authors:

Michael Wooldridge,

Paul E. DunneAuthors Info & Claims

ATAL '00: Proceedings of the 7th International Workshop on Intelligent Agents VII. Agent Theories Architectures and Languages

Pages 1 - 14

Published: 07 July 2000 Publication History

Abstract

The agent design problem is as follows:Given an environment, together with a specification of a task, is it possible to construct an agent that can be guaranteed to successfully accomplish the task in the environment? In previous research, it was shown that for two important classes of tasks (where an agent was required to either achieve some state of affairs or maintain some state of affairs), the agent design problem was PSPACE-complete. In this paper, we consider several important generalisations of such tasks. In an optimistic agent design problem, we simply ask whether an agent has at least some chance of bringing about a goal state. In a combined design problem, an agent is required to achieve some state of affairs while ensuring that some invariant condition is maintained. Finally, in a disjunctive design problem, we are presented with a number of goals and corresponding invariants--the aim is to design an agent that on any given run, will achieve one of the goals while maintaining the corresponding invariant. We prove that while the optimistic achievement and maintenance design problems are np-complete, the pspace-completeness results obtained for achievement and maintenance tasks generalise to combined and disjunctive agent design.

References

[1]

J. F. Allen, J. Hendler, and A. Tate, editors. Readings in Planning. Morgan Kaufmann Publishers: San Mateo, CA, 1990.

[2]

K. Binmore. Fun and Games: A Text on Game Theory. D. C. Heath and Company: Lexington, MA, 1992.

[3]

T. Bylander. The computational complexity of propositional STRIPS planning. Artificial Intelligence, 69(1-2):165-204, 1994.

[4]

E. M. Clarke and E. A. Emerson. Design and synthesis of synchronization skeletons using branching time temporal logic. In D. Kozen, editor, Logics of Programs--Proceedings 1981 (LNCS Volume 131), pages 52-71. Springer-Verlag: Berlin, Germany, 1981.

[5]

R. Fagin, J. Y. Halpern, Y. Moses, and M. Y. Vardi. Reasoning About Knowledge. The MIT Press: Cambridge, MA, 1995.

[6]

M. R. Garey and D. S. Johnson. Computers and Intractability: A Guide to the Theory of np-Completeness. W. H. Freeman: New York, 1979.

[7]

L. P. Kaelbling, M. L. Littman, and A. R. Cassandra. Planning and acting in partially observable stochastic domains. Artificial Intelligence, 101:99-134, 1998.

[8]

M. L. Littman, J. Goldsmith, and M. Mundhenk. The computational complexity of probabilistic planning. Journal of AI Research, 9:1-36, 1998.

[9]

Z. Manna and A. Pnueli. The Temporal Logic of Reactive and Concurrent Systems. Springer-Verlag: Berlin, Germany, 1992.

[10]

Z. Manna and A. Pnueli. Temporal Verification of Reactive Systems--Safety. Springer-Verlag: Berlin, Germany, 1995.

[11]

Z. Manna and P. Wolper. Synthesis of communicating processes from temporal logic specifications. ACM Transactions on Programming Languages and Systems, 6(1):68-93, January 1984.

[12]

C. H. Papadimitriou. Computational Complexity. Addison-Wesley: Reading, MA, 1994.

[13]

A. Pnueli and R. Rosner. On the synthesis of a reactive module. In Proceedings of the Sixteenth ACM Symposium on the Principles of Programming Languages (POPL), pages 179-190, January 1989.

[14]

S. Russell and D. Subramanian. Provably bounded-optimal agents. Journal of AI Research, 2:575-609, 1995.

[15]

M. Tennenholtz andY. Moses. On cooperation in a multi-entity model: Preliminary report. In Proceedings of the Eleventh International Joint Conference on Artificial Intelligence (IJCAI- 89), Detroit, MI, 1989.

[16]

M. Wooldridge. The computational complexity of agent design problems. In Proceedings of the Fourth International Conference on Multi-Agent Systems (ICMAS-2000), pages 341-348, Boston, MA, 2000.

[17]

M. Wooldridge and N. R. Jennings. Intelligent agents: Theory and practice. The Knowledge Engineering Review, 10(2):115-152, 1995.

Cited By

Cairo OOlarte JRivera F(2011)Negotiation in electronic commerceProceedings of the 15th international conference on Knowledge-based and intelligent information and engineering systems - Volume Part II10.5555/2041341.2041375(306-314)Online publication date: 12-Sep-2011
https://dl.acm.org/doi/10.5555/2041341.2041375
Baral CEiter TBjäreland MNakamura M(2008)Maintenance goals of agents in a dynamic environmentArtificial Intelligence10.1016/j.artint.2008.03.005172:12-13(1429-1469)Online publication date: 1-Aug-2008
https://dl.acm.org/doi/10.1016/j.artint.2008.03.005
Seow KMa CYokoo M(2004)Multiagent Planning as Control SynthesisProceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems - Volume 210.5555/1018410.1018851(972-979)Online publication date: 19-Jul-2004
https://dl.acm.org/doi/10.5555/1018410.1018851
Show More Cited By

Recommendations

The Computational Complexity of Agent Design Problems
ICMAS '00: Proceedings of the Fourth International Conference on MultiAgent Systems (ICMAS-2000)

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? ...
Disjunctive normal form for multi-agent modal logics based on logical separability
AAAI'19/IAAI'19/EAAI'19: Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence and Thirty-First Innovative Applications of Artificial Intelligence Conference and Ninth AAAI Symposium on Educational Advances in Artificial Intelligence

Modal logics are primary formalisms for multi-agent systems but major reasoning tasks in such logics are intractable, which impedes applications of multi-agent modal logics such as automatic planning. One technique of tackling the intractability is to ...
The complexity of agent design problems: Determinism and history dependence

The agent design problem is as follows: given a specification of an environment, together with a specification of a task, is it possible to construct an agent that can be guaranteed to successfully accomplish the task in the environment__ __ In this ...

Comments

Information & Contributors

Information

Published In

cover image Guide Proceedings

ATAL '00: Proceedings of the 7th International Workshop on Intelligent Agents VII. Agent Theories Architectures and Languages

July 2000

356 pages

ISBN:3540424229

Publisher

Springer-Verlag

Berlin, Heidelberg

Publication History

Published: 07 July 2000

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

5
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 14 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

Cairo OOlarte JRivera F(2011)Negotiation in electronic commerceProceedings of the 15th international conference on Knowledge-based and intelligent information and engineering systems - Volume Part II10.5555/2041341.2041375(306-314)Online publication date: 12-Sep-2011
https://dl.acm.org/doi/10.5555/2041341.2041375
Baral CEiter TBjäreland MNakamura M(2008)Maintenance goals of agents in a dynamic environmentArtificial Intelligence10.1016/j.artint.2008.03.005172:12-13(1429-1469)Online publication date: 1-Aug-2008
https://dl.acm.org/doi/10.1016/j.artint.2008.03.005
Seow KMa CYokoo M(2004)Multiagent Planning as Control SynthesisProceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems - Volume 210.5555/1018410.1018851(972-979)Online publication date: 19-Jul-2004
https://dl.acm.org/doi/10.5555/1018410.1018851
Stewart I(2003)The complexity of achievement and maintenance problems in agent-based systemsArtificial Intelligence10.1016/S0004-3702(03)00014-6146:2(175-191)Online publication date: 1-Jun-2003
https://dl.acm.org/doi/10.1016/S0004-3702%2803%2900014-6
Dunne PWooldridge MLaurence MGini MIshida TCastelfranchi CJohnson W(2002)The computational complexity of boolean and stochastic agent design problemsProceedings of the first international joint conference on Autonomous agents and multiagent systems: part 210.1145/544862.544968(976-983)Online publication date: 15-Jul-2002
https://dl.acm.org/doi/10.1145/544862.544968

View Options

View options

Media

Figures

Other

Tables

View Table of Contents