首页 > 最新文献

2018 5th International Conference on Control, Decision and Information Technologies (CoDIT)最新文献

英文 中文
Learning statistics from raw text documents 从原始文本文档中学习统计数据
Nour El Houda Ben Chaabene, Maha Mallek
Statistics are still the best tool for analyzing political, economic and social phenomena. Among other things, they allow projections and forecasts to be used to assist in decision-making. The today's information society, and the era of “Big Data”, have facilitated access to information. However, most of the available data is unstructured and, as a result, is not readily available for use by the IT tool, particularly statistical data. In the context of a research project whose objective is to extract statistical in-formation from the results of a Web search, it is imperative to recognize the statistical variables dealt with and their values associated. One of the primordial stages and the assignment, to a given variable, of the different instances corresponding to it. We propose in this work an approach for identifying these statistical data in order to represent them in the form of structured data that are easy to process with the help of computers.
统计仍然是分析政治、经济和社会现象的最佳工具。除其他外,它们允许使用预测和预测来协助决策。当今信息社会和“大数据”时代为信息获取提供了便利。然而,大多数可用数据是非结构化的,因此,IT工具不容易使用,特别是统计数据。在目的是从Web搜索结果中提取统计信息的研究项目的上下文中,必须认识到所处理的统计变量及其相关的值。原始阶段之一,以及将与之相对应的不同实例赋值给给定变量。在这项工作中,我们提出了一种识别这些统计数据的方法,以便以结构化数据的形式表示它们,这些结构化数据易于在计算机的帮助下处理。
{"title":"Learning statistics from raw text documents","authors":"Nour El Houda Ben Chaabene, Maha Mallek","doi":"10.1109/CoDIT.2018.8394841","DOIUrl":"https://doi.org/10.1109/CoDIT.2018.8394841","url":null,"abstract":"Statistics are still the best tool for analyzing political, economic and social phenomena. Among other things, they allow projections and forecasts to be used to assist in decision-making. The today's information society, and the era of “Big Data”, have facilitated access to information. However, most of the available data is unstructured and, as a result, is not readily available for use by the IT tool, particularly statistical data. In the context of a research project whose objective is to extract statistical in-formation from the results of a Web search, it is imperative to recognize the statistical variables dealt with and their values associated. One of the primordial stages and the assignment, to a given variable, of the different instances corresponding to it. We propose in this work an approach for identifying these statistical data in order to represent them in the form of structured data that are easy to process with the help of computers.","PeriodicalId":128011,"journal":{"name":"2018 5th International Conference on Control, Decision and Information Technologies (CoDIT)","volume":"235 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132597920","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Modeling of Decline Dynamics of Knowledge Sharing Networks (KSNets) - A Wikipedia Case 知识共享网络(KSNets)衰落动态建模-维基百科案例
Rong-Huei Chen, Shi-Chung Chang, P. Luh
Online knowledge sharing networks (KSNets) have made significant impacts on the economy as well as wellbeing of societies through sharing. One of the most successful KSNets is Wikipedia that allows users to create contents in a collaborative manner and to provide fast and easy access at no cost to users. Recent research, however, has shown that the numbers of “Wikipedians” and new page creations have been declining, reflecting decrease in user contributions and in new contents. To facilitate management for sustainability, this paper aims at quantitatively modeling how the decline in new contents affects the number of Wikipedians and in turn content creations, and predicting decline start time and speed based on available Wikipedia data. The novel modeling approach adopts auto-regression with an extended Bass Diffusion model (AREBDM) embedded to describe the Wikipedia-wide evolutions of the number of Wikipedians and content developments. Model parameters are then extracted by a nonlinear least square method from early Wikipedia data. Simulation predictions match well with actual Wikipedia decline trajectories of later stages. Our analysis shows that the decline of new page creation leads in time the decline of the number of new Wikipedians, and the decline speed increases with the decrease of new contents. Our approach therefore has the potential to predict decline time and speed so that proactive actions can be taken as early as possible.
在线知识共享网络(KSNets)通过共享对经济和社会福祉产生了重大影响。最成功的knet之一是Wikipedia,它允许用户以协作的方式创建内容,并免费为用户提供快速方便的访问。然而,最近的研究表明,“维基人”和新页面创建的数量一直在下降,这反映了用户贡献和新内容的减少。为了便于可持续性管理,本文旨在定量建模新内容的减少如何影响维基人的数量,进而影响内容的创作,并根据现有的维基百科数据预测下降的开始时间和速度。该建模方法采用嵌入扩展Bass扩散模型(AREBDM)的自回归模型来描述维基百科范围内维基人数量和内容发展的演变。然后用非线性最小二乘法从早期维基百科数据中提取模型参数。模拟预测与维基百科后期的实际下降轨迹非常吻合。我们的分析表明,新页面创建的减少及时导致了新维基人数量的下降,并且下降速度随着新内容的减少而增加。因此,我们的方法有可能预测衰退的时间和速度,以便尽早采取主动行动。
{"title":"Modeling of Decline Dynamics of Knowledge Sharing Networks (KSNets) - A Wikipedia Case","authors":"Rong-Huei Chen, Shi-Chung Chang, P. Luh","doi":"10.1109/CODIT.2018.8394797","DOIUrl":"https://doi.org/10.1109/CODIT.2018.8394797","url":null,"abstract":"Online knowledge sharing networks (KSNets) have made significant impacts on the economy as well as wellbeing of societies through sharing. One of the most successful KSNets is Wikipedia that allows users to create contents in a collaborative manner and to provide fast and easy access at no cost to users. Recent research, however, has shown that the numbers of “Wikipedians” and new page creations have been declining, reflecting decrease in user contributions and in new contents. To facilitate management for sustainability, this paper aims at quantitatively modeling how the decline in new contents affects the number of Wikipedians and in turn content creations, and predicting decline start time and speed based on available Wikipedia data. The novel modeling approach adopts auto-regression with an extended Bass Diffusion model (AREBDM) embedded to describe the Wikipedia-wide evolutions of the number of Wikipedians and content developments. Model parameters are then extracted by a nonlinear least square method from early Wikipedia data. Simulation predictions match well with actual Wikipedia decline trajectories of later stages. Our analysis shows that the decline of new page creation leads in time the decline of the number of new Wikipedians, and the decline speed increases with the decrease of new contents. Our approach therefore has the potential to predict decline time and speed so that proactive actions can be taken as early as possible.","PeriodicalId":128011,"journal":{"name":"2018 5th International Conference on Control, Decision and Information Technologies (CoDIT)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126355359","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Adaptive Dynamic Programming Based Motion Control of Autonomous Underwater Vehicles 基于自适应动态规划的自主水下航行器运动控制
Siddhant Vibhute
In this paper, Adaptive Dynamic Programming (ADP) technique is utilized to achieve optimal motion control of Autonomous Underwater Vehicle (AUV) System. The paper proposes a model-free based method that takes into consideration the actuator input and obstacle position while tracing an optimal path. The concept of machine learning enables to develop a path-planner which aims to avoid collisions with static obstacles. The ADP approach is realized to approximate the solution of the cost functional for optimization purpose by which the positions of the locally situated obstacles need not be priori-known until they are within a designed approximation safety envelope. The methodology is implemented to achieve the path-planning objective using dynamic programming technique. The Least-squares policy method serves as a recursive algorithm to approximate the value function for the domain, providing an approach for the finite space discrete control system. The concept behind the design of an obstacle-free path finder is to generate an optimal action that minimizes the local cost, defined by a functional, under constrained optimization. The most advantageous value function is described by the Hamilton Jacobi Bellman (HJB) equation, that is impractical to solve using analytical methods. To overcome the complex calculations subject to HJB, a method based on Reinforcement Learning (RL), called ADP is implemented. This paper outlines the concept of machine learning to realize a real time obstacle avoidance system.
本文利用自适应动态规划(ADP)技术实现自主水下航行器(AUV)系统的最优运动控制。本文提出了一种基于无模型的方法,该方法在跟踪最优路径时考虑了致动器输入和障碍物位置。机器学习的概念使开发路径规划器能够避免与静态障碍物碰撞。采用ADP方法逼近成本函数的解,使局部障碍物的位置在设计的近似安全包络内不需要知道优先级,从而达到优化目的。利用动态规划技术实现了路径规划的目标。最小二乘策略方法作为一种递归算法来逼近域的值函数,为有限空间离散控制系统提供了一种方法。无障碍寻径器设计背后的概念是,在约束优化下,生成一个最优行为,使局部成本最小化,由函数定义。最有利的价值函数是由Hamilton Jacobi Bellman (HJB)方程描述的,用解析方法求解是不切实际的。为了克服HJB的复杂计算,采用了一种基于强化学习(RL)的方法,称为ADP。本文概述了利用机器学习实现实时避障系统的概念。
{"title":"Adaptive Dynamic Programming Based Motion Control of Autonomous Underwater Vehicles","authors":"Siddhant Vibhute","doi":"10.1109/CoDIT.2018.8394934","DOIUrl":"https://doi.org/10.1109/CoDIT.2018.8394934","url":null,"abstract":"In this paper, Adaptive Dynamic Programming (ADP) technique is utilized to achieve optimal motion control of Autonomous Underwater Vehicle (AUV) System. The paper proposes a model-free based method that takes into consideration the actuator input and obstacle position while tracing an optimal path. The concept of machine learning enables to develop a path-planner which aims to avoid collisions with static obstacles. The ADP approach is realized to approximate the solution of the cost functional for optimization purpose by which the positions of the locally situated obstacles need not be priori-known until they are within a designed approximation safety envelope. The methodology is implemented to achieve the path-planning objective using dynamic programming technique. The Least-squares policy method serves as a recursive algorithm to approximate the value function for the domain, providing an approach for the finite space discrete control system. The concept behind the design of an obstacle-free path finder is to generate an optimal action that minimizes the local cost, defined by a functional, under constrained optimization. The most advantageous value function is described by the Hamilton Jacobi Bellman (HJB) equation, that is impractical to solve using analytical methods. To overcome the complex calculations subject to HJB, a method based on Reinforcement Learning (RL), called ADP is implemented. This paper outlines the concept of machine learning to realize a real time obstacle avoidance system.","PeriodicalId":128011,"journal":{"name":"2018 5th International Conference on Control, Decision and Information Technologies (CoDIT)","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126517741","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 8
Enhanced Conditions in Design of Linear Discrete-time Positive System Control 线性离散正系统控制设计中的增强条件
D. Krokavec, A. Filasová
The linear matrix inequalities approach is proposed to discrete-time linear positive system control design, reflecting enhanced and D-stability region approaches. Coupling together the set of linear matrix inequalities warranting the system positive structure and the structure guaranteing circle D-stability, the design conditions are outlined to raise the positive closed-loop system, considering a nonnegative control gain matrix. Some related properties are deduced to demonstrate diagonal stabilizability of the positive systems.
提出了离散时间线性正系统控制设计的线性矩阵不等式方法,反映了增强和d稳定区域方法。在考虑非负控制增益矩阵的情况下,将保证系统正结构和保证d圆稳定结构的一组线性矩阵不等式耦合在一起,给出了建立正闭环系统的设计条件。为了证明正系统的对角稳定性,导出了一些相关性质。
{"title":"Enhanced Conditions in Design of Linear Discrete-time Positive System Control","authors":"D. Krokavec, A. Filasová","doi":"10.1109/CoDIT.2018.8394786","DOIUrl":"https://doi.org/10.1109/CoDIT.2018.8394786","url":null,"abstract":"The linear matrix inequalities approach is proposed to discrete-time linear positive system control design, reflecting enhanced and D-stability region approaches. Coupling together the set of linear matrix inequalities warranting the system positive structure and the structure guaranteing circle D-stability, the design conditions are outlined to raise the positive closed-loop system, considering a nonnegative control gain matrix. Some related properties are deduced to demonstrate diagonal stabilizability of the positive systems.","PeriodicalId":128011,"journal":{"name":"2018 5th International Conference on Control, Decision and Information Technologies (CoDIT)","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125296320","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
A Cooperative Control Model Foroperating Theaterscheduling 手术室调度的协同控制模型
Bilal Bou Saleh, A. E. Moudni, M. Hajjar, O. Barakat
The efficient management of a surgical block must allow to the realization of pre-planned surgical procedures but also to cope with all the aleas and disturbances as emergencies or late cancellations and this by adapting dynamically the schedule already in progress. This study focuses on the local cooperative control model to manage the surgical operating room process in the completion phase. More precisely: An application of the Contract Net Protocol (CNP) for task decomposition and task assignment in multi-agent systems is presented; we show that it can be used to get the best real-time solution in terms of cost for the assignment of emergency surgery that can happen at any time of the day. By the use at any time of the auction protocols algorithm called “simulated trading” (ST), the schedule for remaining time can be improved significantly. The solution of the rescheduling problem emerges from local decision-making and problem-solving rules. Since the local cooperative control system will include policies that optimize local performance and responsiveness. MAS solve the problem of dynamic planning by controlling the progress of the process during the day. Thus, it is designed as an online system with anytime algorithms. The proposed control model, which is still lacking today, is required to address uncertainties inherent in the surgical block process. Research focus: distributed task allocation with multi-agent systems
外科手术块的有效管理必须允许实现预先计划的外科手术,但也要应对所有的意外和干扰,如紧急情况或延迟取消,并通过动态地适应已经进行的时间表。本研究主要针对外科手术室完成阶段的局部协同控制模型进行管理。更准确地说:提出了契约网络协议(CNP)在多智能体系统中任务分解和任务分配的应用;我们表明,它可以用来获得最佳的实时解决方案在成本方面的紧急手术的分配,可以在一天中的任何时间发生。通过在任何时间使用竞价协议算法“模拟交易”(ST),可以显著改善剩余时间的调度。重新调度问题的解决源于局部决策和问题解决规则。由于本地合作控制系统将包括优化本地性能和响应能力的策略。MAS通过控制白天过程的进度来解决动态规划问题。因此,它被设计成一个在线系统,具有随时随地的算法。所提出的控制模型,目前仍然缺乏,需要解决手术阻滞过程中固有的不确定性。研究重点:多智能体系统的分布式任务分配
{"title":"A Cooperative Control Model Foroperating Theaterscheduling","authors":"Bilal Bou Saleh, A. E. Moudni, M. Hajjar, O. Barakat","doi":"10.1109/CoDIT.2018.8394888","DOIUrl":"https://doi.org/10.1109/CoDIT.2018.8394888","url":null,"abstract":"The efficient management of a surgical block must allow to the realization of pre-planned surgical procedures but also to cope with all the aleas and disturbances as emergencies or late cancellations and this by adapting dynamically the schedule already in progress. This study focuses on the local cooperative control model to manage the surgical operating room process in the completion phase. More precisely: An application of the Contract Net Protocol (CNP) for task decomposition and task assignment in multi-agent systems is presented; we show that it can be used to get the best real-time solution in terms of cost for the assignment of emergency surgery that can happen at any time of the day. By the use at any time of the auction protocols algorithm called “simulated trading” (ST), the schedule for remaining time can be improved significantly. The solution of the rescheduling problem emerges from local decision-making and problem-solving rules. Since the local cooperative control system will include policies that optimize local performance and responsiveness. MAS solve the problem of dynamic planning by controlling the progress of the process during the day. Thus, it is designed as an online system with anytime algorithms. The proposed control model, which is still lacking today, is required to address uncertainties inherent in the surgical block process. Research focus: distributed task allocation with multi-agent systems","PeriodicalId":128011,"journal":{"name":"2018 5th International Conference on Control, Decision and Information Technologies (CoDIT)","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126052067","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
Switching PI speed control of a nonlinear laboratory dc micro-motor using low-cost embedded control hardware and software 采用低成本嵌入式控制硬件和软件的非线性实验室直流微电机的开关PI速度控制
C. Yfoulis, S. Papadopoulou, Dimitris Trigkas, S. Voutetakis
The design of simple linear control laws via linear mathematical models is a standard part of every control systems laboratory in a standard undergraduate curriculum. A typical example is the design of PI control laws for the speed control problem of DC motors. Embedded control is taught nowadays using cheap take-home equipment based on low-cost microprocessors like Arduino and dc micro-motors. Although offering ease for the demonstration of simple PI control laws, these motors exhibit nonlinear characteristics, which can be dealt with the application of more advanced control laws. The paper's purpose is twofold: first, to explore the possibilities offered by low-cost equipment, as a test bed for the “proof of concept” of more sophisticated switching control laws; and secondly to unfold the possibilities offered by this new environment for teaching, demonstration, project work, as well as research purposes, in the current laboratory practice.
通过线性数学模型设计简单的线性控制律是标准本科课程中每个控制系统实验室的标准部分。一个典型的例子是直流电机速度控制问题的PI控制律的设计。嵌入式控制现在是使用廉价的带回家的设备,基于低成本的微处理器,如Arduino和直流微电机。虽然为简单的PI控制律的演示提供了便利,但这些电机具有非线性特性,可以处理更先进的控制律的应用。这篇论文的目的有两个:首先,探索低成本设备提供的可能性,作为更复杂的开关控制规律的“概念验证”的试验台;其次,在当前的实验室实践中,展示这种新环境为教学、示范、项目工作以及研究目的提供的可能性。
{"title":"Switching PI speed control of a nonlinear laboratory dc micro-motor using low-cost embedded control hardware and software","authors":"C. Yfoulis, S. Papadopoulou, Dimitris Trigkas, S. Voutetakis","doi":"10.1109/CoDIT.2018.8394944","DOIUrl":"https://doi.org/10.1109/CoDIT.2018.8394944","url":null,"abstract":"The design of simple linear control laws via linear mathematical models is a standard part of every control systems laboratory in a standard undergraduate curriculum. A typical example is the design of PI control laws for the speed control problem of DC motors. Embedded control is taught nowadays using cheap take-home equipment based on low-cost microprocessors like Arduino and dc micro-motors. Although offering ease for the demonstration of simple PI control laws, these motors exhibit nonlinear characteristics, which can be dealt with the application of more advanced control laws. The paper's purpose is twofold: first, to explore the possibilities offered by low-cost equipment, as a test bed for the “proof of concept” of more sophisticated switching control laws; and secondly to unfold the possibilities offered by this new environment for teaching, demonstration, project work, as well as research purposes, in the current laboratory practice.","PeriodicalId":128011,"journal":{"name":"2018 5th International Conference on Control, Decision and Information Technologies (CoDIT)","volume":"80 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114992881","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
A location-routing problem within blood sample collection chains 血样采集链中的位置路由问题
A. Elalouf, Dmitry Tsadikovich, E. Levner
We focus on improving a two-echelon blood sample collection chain with an application for MEUHEDET, the second largest health maintenance organization (HMO) in Israel. The effectiveness of the chain is influenced by two contradictory factors: (a) how many clinics should be activated to satisfy all customers' demand and (b) how many vehicles should be employed to deliver the collected samples to the testing lab in time and in a cost-effective manner. Determining the optimal balance between these two aspects while satisfying timing and quality constraints constitute the main focus of our work. To find a solution, a novel approach based on a combination of the vehicle routing heuristic with the fully polynomial time approximation scheme (FPTAS) is developed.
我们专注于为以色列第二大健康维护组织(HMO) MEUHEDET申请改善两级血液样本采集链。该链条的有效性受到两个相互矛盾的因素的影响:(a)应启用多少诊所以满足所有客户的需求;(b)应使用多少车辆以符合成本效益的方式及时将收集的样本运送到测试实验室。在满足时间和质量限制的同时,确定这两个方面的最佳平衡是我们工作的主要重点。为了解决这一问题,提出了一种将车辆路径启发式算法与全多项式时间逼近算法(FPTAS)相结合的新方法。
{"title":"A location-routing problem within blood sample collection chains","authors":"A. Elalouf, Dmitry Tsadikovich, E. Levner","doi":"10.1109/CoDIT.2018.8394826","DOIUrl":"https://doi.org/10.1109/CoDIT.2018.8394826","url":null,"abstract":"We focus on improving a two-echelon blood sample collection chain with an application for MEUHEDET, the second largest health maintenance organization (HMO) in Israel. The effectiveness of the chain is influenced by two contradictory factors: (a) how many clinics should be activated to satisfy all customers' demand and (b) how many vehicles should be employed to deliver the collected samples to the testing lab in time and in a cost-effective manner. Determining the optimal balance between these two aspects while satisfying timing and quality constraints constitute the main focus of our work. To find a solution, a novel approach based on a combination of the vehicle routing heuristic with the fully polynomial time approximation scheme (FPTAS) is developed.","PeriodicalId":128011,"journal":{"name":"2018 5th International Conference on Control, Decision and Information Technologies (CoDIT)","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124278028","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
Optimization of Electricity Consumption in a building 建筑用电优化
Kahina Louadj, Fethi Demim, A. Nemra, M. Aidène, P. Marthon, Hocine Iddir
The main objective of an energy regulation of a building is to maintain internal thermal comfort, as well as minimize energy consumption, or reduce the peak of electrical consumption. The dynamic programming has been used to minimize a cost function, accounting for a high peak electricity tariff, under constraints related to comfort (minimal temperature, maximal temperature variation) and the maximum heating power. The proposed energy management consists in over-heating the building during the hours before the peak knowing in advance the weather, occupation and internal gains for the day. The method has been tested in a case study corresponding to a house of a four-person family with performance levels: high construction and poorly insulated old house.
建筑能源调节的主要目标是保持内部热舒适,以及最大限度地减少能源消耗,或减少电力消耗的峰值。动态规划已被用于最小化成本函数,在与舒适性(最低温度,最大温度变化)和最大加热功率相关的约束下,考虑高峰电价。拟议的能源管理包括在高峰前的几个小时对建筑进行过热,提前知道当天的天气、占用和内部收益。该方法已经在一个案例研究中进行了测试,该案例研究对应于一个四口之家的住宅,其性能水平:高层建筑和隔热不良的老房子。
{"title":"Optimization of Electricity Consumption in a building","authors":"Kahina Louadj, Fethi Demim, A. Nemra, M. Aidène, P. Marthon, Hocine Iddir","doi":"10.1109/CoDIT.2018.8394953","DOIUrl":"https://doi.org/10.1109/CoDIT.2018.8394953","url":null,"abstract":"The main objective of an energy regulation of a building is to maintain internal thermal comfort, as well as minimize energy consumption, or reduce the peak of electrical consumption. The dynamic programming has been used to minimize a cost function, accounting for a high peak electricity tariff, under constraints related to comfort (minimal temperature, maximal temperature variation) and the maximum heating power. The proposed energy management consists in over-heating the building during the hours before the peak knowing in advance the weather, occupation and internal gains for the day. The method has been tested in a case study corresponding to a house of a four-person family with performance levels: high construction and poorly insulated old house.","PeriodicalId":128011,"journal":{"name":"2018 5th International Conference on Control, Decision and Information Technologies (CoDIT)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125813917","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
Adaptive Lag-Bipartite Consensus of Linear Multiagent Systems with a Non-autonomous Leader over Signed Graph 带非自治Leader的线性多智能体系统的自适应lagi - bipartite一致性
Sourav K. Bhowmick, S. Panja
The objective of this paper is to investigate lag-bipartite consensus of linear multiagent systems (MAS) with a non-autonomous leader. The principle focus of this work is to study the collective behaviour of MAS over a signed graph called lag-bipartite consensus in which a group of follower agents tracks the leader trajectory with a certain time-delay, and the other group tracks the opposite of the leader trajectory with the same amount of time-delay. The study is carried out under both static and adaptive couplings. Static coupling uses global information while adaptive coupling uses only relative information between agents and system parameters. It is shown that if the communication topology is connected, then with the design of suitable distributed state-feedback controllers based on static and adaptive coupling gains, and feedback gain matrices, lag-bipartite consensus among the followers and the leader is achieved. The theoretical developments are verified with the numerical simulation results.
本文的目的是研究具有非自治领导者的线性多智能体系统(MAS)的滞后二部共识。本工作的主要重点是研究MAS在一个被称为滞后二部共识的签名图上的集体行为,其中一组跟随智能体以一定的时滞跟踪领导轨迹,另一组以相同的时滞跟踪相反的领导轨迹。该研究在静态和自适应耦合两种情况下进行。静态耦合使用全局信息,而自适应耦合仅使用代理和系统参数之间的相对信息。研究表明,在通信拓扑连通的情况下,通过设计合适的基于静态和自适应耦合增益的分布式状态反馈控制器以及反馈增益矩阵,可以实现follower和leader之间的滞后二部一致性。数值模拟结果验证了理论进展。
{"title":"Adaptive Lag-Bipartite Consensus of Linear Multiagent Systems with a Non-autonomous Leader over Signed Graph","authors":"Sourav K. Bhowmick, S. Panja","doi":"10.1109/CoDIT.2018.8394967","DOIUrl":"https://doi.org/10.1109/CoDIT.2018.8394967","url":null,"abstract":"The objective of this paper is to investigate lag-bipartite consensus of linear multiagent systems (MAS) with a non-autonomous leader. The principle focus of this work is to study the collective behaviour of MAS over a signed graph called lag-bipartite consensus in which a group of follower agents tracks the leader trajectory with a certain time-delay, and the other group tracks the opposite of the leader trajectory with the same amount of time-delay. The study is carried out under both static and adaptive couplings. Static coupling uses global information while adaptive coupling uses only relative information between agents and system parameters. It is shown that if the communication topology is connected, then with the design of suitable distributed state-feedback controllers based on static and adaptive coupling gains, and feedback gain matrices, lag-bipartite consensus among the followers and the leader is achieved. The theoretical developments are verified with the numerical simulation results.","PeriodicalId":128011,"journal":{"name":"2018 5th International Conference on Control, Decision and Information Technologies (CoDIT)","volume":"220 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124350776","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
An Iterated Local Search ILS-CHC for the Maximum Vertex-Weighted Clique Problem 最大顶点加权团问题的迭代局部搜索ILS-CHC
D. Tayachi, N. Zaddem
In this paper, we tackle the Maximum Vertex-Weighted Clique Problem MVWCP. This problem consists to find in any weighted and non-oriented graph a clique with the maximum weight, i.e. a complete subgraph which has a maximum weight. MVWCP is an NP-hard combinatorial optimization problem with many practical applications. The objective of this work is to provide good quality solutions in reasonable computational times. Thus, we propose an iterated local search method ILS-CHC which explores the search space using a combined local search method and two levels of perturbation. Experimental studies conducted on the DIMACS benchmark instances show that the proposed approach compares favorably with the state-of-the-art methods and that it is even able to find better cliques than those found in the literature in many instances.
本文研究了最大顶点加权团问题MVWCP。该问题包括在任意有权无向图中找到一个权值最大的团,即一个权值最大的完全子图。MVWCP是一个具有许多实际应用的NP-hard组合优化问题。这项工作的目标是在合理的计算时间内提供高质量的解决方案。因此,我们提出了一种迭代局部搜索方法ILS-CHC,该方法使用局部搜索方法和两级扰动相结合来探索搜索空间。在DIMACS基准实例上进行的实验研究表明,所提出的方法优于最先进的方法,并且在许多情况下,它甚至能够找到比文献中发现的更好的派系。
{"title":"An Iterated Local Search ILS-CHC for the Maximum Vertex-Weighted Clique Problem","authors":"D. Tayachi, N. Zaddem","doi":"10.1109/CoDIT.2018.8394892","DOIUrl":"https://doi.org/10.1109/CoDIT.2018.8394892","url":null,"abstract":"In this paper, we tackle the Maximum Vertex-Weighted Clique Problem MVWCP. This problem consists to find in any weighted and non-oriented graph a clique with the maximum weight, i.e. a complete subgraph which has a maximum weight. MVWCP is an NP-hard combinatorial optimization problem with many practical applications. The objective of this work is to provide good quality solutions in reasonable computational times. Thus, we propose an iterated local search method ILS-CHC which explores the search space using a combined local search method and two levels of perturbation. Experimental studies conducted on the DIMACS benchmark instances show that the proposed approach compares favorably with the state-of-the-art methods and that it is even able to find better cliques than those found in the literature in many instances.","PeriodicalId":128011,"journal":{"name":"2018 5th International Conference on Control, Decision and Information Technologies (CoDIT)","volume":"110 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124088018","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
期刊
2018 5th International Conference on Control, Decision and Information Technologies (CoDIT)
全部 Acc. Chem. Res. ACS Applied Bio Materials ACS Appl. Electron. Mater. ACS Appl. Energy Mater. ACS Appl. Mater. Interfaces ACS Appl. Nano Mater. ACS Appl. Polym. Mater. ACS BIOMATER-SCI ENG ACS Catal. ACS Cent. Sci. ACS Chem. Biol. ACS Chemical Health & Safety ACS Chem. Neurosci. ACS Comb. Sci. ACS Earth Space Chem. ACS Energy Lett. ACS Infect. Dis. ACS Macro Lett. ACS Mater. Lett. ACS Med. Chem. Lett. ACS Nano ACS Omega ACS Photonics ACS Sens. ACS Sustainable Chem. Eng. ACS Synth. Biol. Anal. Chem. BIOCHEMISTRY-US Bioconjugate Chem. BIOMACROMOLECULES Chem. Res. Toxicol. Chem. Rev. Chem. Mater. CRYST GROWTH DES ENERG FUEL Environ. Sci. Technol. Environ. Sci. Technol. Lett. Eur. J. Inorg. Chem. IND ENG CHEM RES Inorg. Chem. J. Agric. Food. Chem. J. Chem. Eng. Data J. Chem. Educ. J. Chem. Inf. Model. J. Chem. Theory Comput. J. Med. Chem. J. Nat. Prod. J PROTEOME RES J. Am. Chem. Soc. LANGMUIR MACROMOLECULES Mol. Pharmaceutics Nano Lett. Org. Lett. ORG PROCESS RES DEV ORGANOMETALLICS J. Org. Chem. J. Phys. Chem. J. Phys. Chem. A J. Phys. Chem. B J. Phys. Chem. C J. Phys. Chem. Lett. Analyst Anal. Methods Biomater. Sci. Catal. Sci. Technol. Chem. Commun. Chem. Soc. Rev. CHEM EDUC RES PRACT CRYSTENGCOMM Dalton Trans. Energy Environ. Sci. ENVIRON SCI-NANO ENVIRON SCI-PROC IMP ENVIRON SCI-WAT RES Faraday Discuss. Food Funct. Green Chem. Inorg. Chem. Front. Integr. Biol. J. Anal. At. Spectrom. J. Mater. Chem. A J. Mater. Chem. B J. Mater. Chem. C Lab Chip Mater. Chem. Front. Mater. Horiz. MEDCHEMCOMM Metallomics Mol. Biosyst. Mol. Syst. Des. Eng. Nanoscale Nanoscale Horiz. Nat. Prod. Rep. New J. Chem. Org. Biomol. Chem. Org. Chem. Front. PHOTOCH PHOTOBIO SCI PCCP Polym. Chem.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1