Hostname: page-component-cd9895bd7-8ctnn Total loading time: 0 Render date: 2024-12-27T09:24:34.324Z Has data issue: false hasContentIssue false
  • English
  • Français

Using Pareto optimality to coordinate distributed agents

Published online by Cambridge University Press:  27 February 2009

Charles J. Petrie ,
Teresa A. Webster  and
Mark R. Cutkosky
Charles J. Petrie
Affiliation:
Center for Design Research, Stanford University, 560 Panama Street, Stanford, CA 94305–2232, U.S.A.
Teresa A. Webster
Affiliation:
Center for Design Research, Stanford University, 560 Panama Street, Stanford, CA 94305–2232, U.S.A.
Mark R. Cutkosky
Affiliation:
Center for Design Research, Stanford University, 560 Panama Street, Stanford, CA 94305–2232, U.S.A.
Get access Rights & Permissions [Opens in a new window]

Abstract

Pareto optimality is a domain-independent property that can be used to coordinate distributed engineering agents. Within a model of design called Redux, some aspects of dependency-directed backtracking can be interpreted as tracking Pareto optimality. These concepts are implemented in a framework, called Next-Link, that coordinates legacy engineering systems. This framework allows existing software tools to communicate with each other and a Redux agent over the Internet. The functionality is illustrated with examples from the domain of electrical cable harness design.

Keywords

Change ManagementDesign CoordinationDistributed EngineeringNetwork AgentsPareto Optimality
Type
Articles
Information
AI EDAM , Volume 9 , Issue 4 , September 1995 , pp. 269 - 281
Copyright
Copyright © Cambridge University Press 1995

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

REFERENCES

Conklin, J., & Begeman, M. (1988). gIBIS: A hypertext tool for exploratory policy discussion. In Proc. of CSCW '88 (Computer Supported Cooperative Work), September.CrossRefGoogle Scholar
Descotte, Y., & Latombe, J. (1985). Making compromises among antagonist constraints in a planner. Artif. Intell. 27, 183–217.CrossRefGoogle Scholar
Dhar, V., & Raganathan, N. (1990). An experiment in integer programming. Communications of the ACM, March.CrossRefGoogle Scholar
Doyle, J. (1985). Reasoned assumptions and Pareto optimality. In Proc. of the 9th IJCAI, 87–90.Google Scholar
Feldman, A.M. (1980). Welfare economics and social choice theory. Kluwer, Boston.CrossRefGoogle Scholar
Korhonen, P., & Wallenius, J. (1990). A multiple objective linear programming decision support system. Decision Support Systems, 6, 243–251.CrossRefGoogle Scholar
Lee, J., & Lai, K.-Y. (1991). A comparative analysis of design rationale representations. MIT Sloan School TR CCS TR 121, May.Google Scholar
McGuire, J.G. et al. (1993). SHADE: A medium for sharing design knowledge among engineering tools. CERA, 1(2), September.Google Scholar
Park, H. et al. (1994). An agent-based approach to concurrent cable harness design. AIEDAM, 8, 45–61.CrossRefGoogle Scholar
Park, H. (1995). Modeling of collaborative design processes for agent-assisted product design. Dissertation, Center for Design Research, Stanford University, January.Google Scholar
Petrie, C. (1991). Context maintenance. In Proc. 9th Nat. Conf. on AI, 288–295, AAAI Press, July.Google Scholar
Petrie, C. (1992). Constrained decision revision. Proc. 10th Nat. Conf. on AI, 393–400, AAAI Press, July.Google Scholar
Petrie, C. (1993). The Redux' server. In Proc. Int. Conf. on Intelligent and Cooperative Information Systems (ICICIS), Rotterdam, May.Google Scholar
Petrie, C. et al. (1994). Design space navigation as a collaborative aid. In Proc. AI in Design: 3rd Int. Conf., 611–623. Lausanne, Switzerland.Google Scholar
Ramesh, B., & Dhar, V. (1994). Representing and maintaining process knowledge for large-scale systems development. IEEE Expert, 9(2), 54–59.CrossRefGoogle Scholar
Wilkens, D. (1988). Practical planning. Morgan Kaufmann, San Mateo, CA..Google Scholar