#### DMCA

## An approach to Symmetry Breaking in Distributed Constraint Satisfaction Problems

Citations: | 2 - 0 self |

### Citations

247 | Algorithms for distributed constraint satisfaction: Areview.InAutonomous Agents and Multi-Agent Systems
- Yokoo, Hirayama
- 2000
(Show Context)
Citation Context ...blem [2], or staff timetabling in large organisations with multiple departments [3]. One technique for modelling and solving these problems is the Distributed Constraint Satisfaction Problem (DisCSP) =-=[4]-=- formulism, which is an extension of the Constraint Satisfaction Problem (CSP). DisCSP algorithms solve the problem in its natural distributed state searching for globally acceptable solutions while m... |

24 | The Handbook of Constraint Programming
- Gent, Petrie, et al.
- 2006
(Show Context)
Citation Context ...faction Problem (CSP). DisCSP algorithms solve the problem in its natural distributed state searching for globally acceptable solutions while minimising communcation between agents. Symmetry breaking =-=[5]-=- has been shown to provide great benefits when solving centralised CSPs. By identifying assignments to a problem that are symmetrically equivalent, large areas of the search space can be eliminated by... |

7 | Constraint satisfaction techniques and software agents
- Calisti, Neagu
- 2004
(Show Context)
Citation Context ... rescue scenario, multiple agents with interdependent plans need to have their task schedules coordinated [1]. Further examples include coordinating vehicle schedules in a transport logistics problem =-=[2]-=-, or staff timetabling in large organisations with multiple departments [3]. One technique for modelling and solving these problems is the Distributed Constraint Satisfaction Problem (DisCSP) [4] form... |

4 |
Partial Symmetry in Model Checking
- Donaldson
- 2005
(Show Context)
Citation Context ...variables and the weakly symmetric solutions satisfy only a subset of the constraints of the problem. Weak symmetries occur in many real-world problems such as planning, scheduling and model checking =-=[6, 7]-=-. If a CSP is distributed among several agents then each agent only has access to a subset of the variables and the constraints. If the subproblem of an agent contains a symmetry, two solutions that a... |

4 |
The challenge of exploiting weak symmetries
- Martin
- 2005
(Show Context)
Citation Context ... the symmetry is weak. That means the symmetries of the agent cannot be broken since the agent does not know whether these solutions are symmetric for other agents. A modelling approach introduced in =-=[8]-=- allows weak symmetries to be broken without losing solutions. In this paper we will show how this approach can be applied to DisCSPs which represents the first method of symmetry breaking in DisCSPs.... |

3 | Scheduling agents - distributed timetabling problems (DisTTP
- Meisels, Kaplansky
(Show Context)
Citation Context ...eir task schedules coordinated [1]. Further examples include coordinating vehicle schedules in a transport logistics problem [2], or staff timetabling in large organisations with multiple departments =-=[3]-=-. One technique for modelling and solving these problems is the Distributed Constraint Satisfaction Problem (DisCSP) [4] formulism, which is an extension of the Constraint Satisfaction Problem (CSP). ... |

2 |
Almostâ€“symmetry in planning
- Gregory
(Show Context)
Citation Context ...variables and the weakly symmetric solutions satisfy only a subset of the constraints of the problem. Weak symmetries occur in many real-world problems such as planning, scheduling and model checking =-=[6, 7]-=-. If a CSP is distributed among several agents then each agent only has access to a subset of the variables and the constraints. If the subproblem of an agent contains a symmetry, two solutions that a... |

1 |
W.C.: Constraint propagation for domain bounding in ctaems task scheduling
- Sultanik, Modi, et al.
(Show Context)
Citation Context ...volve solving problems that are naturally distributed over a set of agents, e.g, in a disaster rescue scenario, multiple agents with interdependent plans need to have their task schedules coordinated =-=[1]-=-. Further examples include coordinating vehicle schedules in a transport logistics problem [2], or staff timetabling in large organisations with multiple departments [3]. One technique for modelling a... |