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

Cooperative Trajectory Generation Using Pythagorean Hodograph Bezier Curves

JOURNAL OF GUIDANCE CONTROL AND DYNAMICS 2016年第8期39卷 1744-1763页

作者： Choe, Ronald Puig-Navarro, Javier Cichella, Venanzio Xargay, Enric Hovakimyan, Naira Univ Illinois Dept Aerosp Engn Urbana IL 61801 USA Univ Illinois Dept Mech Sci & Engn Urbana IL 61801 USA

This paper presents a cooperative trajectory-generation framework to efficiently compute a set of spatial trajectories for a team of cooperating vehicles: in particular, for unmanned aerial vehicles. The desired, feasible trajectories are generated using Pythagorean Hodograph Bezier curves, satisfy stringent spatial and temporal constraints, do not violate the dynamic constraints of the vehicles, and guarantee spatial deconfliction between the trajectories for safe operation. A multivehicle mission scenario is presented to show the efficacy of the proposed cooperative trajectory-generation framework.

关键词： Unmanned System Flight Path Angle Pseudospectral Optimal Control Model Predictive Control Fixed Wing Aircraft Computing Power MATLAB Mixed Integer Linear Programming recursive algorithm Motion Planning

来源：评论

学校读者我要写书评

暂无评论

An improved algorithm for finding all minimal paths in a network

引用

RELIABILITY ENGINEERING & SYSTEM SAFETY 2016年 150卷 1-10页

作者： Bai, Guanghan Tian, Zhigang Zuo, Ming J. Univ Alberta Dept Mech Engn Edmonton AB Canada

Minimal paths (MPs) play an important role in network reliability evaluation. In this paper, we report an efficient recursive algorithm for finding all MPs in two-terminal networks, which consist of a source node and a sink node. A linked path structure indexed by nodes is introduced, which accepts both directed and undirected form of networks. The distance between each node and the sink node is defined, and a simple recursive algorithm is presented for labeling the distance for each node. Based on the distance between each node and the sink node, additional conditions for backtracking are incorporated to reduce the number of search branches. With the newly introduced linked node structure, the distances between each node and the sink node, and the additional backtracking conditions, an improved backtracking algorithm for searching for all MPs is developed. In addition, the proposed algorithm can be adapted to search for all minimal paths for each source-sink pair in networks consisting of multiple source nodes and/or multiple sink nodes. Through computational experiments, it is demonstrated that the proposed algorithm is more efficient than existing algorithms when the network size is not too small. The proposed algorithm becomes more advantageous as the size of the network grows. (C) 2016 Elsevier Ltd. All rights reserved.

关键词： Minimal path Backtracking Network reliability Linked path structure recursive algorithm

来源：评论

学校读者我要写书评

暂无评论

Two-dimensional discrete cosine transform on sliding windows

引用

DIGITAL SIGNAL PROCESSING 2016年第0期58卷 20-25页

作者： Park, Chun-Su Sejong Univ Dept Digital Contents Seoul South Korea

The discrete cosine transform (DCT) has been successfully used for a wide range of applications in digital signal processing. While there are efficient algorithms for implementing the DCT, its use becomes difficult in the sliding transform scenario where the transform window is shifted one sample at a time and the transform process is repeated. In this paper, a new two-dimensional sliding DCT (2-D SDCT) algorithm is proposed for fast implementation of the DCT on 2-D sliding windows. In the proposed algorithm, the DCT coefficients of the shifted window are computed by exploiting the recursive relationship between 2-D DCT outputs of three successive windows. The theoretical analysis shows that the computational requirement of the proposed 2-D SDCT algorithm is the lowest among existing 2-D DCT algorithms. Moreover, the proposed algorithm enables independent updating of each DCT coefficient. (C) 2016 Elsevier Inc. All rights reserved.

关键词： Discrete cosine transform Sliding transform Sliding window recursive algorithm Two-dimensional algorithm

来源：评论

学校读者我要写书评

暂无评论

A linear time algorithm for the unbalanced Hitchcock transportation problem

引用

NETWORKS 2016年第2期67卷 170-182页

作者： Matsui, Tomomi Scheifele, Rudolf Tokyo Inst Technol Grad Sch Decis Sci & Technol Dept Social Engn Meguro Ku Tokyo 1528550 Japan Univ Bonn Res Inst Discrete Math Lennestr 2 D-53113 Bonn Germany

The Hitchcock transportation problem is a special case of the minimum cost flow problem where the graph is bipartite and capacities are infinite. If we let m denote the size of the larger and n the size of the smaller side of the bipartition, we call the Hitchcock transportation problem unbalanced if m is much larger than n. The unbalanced case arises in various applications, motivating the search for algorithms whose running time dependence on m is as small as possible. In this work, we give an algorithm with running time , which is the fastest known algorithm whose running time grows linearly in m. Moreover, we compare running times of algorithms for the Hitchcock transportation problem and the minimum cost flow problem and point out the fastest algorithms for particular relations of m and n, where m and n denote the number of edges and vertices in the context of the minimum cost flow problem. (c) 2015 Wiley Periodicals, Inc. NETWORKS, Vol. 67(2), 170-182 2016

关键词： Hitchcock transportation problem minimum cost flow problem linear time algorithm recursive algorithm bipartite graph parallel edges

来源：评论

学校读者我要写书评

暂无评论

A dynamic unreliability assessment and optimal maintenance strategies for multistate weighted k-out-of-n:F systems

引用

APPLIED STOCHASTIC MODELS IN BUSINESS AND INDUSTRY 2016年第4期32卷 485-493页

作者： Khorshidi, Hadi Akbarzade Gunawan, Indra Ibrahim, Yousef Monash Univ Fac Sci Melbourne Vic Australia Univ Adelaide Entrepreneurship Commercialisat & Innovat Ctr Adelaide SA Australia Federat Univ Australia Sch Engn & Informat Technol Churchill Vic Australia

In this paper, a dynamic evaluation of the multistate weighted k-out-of-n:F system is presented in an unreliability viewpoint. The expected failure cost of components is used as an unreliability index. Using failure cost provides an opportunity to employ financial concepts in system unreliability estimation. Hence, system unreliability and system cost can be compared easily in order to making decision. The components' probabilities are computed over time to model the dynamic behavior of the system. The whole system has been assessed by recursive algorithm approach. As a result, a bi-objective optimization model can be developed to find optimal decisions on maintenance strategies. Finally, the application of the proposed model is investigated via a transportation system case. Matlab programming is developed for the case, and genetic algorithm is used to solve the optimization model. Copyright (c) 2016 John Wiley & Sons, Ltd.

关键词： multistate weighted k-out-of-n:F system dynamic assessment unreliability evaluation bi-objective optimization failure cost recursive algorithm

来源：评论

学校读者我要写书评

暂无评论

recursive minimum component algorithms for parameter estimation of dynamic systems

引用

NEUROCOMPUTING 2016年第0期186卷 251-257页

作者： Li, Huxiong Mu, Bingxian Zuo, Lei Zhejiang Univ Media & Commun Sch New Media Xiasha Higher Educ Zone 998 Xueyuan St Hangzhou 310018 Peoples R China Univ Victoria Dept Mech Engn Stn CSC POB 1700 Victoria BC V8W 2Y2 Canada Northwestern Polytech Univ Sch Marine Sci & Technol 127 West Youyi Rd Xian 710072 Peoples R China

Minimum component analysis is an elegant and promising approach to system identification. This paper focuses on developing related recursive algorithms. Two algorithms are presented. In the first approach, rank-one modification is used to get an accurate and quickly convergent algorithm. However, its drawback is low computational efficiency. Therefore, the second algorithm is proposed to realize faster computation. The simulation results verify the effectiveness of both algorithms. (C) 2016 Published by Elsevier B.V.

关键词： System identification Minimum component analysis recursive algorithm

来源：评论

学校读者我要写书评

暂无评论

A fast recursive algorithm based on fuzzy 2-partition entropy approach for threshold selection

引用

NEUROCOMPUTING 2011年第17期74卷 3072-3078页

作者： Tang, Yinggan Mu, Weiwei Zhang, Ying Zhang, Xuguang Beijing Univ Posts & Telecommun State Key Lab Networking & Switching Technol Beijing 100876 Peoples R China Yanshan Univ Inst Elect Engn Qinhuangdao 066004 Hebei Peoples R China Natl Lighting Test Ctr Beijing 100022 Peoples R China

The fuzzy c-partition entropy approach for threshold selection is an effective approach for image segmentation. The approach models the image with a fuzzy c-partition, which is obtained using parameterized membership functions. The ideal threshold is determined by searching an optimal parameter combination of the membership functions such that the entropy of the fuzzy c-partition is maximized. It involves large computation when the number of parameters needed to determine the membership function increases. In this paper, a recursive algorithm is proposed for fuzzy 2-partition entropy method, where the membership function is selected as S-function and Z-function with three parameters. The proposed recursive algorithm eliminates many repeated computations, thereby reducing the computation complexity significantly. The proposed method is tested using several real images, and its processing time is compared with those of basic exhaustive algorithm, genetic algorithm (GA), particle swarm optimization (PSO), ant colony optimization (ACO) and simulated annealing (SA). Experimental results show that the proposed method is more effective than basic exhaustive search algorithm, GA, PSO, ACO and SA. Crown Copyright (C) 2011 Published by Elsevier B.V. All rights reserved.

关键词： Image segmentation Fuzzy c-partition Thresholding recursive algorithm Entropy

来源：评论

学校读者我要写书评

暂无评论

Bayesian reasoning approach based recursive algorithm for online updating belief rule based expert system of pipeline leak detection

引用

EXPERT SYSTEMS WITH APPLICATIONS 2011年第4期38卷 3937-3943页

作者： Zhou, Zhi-Jie Hu, Chang-Hua Xu, Dong-Ling Yang, Jian-Bo Zhou, Dong-Hua Tsinghua Univ Dept Automat TNList Beijing 100084 Peoples R China High Tech Inst Xian Xian 710025 Shaanxi Peoples R China Univ Manchester Manchester Business Sch Manchester M15 6PB Lancs England

In this paper a recursive algorithm based on the Bayesian reasoning approach is proposed to update a belief rule based (BRB) expert system for pipeline leak detection and leak size estimation. In addition to using available real time data, expert knowledge on the relationships of the parameters among different rules is incorporated into the updating process so that the performance of the expert system can be improved. Experiments are carried out to compare the newly proposed algorithm with the previously published algorithms, and results show that the proposed algorithm can update the BRB expert system faster and more accurately, which is important for real-time applications. The BRB expert systems can be automatically tuned to represent complex real world systems, and applied widely in engineering. (C) 2010 Elsevier Ltd. All rights reserved.

关键词： Belief rule base Expert system Bayesian reasoning recursive algorithm Leak detection

来源：评论

学校读者我要写书评

暂无评论

Generating strictly binary trees at random based on convex polygon triangulations

引用

INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS 2016年第3期93卷 445-452页

作者： Yu, Jing Tang, Zi-Li Soochow Univ Sch Comp Sci & Technol Suzhou 215006 Jiangsu Peoples R China

A set of maximal non-intersecting diagonals can decompose a polygon into triangles, and the edges and diagonals can be converted into the external and internal nodes of a strictly binary tree. This paper gives algorithms to generate all types of triangulations and triangulations at random. Based on that, this paper gives an algorithm to generate strictly binary trees at random. The experimental results show that the numbers of various shapes of strictly binary trees generated are nearly equal. The algorithm to generate strictly binary trees at random can be transformed to the algorithm to randomly generate binary trees.

关键词： strictly binary tree edge diagonal binary tree recursive algorithm convex polygon triangulation node 32B25 05C05 05C85

来源：评论

学校读者我要写书评

暂无评论

A systematic method for the hybrid dynamic modeling of open kinematic chains confined in a closed environment

引用

MULTIBODY SYSTEM DYNAMICS 2016年第1期38卷 21-42页

作者： Shafei, A. M. Shafei, H. R. Shahid Bahonar Univ Kerman Dept Mech Engn Kerman Iran

This work presents a systematic method for the dynamic modeling of multi-rigid links confined within a closed environment. The behavior of the system can be completely characterized by two different mathematical models: a set of highly coupled differential equations for modeling the confined multi-link system when it has no impact with surrounding walls;and a set of algebraic equations for expressing the collision of this open kinematic chain system with the confining surfaces. In order to avoid the Lagrangian formulation (which uses an excessive number of total and partial derivatives in deriving the governing equations of multi-rigid links), the motion equations of such a complex system are obtained according to the recursive Gibbs-Appell formulation. The main feature of this paper is the recursive approach, which is used to automatically derive the governing equations of motion. Moreover, in deriving the motion equations, the manipulators are not limited to planar motions only. In fact, for systematic modeling of the motion of a multi-rigid-link system in 3D space, two imaginary links are added to the -real links of a manipulator in order to model the spatial rotations of the system. Finally, a 2D and a 3D case studies are simulated to demonstrate the effectiveness of the proposed approach.

关键词： recursive algorithm Gibbs-Appell Finite motion Impulsive motion Closed environment

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：