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

A Time-delay Approach for Extremum Seeking of Nonlinear Static Maps:

IFAC-PapersOnLine 2023年第1期56卷 258-263页

作者： Yang Zhu Emilia Fridman Institute of Cyber-Systems and Control State Key Laboratory of Industrial Control Technology Zhejiang University China School of Electrical Engineering Tel-Aviv University Israel

This paper develops a constructive time-delay approach to averaging for gradient-based extremum seeking (ES) control of nonlinear static maps of non-quadratic form. Under the assumption that some prior knowledge of the nonlinear map with its derivatives is available, for the first time, we derive a quantitative analysis for ES close-loop systems with upper bounds on the tuning parameter that preserves the exponential stability and on the convergence error of extremum seeking. By transforming the ES system into a time-delay neutral type system with distributed delays, the developed method gives an accurate perturbed system of ES without employing any approximate calculation, and suggests a direct Lyapunov-Krasovskii approach in the form of linear matrix inequalities (LMIs), for the transformed time-delay plant to derive efficient stability conditions.

关键词： Extremum Seeking Time-delay Nonlinear Static Non-quadratic

来源：评论

学校读者我要写书评

暂无评论

Principal Trotter observation error with truncated commutators

引用

Physical Review A 2024年第6期110卷 062614-062614页

作者： Langyu Li Institute of Cyber-system and Control College of Control Science and Engineering Zhejiang University Hangzhou Zhejiang 310027 China and State Key Laboratory of Industrial Control Technology Zhejiang University Hangzhou Zhejiang 310027 China

Hamiltonian simulation is one of the most promising applications of quantum computers, and the product formula is one of the most important methods for this purpose. Previous related work has mainly focused on the worst-case, average-case, or actual-case scenarios. In this work we consider the simulation error under a fixed observable. Specifically, errors that commute with this observable become less significant. To illustrate this point, we define the observation error as the expectation under the observable and provide a commutativity-based upper bound using the Baker-Campbell-Hausdorff formula. Furthermore, we observe that the evolution order plays a critical role in determining the observation error. By leveraging a simulated annealing algorithm, we design an evolution order optimization algorithm, to identify an order that enhances commutativity with the observable, where the observation error indicated by this upper bound can be significantly compressed. In the experiment with the Heisenberg model, the observation bound compresses the Trotter number by nearly half compared to recent commutator bounds. The experiment on the hydrogen molecule Hamiltonian demonstrates that optimizing the order can lead to nearly half the reduction in the Trotter number.

关键词： Hamiltonians

来源：评论

学校读者我要写书评

暂无评论

Accelerated Distributed Aggregative Optimization

引用

IEEE Transactions on Automatic control 2025年

作者： Liu, Jiaxu Chen, Song Cai, Shengze Xu, Chao Chu, Jian Zhejiang University School of Mathematical Sciences Zhejiang Hangzhou310027 China Zhejiang University State Key Laboratory of Industrial Control Technology Institute of Cyber-Systems and Control Zhejiang Hangzhou310027 China

This paper delves into the investigation of a distributed aggregative optimization problem within a network. In this scenario, each agent possesses its own local cost function, which relies not only on the local state variable but also on an aggregated function of state variables from all agents. To expedite the optimization process, we amalgamate the heavy ball and Nesterov's accelerated method with distributed aggregative gradient tracking, resulting in the proposal of two innovative algorithms, aimed at resolving the distributed aggregative optimization problem. Our analysis demonstrates that the proposed algorithms can converge to an optimal solution at a global linear convergence rate when the objective function is strongly convex with the Lipschitz-continuous gradient, and when the parameters (e.g., step size and momentum coefficients) are chosen within specific ranges. Additionally, we present several numerical experiments to verify the effectiveness, robustness and superiority of our proposed algorithms. © 2025 IEEE.

关键词： Optimization algorithms

来源：评论

学校读者我要写书评

暂无评论

Symplectic analysis for regulating wave propagation in a one-dimensional nonlinear graded metamaterial

引用

Applied Mathematics and Mechanics(English Edition) 2023年第5期44卷 745-758页

作者： Yunping ZHAO Xiuhui HOU Kai ZHANG Zichen DENG Department of Applied Mathematics Northwestern Polytechnical UniversityXi’an 710072China School of Mechanics Civil Engineering and ArchitectureNorthwestern Polytechnical UniversityXi’an 710072China Ministry of Industry and Information Technology Key Laboratory of Dynamics and Control of Complex SystemsNorthwestern Polytechnical UniversityXi’an 710072China State Key Laboratory of Structural Analysis for Industrial Equipment Dalian University of TechnologyDalian 116024China

An analytical method,called the symplectic mathematical method,is proposed to study the wave propagation in a spring-mass chain with gradient arranged local resonators and nonlinear ground *** with the linearized perturbation approach,the symplectic transform matrix for a unit cell of the weakly nonlinear graded metamaterial is derived,which only relies on the state *** results of the dispersion relation obtained with the symplectic mathematical method agree well with those achieved by the Bloch *** is shown that wider and lower frequency bandgaps are formed when the hardening nonlinearity and incident wave intensity ***,the displacement response and transmission performance of nonlinear graded metamaterials with finite length are *** dual tunable effects of nonlinearity and gradation on the wave propagation are explored under different excitation *** small excitation frequencies,the gradient parameter plays a dominant role compared with the *** reason is that the gradient tuning aims at the gradient arrangement of local resonators,which is limited by the critical value of the local resonator *** contrast,for larger excitation frequencies,the hardening nonlinearity is dominant and will contribute to the formation of a new bandgap.

关键词： symplectic mathematical method nonlinear graded metamaterial tunable bandgap

来源：评论

学校读者我要写书评

暂无评论

Learning adaptive manipulation of objects with revolute joint: A case study on varied cabinet doors opening

arXiv

引用

arXiv 2023年

作者： Yu, Hongxiang Guo, Dashun Zhou, Zhongxiang Wang, Yue Xiong, Rong The State Key Laboratory of Industrial Control and Technology The Institute of Cyber-Systems and Control Zhejiang University Hangzhou310058 China

This paper introduces a learning-based framework for robot adaptive manipulating the object with a revolute joint in unstructured environments. We concentrate our discussion on various cabinet door opening tasks. To improve the performance of Deep Reinforcement Learning in this scene, we analytically provide an efficient sampling manner utilizing the constraints of the objects. To open various kinds of doors, we add encoded environment parameters that define the various environments to the input of out policy. To transfer the policy into the real world, we train an adaptation module in simulation and fine-tune the adaptation module to cut down the impact of the policy-unaware environment parameters. We design a series of experiments to validate the efficacy of our framework. Additionally, we testify to the model's performance in the real world compared to the traditional door opening method. Copyright © 2023, The Authors. All rights reserved.

关键词： Reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

Distributed Optimization in Sensor Network for Scalable Multi-Robot Relative state Estimation

arXiv

引用

arXiv 2023年

作者： Wu, Tianyue Gao, Fei State Key Laboratory of Industrial Control Technology Institute of Cyber-Systems and Control Zhejiang University Hangzhou310027 China

Distance measurements demonstrate distinctive scalability when used for relative state estimation in large-scale multi-robot systems. Despite the attractiveness of distance measurements, multi-robot relative state estimation based on distance measurements raises a tricky optimization problem, especially in the context of large-scale systems. Motivated by this, we aim to develop specialized computational techniques that enable robust and efficient estimation when deploying distance measurements at scale. We first reveal the commonality between the estimation problem and the one that finds realization of a sensor network, from which we draw crucial lesson to inspire the proposed methods. However, solving the latter problem in large-scale (still) requires distributed optimization schemes with scalability natures, efficient computational procedures, and fast convergence rates. Towards this goal, we propose a complementary pair of distributed computational techniques with the classical block coordinate descent (BCD) algorithm as a unified backbone. In the first method, we treat Burer-Monteiro factorization as a rank-restricted heuristic for rank-constrained semidefinite programming (SDP), where a specialized BCD-type algorithm that analytically solve each block update subproblem is employed. Although this method enables robust and (extremely) fast recovery of estimates from initial guesses, it inevitably fails as the initialization becomes disorganized. We therefore propose the second method, derived from a convex formulation named anchored edge-based semidefinite programming (ESDP), to complement it, at the expense of a certain loss of efficiency. This formulation is structurally decomposable so that BCD can be naturally employed, where each subproblem is convex and (again) solved exactly. Since in both methods BCD seeks to solve the subproblem exactly, fewer iterations, as well as the number of communication rounds, are expected. Extensive evaluation on 2D and 3D probl

关键词： Scalability

来源：评论

学校读者我要写书评

暂无评论

Adaptive Model Prediction control-Based Multi-Terrain Trajectory Tracking Framework for Mobile Spherical Robots

arXiv

引用

arXiv 2023年

作者： Liu, Yifan Hu, Tao Guan, Xiaoqing Wang, Yixu Zhang, Bixuan Wang, You Li, Guang State Key Laboratory of Industrial Control Technology Institute of Cyber Systems and Control Zhejiang University Hangzhou310027 China

Owing to uncertainties in both kinematics and dynamics, the current trajectory tracking framework for mobile robots like spherical robots cannot function effectively on multiple terrains, especially uneven and unknown ones. Since this is a prerequisite for robots to execute tasks in the wild, we enhance our previous hierarchical trajectory tracking framework to handle this issue. First, a modified adaptive RBF neural network (RBFNN) is proposed to represent all uncertainties in kinodynamics. Then the Lyapunov function is utilized to design its adaptive law, and a variable step-size algorithm is employed in the weights update procedure to accelerate convergence and improve stability. Hence, a new adaptive model prediction control-based instruction planner (VAN-MPC) is proposed. Without modifying the bottom controllers, we finally develop the multi-terrain trajectory tracking framework by employing the new instruction planner VAN-MPC. The practical experiments demonstrate its effectiveness and robustness. Copyright © 2023, The Authors. All rights reserved.

关键词： Mobile robots

来源：评论

学校读者我要写书评

暂无评论

A Conflict-Reducing Path Planning Algorithm in Automated Warehouses 18

A Conflict-Reducing Path Planning Algorithm in Automated War...

引用

18th IEEE International Conference on Networking, Sensing and control, ICNSC 2021

作者： Feng, Ligen Chen, Xinyu Zhang, Tingqi Wu, Weimin Zhejiang University State Key Laboratory of Industrial Control Technology Institute of Cyber-Systems and Control Hangzhou China

ISBN: (纸本)9781665440486

With the development of modern logistics industry, automated warehouses are becoming more and more widely used. An automated guided vehicle (AGV) is often used to carry goods in warehouse. Under specific limitations of the road layout, AGVs are prone to conflict when moving. According to the layout characteristics of automated warehouses, this paper proposes a conflict-reducing path planning algorithm, which is an improvement of A-star algorithm. The conflict cost and turn cost are introduced to the algorithm to reduce the conflict probability and the number of turns of paths. Through simulation comparison, it is verified that the algorithm can reduce the probability of conflicts among AGVs and improve the overall efficiency of multi-AGV systems. © 2021 IEEE.

关键词： Motion planning

来源：评论

学校读者我要写书评

暂无评论

A Real Time Vehicle Scheduling Strategy in Container Terminals 18

A Real Time Vehicle Scheduling Strategy in Container Termina...

引用

18th IEEE International Conference on Networking, Sensing and control, ICNSC 2021

作者： Rong, Zhenrui Wu, Weimin Wang, Xingkai Jin, Xiaojie Institute of Cyber-Systems and Control Zhejiang University State Key Laboratory of Industrial Control Technology Hangzhou China

ISBN: (纸本)9781665440486

With the rapid development of global container business, there are higher requirements for the operation efficiency of container terminals. The vehicle dispatching system is an important link in the operation of container terminal. The yard environment of container terminal is very complex, and the traditional global optimization model based on time estimation is no longer suitable to deal with the vehicle dispatching problem in the scene of dock. This paper proposes a real-time vehicle scheduling strategy for container terminals. Firstly, a buffer vehicle pool is designed to balance the efficiency of each quay crane (QC). Secondly, the wider neighborhood simulated annealing algorithm (WNSA) is presented to find the optimal matching result of each round of calculation. The experimental results show that the proposed strategy in this paper is able to improve the operation efficiency of the QCs and reduce the vehicle cost in the container terminal. © 2021 IEEE.

关键词： Vehicles

来源：评论

学校读者我要写书评

暂无评论

A Dynamic Joint Real-time Scheduling Strategy of Truck and Yard Crane in Container Terminals 18

A Dynamic Joint Real-time Scheduling Strategy of Truck and Y...

引用

18th IEEE International Conference on Networking, Sensing and control, ICNSC 2021

作者： Jin, Xiaojie Wang, Xingkai Wu, Weimin Rong, Zhenrui Zhang, Quanling Zhejiang University State Key Laboratory of Industrial Control Technology Institute of Cyber-Systems and Control Hangzhou China

ISBN: (纸本)9781665440486

With the continuous growth of port container throughput, it is difficult to meet the port production demand by simply configuring automation equipments to improve the operation efficiency of machinery. The container truck scheduling and yard crane scheduling are the two important scheduling links in container terminals. At the same time, there is a tight coupling between them. Thus, the joint scheduling of container trucks and yard cranes is necessary to improve the operation efficiency of container terminals. In this paper, the joint real-time scheduling of trucks and yard cranes is mathematically modeled, and is solved by the elite genetic algorithm. Finally, a variety of scheduling strategies are compared to verify the effectiveness of the proposed strategy. © 2021 IEEE.

关键词： Trucks

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：