{"title":"多智能体系统布局问题的解决初探","authors":"Johannes Stein","doi":"10.1109/CAIA.1994.323699","DOIUrl":null,"url":null,"abstract":"Describes a multiagent approach to a class of layout problems, in particular that of arranging a set of electrical components in a low-voltage switchgear cabinet. A survey of known approaches has shown that the layout problems have exclusively been either of constraint optimization or constraint satisfaction. Inherent to the problem mentioned is the presence of both types of constraints. This paper shows that multiagent approaches exhibit sufficient flexibility to deal with both types of constraints. In the approach taken, the original problem is translated into a pure optimization problem which can be solved efficiently by agents behaving \"reactively\". However, the applied optimization technique cannot guarantee to satisfy any \"hard\" constraints defined in the problem. Such constraints then have to be solved by cooperative activity of agents. Initial experiences with this idea were gained by implementing a simplified example.<<ETX>>","PeriodicalId":297396,"journal":{"name":"Proceedings of the Tenth Conference on Artificial Intelligence for Applications","volume":"96 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1994-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"On the solution of layout problems in multiagent systems: a preliminary report\",\"authors\":\"Johannes Stein\",\"doi\":\"10.1109/CAIA.1994.323699\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Describes a multiagent approach to a class of layout problems, in particular that of arranging a set of electrical components in a low-voltage switchgear cabinet. A survey of known approaches has shown that the layout problems have exclusively been either of constraint optimization or constraint satisfaction. Inherent to the problem mentioned is the presence of both types of constraints. This paper shows that multiagent approaches exhibit sufficient flexibility to deal with both types of constraints. In the approach taken, the original problem is translated into a pure optimization problem which can be solved efficiently by agents behaving \\\"reactively\\\". However, the applied optimization technique cannot guarantee to satisfy any \\\"hard\\\" constraints defined in the problem. Such constraints then have to be solved by cooperative activity of agents. Initial experiences with this idea were gained by implementing a simplified example.<<ETX>>\",\"PeriodicalId\":297396,\"journal\":{\"name\":\"Proceedings of the Tenth Conference on Artificial Intelligence for Applications\",\"volume\":\"96 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1994-03-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the Tenth Conference on Artificial Intelligence for Applications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CAIA.1994.323699\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the Tenth Conference on Artificial Intelligence for Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CAIA.1994.323699","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
On the solution of layout problems in multiagent systems: a preliminary report
Describes a multiagent approach to a class of layout problems, in particular that of arranging a set of electrical components in a low-voltage switchgear cabinet. A survey of known approaches has shown that the layout problems have exclusively been either of constraint optimization or constraint satisfaction. Inherent to the problem mentioned is the presence of both types of constraints. This paper shows that multiagent approaches exhibit sufficient flexibility to deal with both types of constraints. In the approach taken, the original problem is translated into a pure optimization problem which can be solved efficiently by agents behaving "reactively". However, the applied optimization technique cannot guarantee to satisfy any "hard" constraints defined in the problem. Such constraints then have to be solved by cooperative activity of agents. Initial experiences with this idea were gained by implementing a simplified example.<>