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

Chinese Automation Congress (CAC)

作者： Zhaohui Luo Youmin Zhang Lingxia Mu Jing Huang Jing Xin Han Liu Shangbin Jiao Guo Xie Yingmin Yi Shaanxi Key Laboratory of Complex System Control and Intelligent Information Processing Xi’an University of Technology Xi’an China Concordia University Montreal Canada

ISBN: (数字)9781728176871

ISBN: (纸本)9781728176888

This paper proposes a new type of forest firefighting method. When one or more suspected fire spots are found in the forest, the firefighting Unmanned Aerial Vehicles (UAVs) can safely and quickly reach the desired location, conduct a thorough investigation of the suspected fire spots. If a fire occurs, it is necessary to drop firefighting materials to put out the fire. At the same time, considering the characteristics of limited endurance and low load capability have always limited the applications of UAVs, Unmanned Ground Vehicles (UGVs) are considered in this paper as an additional and comprehensive problem solution to provide energy and supplement materials for UAVs. In order to enable firefighting UAV to plan a safe and effective path in real time in the complex forest environment, a new improved D*Lite algorithm is proposed for UAVs in the mission team. Even when the 3D workspace is partially known or completely unknown, the algorithm can plan an effective path so that the firefighting UAV can move to the fire spots and UGV in real time.

关键词： Path planning Heuristic algorithms Unmanned aerial vehicles Forestry Smoothing methods Real-time systems Planning

来源：评论

学校读者我要写书评

暂无评论

Multi-Objective Cooperative Salvo Attack Against Group Target

引用

Journal of systems Science & complexity 2018年第1期31卷 244-261页

作者： ZENG Jie DOU Lihua XIN Bin School of Automation State Key Laboratory of Intelligent Control and Decision of Complex SystemsBeijing Advanced Innovation Center for Intelligent Robots and Systems Beijing Institute of Technology

This paper proposes a solution for the problem of cooperative salvo attack of multiple cruise missiles against targets in a group. Synchronization of the arrival time of missiles to hit their common target, minimizing the time consumption of attack and maximizing the expected damage to group targets are taken into consideration simultaneously. These operational objectives result in a hierarchical mixed-variable optimization problem which includes two types of subproblems, namely the multi-objective missile-target assignment（MOMTA） problem at the upper level and the time-optimal coordinated path planning（TOCPP） problems at the lower level. In order to solve the challenging problem, a recently proposed coordinated path planning method is employed to solve the TOCPP problems to achieve the soonest salvo attack against each target. With the aim of finding a more competent solver for MOMTA, three state-of-the-art multi-objective optimization methods（MOMs）,namely NSGA-II, MOEA/D and DMOEA-εC, are adopted. Finally, a typical example is used to demonstrate the advantage of the proposed method. A simple rule-based method is also employed for comparison. Comparative results show that DMOEA-εC is the best choice among the three MOMs for solving the MOMTA problem. The combination of DMOEA-εC for MOMTA and the coordinated path planning method for TOCPP can generate obviously better salvo attack schemes than the rule-based method.

关键词： Coordinated path planning missile-target assignment multi-missile salvo attack multiobjective optimization

来源：评论

学校读者我要写书评

暂无评论

An Integral Variable Continuous Exponential Reaching Law PD Sliding Mode control of Magnetic Levitation system

An Integral Variable Continuous Exponential Reaching Law PD ...

引用

Chinese Automation Congress (CAC)

作者： Xing-Xing Zhao Shi-Cheng Han Hai-Peng Ren Shaanxi Key Laboratory of Complex System Control and Intelligent Information Processing Xi’an University of Technology Xi’an China Xi’an Technological University Xi’an China

ISBN: (数字)9781728176871

ISBN: (纸本)9781728176888

Magnetic Levitation system (MLS) is a complex nonlinear control system. The aim of MLS control is to keep the vertical position of a metal ball by adjusting the duty ratio of electromagnet voltage. Sliding mode controller achieves the robustness to unknown disturbance and uncertainty, however, its control variable chattering is an obstacle for applications. There are some traditional methods to reduce the chattering at the cost of increasing the steady state error. In this paper, we present an improved reaching law based on proportional-derivative (PD) sliding surface to reduce the chattering, at the same time, to reduce steady-state error. The simulation is performed to test the effectiveness of the proposed method. The proposed method is compared with four other controllers to show the superiority.

关键词： Robustness Simulation Magnetic levitation Uncertainty Steady-state Mathematical model Electromagnets

来源：评论

学校读者我要写书评

暂无评论

Distributed synchronous and asynchronous algorithms for semi-definite programming with diagonal constraints

arXiv

引用

arXiv 2021年

作者： Jiang, Xia Zeng, Xianlin Sun, Jian Chen, Jie Key Laboratory of Intelligent Control and Decision of Complex Systems School of Automation Beijing Institute of Technology Beijing100081 China Beijing Institute of Technology Chongqing Innovation Center Chongqing401120 China Ministry of Education Beijing100081 China School of Electronic and Information Engineering Tongji University Shanghai200082 China

This paper develops distributed synchronous and asynchronous algorithms for the large-scale semi-definite programming with diagonal constraints, which has wide applications in combination optimization, image processing and community detection. The information of the semi-definite programming is allocated to multiple interconnected agents such that each agent aims to find a solution by communicating to its neighbors. Based on low-rank property of solutions and the Burer-Monteiro factorization, we transform the original problem into a distributed optimization problem over unit spheres to reduce variable dimensions and ensure positive semi-definiteness without involving semi-definite projections, which are computationally expensive. For the distributed optimization problem, we propose distributed synchronous and asynchronous algorithms, both of which reduce computational burden and storage space compared with existing centralized algorithms. Specifically, the distributed synchronous algorithm almost surely escapes strict saddle points and converges to the set of optimal solutions to the optimization problem. In addition, the proposed distributed asynchronous algorithm allows communication delays and converges to the set of critical points to the optimization problem under mild conditions. By applying proposed algorithms to image segmentation applications, we illustrate the efficiency and convergence performance of the two proposed algorithms. © 2021, CC BY.

关键词： Optimization

来源：评论

学校读者我要写书评

暂无评论

Distributed stochastic gradient tracking algorithm with variance reduction for non-convex optimization

arXiv

引用

arXiv 2021年

This paper proposes a distributed stochastic algorithm with variance reduction for general smooth non-convex finite-sum optimization, which has wide applications in signal processing and machine learning communities. In distributed setting, large number of samples are allocated to multiple agents in the network. Each agent computes local stochastic gradient and communicates with its neighbors to seek for the global optimum. In this paper, we develop a modified variance reduction technique to deal with the variance introduced by stochastic gradients. Combining gradient tracking and variance reduction techniques, this paper proposes a distributed stochastic algorithm, GT-VR, to solve large-scale non-convex finite-sum optimization over multi-agent networks. A complete and rigorous proof shows that the GT-VR algorithm converges to first-order stationary points with O(k1) convergence rate. In addition, we provide the complexity analysis of the proposed algorithm. Compared with some existing first-order methods, the proposed algorithm has a lower O(PMΕ−1) gradient complexity under some mild condition. By comparing state-of-the-art algorithms and GT-VR in experimental simulations, we verify the efficiency of the proposed algorithm. © 2021, CC BY.

关键词： Stochastic systems

来源：评论

学校读者我要写书评

暂无评论

Distributed proximal gradient algorithm for non-smooth non-convex optimization over time-varying networks

arXiv

引用

arXiv 2021年

This note studies the distributed non-convex optimization problem with non-smooth regularization, which has wide applications in decentralized learning, estimation and control. The objective function is the sum of different local objective functions, which consist of differentiable (possibly non-convex) cost functions and non-smooth convex functions. This paper presents a distributed proximal gradient algorithm for the non-smooth non-convex optimization problem over time-varying multi-agent networks. Each agent updates local variable estimate by the multi-step consensus operator and the proximal operator. We prove that the generated local variables achieve consensus and converge to the set of critical points with convergence rate O(1/T). Finally, we verify the efficacy of proposed algorithm by numerical simulations. © 2021, CC BY.

关键词： Time varying networks

来源：评论

学校读者我要写书评

暂无评论

A Heuristic Algorithm for Solving Resource Constrained Project Scheduling Problem with Transfer Time under Resource Bundle

A Heuristic Algorithm for Solving Resource Constrained Proje...

引用

第三十八届中国控制会议

作者： Junqi Cai Zhihong Peng School of Automation Beijing Institute of Technology State Key Laboratory of Intelligent Control and Decision of Complex System

In this paper we investigate an extension of Resource Constrained Projected Scheduling Problem(RCPSP): the Resource Constrained Project Scheduling Problem with Transfer Time under Resource Bundle. For this complex problem, the use of a parallel scheduling scheme is proposed. Such scheme has been successfully applied to the RCPSP. Introducing transfer time and resource bundle into RCPSP causes two problems, one is the possibility of resources significantly exceed the need of a task, the other is cooperation among unfamiliar members from different team may increase the makespan of the project. In order to deal with the problem, two new concepts are developed: task-related resource weight and collaboration coefficient. Some discussion of such concepts is given of and use them for new heuristic framework we proposed. A computational test is performed and the results show that the new heuristic is very effective in finding better solutions within a very short time.

关键词： RCPSP heuristic algorithm resource bundle transfer time

来源：评论

学校读者我要写书评

暂无评论

Road acceleration spectrum replication on Stewart platform with Three Variable controller

Road acceleration spectrum replication on Stewart platform w...

引用

第三十八届中国控制会议

作者： Hu Xiaoyu Wang Shoukun State Key Laboratory of Intelligent Control and Decision of Complex System School of Automation Beijing Institute of Technology

Comparing to the commonly used hydraulic three-axial shaking tables, multi-degree of freedom shaking systems implemented by Stewart platform have the merits of being portable, easy to install and with high load capacity, but are not well studied because of the inherent nonlinearity and strong coupling of Stewart platform. In order to replicate multi-degree of freedom road acceleration spectrum on Stewart platform, analysis of the system was carried out. Firstly, the system structure was introduced and the linearized platform kinematic equations, at the equilibrium position, were inducted. The models of actuators that drive the platform were simplified and the principles of three variable controller(TVC) were deduced briefly. Finally, MATLAB-Adams co-simulation environment was built to perform multi-degree of freedom road acceleration spectrum replication with TVC. The results show that it can reproduce high accuracy multi-degree of freedom road acceleration spectrum with TVC on Stewart platform.

关键词： Shaking table Stewart platform three variable controller

来源：评论

学校读者我要写书评

暂无评论

Asynchronous Algorithm for Distributed Multi-agent Convex Optimization

Asynchronous Algorithm for Distributed Multi-agent Convex Op...

引用

第三十九届中国控制会议

作者： Duqiao Zhao Ding Liu Xia Zhang National & Local Joint Engineering Research Center of Crystal Growth Equipment and System Integration Xi'an University of Technology Shaanxi Key Laboratory of Complex System Control and Intelligent Information Processing

This paper proposes an asynchronous algorithm for distributed optimization problem(Asy-DOP) in multi-agent network with gradient *** algorithm can be implemented in an asynchronous distributed *** objective function of the algorithm is the sum of the local functions of multiple nodes in the network,each node only knows its own local objective function and can exchange information with its *** addition,the algorithm is based on the undirected connected graph and requires the objective function is Lipschitz *** step-size of the proposed algorithm is homogeneous and when the step-size is in a suitable range,it is proved that the convergence rate of the proposed algorithm is O(1/(?)),where the k is the number of iterations.

关键词： asynchronous algorithm distributed optimization multi-agent gradient method

来源：评论

学校读者我要写书评

暂无评论

A threshold segmentation method for non-uniform illumination image based on brightness equalization 2

A threshold segmentation method for non-uniform illumination...

引用

2019 2nd International Conference on Advanced Materials, intelligent Manufacturing and Automation, AMIMA 2019

作者： Guo, Hui Chen, Peng Huang, Shun Hu, Cong Zhang, Lijun School of Automation China University of Geosciences Wuhan430074 China Hubei Key Laboratory of Advanced Control and Intelligent Automation for Complex System Wuhan430074 China

In the process of image acquisition, non-uniform illumination images are common due to poor lighting, surface reflection, or a combination of these two factors. In order to improve the quality of image segmentation, an image threshold segmentation method is proposed for non-uniform illumination images. First, the brightness of different regions in the image is compensated to make the brightness background of the whole image consistent. Second, the gradation histogram of the processed image is obtained and simulated into Gaussian distribution curve, then the inflection points of the curve are calculated. Finally, the two inflection points are set as thresholds to segment the image after brightness equalization. This method eliminates the influence of non-uniform illumination to a certain extent and gets a better segmentation effect. Experiments were carried out on images containing several different types of non-uniform illumination. The results demonstrate that the proposed method outperforms the compared enhancement algorithms in threshold segmentation. © Published under licence by IOP Publishing Ltd.

关键词： Luminance

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：