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

arXiv 2024年

作者： Hu, Bin-Bin Zhang, Hai-Tao Yao, Weijia Sun, Zhiyong Cao, Ming The School of Artificial Intelligence and Automation The Engineering Research Center of Autonomous Intelligent Unmanned Systems The Key Laboratory of Image Processing and Intelligent Control The State Key Lab of Digital Manufacturing Equipment and Technology Huazhong University of Science and Technology Wuhan430074 China The School of Robotics Hunan University Hunan410082 China The Institute of Engineering and Technology University of Groningen Groningen9747 AG Netherlands Department of Electrical Engineering Eindhoven University of Technology Netherlands

We design a distributed coordinated guiding vector field (CGVF) for a group of robots to achieve ordering-flexible motion coordination while maneuvering on a desired two-dimensional (2D) surface. The CGVF is characterized by three terms, i.e., a convergence term to drive the robots to converge to the desired surface, a propagation term to provide a traversing direction for maneuvering on the desired surface, and a coordinated term to achieve the surface motion coordination with an arbitrary ordering of the robotic group. By setting the surface parameters as additional virtual coordinates, the proposed approach eliminates potential singularity of the CGVF and enables both the global convergence to the desired surface and the maneuvering on the surface from all possible initial conditions. The ordering-flexible surface motion coordination is realized by each robot to share with its neighbors only two virtual coordinates, i.e. that of a given target and that of its own, which reduces the communication and computation cost in multi-robot surface navigation. Finally, the effectiveness of the CGVF is substantiated by extensive numerical simulations. Copyright © 2024, The Authors. All rights reserved.

关键词： Navigation

来源：评论

学校读者我要写书评

暂无评论

Finite-time tracking consensus in probability for multi-agent system with noises and time delay

Finite-time tracking consensus in probability for multi-agen...

引用

International Conference on Information Science and Technology (ICIST)

作者： Mingyan Tuo Fenglan Sun Feng Wang Hao Li Key Lab of Intelligent Analysis and Decision on Complex Systems School of Science Chongqing University of Posts and Telecommunications Chongqing China Key Lab of Intelligent Air-Ground Cooperative Control for Universities in Chongqing College of Automation Chongqing University of Posts and Telecommunications Chongqing China

ISBN: (纸本)9781665412667;9781665429412

This paper studies the finite-time tracking consensus in probability of multi-agent systems with noises and time delay. By using the method of pinning control and observer, the system both with and without the leader as the root of a spanning tree is considered. According to algebraic graph theory, stochastic Lyapunov stability theory and control theory, sufficient conditions for the tracking consensus are given. Numerical simulations are given to verify the effectiveness of the main results.

关键词： Sufficient conditions Information science Protocols Delay effects Observers Numerical simulation Graph theory

来源：评论

学校读者我要写书评

暂无评论

Motion Planning of Six-DOF Arm Robot Based on Improved DDPG Algorithm

Motion Planning of Six-DOF Arm Robot Based on Improved DDPG ...

引用

第三十九届中国控制会议

作者： Zhuang Li Hongbin Ma Yazhe Ding Chen Wang Ying Jin School of Automation Beijing Institute of Technology State Key Laboratory of Intelligent Control and Decision of Complex Systems

This paper presents an improved deep deterministic policy gradient algorithm based on a six-DOF(six multi-degree-offreedom) arm robot. First, we build a robot model based on the DH(Denavit-Hartenberg) parameters of the UR5 arm robot. Then,we improved the experience pool of the traditional DDPG(deep deterministic policy gradient) algorithm by adding a success experience pool and a collision experience pool. Next, the reward function is improved to increase the degree of successful reward and the penalty of collision. Finally, the training is divided into segments, the front three axes are trained first, and then the six axes. The simulation results in ROS(Robot Operating System) show that the improved DDPG algorithm can effectively solve the problem that the six-DOF arm robot moves too far in the configuration space. The trained model can reach the target area in five steps. Compared with the traditional DDPG algorithm, the improved DDPG algorithm has fewer training episodes,but achieves better results.

关键词： Motion Planning Improved DDPG Six-DOF Arm Robot ROS

来源：评论

学校读者我要写书评

暂无评论

A review of cooperative path planning of an unmanned aerial vehicle group

引用

Frontiers of Information Technology & Electronic Engineering 2020年第12期21卷 1671-1694页

作者： Hao ZHANG Bin XIN Li-hua DOU Jie CHEN Kaoru HIROTA School of Automation Beijing Institute of TechnologyBeijing 100081China State Key Laboratory of Intelligent Control and Decision of Complex Systems Beijing 100081China Department of Computational Intelligence and Systems Science Tokyo Institute of TechnologyTokyo 1528550Japan

As a cutting-edge branch of unmanned aerial vehicle(UAV)technology,the cooperation of a group of UAVs has attracted increasing attention from both civil and military sectors,due to its remarkable merits in functionality and flexibility for accomplishing complex extensive tasks,e.g.,search and rescue,fire-fighting,reconnaissance,and *** path planning(CPP)is a key problem for a UAV group in executing tasks *** this paper,an attempt is made to perform a comprehensive review of the research on CPP for UAV ***,a generalized optimization framework of CPP problems is proposed from the viewpoint of three key elements,i.e.,task,UAV group,and environment,as a basis for a comprehensive classification of different types of CPP *** following the proposed framework,a taxonomy for the classification of existing CPP problems is proposed to describe different kinds of CPPs in a unified ***,a review and a statistical analysis are presented based on the taxonomy,emphasizing the coordinative elements in the existing CPP *** addition,a collection of challenging CPP problems are provided to highlight future research directions.

关键词： Unmanned aerial vehicle group Cooperation Path planning Optimization problem

来源：评论

学校读者我要写书评

暂无评论

DBFCM: a Density-Based Fuzzy C-Means with Self-Regulated Fuzzy Clustering Parameters

DBFCM: a Density-Based Fuzzy C-Means with Self-Regulated Fuz...

引用

第三十九届中国控制会议

作者： Jiayi Sun Yaping Dai Kaixin Zhao School of Automation Beijing Institute of Technology State Key Laboratory of Intelligent Control and Decision of Complex Systems

As an interdisciplinary of fuzzy theory and clustering, Fuzzy C-Means（FCM） is widely applied for identifying categories with unlabeled data. However, its application to data which is hard to visualize rises the difficulty for users to determine the input parameters, especially for the number of clusters. In this paper, a kind of fuzzy clustering algorithm with self-regulated parameters named Density-Based Fuzzy C-Means（DBFCM） is proposed by integrating the idea of Density-Based Spatial Clustering of Application with Noise（DBSCAN） into FCM. Its advantage is using the inherit density characteristic of input data to self-determine the parameters of fuzzy clustering. The experimental results demonstrate that the proposed DBFCM can not only self-determine the proper parameters, but also accelerate the convergence process compared to the original FCM.

关键词： Machine Learning Fuzzy Clustering Fuzzy C-Means Parameter Self-Regulation

来源：评论

学校读者我要写书评

暂无评论

Analytic Hierarchy Process（AHP） in Portfolio Selection Based on Information Granularity

Analytic Hierarchy Process（AHP） in Portfolio Selection Bas...

引用

第32届中国控制与决策会议

作者： Kaixin Zhao Yaping Dai Ye Ji Jiayi Sun School of Automation Beijing Institute of Technology State Key Laboratory of Intelligent Control and Decision of Complex Systems

Analytic Hierarchy Process（AHP） is a multi criteria decision-making method,which can describe and transform the qualitative problems quantitatively,and then get the quantitative analysis results in accordance with the causal relationship between decision *** this paper,a granular Analytic Hierarchy Process,which introduces the granularity mechanism,is proposed to solve the portfolio selection problem under the mean-risk *** the proposed method,the scale value of scheme layer is no longer limited to nine positive integers from 1 to 9,which gives granularity attributes to the comparison of advantages and disadvantages in a specific criterion layer between different *** proposed method reflects small differences between different alternative schemes through granularity attribute,so it can provide rich decision information for decision *** numeric examples from the real-world financial market（China Shanghai Stock Exchange） are provided to illustrate an essence of the proposed method.

关键词： Analytic Hierarchy Process（AHP） Portfolio Selection Information Granularity decision-making

来源：评论

学校读者我要写书评

暂无评论

Cross-Membrane Penetration to Nucleus of Adherent Cells Using Micropipettes Made by Borosilicate Glass and Quartz 17

Cross-Membrane Penetration to Nucleus of Adherent Cells Usin...

引用

17th IEEE International Conference on Mechatronics and automation, ICMA 2020

作者： Xu, Xinyue Liu, Xiaoming Lin, Yuqing Li, Pengyun Liu, Fengyu Tang, Xiaoqing Huang, Qiang Arai, Tatsuo Beijing Institute of Technology Key Laboratory of Biomimetic Robots and Systems Ministry of Education State Key Laboratory of Intelligent Control and Decision of Complex System Beijing Advanced Innovation Center for Intelligent Robots and Systems School of Mechatronical Engineering Beijing100081 China

ISBN: (纸本)9781728164151

In the biomicromanipulation field, single-cell manipulation is receiving attention due to its potential applications in many aspects of biomedicine. Cell injection, as a typical cell micromanipulation technique, is devoted to introducing foreign substances into living cells by penetrating a fine micropipette into cell membranes. Direct access to the intracellular environment, especially the nucleus, provides an ideal way to gain insight into the dynamic processes of living cells. This paper presents the comparison of controlled penetrations of two types of adherent cells and their nuclei by two types of micropipettes, made of borosilicate glass and quartz respectively. Due to the differences in the cell properties (e.g., height, adhesion strength), two corresponding penetration strategies optimizing the puncture angle and puncture height, are proposed to improve the success rate of the puncture process and the survival rate of cells after the puncture. Real nucleus puncture experiments adopting the optimal puncture strategy for each type of cells and carried out by a semi-automatic system, indicated a better puncture effect by quartz pipettes. Through this method, functional materials such as peptides and nanoparticles can be potentially introduced to perturb the cell activities and then realize its full automation. © 2020 IEEE.

关键词： Quartz

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Self-Attention based Temporal Intrinsic Reward for Reinforcement Learning

Self-Attention based Temporal Intrinsic Reward for Reinforce...

引用

Chinese automation Congress (CAC)

作者： Zhuo Jiang Daiying Tian Qingkai Yang Zhihong Peng School of Automation Beijing Institute of Technology Beijing China State Key Laboratory of Intelligent Control and Decision of Complex System Beijing China Peng Cheng Laboratory Shenzhen China

ISBN: (纸本)9781665426480

This paper proposes a self-attention based temporal intrinsic reward model for reinforcement learning (RL), to synthesize the control policy for the agent constrained by the sparse reward in partially observable environments. This approach can solve the problem of temporal credit assignment to some extent and deal with the low efficiency of exploration. We first introduce a sequence-based self-attention mechanism to generate the temporary features, which can effectively capture the temporal property of the task for the agent. During the training process, the temporary features are employed in each sampled episode to elaborate the intrinsic rewards, which is combined with the extrinsic reward to help the agent learn a feasible policy. Then we use the meta-gradient to update this intrinsic reward model in order that the agent can achieve better performance. Experiments are given to demonstrate the superiority of the proposed method.

关键词： Training automation Reinforcement learning Task analysis

来源：评论

学校读者我要写书评

暂无评论

A comparative study on evolutionary algorithms for the agent routing problem in multi-point dynamic task

A comparative study on evolutionary algorithms for the agent...

引用

作者： Lu, Sai Xin, Bin Dou, Lihua Wang, Ling School of Automation Beijing Institute of Technology Beijing China Key Laboratory of Intelligent Control and Decision of Complex Systems Beijing Institute of Technology Beijing China Beijing Advanced Innovation Center for Intelligent Robots and Systems Beijing Institute of Technology Beijing China Department of Automation Tsinghua University Beijing China

The agent routing problem in multi-point dynamic task (ARP-MPDT) proposed recently is a novel permutation optimisation problem. In ARP-MPDT, a number of task points are located at different places and their states change over time. The agent must go to the task points in turn to execute the tasks, and the execution time of each task depends on the task state. The optimisation objective is to minimise the time for the agent to complete all the tasks. In this paper, five evolutionary algorithms are redesigned and tried to solve this problem, including a permutation genetic algorithm (GA), a variant of the particle swarm optimisation (PSO) and three variants of the estimation of distribution algorithm (EDA). In particular, a dual-model EDA (DM-EDA) employing two probability models was proposed. Finally, comparative tests confirm that the DM-EDA has a stronger adaptability than the other algorithms though GA performs better for the large-scale instances. Copyright © 2020 Inderscience Enterprises Ltd.

关键词： Genetic algorithms

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：