Using Message-Passing DCOP Algorithms to Solve Energy-Efficient Smart Environment Configuration Problems
Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence. Pages 468-473.
Abstract
We consider environments in which smart devices equipped with limited communication and computation capabilities have to cooperate to self-configure their state in an energy-efficient manner, as to meet user-defined requirements. Such requirements are expressed as scene rules, configured by the user using an intuitive interface that connects conditions on sensors' and actuators' states and actions on actuators. We translate this smart environment configuration problem into a constraint optimization problem. As to install distributiveness, robustness, and openness, we solve it using distributed message-passing algorithms. We illustrate our approach through a running example, and evaluate the performances of the implemented protocols on a simulated realistic environment.
@inproceedings{ijcai2016p73,
title = {Using Message-Passing DCOP Algorithms to Solve Energy-Efficient Smart Environment Configuration Problems},
author = {Rust, Pierre and Picard, Gauthier and Ramparany, Fano},
booktitle = {Proceedings of the Twenty-Fifth International Joint Conference on
Artificial Intelligence, {IJCAI-16}},
publisher = {AAAI Press / International Joint Conferences on Artificial Intelligence},
editor = {Subbarao Kambhampati},
pages = {468--473},
year = {2016},
month = {7},
url = {https://ijcai.org/proceedings/2016/73},
}
TY - CPAPER TI - Using Message-Passing DCOP Algorithms to Solve Energy-Efficient Smart Environment Configuration Problems AU - Rust, Pierre AU - Picard, Gauthier AU - Ramparany, Fano T2 - Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, IJCAI-16 PB - AAAI Press / International Joint Conferences on Artificial Intelligence PY - 2016 SP - 468 EP - 473 UR - https://ijcai.org/proceedings/2016/73 ER -Copied
Machine-readable versions of this paper, for tools and AI agents: