Hostname: page-component-78c5997874-t5tsf Total loading time: 0 Render date: 2024-11-10T23:19:29.379Z Has data issue: false hasContentIssue false
  • English
  • Français

The MarCon algorithm: A systematic market approach to distributed constraint problems

Published online by Cambridge University Press:  01 June 1999

H. VAN DYKE PARUNAK ,
ALLEN C. WARD  and
JOHN A. SAUTER
H. VAN DYKE PARUNAK
Affiliation:
CEC, ERIM, P.O. Box 134001, Ann Arbor, MI 48113-4001, USA
ALLEN C. WARD
Affiliation:
Ward Synthesis, 3446 Gettysburg Road, Ann Arbor, MI 48105, USA
JOHN A. SAUTER
Affiliation:
CEC, ERIM, P.O. Box 134001, Ann Arbor, MI 48113-4001, USA
Get access Rights & Permissions [Opens in a new window]

Abstract

MarCon (Market-based Constraints) applies market-based control to distributed constraint problems. It offers a new approach to distributing constraint problems that avoids challenges faced by current approaches in some problem domains, and it provides a systematic method for applying markets to a wide array of problems. Constraint agents interact with one another via the variable agents in which they have a common interest, using expressions of their preferences over sets of assignments. Each variable integrates this information from the constraints interested in it and provides feedback that enables the constraints to shrink their sets of assignments until they converge on a solution. MarCon originated in a system for supporting human product designers, and its mechanisms are particularly useful for applications integrating human and machine intelligence to explore implicit constraints. MarCon has been tested in the domain of mechanical design, in which its set-narrowing process is particularly useful.

Keywords

Constraint OptimizationMarket-based ComputationCollaborative DesignSet-based DesignConstraint Satisfaction Problem
Type
Research Article
Information
AI EDAM , Volume 13 , Issue 3 , June 1999 , pp. 217 - 234
Copyright
© 1999 Cambridge University Press

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.)