期刊文献+
共找到3篇文章
< 1 >
每页显示 20 50 100
An Integrated Approach to Oscillation Propagation Identification and Source Locating in Process Multi-loop Systems 被引量:1
1
作者 曹稼斌 张亮 +1 位作者 郑建荣 夏春明 《Chinese Journal of Chemical Engineering》 SCIE EI CAS CSCD 2011年第6期999-1008,共10页
An integrated method for identifying the propagation of multi-loop process oscillations and their source location is proposed in this paper. Oscillatory process loop variables are automatically selected based on the c... An integrated method for identifying the propagation of multi-loop process oscillations and their source location is proposed in this paper. Oscillatory process loop variables are automatically selected based on the component-related ratio index and a mixing matrix, both of which are obtained in data preprocessing by spectral independent component analysis. The complex causality among oscillatory process variables is then revealed by Granger causality test and is visualized in the form of causality diagram. The simplification of causal connectivity in the diagram is performed according to the understanding of process knowledge and the final simplest causality diagram, which represents the main oscillation propagation paths, is achieved by the automated cutting-off thresh-old search, with which less significant causality pathways are filtered out. The source of the oscillation disturbance can be identified intuitively through the final causality diagram. Both simulated and real plant data tests are presented to demonstrate the effectiveness and feasibility of the proposed method. 展开更多
关键词 multi-loop system process oscillation spectral independent component analysis Granger causality test causality diagram propagation path simplification source locating
在线阅读 下载PDF
A distributed variable density path search and simplification method for industrial manipulators with end-effector's attitude constraints
2
作者 Jin WANG Shengjie LI +4 位作者 Haiyun ZHANG Guodong LU Yichang FENG Peng WANG Jituo LI 《Frontiers of Information Technology & Electronic Engineering》 SCIE EI CSCD 2023年第4期536-552,共17页
In many robot operation scenarios, the end-effector's attitude constraints of movement are indispensable for the task process, such as robotic welding, spraying, handling, and stacking. Meanwhile, the inverse kine... In many robot operation scenarios, the end-effector's attitude constraints of movement are indispensable for the task process, such as robotic welding, spraying, handling, and stacking. Meanwhile, the inverse kinematics, collision detection, and space search are involved in the path planning procedure under attitude constraints, making it difficult to achieve satisfactory efficiency and effectiveness in practice. To address these problems, we propose a distributed variable density path planning method with attitude constraints(DVDP-AC) for industrial robots. First, a position – attitude constraints reconstruction(PACR) approach is proposed in the inverse kinematic solution. Then, the distributed signed-distance-field(DSDF) model with single-step safety sphere(SSS) is designed to improve the efficiency of collision detection. Based on this, the variable density path search method is adopted in the Cartesian space. Furthermore, a novel forward sequential path simplification(FSPS) approach is proposed to adaptively eliminate redundant path points considering path accessibility. Finally, experimental results verify the performance and effectiveness of the proposed DVDP-AC method under end-effector's attitude constraints, and its characteristics and advantages are demonstrated by comparison with current mainstream path planning methods. 展开更多
关键词 path planning Industrial robots Distributed signed-distance-field Attitude constraints path simplification
原文传递
PATH PROBLEM SIMPLIFICATION WITH DESIRED BOUNDED LENGTHS IN ACYCLIC NETWORKS
3
作者 Zhixiong Su Jianxun Qi Hanying Wei 《Journal of Systems Science and Systems Engineering》 SCIE EI CSCD 2015年第4期500-519,共20页
Path determination is a fundamental problem of operations research. Current solutions mainly focus on the shortest and longest paths. We consider a more generalized problem; specifically, we consider the path problem ... Path determination is a fundamental problem of operations research. Current solutions mainly focus on the shortest and longest paths. We consider a more generalized problem; specifically, we consider the path problem with desired bounded lengths (DBL path problem). This problem has extensive applications; however, this problem is much harder, especially for large-scale problems. An effective approach to this problem is equivalent simplification. We focus on simplifying the problem in acyclic networks and creating a path length model that simplifies relationships between various path lengths. Based on this model, we design polynomial algorithms to compute the shortest, longest, second shortest, and second longest paths that traverse any arc. Furthermore, we design a polynomial algorithm for the equivalent simplification of the is O(m), where m is the number of arcs. DBL path problem. The complexity of the algorithm 展开更多
关键词 Operations research path problem with desired bounded lengths equivalent simplification path length model acyclic network
原文传递
上一页 1 下一页 到第
使用帮助 返回顶部