{"type":"ScholarlyArticle","title":"Grid-based SensorDCSP","authors":[{"name":"Ramón Béjar","slug":"ramon-bejar","given":"Ramón","family":"Béjar","affiliation":""},{"name":"Carmel Domshlak","slug":"carmel-domshlak","given":"Carmel","family":"Domshlak","affiliation":""},{"name":"Cèsar Fernández","slug":"cesar-fernandez","given":"Cèsar","family":"Fernández","affiliation":""},{"name":"Carla P. Gomes","slug":"carla-p-gomes","given":"Carla P.","family":"Gomes","affiliation":""},{"name":"Bart Selman","slug":"bart-selman","given":"Bart","family":"Selman","affiliation":""},{"name":"Magda Valls","slug":"magda-valls","given":"Magda","family":"Valls","affiliation":""}],"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.","doi":null,"url":"https://ijcai.org/proceedings/2003/197","pdf":"https://ijcai.org/proceedings/2003/0197.pdf","markdown":"https://ijcai.org/proceedings/2003/197.md","bibtex":"https://ijcai.org/proceedings/2003/bibtex/197","volume":{"slug":"2003","title":"Proceedings of the Eighteenth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2003","url":"https://ijcai.org/proceedings/2003/","year":2003,"location":"Acapulco, Mexico","dates":"","editors":"Georg Gottlob","isbn":"","publisher":"International Joint Conferences on Artificial Intelligence","doi_prefix":""},"section":null,"track":"","number":197,"pages":{"first":1359,"last":1360},"keywords":[],"videos":[],"references":[],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}