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

2nd IEEE International Conference on Data Science and computer Application, ICDSCA 2022

作者： Liu, Yiyang Yan, Shuaihua Hou, Zheng Zhao, Yang Chinese Academy of Sciences Shenyang Institute of Automation Chinese Academy of Sciences Institutes for Robotics and Intelligent Manufacturing Chinese Academy of Sciences China Kunshan Intelligent Equipment Research Institute Key Laboratory of Networked Control Systems Shenyang China Chinese Academy of Sciences Shenyang Institute of Automation Chinese Academy of Sciences Institutes for Robotics and Intelligent Manufacturing Chinese Academy of Sciences China University of Chinese Academy of Sciences Key Laboratory of Networked Control Systems Shenyang China College of Information Science and Engineering Northeastern University Shenyang China School of Automation and Electrical Engineering Shenyang Ligong University Shenyang China

ISBN: (数字)9781665472005

ISBN: (纸本)9781665472005

This paper studies the path planning problem of multiple automated guided vehicles (multi-AGV) in a matrix manufacturing workshop. We proposed the multi-AGV path planning problem with default time, which is a variant of the classic path planning problem. In order to ensure the timely completion of each task, the default time of the task is explicitly considered. The goal is to obtain a conflict-free path with the minimum total default time, total time, and total path length. For these three goals, this problem is NP-hard. In order to solve this problem better, we established a multi-objective optimization model of total default time, total time and total path length of multi-AGV in flexible manufacturing environment. This paper proposes a multi-AGV path planning method that integrates game theory and A∗ algorithm. This method regards each AGV as a participant in the game model, through the default time obtained from each game dynamically adjusts the probability of each AGV planning the next path, and uses game theory to help the system dynamically select the most suitable AGV to plan the next path to improve the on-time delivery rate of tasks. Finally, the simulation results show that the multi-AGV path planning method integrating game theory and A∗ algorithm further reduces the total default time, total time and total path length of all AGVs. © 2022 IEEE.

关键词： Motion planning

来源：评论

学校读者我要写书评

暂无评论

Modeling and Planar Trajectory Tracking Control of an MJ-AUV

Modeling and Planar Trajectory Tracking Control of an MJ-AUV

引用

Chinese Control Conference (CCC)

作者： Zakarya Omar Ke-Xian Liu Chao Ren Qing-Hao Meng Tianjin Key Laboratory of Intelligent Unmanned Swarm Technology and System Institute of Robotics and Autonomous Systems School of Electrical and Information Engineering Tianjin University Tianjin China Faculty of Engineering Sana'a University Sana'a Yemen

A Multi-Joint Autonomous Underwater Vehicle (MJ-AUV) is designed and equipped with multiple movable segments or joints that allow for greater maneuverability and flexibility in the water. These joints allow the MJ-AUV to change its shape, orientation, and direction of movement, so it can access tight spaces or navigate in complex underwater environments, making it useful for a variety of tasks in the deep sea, such as surveillance, exploration, and maintenance. However, the multiple joint structure of the MJ-AUV complicates the dynamics of the system. Furthermore, the joints' rotation causes misalignment of the cabins, causing deviations in the desired forces and torques. To address these issues, this study focuses on the 2-dimensional (2D) modeling as well as the trajectory tracking controller of the MJ-AUV. In this setting, the proposed controller utilizes a hierarchically structured robust nonlinear back-stepping and sliding-mode approach. Hence, this controller is simulated under various uncertainties and disturbances and the results show that it presents a global finite-time convergence to a bounded neighborhood of the origin for both position and velocity tracking errors, demonstrating its effectiveness and robustness.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Distributed Online Convex Optimization with Time-Varying Constraints: Tighter Cumulative Constraint Violation Bounds under Slater's Condition

引用

IEEE Transactions on Automatic Control 2025年

作者： Yi, Xinlei Li, Xiuxian Yang, Tao Xie, Lihua Hong, Yiguang Chai, Tianyou Johansson, Karl H. National Key Laboratory of Autonomous Intelligent Unmanned Systems Shanghai Institute of Intelligent Science and Technology China Ministry of Education Frontiers Science Center for Intelligent Autonomous Systems China Massachusetts Institute of Technology Lab for Information & Decision Systems CambridgeMA02139 United States Northeastern University State Key Laboratory of Synthetical Automation for Process Industries Shenyang110819 China Nanyang Technological University School of Electrical and Electronic Engineering 50 Nanyang Avenue 639798 Singapore Kth Royal Institute of Technology Division of Decision and Control Systems School of Electrical Engineering and Computer Science Sweden Digital Futures Stockholm10044 Sweden

This paper considers distributed online convex optimization with time-varying 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 static network regret and network cumulative constraint violation. A novel distributed online algorithm with a vanishing stepsize is proposed and it achieves an O(Tmax {c,1-c}) static network regret bound and an O(T1-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(T1-c). Moreover, if the loss functions are strongly convex, then static 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 tighter (network) cumulative constraint violation bounds for (distributed) online convex optimization with time-varying constraints under Slater's condition. Finally, the theoretical results are verified through numerical simulations. © 1963-2012 IEEE.

关键词： Convex optimization

来源：评论

学校读者我要写书评

暂无评论

Deep Learning-Based Estimation of Arterial Stiffness from PPG Spectrograms: A Novel Approach for Non-Invasive Cardiovascular Diagnostics

Deep Learning-Based Estimation of Arterial Stiffness from PP...

引用

Annual International Conference of the IEEE engineering in Medicine and Biology Society (EMBC)

作者： Kiana Pilevar Abrisham Khalil Alipour Bahram Tarvirdizadeh Mohammad Ghamari Department of Mechatronics Engineering School of Intelligent Systems Engineering College of Interdisciplinary Science and Technology Advanced Service Robots (ASR) Laboratory University of Tehran Tehran Iran Department of Electrical and Computer Engineering Kettering University Flint Michigan USA

ISBN: (数字)9798350371499

ISBN: (纸本)9798350371505

Cardiovascular diseases (CVDs), a leading cause of global mortality, are intricately linked to arterial stiffness, a key factor in cardiovascular health. Non-invasive assessment of arterial stiffness, particularly through Carotid-to-femoral Pulse Wave Velocity (cf-PWV) – the gold standard in this field – is vital for early detection and management of CVDs. This study introduces a novel approach, utilizing photoplethysmogram (PPG) signal spectrograms as inputs for deep learning models to estimate cf-PWV, a significant advancement over traditional methods. Employing a modified ResNet-18 architecture, we analyze PPG signals from digital, radial, and brachial arteries of a simulated dataset of 4374 healthy adults. Our methodology's innovation lies in its direct use of finely tuned spectrogram images, bypassing the complex feature extraction processes. This approach achieved R 2 (correlation coefficient) values of up to 0.9902 for the digital artery, 0.9898 for the radial artery, and 0.9825 for the brachial artery, coupled with significantly lower Mean Absolute Percentage Errors (MAPE) of approximately 1.61% for the digital, 1.87% for the radial, and 2.08% for the brachial artery. These findings highlight the efficacy of PPG spectrograms, especially from the digital artery, in providing an accurate, user-friendly, and non-invasive method for cf-PWV estimation, thereby enhancing the capabilities of non-invasive cardiovascular diagnostics.

关键词： Accuracy Noise Estimation Predictive models Feature extraction Brachytherapy Data models Arteries Spectrogram Monitoring

来源：评论

学校读者我要写书评

暂无评论

Hidden Convexity-Based Distributed Operation of Integrated Electricity-Gas systems

arXiv

引用

arXiv 2024年

作者： Liu, Rong-Peng Song, Yue Liu, Junhong Wang, Xiaozhe Guo, Jinpeng Hou, Yunhe The Department of Electrical and Computer Engineering McGill University MontrealQCH3A 0E9 Canada The State Key Laboratory of Intelligent Autonomous Systems Frontiers Science Center for Intelligent Autonomous Systems Tongji University Shanghai China The Department of Electrical and Electronic Engineering The University of Hong Kong Hong Kong The Department of Energy and Electrical Engineering Ho-Hai University Jiangsu Nanjing China

This letter proposes a hidden convexity-based method to address distributed optimal energy flow (OEF) problems for transmission-level integrated electricity-gas systems. First, we develop a node-wise decoupling method to decompose an OEF problem into multiple OEF subproblems. Then, we propose a hidden convexity-based method to equivalently reformulate nonconvex OEF subproblems as semi-definite programs. This method differs from any approximation and convexification methods that may incur infeasible solutions. Since all OEF subproblems are originally convex or equivalently convexified, we adopt an ADMM to solve the hidden convexity-based distributed OEF problem with convergence analysis. Test results validate the effectiveness of the proposed method, especially in handling a large number of agents. Copyright © 2024, The Authors. All rights reserved.

关键词： Quadratic programming

来源：评论

学校读者我要写书评

暂无评论

Verifying Nonlinear Neural Feedback systems using Polyhedral Enclosures

arXiv

引用

arXiv 2025年

作者： Akinwande, Samuel I. Sidrane, Chelsea Kochenderfer, Mykel J. Barrett, Clark Department of Aeronautical and Astronautical Engineering Stanford University StanfordCA94305 United States Department of Computer Science Stanford University StanfordCA94305 United States Division of Robotics Perception and Learning Intelligent Systems Department School of Electrical Engineering & Computer Science KTH Royal Institute of Technology Stockholm Sweden

As dynamical systems equipped with neural network controllers (neural feedback systems) become increasingly prevalent, it is critical to develop methods to ensure their safe operation. Verifying safety requires extending control theoretic analysis methods to these systems. Although existing techniques can efficiently handle linear neural feedback systems, relatively few scalable methods address the nonlinear case. We propose a novel algorithm for forward reachability analysis of nonlinear neural feedback systems. The approach leverages the structure of the nonlinear transition functions of the systems to compute tight polyhedral enclosures (i.e., abstractions). These enclosures, combined with the neural controller, are then encoded as a mixed-integer linear program (MILP). Optimizing this MILP yields a sound over-approximation of the forward-reachable set. We evaluate our algorithm on representative benchmarks and demonstrate an order of magnitude improvement over the current state of the art. Copyright © 2025, The Authors. All rights reserved.

关键词： Mixed-integer linear programming

来源：评论

学校读者我要写书评

暂无评论

Network of Microgrids: Opportunities and Challenges

Network of Microgrids: Opportunities and Challenges

引用

Grid Edge Technologies Conference & Exposition (Grid Edge), IEEE PES

作者： Kyle A. Skeen G. Kumar Venayagamoorthy Department of Electrical and Computer Engineering Real-Time Power and Intelligent Systems Laboratory Clemson University SC USA University of KwaZulu-Natal Durban South Africa

Microgrids are a promising technology to achieve the sustainability goals set by the UN to fight against climate change, create affordable and clean energy, sustainable cities and communities, and economic growth by creating a reliable, resilient, green power infrastructure. There are limitations to the benefits that microgrids can provide. To overcome the limitations and bolster the benefits of individual microgrids, they can be interconnected, creating a network of microgrids (NoMs). NoMs have many benefits that individual microgrids cannot accomplish, such as participating in power interchange between connected microgrids and the utility grid. This will increase reliability and resiliency and create economic benefits for the participants of NoMs. Challenges exist in NoMs, including data analysis, communication, and cyber-security to operations and management of the NoMs. This paper will go over the benefits that NoMs can provide and the challenges currently being researched in academia.

关键词： Climate change Microgrids Renewable energy sources Sustainable development Market opportunities Energy management

来源：评论

学校读者我要写书评

暂无评论

Visual recognition of wheel hubs with convolutional neural network

Visual recognition of wheel hubs with convolutional neural n...

引用

Consumer Electronics and computer engineering (ICCECE), 2021 IEEE International Conference on

作者： Yining Dai Zaojun Fang Caiming Zhong Faculty of Electrical Engineering and Computer Science Ningbo University NingBo Zhejiang China Zhejiang Key Laboratory of Robotics and Intelligent Manufacturing Equipment Technology Ningbo Institute of Materials Technology & Engineering Chinese Academy of Sciences

The traditional recognition methods of wheel hubs are mainly based on extracted feature matching. In practical production, their accuracy, robustness and processing speed are usually greatly affected. To overcome these problems, this paper proposes a recognition method based on convolutional neural network. The basic steps include two parts: wheel image pre-processing and wheel model classification. The image processing method, mainly using the detection algorithm of hough circles, obtains the center coordinates and radius of the wheel. Then it maps the ring-shaped wheel in right-angle coordinates to polar coordinates by the center coordinates and radius. This stepcan extract the ring-shaped feature information of the wheel image and reduce the influence generated by redundant features. Then a network architecture with an improved Resnet is designed to classify the wheel models. Finally, the wheel model recognition algorithm is evaluated, and the effectiveness of the method is verified through the comparison experiments of SVM, KNN and other models. The experiments show that the recognition accuracy can reach about 99.8% for 10 kinds of wheels.

关键词：

来源：评论

学校读者我要写书评

暂无评论

STARS-Enabled Full-Duplex Two-Way mMIMO System Under Spatially-Correlated Channels

引用

IEEE Transactions on Vehicular Technology 2025年

作者： Papazafeiropoulos, Anastasios Kourtessis, Pandelis Chatzinotas, Symeon Kaklamani, Dimitra I. Venieris, Iakovos S. University of Hertfordshire Communications and Intelligent Systems Research Group HatfieldAL10 9AB United Kingdom University of Luxembourg SnT Luxembourg Microwave and Fiber Optics Laboratory Greece National Technical University of Athens Intelligent Communications and Broadband Networks Laboratory School of Electrical and Computer Engineering Athens Zografou15780 Greece

Low-cost reconfigurable intelligent surfaces (RISs) are being considered as promising physical-layer technology for next-generation wireless networks due to their ability to re-engineer the propagation environment by tuning their elements. Although RIS-aided systems have many advantages, one of their major bottlenecks is that they can provide coverage only in front of the surface. Fortunately, simultaneous transmitting and reflecting surface (STARS)-assisted systems have emerged to fill this gap by providing 360° wireless coverage. In parallel, full-duplex (FD) communication offers a higher achievable rate through efficient spectrum utilization compared to the half-duplex (HD) counterpart. Moreover, two-way/bi-directional communications in an FD system can further enhance the system's spectral efficiency. Hence, in this paper, we propose a STARS-enabled massive MIMO deployment in an FD two-way communication network for highly efficient spectrum utilization, while covering the dead zones around the STARS. This model enables simultaneous information exchange between multiple nodes, while potentially doubling the spectral efficiency (SE). By invoking the use-and-then-forget (UaTF) combining scheme, we derive a closed-form expression for an achievable SE at each user of the system considering both uplink and downlink communications based on statistical channel state information (CSI), while also accounting for imperfect CSI and correlated fading conditions. Moreover, we formulate an optimization problem to obtain an optimal passive beamforming matrix design at the STARS that maximizes the sum achievable SE. The considered problem is non-convex and we propose a provably-convergent low-complexity algorithm, termed as projected gradient ascent method (ProGrAM), to obtain a stationary solution. Extensive numerical results are provided to establish the performance superiority of the FD STARS-enabled system over the HD STARS-enabled and FD conventional RIS (cRIS)-enabled coun

关键词： Digital television

来源：评论

学校读者我要写书评

暂无评论

A Battery Control Strategy for Sequential Utilization of Energy Storage systems in Power Batteries

A Battery Control Strategy for Sequential Utilization of Ene...

引用

IEEE Advanced Information Technology, Electronic and Automation Control Conference (IAEAC)

作者： Bowen Li Shijie Cui Lizhong Zhu College of Automation and Electrical Engineering Shenyang Ligong University Liaoning China State Key Laboratory of Robotics Shenyang Institute of Automation Chinese Academy of Sciences Shenyang China Key Laboratory of Networked Control Systems Chinese Academy of Sciences Liaoning China Institutes for Robotics and Intelligent Manufacturing Chinese Academy of Sciences Shenyang China

With the widespread adoption of energy storage systems utilizing power batteries, battery lifespan degradation has become a primary constraint on system performance. To address this issue, this study proposes a lifespan-optimized battery control strategy. Firstly, a battery lifespan calculation model for the energy storage system is established, taking into detailed consideration key parameters such as battery State of Charge (SOC). Secondly, a control strategy based on SOC for charging and discharging is designed, aiming to minimize battery lifespan consumption to the greatest extent possible. Finally, experimental results demonstrate that the proposed control strategy significantly improves the lifespan of the energy storage system compared to existing strategies. This research provides an effective means of control for the long-term stable operation of power battery systems.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：