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

Decentralized Cooperative Control Methods for the Modified Weapon-Target Assignment Problem

JOURNAL OF GUIDANCE CONTROL AND DYNAMICS 2016年第9期39卷 1934-1948页

作者： Volle, Kyle Rogers, Jonathan Brink, Kevin Georgia Inst Technol Sch Mech Engn Atlanta GA 30332 USA US Air Force Res Lab Munit Directorate Eglin AFB FL 32542 USA

Weapon-target assignment is a combinatorial optimization problem in which a set of weapons must selectively engage a set of targets. In its decentralized form, it is also an important problem in autonomous multi-agent robotics. In this work, decentralized methods are explored for a modified weapon-target assignment problem in which weapons seek to achieve a prespecified probability of kill on each target. Three novel cost functions are proposed that, in cases with low agent-to-target ratios, induce behaviors that may be preferable to the behaviors induced by classical cost functions. The performance of these proposed cost functions is explored in simulation of both homogeneous and heterogeneous engagement scenarios using airborne autonomous weapons. Simulation results demonstrate that the proposed cost functions achieve desired behaviors in cases with low agent-to-target ratios where efficient use of weapons is particularly important.

关键词： Airborne Autonomous Weapons Robotics Annealing algorithm performance Optimization algorithm Stochastic Optimization Mechanism Design Cost Reduction Search algorithm Unmanned Aerial Vehicle

来源：评论

学校读者我要写书评

暂无评论

Estimation of execution time for computing tasks

引用

CLUSTER COMPUTING-THE JOURNAL OF NETWORKS SOFTWARE TOOLS AND APPLICATIONS 2023年第6期26卷 3943-3956页

作者： Bielecki, Jan Smialek, Michal Warsaw Univ Technol Fac Elect Engn Ul Koszykowa 75 PL-00662 Warsaw Poland

This work aims to estimate the execution time of data processing tasks (specific executions of a program or an algorithm) before their execution. The paper focuses on the estimation of the average-case execution time (ACET). This metric can be used to predict the approximate cost of computations, e.g. when resource consumption in a High-performance Computing system has to be known in advance. The presented approach proposes to create machine learning models using historical data. The models use program metadata (properties of input data) and parameters of the run-time environment as their explanatory variables. Moreover, the set of these variables can be easily expanded with additional parameters of the specific programs. The program code itself is treated as a black box. The response variable of the model is the execution time. The models have been validated within a Large-Scale Computing system that allows for a unified treatment of programs as computation modules. We present the process of training and validation for several different computation modules and discuss the suitability of the proposed models for ACET estimation in various computing environments.

关键词： Execution time algorithm performance High-performance computing Non-linear regression Machine learning

来源：评论

学校读者我要写书评

暂无评论

Automatic recommendation of classification algorithms based on data set characteristics

引用

PATTERN RECOGNITION 2012年第7期45卷 2672-2689页

作者： Song, Qinbao Wang, Guangtao Wang, Chao Xi An Jiao Tong Univ Dept Comp Sci & Technol Xian Peoples R China

Choosing appropriate classification algorithms for a given data set is very important and useful in practice but also is full of challenges. In this paper, a method of recommending classification algorithms is proposed. Firstly the feature vectors of data sets are extracted using a novel method and the performance of classification algorithms on the data sets is evaluated. Then the feature vector of a new data set is extracted, and its k nearest data sets are identified. Afterwards, the classification algorithms of the nearest data sets are recommended to the new data set. The proposed data set feature extraction method uses structural and statistical information to characterize data sets, which is quite different from the existing methods. To evaluate the performance of the proposed classification algorithm recommendation method and the data set feature extraction method, extensive experiments with the 17 different types of classification algorithms, the three different types of data set characterization methods and all possible numbers of the nearest data sets are conducted upon the 84 publicly available UCI data sets. The results indicate that the proposed method is effective and can be used in practice. (C) 2012 Elsevier Ltd. All rights reserved.

关键词： Classification algorithm automatic recommendation Classification Data set characteristics extraction algorithm performance k-Nearest Neighbors

来源：评论

学校读者我要写书评

暂无评论

Comparison of Adaptive Control Architectures for Flutter Suppression

引用

JOURNAL OF GUIDANCE CONTROL AND DYNAMICS 2015年第2期38卷 346-354页

作者： Cassaro, M. Battipede, M. Marzocca, P. Behal, A. Politecn Torino Dept Mech & Aerosp Engn I-10128 Turin Italy Clarkson Univ Dept Mech & Aeronaut Engn Potsdam NY 13699 USA Univ Cent Florida Dept Elect Engn & Comp Sci Orlando FL 32826 USA Univ Cent Florida Nanosci Technol Ctr Orlando FL 32826 USA

A study is conducted to derive and implement a state feedback model reference adaptive control (MRAC) solutions for a 2-D aeroelastic nonlinear system and in evaluating the robustness of different control strategies to damage leading to the deterioration of the structural stiffness characteristics. The standard MRAC, a modified MRAC and the adaptive controller are the three model reference adaptive control solutions analyzed. The standard direct MRAC solution serves as the threshold to assess whether or not the more complex algorithms are an effective improvement to it.

关键词： Model Reference Adaptive Control Aeroelastic Response Stiffness Matrices Dynamic Response Angle of Attack Structural Failure Aerodynamic Moments algorithm performance Phase Diagram Flap Deflection

来源：评论

学校读者我要写书评

暂无评论

performance of antenna array receiver algorithms for CDMA

引用

SIGNAL PROCESSING 1998年第1期68卷 23-41页

作者： Thompson, JS Grant, PM Mulgrew, B Univ Edinburgh Dept Elect Engn Signals & Syst Grp Edinburgh EH9 3JL Midlothian Scotland

This paper considers a number of techniques that have been proposed for spatial filtering purposes in code division multiple access (CDMA) antenna array receivers. There are two main types of algorithms: (i) matched filter methods that maximise the signal power at the filter output and (ii) interference suppression algorithms that maximise the signal-to-interference plus noise ratio (SINR) of the filter output. Theoretical and simulation results are presented to compare the convergence performance, in terms of the attained SINR, for the algorithms in a CDMA cellular system. A method of trading convergence performance with complexity for algorithms using the maximum SINR approach is also discussed. (C) 1998 Elsevier Science B.V. All rights reserved.

关键词： communications signal processing antenna arrays code division multiple access algorithm performance

来源：评论

学校读者我要写书评

暂无评论

Patch and monopole antennas in linear coprime arrays for direction of arrival estimation using compressed sensing

引用

IET MICROWAVES ANTENNAS & PROPAGATION 2020年第2期14卷 209-214页

作者： Oweis, Ahmad, I Alawsh, Saleh A. Muqaibel, Ali H. Sharawi, Mohammad S. King Fahd Univ Petr & Minerals Elect Engn Dept Dhahran Saudi Arabia Polytech Montreal Elect Engn Dept Polygrames Res Ctr Montreal PQ H3T 1J4 Canada

Original work on direction of arrival (DOA) estimation relied on uniform linear arrays (ULAs) of antennas. Most of the work focused on improving the algorithms and the configuration of the antenna array and overlooked the effects of practical antennas on the algorithm performance. Very limited work studied DOA estimation within the physical limitations of handheld devices. In this work, we introduce three nonuniform linear coprime arrays based on patch and monopole antenna elements operating in 2.1 and 5.8 GHz bands and assess their behaviour in DOA estimation. The complex radiation patterns of the arrays were incorporated in the DOA estimation algorithm using compressed sensing (CS). Estimation accuracy is quantified by the root mean square error (RMSE) and the results are compared with those obtained by using isotropic antennas, showing that physical antennas can introduce up to 8 degrees of error. Simulations were also carried out using the multiple signal classification (MUSIC) algorithm to demonstrate the advantage of CS in coprime arrays. The MUSIC algorithm failed to detect all sources even at maximum SNR. The impact of reducing the fundamental inter-element spacing in coprime arrays below $0.5\lambda $0.5 lambda to achieve smaller array sizes is investigated as well.

关键词： antenna radiation patterns array signal processing mean square error methods linear antenna arrays direction-of-arrival estimation signal classification monopole antennas monopole antenna elements complex radiation patterns DOA estimation algorithm compressed sensing estimation accuracy isotropic antennas physical antennas multiple signal classification algorithm MUSIC algorithm smaller array sizes direction of arrival estimation utilised algorithms antenna array practical antennas algorithm performance nonuniform linear coprime arrays frequency 2 1 GHz frequency 5 8 GHz

来源：评论

学校读者我要写书评

暂无评论

Unmanned Aerial System Collision Avoidance Using Artificial Potential Fields

引用

JOURNAL OF AEROSPACE INFORMATION SYSTEMS 2014年第3期11卷 140-144页

作者： Ruchti, Jason Senkbeil, Robert Carroll, James Dickinson, Jared Holt, James Biaz, Saad Auburn Univ Auburn AL 36849 USA

Unmanned aerial systems (UAS) are increasingly popular due to the numerous surveying and military applications. Autonomous UASs require a collision-avoidance algorithm, also known as sense and avoid, to monitor the flight and alert the aircraft to necessary avoidance maneuvers. Artificial potential fields provide a computationally efficient solution to the problem of collision avoidance. This paper integrates existing APF methods into a single algorithm. Furthermore, the algorithm was improved to handle some special cases by adding circling detection and correction. These results indicate that APF is appropriate only in low-density traffic areas. Future work on the algorithm should address more of the special cases created by a densely populated airspace to increase effectiveness. This algorithm may also benefit from hybridization with a predictive algorithm that plans farther into the future.

关键词： Artificial Potential Fields Unmanned Aerial Systems Airspace algorithm performance Operating Systems Fuel Efficiency Path Planning Robots

来源：评论

学校读者我要写书评

暂无评论

STUDY OF STRAPDOWN NAVIGATION ATTITUDE algorithmS

引用

JOURNAL OF GUIDANCE CONTROL AND DYNAMICS 1995年第2期18卷 287-290页

作者： MUSOFF, H MURPHY, JH Charles Stark Draper Laboratory Inc. Cambridge Massachusetts 02139

Typically coning motion has been used as the input to test the effectiveness of attitude algorithms. Jacobian elliptic functions are also shown to meet the criteria for a test input. Simulations using several of these inputs are performed on Miller's algorithm. Analytical evaluation of a Jacobian elliptic function input would be prohibitive. To alleviate this problem Richardson extrapolation is used to numerically evaluate the algorithms for each test input. Additionally, a method for improving all of the attitude algorithms using interpolation is presented.

关键词： Richardson Extrapolation algorithm performance Navigation Attitude algorithms Taylor Series Quaternions Computing performance Euler Equations Angular Motion Gyroscopes Telemetry

来源：评论

学校读者我要写书评

暂无评论

Design and implementation of symbolic algorithms for the computation of generalized asymptotes

引用

ANNALS OF MATHEMATICS AND ARTIFICIAL INTELLIGENCE 2023年第4期91卷 537-561页

作者： de Sevilla, Marian Fernandez Benedicto, Rafael Magdalena Perez-Diaz, Sonia Univ Alcala Dept Comp Sci Ctra Madrid BarcelonaKm 336 Madrid 28871 Spain Univ Valencia Dept Elect Engn Av Univ S-N Valencia 46100 Spain Univ Alcala Dept Phys & Math Ctra Madrid BarcelonaKm 336 Madrid 28871 Spain

In this paper we present two algorithms for computing the g-asymptotes or generalized asymptotes, of a plane algebraic curve, c , implicitly or parametrically defined. The asymptotes of a curve c reflect the status of c at points with sufficiently large coordinates. It is well known that an asymptote of a curve c is a line such that the distance between c and the line approaches zero as they tend to infinity. However, a curve c may have more general curves than lines describing the status of c at infinity. These curves are known as g-asymptotes or generalized asymptotes. The pseudocodes of these algorithms are presented, as well as the corresponding implementations. For this purpose, we use the algebra software Maple. A comparative analysis of the algorithms is carried out, based on some properties of the input curves and their results to analyze the efficiency of the algorithms and to establish comparative criteria. The results presented in this paper are a starting point to generalize this study to surfaces or to curves defined by a non-rational parametrization, as well as to improve the efficiency of the algorithms. Additionally, the methods developed can provide a new and different approach in prediction (regression) or classification algorithms in the machine learning field.

关键词： Algebraic curves Infinity branches Convergent branches Approaching curves Generalized asymptotes algorithm performance Hardware usage

来源：评论

学校读者我要写书评

暂无评论

performance-CHARACTERISTICS OF DIFFERENT SOLVING STRATEGIES IN MULTIVARIATE MIXED MODELS

引用

LIVESTOCK PRODUCTION SCIENCE 1992年第4期30卷 319-332页

作者： GROENEVELD, E KOVAC, M UNIV ILLINOIS DEPT ANIM SCIURBANAIL 61801

Scope and optimization strategies for solving mixed linear models with PEST (general purpose package for multivariate prediction and estimation) are investigated on the basis of three multivariate problems with system sizes of 4116, 30 016 and 472 252 equations. A univariate model with 1 813 168 equations was run to assess the performance of PEST with large problems. Where a submatrix of the mixed model equations was solved simultaneously computing time was reduced to around 1% if compared with complete Gauss-Seidel iteration on data. With the possibility of different incidence matrices for each trait in multivariate models no precorrection of data is required but regressions can be added to the model without much penalty in processing time. Overrelaxation may improve the rate of convergence by 25% and setting a "ceiling" for the number of iterations for the simultaneous part reduced the CPU time by 11%. Cholesky transformation further reduced CPU time between 30 and 50% depending on the required accuracy. The largest system was an animal model for milk yield of nearly 900 000 cows resulting in 1.8 million equations which required 26 Mb of memory during the solving process taking 37 min per round on a SUN 4 workstation.

关键词： algorithm performance MIXED LINEAR MODELS MULTIVARIATE BEST LINEAR UNBIASED PREDICTION

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：