Constrain relaxation in distributed constraint satisfaction problems

Research output: Chapter in Book/Report/Conference proceedingConference contribution

13 Citations (Scopus)

Abstract

The distributed constraint satisfaction problem (DSCP) formulation has recently been identified as a general framework for formalizing various Distributed Artificial Intelligence problems. In this paper, we extend the DCSP formalization by introducing the notion of importance values of constraints. With these values, we define a solution criterion for DCSPs, that are over-constrained (where no solution satisfies all constraints completely). We show that agents can find an optimal solution with this criterion by using the asynchronous incremental relaxation algorithm, in which the agents iteratively apply the asynchronous backtracking algorithm to solve a DCSP, while incrementally relaxing less important constraints. In this algorithm, agents act asynchronously and concurrently, in contrast to traditional sequential backtracking techniques, while guaranteeing thee completeness of the algorithm and the optimality of the optimality. Furthermore, we show that, in this algorithm, agents can avoid redundant computation and achieve a five-fold speed-up in example problems by maintaining the dependencies between constraint violations (nogoods) and constraints.

Original languageEnglish
Title of host publicationProceedings of the International Conference on Tools with Artificial Intelligence
Editors Anon
PublisherPubl by IEEE
Pages56-63
Number of pages8
ISBN (Print)0818642009
Publication statusPublished - 1993
Externally publishedYes
EventProceedings of the 5th International Conference on Tools with Artificial Intelligence TAI '93 - Boston, MA, USA
Duration: Nov 8 1993Nov 11 1993

Other

OtherProceedings of the 5th International Conference on Tools with Artificial Intelligence TAI '93
CityBoston, MA, USA
Period11/8/9311/11/93

Fingerprint

Constraint satisfaction problems
Artificial intelligence

All Science Journal Classification (ASJC) codes

  • Software

Cite this

Yokoo, M. (1993). Constrain relaxation in distributed constraint satisfaction problems. In Anon (Ed.), Proceedings of the International Conference on Tools with Artificial Intelligence (pp. 56-63). Publ by IEEE.

Constrain relaxation in distributed constraint satisfaction problems. / Yokoo, Makoto.

Proceedings of the International Conference on Tools with Artificial Intelligence. ed. / Anon. Publ by IEEE, 1993. p. 56-63.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Yokoo, M 1993, Constrain relaxation in distributed constraint satisfaction problems. in Anon (ed.), Proceedings of the International Conference on Tools with Artificial Intelligence. Publ by IEEE, pp. 56-63, Proceedings of the 5th International Conference on Tools with Artificial Intelligence TAI '93, Boston, MA, USA, 11/8/93.
Yokoo M. Constrain relaxation in distributed constraint satisfaction problems. In Anon, editor, Proceedings of the International Conference on Tools with Artificial Intelligence. Publ by IEEE. 1993. p. 56-63
Yokoo, Makoto. / Constrain relaxation in distributed constraint satisfaction problems. Proceedings of the International Conference on Tools with Artificial Intelligence. editor / Anon. Publ by IEEE, 1993. pp. 56-63
@inproceedings{e9331236f5814e9aa7873908e5e79a84,
title = "Constrain relaxation in distributed constraint satisfaction problems",
abstract = "The distributed constraint satisfaction problem (DSCP) formulation has recently been identified as a general framework for formalizing various Distributed Artificial Intelligence problems. In this paper, we extend the DCSP formalization by introducing the notion of importance values of constraints. With these values, we define a solution criterion for DCSPs, that are over-constrained (where no solution satisfies all constraints completely). We show that agents can find an optimal solution with this criterion by using the asynchronous incremental relaxation algorithm, in which the agents iteratively apply the asynchronous backtracking algorithm to solve a DCSP, while incrementally relaxing less important constraints. In this algorithm, agents act asynchronously and concurrently, in contrast to traditional sequential backtracking techniques, while guaranteeing thee completeness of the algorithm and the optimality of the optimality. Furthermore, we show that, in this algorithm, agents can avoid redundant computation and achieve a five-fold speed-up in example problems by maintaining the dependencies between constraint violations (nogoods) and constraints.",
author = "Makoto Yokoo",
year = "1993",
language = "English",
isbn = "0818642009",
pages = "56--63",
editor = "Anon",
booktitle = "Proceedings of the International Conference on Tools with Artificial Intelligence",
publisher = "Publ by IEEE",

}

TY - GEN

T1 - Constrain relaxation in distributed constraint satisfaction problems

AU - Yokoo, Makoto

PY - 1993

Y1 - 1993

N2 - The distributed constraint satisfaction problem (DSCP) formulation has recently been identified as a general framework for formalizing various Distributed Artificial Intelligence problems. In this paper, we extend the DCSP formalization by introducing the notion of importance values of constraints. With these values, we define a solution criterion for DCSPs, that are over-constrained (where no solution satisfies all constraints completely). We show that agents can find an optimal solution with this criterion by using the asynchronous incremental relaxation algorithm, in which the agents iteratively apply the asynchronous backtracking algorithm to solve a DCSP, while incrementally relaxing less important constraints. In this algorithm, agents act asynchronously and concurrently, in contrast to traditional sequential backtracking techniques, while guaranteeing thee completeness of the algorithm and the optimality of the optimality. Furthermore, we show that, in this algorithm, agents can avoid redundant computation and achieve a five-fold speed-up in example problems by maintaining the dependencies between constraint violations (nogoods) and constraints.

AB - The distributed constraint satisfaction problem (DSCP) formulation has recently been identified as a general framework for formalizing various Distributed Artificial Intelligence problems. In this paper, we extend the DCSP formalization by introducing the notion of importance values of constraints. With these values, we define a solution criterion for DCSPs, that are over-constrained (where no solution satisfies all constraints completely). We show that agents can find an optimal solution with this criterion by using the asynchronous incremental relaxation algorithm, in which the agents iteratively apply the asynchronous backtracking algorithm to solve a DCSP, while incrementally relaxing less important constraints. In this algorithm, agents act asynchronously and concurrently, in contrast to traditional sequential backtracking techniques, while guaranteeing thee completeness of the algorithm and the optimality of the optimality. Furthermore, we show that, in this algorithm, agents can avoid redundant computation and achieve a five-fold speed-up in example problems by maintaining the dependencies between constraint violations (nogoods) and constraints.

UR - http://www.scopus.com/inward/record.url?scp=0027867092&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0027867092&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:0027867092

SN - 0818642009

SP - 56

EP - 63

BT - Proceedings of the International Conference on Tools with Artificial Intelligence

A2 - Anon, null

PB - Publ by IEEE

ER -