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

Force control of Electro-Hydraulic Servo System Based on Load Velocity Compensation

Journal of Beijing Institute of Technology 2018年第3期27卷 326-333页

作者： Shoukun Wang Hu Liu Junzheng Wang Deyang Zhang Key Laboratory of Intelligent Control and Decision of Complex Systems School of AutomationBeijing Institute of Technology

In an electro-hydraulic servo control system,the force servo system is an important ***,due to the nonlinear characteristic of hydraulic systems,traditional control methods cannot achieve satisfactory control *** deal with this issue,a load velocity compensation algorithm based on the structural invariant principle is proposed in this ***,the theoretical analysis of the hydraulic and cylindrical force control system is presented,and the mathematical model of the force control system is *** the open-loop frequency response characteristics of the system are analyzed,in which the Bode diagram shows that the bandwidth of the system is obviously expanded after adopting the load velocity compensation ***,apractical hydraulic and cylindrical force servo system is introduced to validate the feasibility of the proposed controller,the experimental results demonstrate that the proposed method can improve the performance of force control and eliminate the influence of load stiffness on the dynamic characteristics of the system through a set of comparative experiments with different elastic loads.

关键词： electro-hydraulic servo control system force servo control load velocity compensation elastic load

来源：评论

学校读者我要写书评

暂无评论

Simplified Method for Joint Calibration of 3D Ladar and Monocular Camera

引用

Journal of Beijing Institute of Technology 2018年第3期27卷 319-325页

作者： Jing Li Liuzhi Yu Junzheng Wang Key Laboratory of Intelligent Control and Decision of Complex Systems School of AutomationBeijing Institute of Technology

To address the problem of data fusion between monocular camera image with 3 D data from laser detection and ranging(LADAR)sensor,this paper proposes a novel simplified scheme based on the planar feature method,which can meet the accuracy requirements of the joint calibration with fewer checkerboard calibration plate(CP)positions than traditional ***,a mathematical model of the joint calibration is established to obtain the calibration ***,the selection of positions and orientations of the CP are introduced and the corresponding influence to the calibration is ***,the calibration result is optimized by using a nonlinear Levenberg-Marquardt(LM)optimization approach,and the distance residual method is utilized to estimate the ***,experimental results conclude that the minimum number of positions required to meet the joint calibration accuracy in the proposed method is 5,which is less than 12 in traditional methods.

关键词： 3D LADAR monocular camera joint calibration plane calibration method distance residual

来源：评论

学校读者我要写书评

暂无评论

Fast LAV Estimation via Composite Optimization

Fast LAV Estimation via Composite Optimization

引用

IEEE Power and Energy Society General Meeting

作者： Gang Wang Gerogios B. Giannakis Jie Chen Digital Technology Center University of Minnesota Minneapolis MN USA Key Lab of Intell. Control and Decision of Complex Systems School of Automation Beijing Institute of Technology Beijing China

Accurate and robust power system state estimation (PSSE) is an essential prerequisite for reliable operation of smart power grids. In contrast to the commonly employed weighted least squares (WLS) one, the least-absolute-value (LAV) estimator is well documented for its robustness. Due to the non-convexity and non-smoothness however, existing LAV implementations are typically slow, thus inadequate for real-time system monitoring. In this context, this paper puts forward a novel LAV estimator leveraging recent algorithmic advances in composite optimization. Concretely, the estimator is based on a proximal linear procedure that deals with a sequence of convex quadratic problems, each efficiently solvable by means of either standard convex optimization methods, or the alternating direction method of multipliers. Simulated tests using two IEEE benchmark networks showcase its improved robustness and computational efficiency relative to several competing alternatives.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Market-based task assignment for multi-point dynamic aggregation tasks 48

Market-based task assignment for multi-point dynamic aggrega...

引用

48th International Conference on Computers and Industrial Engineering, CIE 2018

作者： Du, Xin Zhang, Jia Xin, Bin Ding, Yulong Peng, Zhihong Dou, Lihua School of Automation Beijing Institute of Technology Beijing100081 China Key Laboratory of Intelligent Control and Decision of Complex Systems Beijing Institute of Technology Beijing100081 China Beijing Advanced Innovation Center for Intelligent Robots and Systems Beijing100081 China

Multi-agent task assignment problem exists in collaborative target tracking, collaborative rescue, regional search, etc. Most researchers regarding multi-agent task assignment only consider static tasks. However, in complex scenarios, the states of tasks (e.g., Monitoring of hazardous environments) are time-varying. This type of the task can be modeled as a multi-point dynamic aggregation (MPDA) process. This paper proposes a distributed task assignment method for the MPDA task. This method firstly adopts an auction algorithm to obtain a pre-allocation planning that can ensure every task can be completed. Then, the agents who complete the pre-allocation planning will evaluate the uncompleted tasks and assist other agents to complete these tasks, so that tasks can be completed as soon as possible. Compared with the optimal solution, simulations show that the task allocation method can obtain satisfied allocation solutions with a lower computational cost. The gap from the optimal solution is only 8% on average. Especially, for problems including more than 100 tasks, the proposed method can obtain planning solutions within one second, and the makespan of the MPDA task is more than 50% better than the best one of the 1000 random sample solutions. © 2018, Curran Associates Inc. All rights reserved.

关键词： Optimal systems

来源：评论

学校读者我要写书评

暂无评论

Automatic Cell Assembly by Two-fingered Microhand

Automatic Cell Assembly by Two-fingered Microhand

引用

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

作者： Junnan Chen Xiaoming Liu Shengnan Dong Pengyun Li Xiaoqing Tang Dan Liu Masaru Kojima Qiang Huang Tatsuo Arai Intelligent Robotics Institute School of Mechatronical Engineering Key Laboratory of Biomimetic Robots and Systems Ministry of Education Key Laboratory of Intelligent Control and Decision of Complex System Beijing Institute of Technology Beijing CHINA Department of Systems Innovation Graduate school of Engineering Science Osaka University Toyonaka Osaka Japan Global Alliance Lab The University of Electro-Communications Tokyo Japan

We have successfully achieved manipulation and assembly of microbeads having the size of 100μm diameter by hemispherical end-effectors with high stability and accuracy. The motivation of achieving assembly of actual cells lies in the great significance of it in tissue regeneration and cell analysis. Firstly, the most difficult problem we need to solve is the releasing problem caused by adhesion force. The viscosity on cell surface is much larger than the microbeads which makes cell releasing challenging. Secondly, the cell can generate its deformation, then contact area with end-effector will change during grasping process. This may influence the adhesion force and also bring problem to releasing. Thirdly, cell is much smaller, around 15μm in diameter, so we need to fabricate smaller end-effector to achieve successful manipulation and ensure the stability in the meantime. In this paper, we realize the manipulation by decreasing the adhesion forces and apply vibration to release a cell stably. We found the appropriate scale size for the end-effector is around 10μm diameter. It can not only grasp a 15μm cell but also bring little interference to the environment. As a demonstration of the proposed manipulation method, the repeated experiments were conducted to explore the dependence of adhesion force on the grasping distance, which can be helpful in the improvement of successful rate. Finally, we achieved automatic cell assembly using Hela cells.

关键词：

来源：评论

学校读者我要写书评

暂无评论

On Event-triggered Adaptive Robust control 36

On Event-triggered Adaptive Robust Control

引用

第36届中国控制会议

作者： Yuan Huang Junzheng Wang Dawei Shi State Key Laboratory of Intelligent Control and Decision of Complex Systems

ISBN: (纸本)9781538629185

In this work,an event-triggered adaptive robust controller（ET-ARC） design is considered for a continuous-time nonlinear system combined with structural uncertainties and parameter *** the event-trigger scheme,the controller only can obtain the sampled date of the output measurement at some certain instants determined by the designed triggering condition and therefore the performance of the ET-ARC depends on the triggering condition ***,in this work,for the adaptive robust control scheme,an event-triggered transmission strategy is proposed,which relies on the output measurement of the nonlinear ***,based on this strategy,the design idea of the adaptive robust controller is presented such that the tracking performance is ***,based on a more general assumption,we provide a possible formation of control signal which satisfies the requirement proposed.

关键词： Adaptive robust control event-triggered transmission parameter estimation

来源：评论

学校读者我要写书评

暂无评论

Adaptive robust control for four-motor driving servo system with uncertain nonlinearities

引用

control Theory and Technology 2017年第1期15卷 45-57页

作者： Wei ZHAO Xuemei REN Key Laboratory of Intelligent Control and Decision of Complex Systems School of Automation Beijing Institute of Technology Beijing 100081 China

A novel adaptive robust control （ARC） is presented for the four-motor driving servo systems with the uncertain nonlinearities and actuation failures, such that the load tracking control is achieved with the proximate optimal-time. By applying the proposed scheme, several control objectives are achieved. First, the nonlinear synchronization algorithm is presented to maintain the velocity synchronization of each motor, which provides fast convergence without chatting. Moreover, the time-varying bias torque is applied to eliminate the effect of backlash and reduce the waste of energy. Then, the ARC is designed to achieve the proximate optimal-time output tracking with the transient performance in L2 norm, where the friction and actuation failures are addressed by the adaptive scheme based on the norm estimation of unknown parameter vector. Finally, the extensive simulated and experimental results validate the effectiveness of the proposed method.

关键词： Four-motor driving servo systems adaptive robust control velocity synchronization control friction backlash,actuation failures

来源：评论

学校读者我要写书评

暂无评论

Distributed auction-based coverage motion planning for multiple cooperative robots 8

Distributed auction-based coverage motion planning for multi...

引用

8th International Symposium on Computational Intelligence and Industrial Applications and 12th China-Japan International Workshop on Information Technology and control Applications, ISCIIA and ITCA 2018

作者： Gao, Guanqiang Xin, Bin School of Automation Beijing Institute of Technology Beijing100081 China Key Laboratory of Intelligent Control and Decision of Complex Systems Beijing Institute of Technology Beijing100081 China Beijing Advanced Innovation Center for Intelligent Robots and Systems Beijing Institute of Technology Beijing100081 China

The multi-robot coverage motion planning (MCMP) problem refers to a typical task where every point of the target area must be covered by robots at least once. This paper designs a novel efficient offline algorithm to solve the MCMP problem, which is extended from the spiral-spanning tree coverage algorithm. A distributed auction mechanism is designed for the cooperative task allocation in the proposed algorithm. In this mechanism, each robot will be an auctioneer which chooses a suitable cell as an auction item form its neighbor vertexes and determines a winner robot. According to the connectedness and the balance of each robot’s graph, bidders will submit proper biddings to the auctioneer. After the auction processes, acceptable coverage trajectories can be planned rapidly. Computational experiments validate the effectiveness of the proposed MCMP algorithm. Meanwhile, the proposed algorithm is compared with the state-of-the-art algorithm named DARP. The comparative results show that the auction-based MCMP algorithm has apparent advantages in the running time and the makespans for large crowded configuration spaces. © ISCIIA and ITCA 2018 - 8th International Symposium on Computational Intelligence and Industrial Applications and 12th China-Japan International Workshop on Information Technology and control Application.

关键词： Multipurpose robots

来源：评论

学校读者我要写书评

暂无评论

Distributed sub-optimal resource allocation via a projected form of singular perturbation

arXiv

引用

arXiv 2019年

作者： Liang, Shu Zeng, Xianlin Chen, Guanpu Hong, Yiguang Key Laboratory of Knowledge Automation for Industrial Processes of Ministry of Education School of Automation and Electrical Engineering University of Science and Technology Beijing Beijing100083 China Key Laboratory of Intelligent Control and Decision of Complex Systems School of Automation Beijing Institute of Technology Beijing100081 China Key Laboratory of Systems and Control Academy of Mathematics and Systems Science Chinese Academy of Sciences Beijing100190 China

Distributed optimization for resource allocation problems is investigated and a sub-optimal continuous-time algorithm is proposed. Our algorithm has lower order dynamics than others to reduce burdens of computation and communication, and is applicable to weight-balanced graphs. Moreover, it can deal with both local constraints and coupled inequality constraints, and remove the requirement of twice differentiability of the cost function in comparison with the existing sub-optimal algorithm. However, this algorithm is not easy to be analyzed since it involves singular perturbation type dynamics with projected non-differentiable righthand side. We overcome the encountered difficulties and obtain results including the existence of an equilibrium of the algorithm, the sub-optimality in the sense that the solution approaches to the optimal solution as an adjustable parameter tends to zero, and the convergence of the algorithm. Copyright © 2019, The Authors. All rights reserved.

关键词： Resource allocation

来源：评论

学校读者我要写书评

暂无评论

Multi-robot distributed cooperative monitoring of mobile targets 3rd

Multi-robot distributed cooperative monitoring of mobile tar...

引用

3rd International Conference on Intelligence Science, ICIS 2018

作者： Jiang, J.Q. Xin, B. Dou, L.H. Ding, Y.L. School of Automation Beijing Institute of Technology Beijing100081 China State Key Laboratory of Intelligent Control and Decision of Complex Systems Beijing Institute of Technology Beijing100081 China Beijing Advanced Innovation Center for Intelligent Robots and Systems Beijing Institute of Technology Beijing100081 China

ISBN: (纸本)9783030013127

Cooperative monitoring targets of mobile robots is of great importance in military, civil, and medical applications. In order to achieve multi-robot coordinated monitoring, this paper proposes a new distributed path planning algorithm. In this algorithm, a method of dynamic sequential decision making is used firstly to determine which robots should be moved to the neighbourhoods of the target path. A distributed cooperative path planning algorithm is then proposed in which the robots can only utilize their local information to make the joint monitoring areas of robots cover the target path. To reduce the chance of detection and ensure enough time to implement monitoring handover, our distributed algorithm can guarantee enough overlapped monitoring areas between adjacent robots. The effectiveness of the algorithm was verified by simulation experiments and a comparison experiment in typical scenarios. © IFIP International Federation for Information Processing 2018.

关键词： Monitoring

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：