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

arXiv 2025年

作者： Cho, Youngchae Yang, Insoon Ishizaki, Takayuki Department of Systems and Control Engineering Institute of Science Tokyo Tokyo Japan Department of Electrical and Computer Engineering ASRI Seoul National University Seoul Korea Republic of

Most existing generation scheduling models for power systems under demand uncertainty rely on energy-based formulations with a finite number of time periods, which may fail to ensure that power supply and demand are balanced continuously over time. To address this issue, we propose a robust generation scheduling model in a continuous-time framework, employing a decision rule approach. First, for a given set of demand trajectories, we formulate a general robust generation scheduling problem to determine a decision rule that maps these demand trajectories and time points to the power outputs of generators. Subsequently, we derive a surrogate of it as our model by carefully designing a class of decision rules that are affine in the current demand, with coefficients invariant over time and constant terms that are continuous piecewise affine functions of time. As a result, our model can be recast as a finite-dimensional linear program to determine the coefficients and the function values of the constant terms at each breakpoint, solvable via the cutting-plane method. Our model is non-anticipative unlike most existing continuous-time models, which use Bernstein polynomials, making it more practical. We also provide illustrative numerical examples. Copyright © 2025, The Authors. All rights reserved.

关键词： Continuous time systems

来源：评论

学校读者我要写书评

暂无评论

Distributed Constrained Online Nonconvex Optimization with Compressed Communication

arXiv

引用

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

来源：评论

学校读者我要写书评

暂无评论

Adaptive Fuzzy Dynamic Surface control of Flexible-Joint Robot systems With Input Saturation

引用

IEEE/CAA Journal of Automatica Sinica 2019年第1期6卷 97-107页

作者： Song Ling Huanqing Wang Peter X.Liu the School of Mechanical Electronic and Control EngineeringBeijing Jiaotong University the Department of Mathematics Bohai University IEEE the Department of Systems and Computer Engineering Carleton University

In this paper, we propose an adaptive fuzzy dynamic surface control(DSC) scheme for single-link flexible-joint robotic systems with input saturation. A smooth function is utilized with the mean-value theorem to deal with the difficulties associated with input saturation. An adaptive DSC design with an auxiliary first-order filter is used to solve the "explosion of complexity"problem. It is proved that all the signals in the closed-loop system are semi-globally uniformly ultimately bounded, and the tracking error eventually converges to a small neighborhood around zero. The main advantage of the proposed method is that only one adaptation parameter needs to be updated,which reduces the computational burden significantly. Simulation results demonstrate the feasibility of the proposed scheme and the comparison results show that the improved DSC method can reduce the computational burden by almost two thirds in comparison with the standard DSC method.

关键词： Adaptive fuzzy control dynamic surface control (DSC) flexible-joint (FJ) robots single-link tracking control

来源：评论

学校读者我要写书评

暂无评论

Pose-graph optimization for efficient tie-point matching and 3D scene reconstruction from oblique UAV images

引用

ISPRS Journal of Photogrammetry and Remote Sensing 2025年 225卷 461-491页

作者： Zhihua Xu Yongze Niu Jincheng Jiang Rongjun Qin Ximin Cui College of Geoscience and Surveying Engineering China University of Mining and Technology-Beijing Beijing 100083 China North Automatic Control Technology Institute Taiyuan Shanxi 030006 China School of Intelligent Systems Engineering Sun Yat-sen University Shenzhen Guangdong 518107 China Department of Civil Environmental and Geodetic Engineering The Ohio State University 2036 Neil Avenue Columbus OH 43210 USA Department of Electrical and Computer Engineering The Ohio State University Dreese Laboratories 205 2015 Neil Ave Columbus OH 43210 United States Translational Data Analytics Institute The Ohio State University 1760 Neil Ave Columbus OH 43210 United States

Oblique photogrammetry using unmanned aerial vehicles (UAV) is crucial to 3D scene reconstruction. Nevertheless, oblique images are generally acquired with large overlaps, and sometimes with multiple views. Although this increases the level of data completeness, it introduces additional and sometimes redundant computations in tie-point matching, creating overly dense camera connections in the pose graph for bundle adjustment (BA). This study optimizes the pose graph of oblique UAV images by removing redundant image connections to guide tie-point matching. Assuming a five-camera system for oblique image collection, a pose graph called a topologically connected camera network (TCN) was initially constructed using position and orientation system (POS) data to determine the spatial connectivity among oblique images. Second, five geometric meta-parameters of overlapping images were constructed, and their influence on tie-point matching was analyzed using a data-driven approach to generate a weighted pose graph. Third, the weighted pose graph was simplified to a degree-bounded skeletal camera network (D-SCN) using the proposed two-stage multi-objective graph optimization approach. Finally, the D-SCN was embedded into a structure from motion (SfM) pipeline to produce a novel D-SCN–SfM method to reduce the required computations for tie-point matching. The proposed D-SCN-SfM method was tested using data from three large sites, each containing over 5,000 images. In addition, the D-SCN-SfM method was compared with three state-of-the-art methods. The experimental results indicate that our method can significantly reduce the required computations for tie-point matching to 1/14–1/20 as compared to a method that uses only topological constraints, that is, TCN, saving 89–92% of the time expenditure. Furthermore, the accuracy and completeness of the 3D geometry produced by the proposed method were comparable to those produced by standard SfM methods. The source code of our approach

关键词：

来源：评论

学校读者我要写书评

暂无评论

Multimodal Emotion Recognition Based on Multi-Scale Facial Features and Cross-Modal Attention

Multimodal Emotion Recognition Based on Multi-Scale Facial F...

引用

IEEE International Conference on Industrial Technology (ICIT)

作者： Chengao Bao Luefeng Chen Min Li Min Wu Witold Pedrycz Kaoru Hirota School of Automation China University of Geosciences Wuhan China the Hubei Key Laboratory of Advanced Control and Intelligent Automation for Complex Systems School of Automation and the Engineering Research Center of Intelligent Technology for Geo-Exploration Ministry of Education China University of Geosciences Wuhan China Department of Electrical and Computer Engineering University of Alberta Edmonton Canada Tokyo Institute of Technology Yokohama Japan Tokyo Institute of Technology Tokyo Japan

ISBN: (数字)9798331521950

ISBN: (纸本)9798331521967

A multi-modal emotion recognition method based on facial multi-scale features and cross-modal attention (MS-FCA) network is proposed. The MSFCA model improves the traditional single-branch ViT network into a two-branch ViT architecture by using classification tokens in each branch to interact with picture embeddings in the other branch, which facilitates effective interactions between different scales of information. Subsequently, audio features are extracted using ResNet18 network. The cross-modal attention mechanism is used to obtain the weight matrices between different modal features, making full use of inter-modal correlation and effectively fusing visual and audio features for more accurate emotion recognition. Two datasets are used for the experiments: eNTERFACE'05 and REDVESS dataset. The experimental results show that the accuracy of the proposed method on the eNTERFACE'05 and REDVESS datasets is 85.42% and 83.84% respectively, which proves the effectiveness of the proposed method.

关键词： Emotion recognition Visualization Accuracy Service robots Semantics Human-robot interaction Speech recognition Feature extraction Data mining Facial features

来源：评论

学校读者我要写书评

暂无评论

Fast implementation of the forward positional acceleration of robots via the distributed arithmetic technique

引用

CIRCUITS systems AND SIGNAL PROCESSING 1997年第2期16卷 165-195页

作者： Grigoriadis, GK Mertzios, BG Automatic Control Systems Laboratory Department of Electrical and Computer Engineering Dimocritus University of Thrace Xanthi Greece

This paper refers to the fast implementation of the positional forward acceleration of the end effector of revolute robotic arms with spherical wrists, using the distributed arithmetic technique. The acceleration of the end effector is calculated by a cascade configuration of two pipelined arrays that calculate the Jacobian matrix and its time derivative, as well as the centrifugal-Coriolis and linear accelerations. These partial accelerations are then added in the adder tree. The building blocks of the arrays are the distributed arithmetic-based circuits that implement the matrix-vector multiplications involved in the calculations. The digit-serial configuration of the proposed implementation of the positional forward acceleration of the end effector is described. The serial and the parallel configurations may result as special cases of the digit-serial configuration. The proposed distributed arithmetic (DA) implementation of the positional forward acceleration may be applied, after appropriate modifications, to the general case of robots having either revolute or prismatic joints, with any type of wrist.

关键词： End effectors

来源：评论

学校读者我要写书评

暂无评论

Internal force-based impedance control for cooperating manipulators

引用

IEEE TRANSACTIONS ON ROBOTICS AND AUTOMATION 1996年第1期12卷 78-89页

作者： Bonitz, RG Hsia, TC Systems Controland Robotics LaboratoryDepartment of Electrical and Computer Engineering University of California Davis CA USA

An internal force-based impedance control scheme for cooperating manipulators is introduced which controls the motion of the objects being manipulated and the internal force on the objects. The controller enforces a relationship between the velocity of each manipulator and the internal force on the manipulated objects. Each manipulator is directly given the properties of an impedance by the controller;thus, eliminating the gain limitation inherent in the structure of previously proposed schemes. The controller uses the forces sensed at the robot end effecters to compensate for the effects of the objects' dynamics and to compute the internal force using only kinematic relationships. Thus, knowledge of the objects' dynamics is not required. Stability of the system is proven using Lyapunov theory and simulation results are presented validating the proposed concepts. The effect of computational delays in digital control implementations is analyzed vis-a-vis stability and a lower bound derived on the size of the desired manipulator inertia relative to the actual manipulator endpoint inertia. The bound is independent of the sample time.

关键词： Impedance Force control Motion control Manipulator dynamics Velocity control Robot sensing systems End effectors Kinematics Stability Computational modeling

来源：评论

学校读者我要写书评

暂无评论

Locally distinguishing inputs for systems on Lie groups and parallelism

引用

PROCEEDINGS OF THE ROYAL SOCIETY A-MATHEMATICAL PHYSICAL AND engineering SCIENCES 1997年第1966期453卷 2391-2395页

作者： Apostolou, N Kazakos, D Control Systems Laboratory Department of Electrical and Computer Engineering University of Patras 26500 Patras Greece

This paper is concerned with invariant systems on Lie groups. A sufficient condition for a piecewise constant input to distinguish between any two distinct initial states contained in some open neighbourhood of the state space is given. This condition involves the parallel translation of vectors along curves thus relating observability to parallelism.

关键词：

来源：评论

学校读者我要写书评

暂无评论

LEARNING OF MODULAR STRUCTURED NETWORKS

引用

ARTIFICIAL INTELLIGENCE 1995年第1期75卷 51-62页

作者： ISHIKAWA, M Department of Control Engineering and Science Faculty of Computer Science and Systems Engineering Kyushu Institute of Technology Iizuka Fukuoka 820 Japan

Learning of large-scale neural networks suffers from computational cost and the local minima problem. One solution to these difficulties is the use of modular structured networks. Proposed here is the learning of modular networks using structural learning with forgetting. It enables the formation of modules. It also enables automatic utilization of appropriate modules from among the previously learned ones. This not only achieves efficient learning, but also makes the resulting network understandable due to its modular character. In the learning of a Boolean function, the present module acquires information from its subtask module without any supervision. In the parity problem, a previously learned lower-order parity problem is automatically used. The geometrical transformation of figures can be realized by a sequence of elementary transformations. This sequence can also be discovered by the learning of multi-layer modular networks. These examples well demonstrate the effectiveness of modular structured networks constructed by structural learning with forgetting.

关键词： Learning systems

来源：评论

学校读者我要写书评

暂无评论

Implementation of the velocities of the end-effector with the distributed arithmetic architecture

引用

JOURNAL OF INTELLIGENT & ROBOTIC systems 1996年第4期17卷 387-417页

作者： Grigoriadis, GK Mertzios, BG Automatic Control Systems Laboratory Department of Electrical and Computer Engineering Democritus University of Thrace 67100 Xanthi Greece

The fast implementation of the linear and of the angular velocities of the end-effector of robotic manipulators, using the distributed arithmetic technique is described. The linear and angular velocities of the end-effector as well as the positional and the orientational Jacobian matrices is calculated by a cascade configuration of two pipelined arrays. The building blocks of the arrays are the distributed arithmetic-based circuits that implement the matrix-vector multiplications involved in the calculations. The digit-serial configuration of the proposed implementation of the linear and angular velocities of the end-effector is described, while the serial and the parallel configurations may result as special cases of the digit-serial configuration. The proposed distributed arithmetic computer architecture may be used in the real-time operation of the robot control system that requires the on-line computation of the position, of the linear and angular velocities of the end-effector and of the Jacobian matrix.

关键词： robot kinematics linear velocity angular velocity positional and orientational Jacobian matrices fast implementation pipelining distributed arithmetic and end-effector

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：