ACDS is based on a multi-attribute domain constraint-satisfaction problem (CSP) computational model of the distributed part-selection problem. This dissertation describes the Automated Configuration-Design Service (ACDS), a set of algorithms and system for solving distributed part-selection problems using a network of design agents that represent part catalogs and design constraints. Wide-area networks, such as the Internet, facilitate communication among designers making possible the use of algorithms to resolve constraint violations, and provide a way to make the contents of distributed part catalogs available to designers. Solving these problems requires communication among designers and algorithms to resolve constraint violations. In addition, the catalogs that contain the parts necessary to solve such problems often do not reside in a single location. Large-scale part-selection problems that consist of thousands of required functions and millions of parts are too complex for a single designer or small group of designers to manage. Functionality defines what the design is supposed to do, specifications define optimality goals, and constraints define the feasibility relationships that must be satisfied for the design to operate correctly. In part-selection problems, parts are selected from catalogs and connected to meet the following problem requirements: functionality, specifications, and constraints.
0 Comments
Leave a Reply. |