Grid-Based SensorDCSP

Abstract

We introduce Grid-based SensorDCSP, a geometrically structured benchmark problem for the study of distributed CSP algorithms. This domain provides realistic structure of the communication and tracking constraints. We formally define this problem, and perform its worst-case complexity analysis. Likewise, we provide an average case empirical analysis of the AWC algorithm, studying its behavior on tractable and intractable sub-classes of our problem. 1

Cite

Text

Béjar et al. "Grid-Based SensorDCSP." International Joint Conference on Artificial Intelligence, 2003.

Markdown

[Béjar et al. "Grid-Based SensorDCSP." International Joint Conference on Artificial Intelligence, 2003.](https://mlanthology.org/ijcai/2003/bejar2003ijcai-grid/)

BibTeX

@inproceedings{bejar2003ijcai-grid,
  title     = {{Grid-Based SensorDCSP}},
  author    = {Béjar, Ramón and Domshlak, Carmel and Fernández, Cèsar and Gomes, Carla P. and Selman, Bart and Valls, Magda},
  booktitle = {International Joint Conference on Artificial Intelligence},
  year      = {2003},
  pages     = {1359-1361},
  url       = {https://mlanthology.org/ijcai/2003/bejar2003ijcai-grid/}
}