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

Unsupervised robust adaptive filtering against impulsive noise

Journal of systems Engineering and Electronics 2012年第1期000卷

作者： Tao Ma Jie Chen Wenjie Chen and Zhihong Peng School of Automation Beijing Institute of Technology Beijing 100081 P. R. China Key Laboratory of Complex System Intelligent Control and Decision(Ministry of Education) Beijing Institute of Technology Beijing 100081 P. R. China

来源：评论

学校读者我要写书评

暂无评论

Regret and cumulative constraint violation analysis for online convex optimization with long term constraints

arXiv

引用

arXiv 2021年

作者： Yi, Xinlei Li, Xiuxian Yang, Tao Xie, Lihua Chai, Tianyou Johansson, Karl H. School of Electrical Engineering and Computer Science and Digital Futures KTH Royal Institute of Technology Stockholm Sweden Department of Control Science and Engineering College of Electronics and Information Engineering Shanghai Research Institute for Intelligent Autonomous Systems Institute for Advanced Study Tongji University Shanghai China State Key Laboratory of Synthetical Automation for Process Industries Northeastern University Shenyang China School of Electrical and Electronic Engineering Nanyang Technological University Singapore Singapore

This paper considers online convex optimization with long term constraints, where constraints can be violated in intermediate rounds, but need to be satisfied in the long run. The cumulative constraint violation is used as the metric to measure constraint violations, which excludes the situation that strictly feasible constraints can compensate the effects of violated constraints. A novel algorithm is first proposed and it achieves an O(Tmax{c,1-c}) bound for static regret and an O(T (1-c)/2) bound for cumulative constraint violation, where c ϵ (0, 1) is a user-defined trade-off parameter, and thus has improved performance compared with existing results. Both static regret and cumulative constraint violation bounds are reduced to O(log(T )) when the loss functions are strongly convex, which also improves existing results. In order to achieve the optimal regret with respect to any comparator sequence, another algorithm is then proposed and it achieves the optimal O( p T (1 + PT )) regret and an O(√T) cumulative constraint violation, where PT is the path-length of the comparator sequence. Finally, numerical simulations are provided to illustrate the effectiveness of the theoretical results. Copyright © 2021, The Authors. All rights reserved.

关键词： Comparators (optical)

来源：评论

学校读者我要写书评

暂无评论

Decentralized Trajectory Planning for Formation Flight in Unknown and Dense Environments

Decentralized Trajectory Planning for Formation Flight in Un...

引用

IEEE/RSJ International Conference on intelligent Robots and systems (IROS)

作者： Jianxin Zeng Yaonan Wang Zhiqiang Miao Wei He Hesheng Wang Department of Electrical and Information Engineering Hunan University Changsha China National Engineering Research Center for Robot Visual Perception and Control Changsha China School of Intelligence Science and Technology University of Science and Technology Beiing Beijing China Key Laboratory of Intelligent Bionic Unmanned Systems Ministry of Education University of Science and Technology Beijing Beijing China Department of Automation Shanghai Jiao Tong University Shanghai China

ISBN: (数字)9798350377705

ISBN: (纸本)9798350377712

For aerial swarms, formation flight has been applied in various scenes. However, most existing works do not consider balancing the conflicting requirements among keeping formation, keeping the smoothness of trajectories, and obstacle avoidance within the limited time. To address this issue, we propose a decentralized trajectory planning framework for formation flight in unknown and dense environments. To ensure that feasible trajectories can be found within the limited time, the formation optimization problem is decoupled into formation affine transformation and iterative trajectory generation. Firstly, the optimization problem based on affine transformation is designed to obtain the optimal affine transformation sequence, which provides the formation reference of trajectory optimization. Secondly, the iterative optimization framework of trajectory planning is designed, which balances the conflicting requirements of formation, smooth flight, and obstacle avoidance. Besides, to escape the local minima caused by non-convex dense environments, the method of topological path planning is designed to provide distinctive initial solutions for trajectory optimization. Finally, the proposed methods are proven to be effective through the simulations and real-world experiments.

关键词： Trajectory planning Planning Iterative methods Collision avoidance Trajectory optimization intelligent robots

来源：评论

学校读者我要写书评

暂无评论

The 110kV Live-Maintaining Robot control System Design for Substation Equipment in complex Working Conditions

The 110kV Live-Maintaining Robot Control System Design for S...

引用

Chinese control Conference (CCC)

作者： Chenyu Hu Xin Chen Chengyu Li Guangxian Huang Cheng Zhou Xu Jian School of Automation China University of Geosciences Wuhan China Hubei Key Laboratory of Advanced Control and Intelligent Automation for Complex Systems Wuhan China School of Future Technology China University of Geosciences Wuhan China Distribution Department State Grid Hubei Electric Power Co. Ltd. Xianning Power Supply Company Xianning China Operations and Maintenance Department State Grid Hubei Electric Power Co. Ltd Xianning Xian'an District Power Supply Company Xianning China Equipment Technology Center State Grid Hubei Electric Power Co. Ltd. Electric Power Science Research Institute Wuhan China Engineering Research Center of Intelligent Technology for Geo-Exploration Ministry of Education Wuhan China

Live-maintaining work is essential for continuous power supply to the substation. To improve the safety and efficiency of live-maintaining work, this paper proposes an equipotential live-maintaining robot system suitable for 110kV voltage levels. Considering the narrow space, complex working conditions and strong electromagnetic interference in substations, binocular vision technology, manipulator trajectory planning algorithm based on time-energy optimization, high voltage electromagnetic shielding technology are utilized to develop the system, and the live-maintaining robot is successfully applied in actual substation. By accurately identifying and locating the joint bolts and insulator, the robot system can achieve equipotential live-disassemble, live-assemble the joint bolts within 18 minutes and live-clean insulator within 5 minutes, demonstrating its the effectiveness and practicability.

关键词：

来源：评论

学校读者我要写书评

暂无评论

FusionPlanner: A Multi-task Motion Planner for Mining Trucks via Multi-sensor Fusion

arXiv

引用

arXiv 2023年

作者： Teng, Siyu Li, Luxi Li, Yuchen Hu, Xuemin Li, Lingxi Ai, Yunfeng Chen, Long Department of Computer Science Hong Kong Baptist University Hong Kong Department of Computer Science BNU-HKBU United International College Zhuhai China The School of Artificial Intelligence Hubei University Wuhan China Waytous Inc. Haidian Distinct Beijing China Indianapolis United States School of Artificial Intelligence University of Chinese Academy of Sciences Beijing China State Key Laboratory of Management and Control for Complex Systems Institute of Automation Chinese Academy of Sciences China

In recent years, significant achievements have been made in motion planning for intelligent vehicles. However, as a typical unstructured environment, open-pit mining attracts limited attention due to its complex operational conditions and adverse environmental factors. A comprehensive paradigm for unmanned transportation in open-pit mines is proposed in this research. Firstly, we propose a multi-task motion planning algorithm, called FusionPlanner, for autonomous mining trucks by the multi-sensor fusion method to adapt both lateral and longitudinal control tasks for unmanned transportation. Then, we develop a novel benchmark called MiningNav, which offers three validation approaches to evaluate the trustworthiness and robustness of well-trained algorithms in transportation roads of open-pit mines. Finally, we introduce the Parallel Mining Simulator (PMS), a new high-fidelity simulator specifically designed for open-pit mining scenarios. PMS enables the users to manage and control open-pit mine transportation from both the single-truck control and multi-truck scheduling perspectives. The performance of FusionPlanner is tested by MiningNav in PMS, and the empirical results demonstrate a significant reduction in the number of collisions and takeovers of our planner. We anticipate our unmanned transportation paradigm will bring mining trucks one step closer to trustworthiness and robustness in continuous round-the-clock unmanned transportation. Copyright © 2023, The Authors. All rights reserved.

关键词： Motion planning

来源：评论

学校读者我要写书评

暂无评论

A Smoothing-Type Algorithm for Solving Monotone Weighted Complementarity Problems

引用

Journal of Physics: Conference Series 2020年第1期1642卷

作者： Xiaoqin Jiang Yujin Huang Department of Public Basic Wuhan Technology And Business University Wuhan Hubei 430065 China School of Automation Hubei Key Laboratory of Advanced Control and Intelligent Automation for Complex Systems China University of Geosciences 388 Lumo Road Wuhan Hubei 430074 China

The weighted complementarity problem is an extension of the standard finite dimensional complementarity problem. It is well known that the smoothing-type algorithm is a powerful tool of solving the standard complementarity problem. In this paper, we propose a smoothing-type algorithm for solving the weighted complementarity problem with a monotone function, which needs only to solve one linear system of equations and performs one line search at each iteration. We show that the proposed method is globally convergent under the assumption that the problem is solvable. The preliminary numerical results indicate that the proposed method is effective and robust for solving the monotone weighted complementarity problem.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Global solution to sensor network localization: A non-convex potential game approach and its distributed implementation

arXiv

引用

arXiv 2024年

作者： Xu, Gehui Chen, Guanpu Hong, Yiguang Fidan, Baris Parisini, Thomas Johansson, Karl H. Key Laboratory of Systems and Control Academy of Mathematics and Systems Science Beijing100190 China The Division of Decision and Control Systems School of Electrical Engineering and Computer Science KTH Royal Institute of Technology Sweden Digital Futures StockholmSE-10044 Sweden Department of Control Science and Engineering Tongji University Shanghai201804 China Shanghai Research Institute for Intelligent Autonomous Systems Shanghai201210 China The Department of Mechanical and Mechatronics Engineering University of Waterloo WaterlooONN2L 3G1 Canada The Department of Electrical and Electronic Engineering Imperial College London LondonSW7 2AZ United Kingdom The Department of Engineering and Architecture University of Trieste Trieste34127 Italy

Consider a sensor network consisting of both anchor and non-anchor nodes. We address the following sensor network localization (SNL) problem: given the physical locations of anchor nodes and relative measurements among all nodes, determine the locations of all non-anchor nodes. The solution to the SNL problem is challenging due to its inherent non-convexity. In this paper, the problem takes on the form of a multi-player nonconvex potential game in which canonical duality theory is used to define a complementary dual potential function. After showing the Nash equilibrium (NE) correspondent to the SNL solution, we provide a necessary and sufficient condition for a stationary point to coincide with the NE. An algorithm is proposed_ to reach the NE and shown to have convergence rate O(1/√k). With the aim of reducing the information exchange within a network, a distributed algorithm for NE seeking is implemented and its global convergence analysis is provided. Extensive simulations show the validity and effectiveness of the proposed approach to solve the SNL problem. Copyright © 2024, The Authors. All rights reserved.

关键词： Game theory

来源：评论

学校读者我要写书评

暂无评论

Application of Iterative Learning control in X-Y Precision Planar Motion Platform

Application of Iterative Learning Control in X-Y Precision P...

引用

Chinese automation Congress (CAC)

作者： Hongyu Yan Danping Jia Tao Zhang Hualiang Zhang Yingjie Xiong Xu Lu Yang Liu School of Artificial Intelligence Shenyang University of Technology Shenyang China School of Information Science and Engineering Shenyang University of Technology Shenyang China Key Laboratory of Networked Control Systems Chinese Academy of Sciences Shenyang China Shenyang Institute of Automation Chinese Academy of Sciences Shenyang China Institutes for Robotics and Intelligent Manufacturing Chinese Academy of Sciences Shenyang China School of Electrical Engineering Dalian University of Technology Dalian China College Of Information Science and Engineering Northeastern University Shenyang China

ISBN: (纸本)9781665426480

The size of the tracking error is one of the important indicators to measure the control system of the X-Y Precision Planar Motion Platform. Iterative learning control (ILC) can obtain higher tracking accuracy through multiple iterations. However, it is found in experiments that the tracking error of the XY precision motion stage using ordinary PD-type iterative learning will eventually fluctuate in a relatively range, and some high-frequency Noise will seriously affect the stability of the system after many iterations. Aiming at the above problems, a PD-type variable gain open-closed loop ILC with a low-pass filter is proposed. This control scheme can effectively remove high-frequency noise and reduce tracking errors. Finally, a hardware-in-the-loop real-time simulator is used to conduct a comparative experiment. Through comparison with PID controller and ordinary PD-type ILC, the experimental consequence show that this arithmetic has a smaller tracking error than the other two algorithms.

关键词： Tracking loops Tracking Low-pass filters control systems Size measurement Stability analysis Real-time systems

来源：评论

学校读者我要写书评

暂无评论

Optimizing Carbon Emissions in Green Logistics for Time-Dependent Routing

SSRN

引用

SSRN 2024年

作者： Liu, Yiming Yu, Yang Roberto, Baldacci Tang, Jiafu Sun, Wei State Key Laboratory of Synthetic Automation for Process Industries Institute of Intelligent Data and Systems Engineering Northeastern University Shenyang110819 China Dalian University of Technology School of Economics and Management Liaoning Dalian116024 China Division of Engineering Management and Decision Sciences College of Science and Engineering Hamad Bin Khalifa University Qatar Foundation P.O. Box 34110 Doha Qatar College of Management Science and Engineering Dongbei University of Finance and Economics Shahekou Dalian116026 China Business School Liaoning University Shenyang110316 China

This paper considers a green vehicle routing problem termed the time-dependent green vehicle routing problem with time windows (TDGVRPTW). The TDGVRPTW is an extension of the green vehicle routing problem with time windows in green logistics. It considers time-dependent vehicle speed and aims to minimize carbon emissions. Since the travel times and carbon emissions between locations depend on the departure time from the starting location, optimizing carbon emissions requires determining the optimal departure times from both the depot and customers. This paper presents a branch-price-and-cut (BPC) algorithm to solve the TDGVRPTW. The problem is formulated based on a set-partitioning model. To solve the pricing problem associated with the set-partitioning model, we first define backward non-dominated time-dependent arcs and optimal timed routes. We also introduce three types of routes, forward, backward, and patchwork optimal timed routes, and analyze their characteristics. Then, we introduce a method to adjust the times in backward and patchwork optimal timed routes from the latest to the earliest. We prove that this method guarantees correctness and effectively reduces complexity. We propose a bidirectional labeling algorithm to generate routes. The pricing problem employs state-of-the-art techniques, including limited memory subset row cuts (lm-SRCs), ng-route relaxation, and bucket graphs to enhance the algorithm’s efficiency. The BPC algorithm is tested on a set of instances derived from benchmark instances in the literature. The results demonstrate the effectiveness of the proposed algorithm in solving the TDGVRPTW. © 2024, The Authors. All rights reserved.

关键词： Travel time

来源：评论

学校读者我要写书评

暂无评论

The influence of color temperature mismatch in star simulator on positioning accuracy and magnitude measurement by star sensor

引用

Journal of Physics: Conference Series 2021年第1期2132卷

作者： Zhiyong Wang Shishen Liu Hao Sun Jingjing Zhang Ruyou Li Chen Liu School of Automation China University of Geosciences Wuhan Hubei 430074 China Hubei key Laboratory of Advanced Control and Intelligent Automation for Complex Systems Wuhan 430074 China Engineering Research Center of Intelligent Technology for Geo-Exploration Shanghai Institute of Technical Physics Chinese Academy of Sciences Shanghai 200083 China

During the calibrating of star sensor, the calibration accuracy is greatly affected by the mismatch between the color temperature of the light and the to-be-measured star, which further affects the attitude measurement accuracy. This paper studied the near-infrared spectra of stars with different color temperatures, and analyzed the errors on star positioning and magnitude measurement of star sensor due to the color temperature mismatch. The results showed that in the central field of view, the spot centroid deviation caused by spectral mismatch is smaller than that in the edge field of *** the defocus of the imaging surface also affects the spot centroid deviation. Besides, when calibrating with 6000K color temperature light, the maximum measurement error can reach -1.9126 magnitude.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：