Webbläsaren som du använder stöds inte av denna webbplats. Alla versioner av Internet Explorer stöds inte längre, av oss eller Microsoft (läs mer här: * https://www.microsoft.com/en-us/microsoft-365/windows/end-of-ie-support).

Var god och använd en modern webbläsare för att ta del av denna webbplats, som t.ex. nyaste versioner av Edge, Chrome, Firefox eller Safari osv.

Distributed constraint programming with agents

Författare

  • Carl Christian Rolf
  • Krzysztof Kuchcinski

Redaktör

  • Abbas Manthiri. M

Summary, in English

Many combinatorial optimization problems lend themselves to be modeled as distributed constraint optimization problems (DisCOP). Problems such as job shop scheduling have an intuitive matching between agents and machines. In distributed constraint problems, agents control variables and are connected via constraints. We have equipped these agents with a full constraint solver. This makes it possible to use global constraint and advanced search schemes.



By empowering the agents with their own solver, we overcome the low performance that often haunts distributed constraint satisfaction problems (DisCSP). By using global constraints, we achieve far greater pruning than traditional DisCSP models. Hence, we dramatically reduce communication between agents.



Our experiments show that both global constraints and advanced search schemes are necessary to optimize job shop schedules using DisCSP.

Publiceringsår

2011

Språk

Engelska

Sidor

320-331

Publikation/Tidskrift/Serie

Lecture notes in computer science

Volym

6943

Dokumenttyp

Konferensbidrag

Förlag

Springer

Ämne

  • Computer Science

Conference name

International Conference on Adaptive and Intelligent Systems (ICAIS 2011)

Conference date

2011-09-06 - 2011-09-08

Conference place

Klagenfurt, Austria

Status

Published

Forskningsgrupp

  • ESDLAB

ISBN/ISSN/Övrigt

  • ISSN: 0302-9743
  • ISBN: 978-3-642-23857-4
  • ISBN: 978-3-642-23857-4