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

Distributed Constrained Online Nonconvex Optimization with Compressed Communication

学校读者我要写书评

暂无评论

arXiv 2025年

作者： Zhang, Kunpeng Xu, Lei Yi, Xinlei Cao, Ming Johansson, Karl H. Chai, Tianyou Yang, Tao State Key Laboratory of Synthetical Automation for Process Industries Northeastern University Shenyang110819 China Department of Mechanical Engineering University of Victoria VictoriaBCV8W 2Y2 Canada Shanghai Institute of Intelligent Science and Technology National Key Laboratory of Autonomous Intelligent Unmanned Systems Frontiers Science Center for Intelligent Autonomous Systems Ministry of Education Shanghai201210 China Engineering and Technology Institute Groningen Faculty of Science and Engineering University of Groningen GroningenAG 9747 Netherlands Division of Decision and Control Systems School of Electrical Engineering and Computer Science KTH Royal Institute of Technology Sweden Digital Futures Stockholm10044 Sweden

This paper considers distributed online nonconvex optimization with time-varying inequality constraints over a network of agents. For a time-varying graph, we propose a distributed online primal–dual algorithm with compressed communication to efficiently utilize communication resources. We show that the proposed algorithm establishes an O(T max{1−θ1,θ1}) network regret bound and an O(T 1−θ1/2) network cumulative constraint violation bound, where T is the number of iterations and θ1 ∈ (0, 1) is a user-defined trade-off parameter. When Slater’s condition holds (i.e, there is a point that strictly satisfies the inequality constraints at all iterations), the network cumulative constraint violation bound is reduced to O(T 1−θ1). These bounds are comparable to the state-of-the-art results established by existing distributed online algorithms with perfect communication for distributed online convex optimization with (time-varying) inequality constraints. Finally, a simulation example is presented to validate the theoretical results. Copyright © 2025, The Authors. All rights reserved.

关键词： Convex optimization

Distributed Online Convex Optimization with Adversarial Constraints: Reduced Cumulative Constraint Violation Bounds under Slater’s Condition

学校读者我要写书评

暂无评论

arXiv 2023年

作者： Yi, Xinlei Li, Xiuxian Yang, Tao Xie, Lihua Hong, Yiguang Chai, Tianyou Johansson, Karl H. Lab for Information & Decision Systems Massachusetts Institute of Technology CambridgeMA02139 United States Department of Control Science and Engineering College of Electronics and Information Engineering Tongji University Shanghai201804 China Shanghai Research Institute for Intelligent Autonomous Systems China The State Key Laboratory of Synthetical Automation for Process Industries Northeastern University Shenyang110819 China School of Electrical and Electronic Engineering Nanyang Technological University 50 Nanyang Avenue Singapore639798 Singapore Division of Decision and Control Systems School of Electrical Engineering and Computer Science KTH Royal Institute of Technology Sweden Digital Futures Stockholm10044 Sweden

This paper considers distributed online convex optimization with adversarial constraints. In this setting, a network of agents makes decisions at each round, and then only a portion of the loss function and a coordinate block of the constraint function are privately revealed to each agent. The loss and constraint functions are convex and can vary arbitrarily across rounds. The agents collaborate to minimize network regret and cumulative constraint violation. A novel distributed online algorithm is proposed and it achieves an O(T max{c,1−c}) network regret bound and an O(T 1−c/2) network cumulative constraint violation bound, where T is the number of rounds and c ∈ (0, 1) is a user-defined trade-off parameter. When Slater’s condition holds (i.e, there is a point that strictly satisfies the inequality constraints), the network cumulative constraint violation bound is reduced to O(T 1−c). Moreover, if the loss functions are strongly convex, then the network regret bound is reduced to O(log(T)), and the network cumulative constraint violation bound is reduced to O(√log(T)T) and O(log(T)) without and with Slater’s condition, respectively. To the best of our knowledge, this paper is the first to achieve reduced (network) cumulative constraint violation bounds for (distributed) online convex optimization with adversarial constraints under Slater’s condition. Finally, the theoretical results are verified through numerical simulations. Copyright © 2023, The Authors. All rights reserved.

关键词： Economic and social effects

Competition and Cooperation Mechanism Between Agency Selling and Wholesale: An Application of the Emerging E-commerce Model

学校读者我要写书评

暂无评论

Competition and Cooperation Mechanism Between Agency Selling...

IEEE International Conference on Industrial engineering and engineering Management

作者： Haonan Wang C. K. M. Lee Ping Ji Gang Li Department of Industrial and Systems Engineering The Hong Kong Polytechnic University Hong Kong China Laboratory for Artificial Intelligence in Design Hong Kong Science Park New Territories Hong Kong SAR China School of Intelligent Finance and Business XJTLU Entrepreneur College (Taicang) Xi'an Jiaotong - Liverpool University China School of Management Xi'an Jiaotong University The State Key Lab for Manufacturing Systems Engineering The Key Lab of the Ministry of Education for Process Control and Efficiency Engineering Xi'an China

Recently, the platform economy allows enterprises to collaborate with business partners and provide additional channels for various parties. E-commerce platforms have become integral channels for connecting suppliers with consumers. In the platform economy, agency selling and reselling are two predominant sales models that often coexist for the same product types, resulting in a competitive relationship. This study analyzes transaction data for 30,000 Stock Keeping Units (SKUs) provided by the Chinese e-commerce platforms over one month. We employ three models to compare the sales quantity and profits of manufacturers and online platforms and to identify the most efficient mode for stakeholders based on the model establishment and empirical evidence. Our findings suggest that apart from the existing channel to provide products to customers, manufacturers enter the platform which will increase the profit of platform operators. On the other hand, platform operators may also affect the profit of the manufacturers.

关键词：

Compressed Gradient Tracking Algorithms for Distributed Nonconvex Optimization

学校读者我要写书评

暂无评论

arXiv 2023年

作者： Xu, Lei Yi, Xinlei Wen, Guanghui Shi, Yang Johansson, Karl H. Yang, Tao The State Key Laboratory of Synthetical Automation for Process Industries Northeastern University Shenyang110819 China The Lab for Information & Decision Systems Massachusetts Institute of Technology CambridgeMA02139 United States The Department of Systems Science School of Mathematics Southeast University Nanjing210096 China The Department of Mechanical Engineering University of Victoria VictoriaBCV8W 2Y2 Canada The Division of Decision and Control Systems School of Electrical Engineering and Computer Science KTH Royal Institute of Technology Stockholm100 44 Sweden

In this paper, we study the distributed nonconvex optimization problem, aiming to minimize the average value of the local nonconvex cost functions using local information exchange. To reduce the communication overhead, we introduce three general classes of compressors, i.e., compressors with bounded relative compression error, compressors with globally bounded absolute compression error, and compressors with locally bounded absolute compression error. By integrating them, respectively, with the distributed gradient tracking algorithm, we then propose three corresponding compressed distributed nonconvex optimization algorithms. Motivated by the state-of-the-art BEER algorithm proposed in [1], which is an efficient compressed algorithm integrating gradient tracking with biased and contractive compressors, our first proposed algorithm extends this algorithm to accommodate both biased and non-contractive compressors. For each algorithm, we design a novel Lyapunov function to demonstrate its sublinear convergence to a stationary point if the local cost functions are smooth. Furthermore, when the global cost function satisfies the Polyak–Lojasiewicz (P–L) condition, we show that our proposed algorithms linearly converge to a global optimal point. It is worth noting that, for compressors with bounded relative compression error and globally bounded absolute compression error, our proposed algorithms’ parameters do not require prior knowledge of the P–L constant. The theoretical results are illustrated by numerical examples, demonstrating the effectiveness of the proposed algorithms in significantly reducing the communication burden while maintaining the convergence performance. Moreover, simulation results show that the proposed algorithms outperform the state-of-the-art compressed distributed nonconvex optimization algorithms. Copyright © 2023, The Authors. All rights reserved.

关键词： Cost functions

Quantized Distributed Nonconvex Optimization with Linear Convergence

学校读者我要写书评

暂无评论

Quantized Distributed Nonconvex Optimization with Linear Con...

IEEE Conference on Decision and control

作者： Lei Xu Xinlei Yi Jiayue Sun Yang Shi Karl Henrik Johansson Tao Yang State Key Laboratory of Synthetical Automation for Process Industries Northeastern University Shenyang China Division of Decision and Control Systems School of Electrical Engineering and Computer Science KTH Royal Institute of Technology Digital Futures Stockholm Sweden Department of Mechanical Engineering University of Victoria Victoria Canada

ISBN: (数字)9781665467612

ISBN: (纸本)9781665467629

This paper considers distributed nonconvex op-timization for minimizing the average of local cost functions, by using local information exchange over undirected communication networks. Since the communication channels often have limited bandwidth or capacity, we first introduce a quantization rule and an encoder/decoder scheme to reduce the transmission bits. By integrating them with a distributed algorithm, we then propose a distributed quantized nonconvex optimization algorithm. Assuming the global cost function satisfies the Polyak– Łojasiewicz condition, which does not require the global cost function to be convex and the global minimizer is not necessarily unique, we show that the proposed algorithm linearly converges to a global optimal point. Moreover, a low data rate is shown to be sufficient to ensure linear convergence when the algorithm parameters are properly chosen. The theoretical results are illustrated by numerical simulation examples.

关键词： Quantization (signal) Communication channels Bandwidth Cost function Numerical simulation Communication networks Distributed algorithms

Optimal Load control and Scheduling through Distributed Mixed-integer Linear Programming

学校读者我要写书评

暂无评论

Optimal Load Control and Scheduling through Distributed Mixe...

Mediterranean Conference on control and Automation (MED)

作者： Vassilios Yfantis William Motsch Nico Bach Achim Wagner Martin Ruskowski Department of Mechanical and Process Engineering Chair of Machine Tools and Control Systems Technische Universit&#x00E4 t Kaiserslautern Kaiserslautern Germany Technologie-Initiative SmartFactory KL e.V. Kaiserslautern Germany German Research Center for Artificial Intelligence (DFKI) Kaiserslautern Germany

ISBN: (数字)9781665406734

ISBN: (纸本)9781665406741

This paper presents a mixed-integer linear programming-based optimization model for simultaneous optimal load control and scheduling of distributed systems coupled through their energy consumptions. The subsystems are able to adjust their energy consumption during the execution of a task and aim at minimizing their completion time and energy cost. The overall problem is solved in a distributed fashion, where each subsystem optimizes its individual operation without sharing sensitive information. To this end, dual decomposition is employed and a new algorithm to update the dual variables is presented. It relies on a transformation of the gradient of the quadratically approximated dual function and the subsequent solution of a regression problem. The proposed algorithm makes efficient use of information collected in previous iterations. The solution obtained from the distributed optimization of the subsystems is compared to both a decentral and a system-wide solution, showing that the distributed solution lies close to the global optimum of the process.

关键词： Energy consumption Costs Automation Approximation algorithms Mixed integer linear programming Task analysis Optimization

The Knowledge Competencies and Digital Competencies of Project Managers in Life Cycle Cost Management 18

学校读者我要写书评

暂无评论

The Knowledge Competencies and Digital Competencies of Proje...

18th IEEE International Conference on Emerging eLearning Technologies and Applications, ICETA 2020

作者： Mandicak, T. Mesaros, P. Spisakova, M. Behun, M. Kanalikova, A. Management and Information Systems in Construction Faculty of Civil Engineering Department of Economics Kosice Slovakia Process Control and Geotechnologies Faculty of Mining Ecology Kosice Slovakia Faculty of Civil Engineering Department of Applied Mathematics and Descriptive Geometry Kosice Slovakia

ISBN: (纸本)9780738123660

Training of project managers and their development of knowledge competencies and digital competencies is one of main attributes of success performance results in each sector. The use of digital and knowledge technologies can be a prerequisite for effective life-cycle cost management in context of development of digital and knowledge competencies. Life Cycle Cost Management is an important part of cost management and approach in each industry. The construction industry is an important sector of the country's economy. It is the relationship between project managers and their level of use of knowledge and digital competencies that can be key concerning effective cost management in construction. Acquisition of digital and knowledge competencies and skills through the use of digital and knowledge technologies is a process for increasing managerial competencies. This research addresses the relationship and how to acquire knowledge and digital competencies using knowledge and digital technologies in Life Cycle Cost Management. It is the relationship and use of digital technologies, the level of knowledge and digital competences and the level of lifetime costs that is the subject of research. The main goal of the research is to point out the relationship between the acquisition of knowledge and digital competencies and the amount of life cycle cost management in individual phases of the life cycle of a construction project. © 2020 IEEE.

关键词： Construction industry

Analysis and Design for Hydrogen-Fueled Cascade Solid Oxide Fuel Cell System

学校读者我要写书评

暂无评论

SSRN

SSRN 2023年

作者： Liu, Peiyuan Zhang, Yongliang Zhu, Jianzhong Han, Minfang Sun, Kaihua Zhong, Haijun Zhang, XueRui State Key Laboratory of Control and Simulation of Power Systems and Generation Equipment Department of Energy and Power Engineering Tsinghua University Beijing100084 China Xuzhou Huatsing Jingkun Energy Co. Ltd. Jiangsu Province 221005 China Petrochemical Research Institute China National Petroleum Corporation Beijing112206 China Institute of Process Engineering Chinese Academy of Sciences Beijing100190 China

Maximizing total fuel utilization is the key to improving the electrical efficiency of solid oxide fuel cell (SOFC) systems. The cascade system can achieve this effectively, but there are fewer studies on hydrogen-fueled cascade systems, and the determination of suitable rated power ratios needs a basis. Because of the characteristics of cascade systems, a fast model that can predict performance at low flow rates and low hydrogen partial pressures is required. Using multiple sets of experimental data, this study developed and validated an improved semi-empirical model, which accurately predicted the industrial-sized cell performance at different flow rates and hydrogen partial pressures. On this basis, the basic parallel and cascade system models were established. The effects of fuel flow rate, rated power ratio, split ratio, and constraints on the system performance were studied and analyzed, and the appropriate design and operation parameters of the cascade system were determined. The results indicated that the cascade system can significantly improve electrical efficiency compared to the parallel system by selecting suitable design parameters. In the example of a 10-kW rated power system design, the cascade system improved the electrical efficiency by over 9% at rated power compared to the parallel system. The results obtained provide valuable reference for related research and offer guidance for system design. © 2023, The Authors. All rights reserved.

关键词： Electrical efficiency

Dexterous Manipulation through Imitation Learning: A Survey

学校读者我要写书评

暂无评论

arXiv 2025年

作者： An, Shan Meng, Ziyu Tang, Chao Zhou, Yuning Liu, Tengyu Ding, Fangqiang Zhang, Shufang Mu, Yao Song, Ran Zhang, Wei Hou, Zeng-Guang Zhang, Hong School of Electrical and Information Engineering Tianjin University Tianjin300072 China School of Control Science and Engineering Shandong University Jinan250061 China State Key Laboratory of General Artificial Intelligence Beijing100086 China Department of Mechanical and Process Engineering ETH Zurich Zurich8092 Switzerland Department of Electronic and Electrical Engineering Southern University of Science and Technology Shenzhen518055 China School of Informatics University of Edinburgh EH8 9AB United Kingdom Department of Computer Science University of Hong Kong 999077 Hong Kong State Key Laboratory of Multimodal Artificial Intelligence Systems Institute of Automation Chinese Academy of Sciences Beijing100190 China School of Artificial Intelligence University of Chinese Academy of Sciences Beijing100049 China CASIA-MUST Joint Laboratory of Intelligence Science and Technology Institute of Systems Engineering Macau University of Science and Technology 999078 China

Dexterous manipulation, which refers to the ability of a robotic hand or multi-fingered end-effector to skillfully control, reorient, and manipulate objects through precise, coordinated finger movements and adaptive force modulation, enables complex interactions similar to human hand dexterity. With recent advances in robotics and machine learning, there is a growing demand for these systems to operate in complex and unstructured environments. Traditional model-based approaches struggle to generalize across tasks and object variations due to the high-dimensionality and complex contact dynamics of dexterous manipulation. Although model-free methods such as reinforcement learning (RL) show promise, they require extensive training, large-scale interaction data, and carefully designed rewards for stability and effectiveness. Imitation learning (IL) offers an alternative by allowing robots to acquire dexterous manipulation skills directly from expert demonstrations, capturing fine-grained coordination and contact dynamics while bypassing the need for explicit modeling and large-scale trial-and-error. This survey provides an overview of dexterous manipulation methods based on imitation learning (IL), details recent advances, and addresses key challenges in the field. Additionally, it explores potential research directions to enhance IL-driven dexterous manipulation. Our goal is to offer researchers and practitioners a comprehensive introduction to this rapidly evolving domain. Copyright © 2025, The Authors. All rights reserved.

关键词： Grippers