2007 | OriginalPaper | Buchkapitel
Support-Based Distributed Search: A New Approach for Multiagent Constraint Processing
verfasst von : Peter Harvey, Chee Fon Chang, Aditya Ghose
Erschienen in: Argumentation in Multi-Agent Systems
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
Distributed Constraint Satisfaction Problems provide a natural mechanism for multiagent coordination and agreement. To date, algorithms for Distributed Constraint Satisfaction Problems have tended to mirror existing non-distributed global-search or local-search algorithms. Unfortunately, existing distributed global-search algorithms derive from classical backtracking search methods and require a total ordering over agents for completeness. Distributed variants of local-search algorithms (such as distributed breakout) inherit the incompleteness properties of their predecessors, or depend on the creation of new communication links between agents. This paper presents a new approach, inspired by argumentation, to solve DisCSP instances while avoiding some of the identified drawbacks of global- and local-search.