检索结果-内蒙古大学图书馆

arXiv 2024年

作者： Mendoza, Fernando Genis Baldivieso-Monasterios, Pablo R. Bauso, Dario Konstantopoulos, George The Department of Automatic Control and Systems Engineering The University of Sheffield Mappin Street SheffieldS1 3JD United Kingdom The Department of Electrical and Computer Engineering University of Patras Rion26500 Greece The Jan C. Willems Center for Systems and Control ENTEG Fac. Science and Engineering University of Groningen Nijenborgh 4 Groningen9747 AG Netherlands The Netherlands and Dipartimento di Ingegneria Università di Palermo viale delle Scienze Palermo Italy

An existing challenge in power systems is the implementation of optimal demand management through dynamic pricing. This paper encompasses the design, analysis and implementation of a novel on-line pricing scheme based on coalitional game theory. The setting consists of a network with multiple energy retailers competing to attract consumers by announcing a price in a hierarchical leader-follower structure. The process of coalition formation under such a pricing scheme can be viewed as a game for which we show that a Stackelberg equilibrium exists, i.e., given a price, consumers will respond by conforming to a reciprocal power consumption quantity. We propose a coalition formation algorithm and perform a game-theoretic stability analysis on the resulting coalitions. We integrate the pricing setting with a resistive micro-grid dynamic model. In this context we analyse the behaviour of the integrated system, bridging the gap between market and physical layers of the problem. Simulations provide a comparison of profits generated by the proposed scheme against a more traditional single retailer scheme, while simultaneously showing convergence towards a steady-state equilibrium. Additionally, we shed light into the system's physical response when subject to our proposed pricing scheme. © 2024, CC BY.

关键词： Costs

来源：评论

学校读者我要写书评

暂无评论

Asynchronous Distributed Optimization via ADMM with Efficient Communication

arXiv

引用

arXiv 2023年

作者： Rikos, Apostolos I. Jiang, Wei Charalambous, Themistoklis Johansson, Karl H. Department of Electrical and Computer Engineering Division of Systems Engineering Boston University BostonMA02215 United States Hong Kong Hong Kong Department of Electrical and Computer Engineering School of Engineering University of Cyprus Nicosia1678 Cyprus Department of Electrical Engineering and Automation School of Electrical Engineering Aalto University Espoo Finland Division of Decision and Control Systems KTH Royal Institute of Technology StockholmSE-100 44 Sweden Digital Futures United Kingdom

In this paper, we focus on an asynchronous distributed optimization problem. In our problem, each node is endowed with a convex local cost function, and is able to communicate with its neighbors over a directed communication network. Furthermore, we assume that the communication channels between nodes have limited bandwidth, and each node suffers from processing delays. We present a distributed algorithm which combines the Alternating Direction Method of Multipliers (ADMM) strategy with a finite time quantized averaging algorithm. In our proposed algorithm, nodes exchange quantized valued messages and operate in an asynchronous fashion. More specifically, during every iteration of our algorithm each node (i) solves a local convex optimization problem (for the one of its primal variables), and (ii) utilizes a finite-time quantized averaging algorithm to obtain the value of the second primal variable (since the cost function for the second primal variable is not decomposable). We show that our algorithm converges to the optimal solution at a rate of O(1/k) (where k is the number of time steps) for the case where the local cost function of every node is convex and not-necessarily differentiable. Finally, we demonstrate the operational advantages of our algorithm against other algorithms from the literature. © 2023, CC BY.

关键词： Cost functions

来源：评论

学校读者我要写书评

暂无评论

Benders decomposition for congested partial set covering location with uncertain demand

arXiv

引用

arXiv 2024年

作者： Calamita, Alice Ljubić, Ivana Palagi, Laura Department of Computer Control and Management Engineering Sapienza University of Rome Via Ariosto 25 Rome00185 Italy Department of Information Systems Decision Sciences and Statistics ESSEC Business School of Paris 3 Avenue Bernard Hirsch Cergy95000 France

In this paper, we introduce a mixed integer quadratic formulation for the congested variant of the partial set covering location problem, which involves determining a subset of facility locations to open and efficiently allocating customers to these facilities to minimize the combined costs of facility opening and congestion while ensuring target coverage. To enhance the resilience of the solution against demand fluctuations, we address the case under uncertain customer demand using Γ-robustness. We formulate the deterministic problem and its robust counterpart as mixed-integer quadratic problems. We investigate the effect of the protection level in adapted instances from the literature to provide critical insights into how sensitive the planning is to the protection level. Moreover, since the size of the robust counterpart grows with the number of customers, which could be significant in real-world contexts, we propose the use of Benders decomposition to effectively reduce the number of variables by projecting out of the master problem all the variables dependent on the number of customers. We illustrate how to incorporate our Benders approach within a mixed-integer second-order cone programming (MISOCP) solver, addressing explicitly all the ingredients that are instrumental for its success. We discuss single-tree and multi-tree approaches and introduce a perturbation technique to deal with the degeneracy of the Benders subproblem efficiently. Our tailored Benders approaches outperform the perspective reformulation solved using the state-of-the-art MISOCP solver Gurobi on adapted instances from the literature. © 2024, CC BY.

关键词： Second-order cone programming

来源：评论

学校读者我要写书评

暂无评论

Time-Robust Path Planning with Piece-Wise Linear Trajectory for Signal Temporal Logic Specifications

Time-Robust Path Planning with Piece-Wise Linear Trajectory ...

引用

American control Conference (ACC)

作者： Nhan-Khanh Le Erfaun Noorani Sandra Hirche John S. Baras Chair of Information-oriented Control (ITR) School of Computation Information and Technology Technical University of Munich Munich Germany Department of Electrical and Computer Engineering Institute for Systems Research (ISR) at the University of Maryland College Park MD USA

ISBN: (数字)9798350382655

ISBN: (纸本)9798350382662

Real-world scenarios are characterized by timing uncertainties, e.g., delays, and disturbances. Algorithms with temporal robustness are crucial in guaranteeing the successful execution of tasks and missions in such scenarios. We study time-robust path planning for synthesizing robots' trajectories that adhere to spatial-temporal specifications expressed in Sig-nal Temporal Logic (STL). In contrast to prior approaches that rely on discretized trajectories with fixed time-steps, we leverage Piece-Wise Linear (PWL) signals for the synthesis. PWL signals represent a trajectory through a sequence of time-stamped waypoints. This allows us to encode the STL formula into a Mixed-Integer Linear Program (MILP) with fewer variables. This reduction is more pronounced for specifications with a long planning horizon. To that end, we define time-robustness for PWL signals. Subsequently, we propose quantitative semantics for PWL signals according to the recursive syntax of STL and prove their soundness. We then propose an encoding strategy to transform our semantics into a MILP. Our simulations showcase the soundness and the performance of our algorithm.

关键词： Uncertainty Semantics Transforms Syntactics Encoding Robustness Trajectory

来源：评论

学校读者我要写书评

暂无评论

Robust Event-Triggered control of Nonlinear systems Under a Global Sector-Bound Condition

引用

Guidance, Navigation and control 2022年第2期2卷 59-79页

作者： Pengpeng Zhang Tengfei Liu Zhong-Ping Jiang Department of Control Science&Engineering Frontiers Science Center for Intelligent Autonomous SystemsTongji UniversityShanghai 201804P.R.China State Key Laboratory of Synthetical Automation for Process Industries Northeastern UniversityShenyang 110819P.R.China Department of Electrical and Computer Engineering New York University370 Jay StreetBrooklynNY 11201USA

This paper studies an event-tniggered control problem for nonlinear systems subject to both external disturbancoes and dy namic *** is assumed that the system satisfies a global sector bound *** avold infnitely fast samplng,a novel eventriggred sampling mechanism is propoeed,which use8 not only the measuned system state but also an estimation of the inluence of the *** the propoeed design,the intersampling intervals an be lower bounded by a poeitive constant,and it is independent of botb external disturbances and dynamie ***,the doeedl loop event-tniggered system i proved to be input-torstate stable with repect to the extemal *** smalgain techmigues are;used for the stability analysis of the dloeeil-bop system.

关键词： Event-triggered control external disturbance dynamic uncertainty input-to-state stability

来源：评论

学校读者我要写书评

暂无评论

Theory of phase reduction for systems with higher-order interactions: a route to Kuramoto models on hypergraphs

arXiv

引用

arXiv 2025年

作者： León, Iván Muolo, Riccardo Hata, Shigefumi Nakao, Hiroya Department of Applied Mathematics and Computer Science Universidad de Cantabria Santander39005 Spain Department of Systems and Control Engineering Tokyo Institute of Technology Tokyo152-8552 Japan Graduate School of Science and Engineering Kagoshima University Kagoshima890-0065 Japan Research Center for Autonomous Systems Materialogy Institute of Innovative Research Tokyo Institute of Technology Yokohama226-8501 Japan

Phase reduction is a powerful technique in the study of nonlinear oscillatory systems. Under certain assumptions, it allows us to describe each multidimensional oscillator by a single phase variable, giving rise to simple phase models such as the Kuramoto model. Classically, the method has been applied in the case where the interactions are only pairwise (two-body). However, increasing evidence shows that interactions in real-world systems are not pairwise but higher-order, i.e., many-body. Although synchronization in higher-order systems has received much attention, analytical results are scarce because of the highly nonlinear nature of the framework. In this paper, we fill the gap by presenting a general theory of phase reduction for the case of higher-order interactions. We show that the higher-order topology is preserved in the phase reduced model at the first order and that only odd couplings have an effect on the dynamics when certain symmetries are present. Additionally, we show the power and ductility of the phase reduction approach by applying it to a population of Stuart-Landau oscillators with an all-to-all configuration and with a ring-like hypergraph topology;in both cases, only the analysis of the phase model can provide insights and analytical results. © 2025, CC BY-NC-ND.

关键词： Topology

来源：评论

学校读者我要写书评

暂无评论

Sensing metric-based hybrid underlay/overlay transmission framework for CR-IoT networks for smart city applications

Sensing metric-based hybrid underlay/overlay transmission fr...

引用

7th IET Smart Cities Symposium (SCS 2023)

作者： Indu Bala Maad M. Mijwil Mostafa Abotaleb El-Sayed M. El-kenawy Abdelhameed Ibrahim School of Electrical and Electronics Engineering Lovely Professional University Punjab India Computer Techniques Engineering Department Baghdad College of Economic Sciences University Baghdad Iraq Department of System Programming South Ural State University Chelyabinsk Russia Department of Communications and Electronics Delta Higher Institute of Engineering and Technology Egypt Computer Engineering and Control Systems Department Faculty of Engineering Mansoura University Mansoura Egypt

With the increasing number of IoT devices, there is a growing need for bandwidth to support their communication. Unfortunately, there is a shortage of available bandwidth due to preallocated bands for various services. To address this issue, Cognitive Internet of Things (CR-IoT) enables devices to optimize their efficiency and enhance their communication capabilities by intelligently accessing available bandwidth. This is achieved through the use of soft sensing metrics, where devices continuously monitor the RF environment and transmit data opportunistically in overlay mode if a free channel is detected, or in underlay mode if not. In this paper, a soft sensing metric based hybrid transmission framework is proposed for CR-IoT devices to meet the data rate requirement for the smart city applications. The efficacy of this approach is demonstrated through simulation results.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Learning of Nash Equilibria in Risk-Averse Games

Learning of Nash Equilibria in Risk-Averse Games

引用

American control Conference (ACC)

作者： Zifan Wang Yi Shen Michael M. Zavlanos Karl H. Johansson Division of Decision and Control Systems School of Electrical Enginnering and Computer Science KTH Royal Institute of Technology and also with Digital Futures Stockholm Sweden Department of Mechanical Engineering and Materials Science Duke University Durham NC USA

ISBN: (数字)9798350382655

ISBN: (纸本)9798350382662

This paper considers risk-averse learning in convex games involving multiple agents that aim to minimize their individual risk of incurring significantly high costs. Specifically, the agents adopt the conditional value at risk (CVaR) as a risk measure with possibly different risk levels. To solve this problem, we propose a first-order risk-averse leaning algorithm, in which the CVaR gradient estimate depends on an estimate of the Value at Risk (VaR) value combined with the gradient of the stochastic cost function. Although estimation of the CVaR gradients using finitely many samples is generally biased, we show that the accumulated error of the CVaR gradient estimates is bounded with high probability. Moreover, assuming that the risk-averse game is strongly monotone, we show that the proposed algorithm converges to the risk-averse Nash equilibrium. We present numerical experiments on a Cournot game example to illustrate the performance of the proposed method.

关键词： Reactive power Costs Estimation Games Nash equilibrium Numerical simulation Cost function

来源：评论

学校读者我要写书评

暂无评论

Data-driven Optimal Cooperative Output Regulation of Unknown Linear Discrete-time Multi-agent systems

Data-driven Optimal Cooperative Output Regulation of Unknown...

引用

Chinese control and Decision Conference, CCDC

作者： Dong Liang Yi Dong Chaoli Wang Engang Tian Department of Control Science and Engineering School of Optical-Electrical and Computer Engineering University of Shanghai for Science and Technology Shanghai China College of Electronic and Information Engineering Shanghai Research Institute for Intelligent Autonomous Systems Tongji University Shanghai China

The cooperative output regulation problem has been extensively studied on the basis of the distributed observer approach. However, the majority of the existing research assumes that the dynamics is known previously. To remove this condition, the cooperative output regulation problem is further solved via the data-driven framework where the dynamics of the plant is unknown. First, a data-driven distributed observer is established to estimate the state of the leader with unknown dynamics subject to external inputs. Second, the unknown regulator equations are solved using the iterative recurrent neural network approach. Third, the state-based data-driven distributed control law is synthesized to solve the problem. The optimal gains are derived by solving convex optimization problems using input and state data. Finally, a numerical example is presented to verify the feasibility of the proposed framework.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Security enhancement of LSB-based audio steganography method

Security enhancement of LSB-based audio steganography method

引用

Zooming Innovation in Consumer Electronics International Conference (ZINC)

作者： Jovana Jezdimirović Nenad Pekez Jelena Kovačević Computing and Control Engineering Department Faculty of Technical Sciences University of Novi Sad Novi Sad Serbia RT-RK Institute for Computer Based Systems LLC Novi Sad Serbia

The rapid development of digital technology has brought about the challenge of ensuring information security. Cryptography and steganography are among the various techniques available to address this challenge. These techniques come in different forms and provide reliable means of securing information and communication. Despite the existence of numerous options, new variations are still emerging. This paper concentrates on Least Significant Bit (LSB) coding, which is one of the most widely recognized and frequently utilized steganography techniques. The advantages of LSB-based coding methods are high capacity and low complexity. However, predictability is an issue. Audio files’ sizes and data redundancy make audio data perfect for steganography, as it is possible to embed large amounts of secret information and easily transmit the signal via various communication channels. However, the use of LSB coding in audio steganography has a drawback due to the extreme sensitivity of the human auditory system (HAS). This means that any noise added to the audio with data embedded in the LSBs can be detected by the HAS, which is dependent on the number of LSBs used. This work presents an improvement of the LSB-based approach, the XORing of LSBs method, with an emphasis on enhanced security. The method achieves this by randomly picking the pairs of bits to be XOR’d while preserving the characteristics of classic LSB methods. To verify the method, it has been implemented on the Cirrus Logic DSP, proving that it may be efficiently used in a real-time audio environment without interfering with HAS sensitivity levels.

关键词：

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：