Cooperative distributed problem solving
Jump to navigation
Jump to search
 | This article may be too technical for most readers to understand. (September 2011) |
In computing cooperative distributed problem solving is a network of semi-autonomous processing nodes working together to solve a problem, typically in a multi-agent system. That is concerned with the investigation of problem subdivision, sub-problem distribution, results synthesis, optimisation of problem solver coherence and co-ordination. It is closely related to distributed constraint programming and distributed constraint optimization; see the links below.
Aspects of CDPS
[edit | edit source]- Neither global control or global data storage – no individual CDPS problem solver (agent) has sufficient information to solve the entire problem.
- Control and data are distributed
- Communication is slower than computation, therefore:
- Loose coupling between problem solvers
- Efficient protocols (not too much communication overhead)
- problems should be modular, coarse grained
- Any unique node is a potential bottleneck
- Organised behaviour is hard to guarantee since no one node has the complete picture
See also
[edit | edit source]- Multiscale decision making
- Distributed constraint optimization
- Distributed artificial intelligence
- Multi-agent planning
Some relevant books
[edit | edit source]- Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value). A chapter in an edited book.
- Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value).
- Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value). See Chapters 1 and 2; downloadable free online.
- Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value).
 | This computer science article is a stub. You can help Wikipedia by expanding it. |