- 1、原创力文档(book118)网站文档一经付费(服务费),不意味着购买了该文档的版权,仅供个人/单位学习、研究之用,不得用于商业用途,未经授权,严禁复制、发行、汇编、翻译或者网络传播等,侵权必究。。
- 2、本站所有内容均由合作方或网友上传,本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺!文档内容仅供研究参考,付费前请自行鉴别。如您付费,意味着您自己接受本站规则且自行承担风险,本站不退款、不进行额外附加服务;查看《如何避免下载的几个坑》。如果您已付费下载过本站文档,您可以点击 这里二次下载。
- 3、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等,请点击“版权申诉”(推荐),也可以打举报电话:400-050-0827(电话支持时间:9:00-18:30)。
- 4、该文档为VIP文档,如果想要下载,成为VIP会员后,下载免费。
- 5、成为VIP后,下载本文档将扣除1次下载权益。下载后,不支持退款、换文档。如有疑问请联系我们。
- 6、成为VIP后,您将拥有八大权益,权益包括:VIP文档下载权益、阅读免打扰、文档格式转换、高级专利检索、专属身份标志、高级客服、多端互通、版权登记。
- 7、VIP文档为合作方或网友上传,每下载1次, 网站将根据用户上传文档的质量评分、类型等,对文档贡献者给予高额补贴、流量扶持。如果你也想贡献VIP文档。上传文档
查看更多
本报告由智东 西(公众号:zhidxcom)收集整理理,仅做 行行业交流学习之 用。
如有侵权,请在公众号告诉我们。
智东 2017年最新整理的行业报告资源包括:人工智能(140+篇)、无人机(20+篇)、 VR/AR(20+篇)、智能出行(10+篇)、智能硬件(10+篇)、物联网智能家居(60+篇)。
欲获取全部报告,微信扫描右侧 二维码,关注智东 西,回复“智东 西内参”,
获取下载指南。更更多报告每周更更新中 扫描 二维码获取报告
arXiv:1702.06970v1 [cs.AI] 22 Feb 2017
A Realistic Dataset for the Smart Home Device
Scheduling Problem for DCOPs
William Kluegel1, Muhammad Aamir Iqbal1, Ferdinando Fioretto2,
William Yeoh1, and Enrico Pontelli1
Department of Computer Science, New Mexico State University
Department of Industrial and Operations Engineering, University of Michigan
{wkluegel,miqbal,wyeoh,epontell}@,
{fioretto}@
Abstract. The field of Distributed Constraint Optimization has gained momen-tum in recent years thanks to its ability to address various applications related to multi-agent cooperation. While techniques to solve Distributed Constraint Opti-mization Problems (DCOPs) are abundant and have matured substantially since the field inception, the number of DCOP realistic applications and benchmark used to asses the performance of DCOP algorithms is lagging behind. To contrast this background we (i) introduce the Smart Home Device Scheduling (SHDS) problem, which describe the problem of coordinating smart devices schedules across multiple homes as a multi-agent system, (ii) detail the physical models adopted to simulate smart sensors, smart actuators, and homes environments, and
introduce a DCOP realistic benchmark for SHDS problems.
Introduction
Distributed Constraint Optimization Problems (DCOPs) [11,15,18] have emerged as one of the prominent agent models to govern the agents’ autonomous behavior, where both algorithms and communication models are driven by the structure of the specific problem. Since the research field inception a wide variety of algorithms have been pro-posed to solve DCOPs and typically classified as being either complete or incomplete, based on whether they can guarantee the optimal solution or they trade optimality for shorter execution time
文档评论(0)