Tackling the Partner Units Configuration Problem
Abstract
The Partner Units Problem is a specific type of configuration problem with important applications in the area of surveillance and security. In this work we show that a special case of the problem, that is of great interest to our partners in industry, can directly be tackled via a structural problem decompostion method. Combining these theoretical insights with general purpose AI techniques such as constraint satisfaction and SAT solving proves to be particularly effective in practice.
Cite
Text
Aschinger et al. "Tackling the Partner Units Configuration Problem." International Joint Conference on Artificial Intelligence, 2011. doi:10.5591/978-1-57735-516-8/IJCAI11-091Markdown
[Aschinger et al. "Tackling the Partner Units Configuration Problem." International Joint Conference on Artificial Intelligence, 2011.](https://mlanthology.org/ijcai/2011/aschinger2011ijcai-tackling/) doi:10.5591/978-1-57735-516-8/IJCAI11-091BibTeX
@inproceedings{aschinger2011ijcai-tackling,
title = {{Tackling the Partner Units Configuration Problem}},
author = {Aschinger, Markus and Drescher, Conrad and Gottlob, Georg and Jeavons, Peter and Thorstensen, Evgenij},
booktitle = {International Joint Conference on Artificial Intelligence},
year = {2011},
pages = {497-503},
doi = {10.5591/978-1-57735-516-8/IJCAI11-091},
url = {https://mlanthology.org/ijcai/2011/aschinger2011ijcai-tackling/}
}