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

Batch, algorithm for global-positioning-system attitude determination and integer ambiguity resolution

JOURNAL OF GUIDANCE CONTROL AND DYNAMICS 2006年第5期29卷 1070-1079页

作者： Psiaki, Mark L. Cornell Univ Sibley Sch Mech & Aerosp Engn Ithaca NY 14853 USA

A new algorithm has been developed for simultaneous determination of attitude and carrier phase integer ambiguities based on data from an array of global-positioning system (GPS) antennas. The purpose of the algorithm is to reduce the required number of tracked GPS satellites and antenna baselines needed to correctly resolve the ambiguities. This new motion-based method relies on data from several sample times. The vehicle must rotate about one or more axes among the samples. The solution algorithm works in two stages. It first solves a nonlinear least-squares problem in which the single-differenced carrier-phase ambiguities are allowed to vary as continuous real numbers. The second stage solves a nonlinear least-squares problem that restricts the ambiguities to be integers. This latter algorithm uses a-combined Newton/Levenberg-Marquardt method to deal with attitude quaternion nonlinearities, and it uses the least-squares ambiguity decorrelation adjustment method to deal with the integers. The second-stage algorithm is very accurate, but it needs to use initial guesses generated from first-stage algorithm solutions to find the global optimum. If the maneuver is large enough, then this new method can reliably solve difficult attitude/ambiguity-resolution problems. This capability has been demonstrated using Monte Carlo simulation. In one set of cases, the new algorithm correctly resolves ambiguities and achieves an accuracy of 4 deg or better when using two GPS satellite signals received by three antennas that are arrayed along 1-m baselines.

关键词： GPS Receiving Antennas Quaternions GPS Satellites algorithm performance Monte Carlo Simulation Satellites Lagrange Multipliers Yaw Aeroplane

来源：评论

学校读者我要写书评

暂无评论

MASS PROPERTY ESTIMATION FOR CONTROL OF ASYMMETRICAL SATELLITES

引用

JOURNAL OF GUIDANCE CONTROL AND DYNAMICS 1987年第5期10卷 483-491页

作者： BERGMANN, EV WALKER, BK LEVY, DR UNIV CINCINNATI AEROSP ENGN & ENGN MECHCINCINNATIOH 45221 USAF DIV SPACELOS ANGELESCA

Real-time algorithms that estimate the mass-property parameters commonly used in spacecraft control laws are developed based upon a stochastic estimation viewpoint. The elements of the inverse inertia matrix and the center-of-mass location vector are estimated from noisy measurements of the angular velocity using a second-order filter, while estimates of the mass reciprocal are generated from noisy linear velocity measurements using a Kalman filter. Simulation results show that the rate of convergence of each estimate depends strongly upon the particular maneuver being performed, but that the mass properties can be estimated to within 1% error.

关键词： Satellites Extended Kalman Filter Spacecraft Control Accelerometer Autopilot algorithm performance Linear Programming Attitude Control Shuttle Orbiter Flight Testing

来源：评论

学校读者我要写书评

暂无评论

A performance analysis of Basin hopping compared to established metaheuristics for global optimization

引用

JOURNAL OF GLOBAL OPTIMIZATION 2024年第3期89卷 803-832页

作者： Baioletti, Marco Santucci, Valentino Tomassini, Marco Univ Perugia Dept Math & Comp Sci Perugia Italy Univ Foreigners Perugia Dept Humanities & Int Social Sci I-06123 Perugia Italy Univ Lausanne Dept Informat Syst Lausanne Switzerland

During the last decades many metaheuristics for global numerical optimization have been proposed. Among them, Basin Hopping is very simple and straightforward to implement, although rarely used outside its original Physical Chemistry community. In this work, our aim is to compare Basin Hopping, and two population variants of it, with readily available implementations of the well known metaheuristics Differential Evolution, Particle Swarm Optimization, and Covariance Matrix Adaptation Evolution Strategy. We perform numerical experiments using the IOH profiler environment with the BBOB test function set and two difficult real-world problems. The experiments were carried out in two different but complementary ways: by measuring the performance under a fixed budget of function evaluations and by considering a fixed target value. The general conclusion is that Basin Hopping and its newly introduced population variant are almost as good as Covariance Matrix Adaptation on the synthetic benchmark functions and better than it on the two hard cluster energy minimization problems. Thus, the proposed analyses show that Basin Hopping can be considered a good candidate for global numerical optimization problems along with the more established metaheuristics, especially if one wants to obtain quick and reliable results on an unknown problem.

关键词： Global optimization Metaheuristics Basin hopping algorithm performance

来源：评论

学校读者我要写书评

暂无评论

OPTIMAL STRAPDOWN ATTITUDE INTEGRATION algorithmS

引用

JOURNAL OF GUIDANCE CONTROL AND DYNAMICS 1990年第2期13卷 363-369页

作者： IGNAGNI, MB Honeywell Systems and Research Center Minneapolis Minnesota

The paper examines various algorithms for integrating the noncommutivity rate equation arising in the implementation of the attitude reference function of a strapdown inertial navigation system, and derives a class of optimized algorithms for performing this integration. The accuracy characteristics associated with each of the algorithms, when the system is exposed to pure coning motion, as well as to a generalized vibrational environment, are defined. The class of optimized algorithms is shown to minimize the mean error in the correction provided by the algorithm in a generalized vibrational environment. (Author)

关键词： algorithm performance Strapdown Inertial Navigation System Angular Motion Selection algorithm Digital Computers Inertial Sensor

来源：评论

学校读者我要写书评

暂无评论

DESIGNING REDUCED-ORDER LINEAR-MULTIVARIABLE CONTROLLERS USING EXPERIMENTALLY DERIVED PLANT-DATA

引用

JOURNAL OF GUIDANCE CONTROL AND DYNAMICS 1993年第1期16卷 53-58页

作者： FRAZIER, WG IRWIN, RD Ohio University Athens Ohio 45701

An iterative numerical algorithm for simultaneously improving multiple performance and stability robustness criteria for multivariable feedback systems is developed. The unsatisfied design criteria are improved by updating the free parameters of an initial, stabilizing controller's state-space matrices. Analytical expressions for the gradients of the design criteria are employed to determine a parameter correction that improves all of the feasible, unsatisfied design criteria al each iteration. A controller design is performed using the algorithm with experimentally derived data from a large space structure test facility. Experimental results of the controller's performance at the facility are presented.

关键词： Large Space Structures Numerical algorithms Open Loop Controller Linear Quadratic Gaussian Mathematical Models Control System Design algorithm performance Frequency Domain NASA Marshall Space Flight Center Search algorithm

来源：评论

学校读者我要写书评

暂无评论

Autonomous fault detection and removal using GPS carrier phase

引用

IEEE TRANSACTIONS ON AEROSPACE AND ELECTRONIC SYSTEMS 1998年第3期34卷 897-906页

作者： Pervan, BS Lawrence, DG Parkinson, BW Stanford Univ Dept Aeronaut & Astronaut Stanford CA 94305 USA

This paper is focused on the use of carrier phase measurements and parity space methodology to investigate the limits of high-integrity and high-continuity satellite-based navigation performance. In this regard, a new algorithm for receiver autonomous fault detection and removal is developed with the specific goal of attaining the high levels of integrity and continuity required for aircraft precision approach and landing applications. Fault detection and removal algorithm performance is demonstrated through analysis and simulation, and the results of tests using deliberately induced failures in raw night data are presented.

关键词： Global Positioning System aerospace simulation aircraft landing guidance fault diagnosis least squares approximations state-space methods GPS carrier phase aircraft precision approach and landing algorithm performance autonomous fault detection and remov State-space methods carrier phase aerospace simulation Defect detection carrier phase measurements Fault diagnosis aircraft landing guidance

来源：评论

学校读者我要写书评

暂无评论

A note on circle packing

引用

Journal of Zhejiang University-Science C(Computers and Electronics) 2012年第8期13卷 559-564页

作者： Young Joon AHN Christoph M. HOFFMANN Paul ROSEN Department of Mathematics Education Chosun University Gwangju 501-759 Korea Department of Computer Science Purdue University West Lafayette IN 47907 USA Scientific Computing and Imaging Institute University of Utah Salt Lake City UT 84112 USA

The problem of packing circles into a domain of prescribed topology is considered. The circles need not have equal radii. The Collins-Stephenson algorithm computes such a circle packing. This algorithm is parMlelized in two different ways and its performance is reported for a triangular, planar domain test case. The implementation uses the highly parallel graphics processing unit （GPU） on commodity hardware. The speedups so achieved are discussed based on a number of experiments.

关键词： Circle packing algorithm performance Parallel computation Graphics processing unit (GPU)

来源：评论

学校读者我要写书评

暂无评论

The Diameter of the Rubik's Cube Group Is Twenty

引用

SIAM REVIEW 2014年第4期56卷 645-670页

作者： Rokicki, Tomas Kociemba, Herbert Davidson, Morley Dethridge, John Kent State Univ Dept Math Sci Kent OH 44242 USA Google Inc Mountain View CA 94043 USA

We give an expository account of our computational proof that every position of the Rubik's Cube can be solved in 20 moves or fewer, where a move is defined as any twist of any face. The roughly 4.3x10(19) positions are partitioned into about two billion cosets of a specially chosen subgroup, and the count of cosets required to be treated is reduced by considering symmetry. The reduced space is searched with a program capable of solving one billion positions per second, using about one billion seconds of CPU time donated by Google. As a byproduct of determining that the diameter is 20, we also find the exact count of cube positions at distance 15.

关键词： group theory algorithm performance Rubik's Cube

来源：评论

学校读者我要写书评

暂无评论

A coupled-contour model for effective segmentation of cotton cross-sections in wide-field microscopic images

引用

TEXTILE RESEARCH JOURNAL 2017年第12期87卷 1509-1521页

作者： Wang, Quande Xu, Bugao Wuhan Univ Sch Elect Informat Wuhan Peoples R China Univ Texas Austin Sch Human Ecol 200 W 24th St Austin TX 78712 USA

Image analysis of a fiber cross-section can provide direct measurements for cotton maturity. Effective segmentation of fiber contours in a cross-sectional image is paramount for accurate fiber geometrical measurements. In a wide-field microscopic image, the adhesion, breakage, and ambiguity (low contrast or noise) of fiber contours make the segmentation rather challenging. This paper presents a new approach for contour segmentation that takes advantage of the shape features of the triple concentric contours, called the coupled-contour model (CCM), of a cross-section, and a CCM-based algorithm developed to locate, split, merge, and refine fiber contours based on the established rules concerning contour features. For a wide-field microscopic image (12 megapixels), this CCM-based algorithm could detect >500 fiber cross-sections with a recall rate of 93.53% and a precision rate of 98.13%, and reduced the errors in maturity measurements by 50%.

关键词： cotton cross-section contour detection contour refinement algorithm performance

来源：评论

学校读者我要写书评

暂无评论

Impact of chaotic dynamics on the performance of metaheuristic optimization algorithms: An experimental analysis

引用

INFORMATION SCIENCES 2022年 587卷 692-719页

作者： Zelinka, Ivan Diep, Quoc Bao Snasel, Vaclav Das, Swagatam Innocenti, Giacomo Tesi, Alberto Schoen, Fabio Kuznetsov, Nikolay V. VSB TUO Fac Elect Engn & Comp Sci Dept Comp Sci 17 Listopadu 2172-15 Ostrava 70800 Czech Republic Indian Stat Inst Elect & Commun Sci Unit 203 B T Rd Kolkata 700108 India Univ Florence Dept Informat Engn DINFO Via Santa Marta 3 Florence Italy St Petersburg State Univ Fac Math & Mech St Petersburg 198504 Russia Univ Jyvaskyla Fac Informat Technol Jyvaskyla 40014 Finland Russian Acad Sci Inst Problems Mech Engn Bolshoj Pr 61 St Petersburg 199178 Russia

Y Random mechanisms including mutations are an internal part of evolutionary algorithms, which are based on the fundamental ideas of Darwin's theory of evolution as well as Mendel's theory of genetic heritage. In this paper, we debate whether pseudo-random processes are needed for evolutionary algorithms or whether deterministic chaos, which is not a random process, can be suitably used instead. Specifically, we compare the performance of 10 evolutionary algorithms driven by chaotic dynamics and pseudo-random number generators using chaotic processes as a comparative study. In this study, the logistic equation is employed for generating periodical sequences of different lengths, which are used in evolutionary algorithms instead of randomness. We suggest that, instead of pseudorandom number generators, a specific class of deterministic processes (based on deterministic chaos) can be used to improve the performance of evolutionary algorithms. Finally, based on our findings, we propose new research questions. (C) 2021 The Author(s). Published by Elsevier Inc.

关键词： Deterministic chaos Swarm intelligence Evolutionary algorithms algorithm dynamics algorithm performance

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：