Informacja

Drogi użytkowniku, aplikacja do prawidłowego działania wymaga obsługi JavaScript. Proszę włącz obsługę JavaScript w Twojej przeglądarce.

English (EN)·Polski (PL)·Yкраїнський (UK)
Przejdź do strony domowej biblioteki Centralna Biblioteka Wojskowa Link otwiera się w nowym oknie Logo biblioteki Prolib Integro - strona głównaCentralna Biblioteka Wojskowa

Wyszukujesz frazę "estimation algorithm" wg kryterium: Temat

  Lista filtrów
Wyrównaj
Wyświetlanie 1-25 z 32
Tytuł:
Methods for lithium-based battery energy storage SOC estimation. Part I: Overview
Autorzy:
Hallmann, Marcel
Wenge, Christoph
Komarnicki, Przemysław
Balischewski, Stephan
Powiązania:
https://bibliotekanauki.pl/articles/2042794.pdf
Data publikacji:
2022
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
battery modeling
equivalent circuit
estimation algorithm
lithium-ion battery
energy storage
simulation
state of charge
SOC
Opis:
The use of lithium-ion battery energy storage (BES) has grown rapidly during the past year for both mobile and stationary applications. For mobile applications, BES units are used in the range of 10–120 kWh. Power grid applications of BES are characterized by much higher capacities (range of MWh) and this area particularly has great potential regarding the expected energy system transition in the next years. The optimal operation of BES by an energy storage management system is usually predictive and based strongly on the knowledge about the state of charge (SOC) of the battery. The SOC depends on many factors (e.g. material, electrical and thermal state of the battery), so that an accurate assessment of the battery SOC is complex. The SOC intermediate prediction methods are based on the battery models. The modeling of BES is divided into three types: fundamental (based on material issues), electrical equivalent circuit (based on electrical modeling) and balancing (based on a reservoir model). Each of these models requires parameterization based on measurements of input/output parameters. These models are used for SOC modelbased calculation and in battery system simulation for optimal battery sizing and planning. Empirical SOC assessment methods currently remain the most popular because they allow practical application, but the accuracy of the assessment, which is the key factor for optimal operation, must also be strongly considered. This scientific contribution is divided into two papers. Paper part I will present a holistic overview of the main methods of SOC assessment. Physical measurement methods, battery modeling and the methodology of using the model as a digital twin of a battery are addressed and discussed. Furthermore, adaptive methods and methods of artificial intelligence, which are important for the SOC calculation, are presented. In paper part II, examples of the application areas are presented and their accuracy is discussed
Źródło:
Archives of Electrical Engineering; 2022, 71, 1; 139-157
1427-4221
2300-2506
Pojawia się w:
Archives of Electrical Engineering
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Methods for lithium-based battery energy storage SOC estimation. Part II: Application and accuracy
Autorzy:
Hallmann, Marcel
Wenge, Christoph
Komarnicki, Przemysław
Powiązania:
https://bibliotekanauki.pl/articles/2086687.pdf
Data publikacji:
2022
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
battery modeling and simulation
estimation algorithm
equivalent circuit
introduction
lithium-ion battery energy storage
state of charge (SOC)
Opis:
Climate change is driving the transformation of energy systems from fossil to renewable energies. In industry, power supply systems and electro-mobility, the need for electrical energy storage is rising sharply. Lithium-based batteries are one of the most widely used technologies. Operating parameters must be determined to control the storage system within the approved operating limits. Operating outside the limits, i.e., exceeding or falling below the permitted cell voltage, can lead to faster aging or destruction of the cell. Accurate cell information is required for optimal and efficient system operation. The key is high-precision measurements, sufficiently accurate battery cell and system models, and efficient control algorithms. Increasing demands on the efficiency and dynamics of better systems require a high degree of accuracy in determining the state of health and state of charge (SOC). These scientific contributions to the above topics are divided into two parts. In the first part of the paper, a holistic overview of the main SOC assessment methods is given. Physical measurement methods, battery modeling, and the methodology of using the model as a digital twin of a battery are addressed and discussed. In addition, adaptive methods and artificial intelligence methods that are important for SOC calculation are presented. Part two of the paper presents examples of the application areas and discusses their accuracy.
Źródło:
Archives of Electrical Engineering; 2022, 71, 2; 311--323
1427-4221
2300-2506
Pojawia się w:
Archives of Electrical Engineering
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Software Systems Clustering Using Estimation of Distribution Approach
Autorzy:
Tajgardan, M.
Izadkhah, H.
Lotfi, S.
Powiązania:
https://bibliotekanauki.pl/articles/108635.pdf
Data publikacji:
2016
Wydawca:
Społeczna Akademia Nauk w Łodzi
Tematy:
Software System
Clustering, Genetic Algorithm
Estimation of Distribution Algorithm (EDA)
Probability Model
Opis:
Software clustering is usually used for program understanding. Since the software clustering is a NP-complete problem, a number of Genetic Algorithms (GAs) are proposed for solving this problem. In literature, there are two wellknown GAs for software clustering, namely, Bunch and DAGC, that use the genetic operators such as crossover and mutation to better search the solution space and generating better solutions during genetic algorithm evolutionary process. The major drawbacks of these operators are (1) the difficulty of defining operators, (2) the difficulty of determining the probability rate of these operators, and (3) do not guarantee to maintain building blocks. Estimation of Distribution (EDA) based approaches, by removing crossover and mutation operators and maintaining building blocks, can be used to solve the problems of genetic algorithms. This approach creates the probabilistic models from individuals to generate new population during evolutionary process, aiming to achieve more success in solving the problems. The aim of this paper is to recast EDA for software clustering problems, which can overcome the existing genetic operators’ limitations. For achieving this aim, we propose a new distribution probability function and a new EDA based algorithm for software clustering. To the best knowledge of the authors, EDA has not been investigated to solve the software clustering problem. The proposed EDA has been compared with two well-known genetic algorithms on twelve benchmarks. Experimental results show that the proposed approach provides more accurate results, improves the speed of convergence and provides better stability when compared against existing genetic algorithms such as Bunch and DAGC.
Źródło:
Journal of Applied Computer Science Methods; 2016, 8 No. 2; 99-113
1689-9636
Pojawia się w:
Journal of Applied Computer Science Methods
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Nowy algorytm estymacji pozycji źródła emisji elektromagnetycznej
A new algorithm for determining of radar position
Autorzy:
Kawalec, A.
Wajszczyk, B.
Powiązania:
https://bibliotekanauki.pl/articles/210668.pdf
Data publikacji:
2006
Wydawca:
Wojskowa Akademia Techniczna im. Jarosława Dąbrowskiego
Tematy:
rozpoznanie radioelektroniczne
źródła emisji
lokalizacja źródła emisji
radar recognition
algorithm for emitter position estimation
Opis:
Lokalizacja, czyli określenie miejsca położenia źródła emisji, jest istotnym, a często najważniejszym, elementem łańcucha czynności (zadań) systemu rozpoznania radioelektronicznego, takich jak: wykrywanie (przechwyt) emisji sygnałów elektromagnetycznych, namierzanie, czyli określanie kierunku na źródło emisji, analiza sygnałów w celu klasyfikacji różnych typów (ocena zagrożenia) i identyfikacji egzemplarzy źródeł emisji tego samego typu. W złożonych sytuacjach pomiarowych estymacja miejsca położenia źródła emisji, wykorzystująca dotychczasowe klasyczne metody rozwiązywania równań liniowych, oparte na metodzie najmniejszej sumy kwadratów, często prowadzi do powstania bardzo dużych błędów w ocenie pozycji źródła emisji. W artykule omówiono nowy beziteracyjny algorytm lokalizacji źródeł emisji, będący szczególną implementacją metody najmniejszej sumy kwadratów. Algorytm ten umożliwia estymację pozycji źródeł emisji w przestrzeni. W pracy przedstawiono wyniki przeprowadzonych badań dla nowego algorytmu oraz porównano uzyskane rezultaty z rozwiązaniami obecnie wykorzystywanymi w urządzeniach rozpoznania radioelektronicznego. W przypadkach złego uwarunkowania zagadnienia, regularyzacja Tichonova umożliwia osiągnięcie poprawnego wyniku estymacji oraz zapewnia stabilność numeryczną algorytmu. Dla nowego algorytmu stosowanie regularyzacji Tichonowa nie jest wymagane. Poprawia to jego efektywność.
A problem of localising position of point emitter in Cartesian co-ordinates from passive radar bearings can be formulated as a linear least squares problem. A non-iterative algorithm of triangulation method, being an implementation of linear least squares method, is presented. The algorithm enables us fast and reliable spatial localisation of electromagnetic emitter. The characteristic features of the new algorithm follow from the results of numerical experiments. The results of its testing on simulated data are given. The new algorithm enables us reliable determination of all three co-ordinates of emitter position, especially when the signal receiving points are in array of angle forwards or backwards. The errors in estimated emitter position are for most cases of bearings much smaller then those produced by the matrix estimation algorithm frequently commented and referred to in literature.
Źródło:
Biuletyn Wojskowej Akademii Technicznej; 2006, 55, 1; 5-23
1234-5865
Pojawia się w:
Biuletyn Wojskowej Akademii Technicznej
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Zastosowanie regularyzowanej metody najmniejszych kwadratów w algorytmach lokalizacji źródeł emisji
An estimation of microwave emitter position based on regularisation of a least-squares method
Autorzy:
Kawalec, A.
Wajszczyk, B.
Powiązania:
https://bibliotekanauki.pl/articles/210670.pdf
Data publikacji:
2006
Wydawca:
Wojskowa Akademia Techniczna im. Jarosława Dąbrowskiego
Tematy:
rozpoznanie radioelektroniczne
źródła emisji
lokalizacja źródła emisji
radar recognition
algorithm for emitter position estimation
Opis:
Stosowane dotychczas algorytmy estymacji położenia obiektu w systemach rozpoznania radioelektronicznego wymagają wprowadzania określonych ograniczeń, które wynikają z tzw. zagadnień niepoprawnie postawionych. Prowadzi to do powstawania znacznych błędów w określaniu pozycji emitera lub wręcz uniemożliwia jego wyznaczenie. Metody rozwiązywania zagadnień niepoprawnie postawionych w fizyce matematycznej polegają na stosowaniu regularyzacji, z których najbardziej znana jest regularyzacja Tichonova. W tym zakresie bardzo aktualne są poszukiwania algorytmów w rozwiązywaniu istniejących problemów związanych z obliczeniami numerycznymi określania pozycji emitera na podstawie danych pomiarowych. W artykule przedstawiono zmodyfikowaną wersję algorytmu lokalizacji źródeł emisji dla metody wcięcia w przód, zbudowanego w oparciu o metodę najmniejszych kwadratów otrzymywania estymatorów. Modyfikacja algorytmu polegała na rozwiązaniu zadania przy wykorzystaniu rozkładu macierzy według wartości szczególnych (ang. Singular Value Decomposition) oraz zastosowaniu regularyzacji Tichonowa. Dla tego algorytmu przedstawiono wyniki przeprowadzonych badań.
The basic method of passive radar reconnaissance of microwave emitter position is intersection triangulation method. In this paper, a modified version of iterative matrix estimator algorithm for localising emitter by intersection method is presented. The problem of emitter localisation should be regularised. The variant of the iterative algorithm for localising emitter, modified by exploiting Tikhonov regularisation with constant parameter is stable. The value of parameter was chosen on the base of results of numerical experiments. Such regularisation makes possible to obtain estimates of emitter position in the case of their inconsistency or singularity. Better, finite (i.e. non-iterative) method together with regularising algorithm by the authors is presented in this paper.
Źródło:
Biuletyn Wojskowej Akademii Technicznej; 2006, 55, 1; 25-39
1234-5865
Pojawia się w:
Biuletyn Wojskowej Akademii Technicznej
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A highly accurate DFT-based parameter estimator for complex exponentials
Autorzy:
Tsui, J.
Reisenfeld, S.
Powiązania:
https://bibliotekanauki.pl/articles/309144.pdf
Data publikacji:
2006
Wydawca:
Instytut Łączności - Państwowy Instytut Badawczy
Tematy:
frequency estimation
phase estimation
amplitude estimation
DFT-based parameter estimation
spectral estimation
digital signal processing algorithm
complex exponential parameter estimation
Opis:
A highly accurate DFT-based complex exponential parameter estimation algorithm is presented in this paper. It will be shown that for large number of samples and high signal to noise ratio (SNR), the phase estimation error variance performance is only 0.0475 dB above the Cramer-Rao lower bound (CRLB) for phase estimation with unknown frequency and phase. The amplitude estimation error variance performance was found to lay on the CRLB for amplitude estimation. Exact phase and amplitude estimation can be achieved in the noiseless case with this algorithm. The algorithm has low implementation computational complexity and is suitable for numerous real time digital signal processing applications.
Źródło:
Journal of Telecommunications and Information Technology; 2006, 1; 76-82
1509-4553
1899-8852
Pojawia się w:
Journal of Telecommunications and Information Technology
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Algorithm aversion: Sensitivity to interventions and the relationship with numeracy
Autorzy:
Dzieżyk, Michał
Hetmańczuk, Weronika
Traczyk, Jakub
Powiązania:
https://bibliotekanauki.pl/articles/2127587.pdf
Data publikacji:
2020
Wydawca:
Akademia Leona Koźmińskiego w Warszawie
Tematy:
algorithm aversion
numeracy
estimation
augmented decisions
good decisions
Opis:
The main goal of this research was to investigate whether people exhibit algorithm aversion—a tendency to avoid using an imperfect algorithm even if it outperforms human judgments—in the case of estimating students’ percentile scores on a standardized math test. We also explored the relationships between numeracy and algorithm aversion and tested two interventions aimed at reducing algorithm aversion. In two studies, we asked participants to estimate the percentiles of 46 real 15-year-old Polish students on a standardized math test. Participants were offered the opportunity to compare their estimates with the forecasts of an algorithm — a statistical model that predicted real percentile scores based on fi ve explanatory variables (i.e., gender, repeating a class, the number of pages read before the exam, the frequency of playing online games, socioeconomic status). Across two studies, we demonstrated that even though the predictions of the statistical model were closer to students’ percentile scores, participants were less likely to rely on the statistical model predictions in making forecasts. We also found that higher statistical numeracy was related to a higher reluctance to use the algorithm. In Study 2, we introduced two interventions to reduce algorithm aversion. Depending on the experimental condition, participants either received feedback on statistical model predictions or were provided with a detailed description of the statistical model. We found that people, especially those with higher statistical numeracy, avoided using the imperfect algorithm even though it outperformed human judgments. Interestingly, a simple intervention that explained how the statistical model works led to better performance in an estimation task.
Źródło:
Decyzje; 2020, 34; 67-90
1733-0092
2391-761X
Pojawia się w:
Decyzje
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Multivariate kernel density estimation with a parametric support
Autorzy:
Jarnicka, J.
Powiązania:
https://bibliotekanauki.pl/articles/255530.pdf
Data publikacji:
2009
Wydawca:
Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
Tematy:
density estimation
kernel
bandwidth
kernel density estimator
EM algorithm
Opis:
We consider kernel density estimation in the multivariate case, focusing on the use of some elements of parametric estimation. We present a two-step method, based on a modification of the EM algorithm and the generalized kernel density estimator, and compare this method with a couple of well known multivariate kernel density estimation methods.
Źródło:
Opuscula Mathematica; 2009, 29, 1; 41-55
1232-9274
2300-6919
Pojawia się w:
Opuscula Mathematica
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Algorithms of parallel calculations in task of tolerance ellipsoidal estimation of interval model parameters
Autorzy:
Dyvak, M.
Stakhiv, P.
Pukas, A.
Powiązania:
https://bibliotekanauki.pl/articles/201054.pdf
Data publikacji:
2012
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
interval model
parameters identification
tolerance ellipsoidal estimation
parallel algorithm
Opis:
The methods of the tolerance ellipsoidal estimation for the tasks of synthesis of the tolerances to parameters of radio-electronic circuits and possibility of its parallelization are considered. These methods are the result of the task of estimation the solutions of an interval system of linear algebraic equations (ISLAE) which is built according to given criteria of optimality. The numerical algorithm is proposed for solving the tolerance ellipsoidal estimation tasks with a possibility of parallelization.
Źródło:
Bulletin of the Polish Academy of Sciences. Technical Sciences; 2012, 60, 1; 159-164
0239-7528
Pojawia się w:
Bulletin of the Polish Academy of Sciences. Technical Sciences
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Method of Colour Segmentation in Two Dimensional Images
Metody segmentacji kolorów w obrazach dwuwymiarowych
Autorzy:
Korzeniewski, Jerzy
Powiązania:
https://bibliotekanauki.pl/articles/904923.pdf
Data publikacji:
2004
Wydawca:
Uniwersytet Łódzki. Wydawnictwo Uniwersytetu Łódzkiego
Tematy:
colour segmentation
EM algorithm
non-parametric density estimation
pixel clustering
Opis:
The paper is divided into two parts. In the first part an overview of some selected methods of segmenting colours in two dimensional images is given. In the second part a new algorithm is proposed. The new algorithm is different from other algorithms due to its stress on accuracy of colour classes, the smallest possible number of colour classes (conditionally on paramameter choice) and due to smaller stress on the small number of eventual segments. The algorithm performance is assessed through applications to the segmentation a couple of colourful images.
Źródło:
Acta Universitatis Lodziensis. Folia Oeconomica; 2004, 175
0208-6018
2353-7663
Pojawia się w:
Acta Universitatis Lodziensis. Folia Oeconomica
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Complexity study of guaranteed state estimation for real time robot localization
Autorzy:
Seignez, E.
Lambert, A.
Powiązania:
https://bibliotekanauki.pl/articles/384760.pdf
Data publikacji:
2011
Wydawca:
Sieć Badawcza Łukasiewicz - Przemysłowy Instytut Automatyki i Pomiarów
Tematy:
autonomous robot
data fusion
localization
bounded error state estimation
algorithm
Opis:
The estimation of a vehicle configuration in its environment is mostly solved by Bayesian methods. Interval analysis allows an alternative approach: bounded-error localization. Such an approach provides a bounded set of configuration that is guaranteed to include the actual vehicle configuration. This paper describes the boundederror localization algorithms and presents their complexity study. A real time implementation of the studied algorithms is validated through the use of an experimental platform.
Źródło:
Journal of Automation Mobile Robotics and Intelligent Systems; 2011, 5, 2; 12-27
1897-8649
2080-2145
Pojawia się w:
Journal of Automation Mobile Robotics and Intelligent Systems
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Large and moderate deviation principles for nonparametric recursive kernel distribution estimators defined by stochastic approximation method
Autorzy:
Slaoui, Yousri
Powiązania:
https://bibliotekanauki.pl/articles/254712.pdf
Data publikacji:
2019
Wydawca:
Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
Tematy:
distribution estimation
stochastic approximation algorithm large and moderate deviations principles
Opis:
In this paper we prove large and moderate deviations principles for the recursive kernel estimators of a distribution function defined by the stochastic approximation algorithm. We show that the estimator constructed using the stepsize which minimize the Mean Integrated Squared Error (MISE) of the class of the recursive estimators defined by Mokkadem et al. gives the same pointwise large deviations principle (LDP) and moderate deviations principle (MDP) as the Nadaraya kernel distribution estimator.
Źródło:
Opuscula Mathematica; 2019, 39, 5; 733-746
1232-9274
2300-6919
Pojawia się w:
Opuscula Mathematica
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A new mutual coupling compensation method for receiving antenna array-based DOA estimation
Autorzy:
Parhizgar, N.
Powiązania:
https://bibliotekanauki.pl/articles/141040.pdf
Data publikacji:
2018
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
antenna array
beamforming
compensation matrix
DOA estimation
mutual coupling
MUSIC algorithm
Opis:
Most receiving antenna arrays suffer from the mutual coupling problem between antenna elements, which can critically influence the performance of the array. In this work, a novel and accurate form of compensation matrix is applied to compensate the mutual coupling in a uniform linear array (ULA). This is achieved by applying a new method based on solving a boundary value problem for the whole ULA. In this method, both self and mutual impedances are exploited in an accurate characterization of mutual impedance matrix which results in a perfect mutual coupling compensation method, and hence a very accurate direction of arrival (DOA) estimation. In the new scheme, the compensation matrix is obtained by using the relationship between measured voltage and theoretical coupled voltage based on the MOM. Numerical results show that using DOA estimation algorithms to the decoupled voltage obtained by using this method leads to an excellent performance of DOA estimation with higher accuracy and resolution.
Źródło:
Archives of Electrical Engineering; 2018, 67, 2; 419--431
1427-4221
2300-2506
Pojawia się w:
Archives of Electrical Engineering
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A Novel Technique of Optimization for the COCOMO II Model Parameters using Teaching-Learning-Based Optimization Algorithm
Autorzy:
Khuat, T. T.
Le, M. H.
Powiązania:
https://bibliotekanauki.pl/articles/309064.pdf
Data publikacji:
2016
Wydawca:
Instytut Łączności - Państwowy Instytut Badawczy
Tematy:
COCOMO II
cost estimation
NASA software
optimization
teaching-learning-based optimization algorithm
Opis:
Software cost estimation is a critical activity in the development life cycle for controlling risks and planning project schedules. Accurate estimation of the cost before the start-up of a project is essential for both the developers and the customers. Therefore, many models were proposed to address this issue, in which COCOMO II has been being widely employed in actual software projects. Good estimation models, such as COCOMO II, can avoid insufficient resources being allocated to a project. However, parameters for estimation formula in this model have not been optimized yet, and so the estimated results are not close to the actual results. In this paper, a novel technique to optimize the coefficients for COCOMO II model by using teaching-learning-based optimization (TLBO) algorithm is proposed. The performance of the model after optimizing parameters was tested on NASA software project dataset. The obtained results indicated that the improvement of parameters provided a better estimation capabilities compared to the original COCOMO II model.
Źródło:
Journal of Telecommunications and Information Technology; 2016, 1; 84-89
1509-4553
1899-8852
Pojawia się w:
Journal of Telecommunications and Information Technology
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A factor graph based genetic algorithm
Autorzy:
Helmi, B. H.
Rahmani, A. T.
Pelikan, M.
Powiązania:
https://bibliotekanauki.pl/articles/330811.pdf
Data publikacji:
2014
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
optimization problem
genetic algorithm
estimation
distribution algorithm
factor graph
matrix factorization
problem optymalizacji
algorytm genetyczny
algorytm estymacji rozkładu
faktoryzacja macierzy
Opis:
We propose a new linkage learning genetic algorithm called the Factor Graph based Genetic Algorithm (FGGA). In the FGGA, a factor graph is used to encode the underlying dependencies between variables of the problem. In order to learn the factor graph from a population of potential solutions, a symmetric non-negative matrix factorization is employed to factorize the matrix of pair-wise dependencies. To show the performance of the FGGA, encouraging experimental results on different separable problems are provided as support for the mathematical analysis of the approach. The experiments show that FGGA is capable of learning linkages and solving the optimization problems in polynomial time with a polynomial number of evaluations.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2014, 24, 3; 621-633
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Prediction of ship's speed through ground using the previous voyage's drift speed
Autorzy:
Yamane, D.
Kano, T.
Powiązania:
https://bibliotekanauki.pl/articles/24201461.pdf
Data publikacji:
2023
Wydawca:
Uniwersytet Morski w Gdyni. Wydział Nawigacyjny
Tematy:
machine learning
weather routing
ship's speed estimation
drift speed
algorithm
route planning
tidal current
Opis:
In recent years, 'weather routing' has been attracting increasing attention as a means of reducing costs and environmental impact. In order to achieve high-quality weather routing, it is important to accurately predict the ship's speed through ground during a voyage from ship control variables and predicted data on weather and sea conditions. Because sea condition forecasts are difficult to produce in-house, external data is often used, but there is a problem that the accuracy of sea condition forecasts is not sufficient and it is impossible to improve the accuracy of the forecasts because the data is external. In this study, we propose a machine learning method for predicting speed through ground by considering the actual values of the previous voyage’s drift speed for ships that regularly operate on the same route, such as ferries. Experimental results showed that this method improves the prediction performance of ship’s speed through ground.
Źródło:
TransNav : International Journal on Marine Navigation and Safety of Sea Transportation; 2023, 17, 1; 129--137
2083-6473
2083-6481
Pojawia się w:
TransNav : International Journal on Marine Navigation and Safety of Sea Transportation
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Application of multiple criteria evolutionary algorithms to vector optimisation, decision support and reference point approaches
Autorzy:
Szczepański, M.
Wierzbicki, A.P.
Powiązania:
https://bibliotekanauki.pl/articles/307706.pdf
Data publikacji:
2003
Wydawca:
Instytut Łączności - Państwowy Instytut Badawczy
Tematy:
algorytm ewolucyjny
optymalizacja wektorowa
evolutionary algorithm
vector optimisation
nadir point estimation
reference point techniques
Opis:
Multiple criteria evolutionary algorithms, being essentially parallel in their character, are a natural instrument of finding a representation of entire Pareto set (set of solutions and outcomes non-dominated in criteria space) for vector optimisation problems. However, it is well known that Pareto sets for problems with more than two criteria might become complicated and their representation very time-consuming. Thus, the application of such algorithms is essentially limited to bi-criteria problems or to vector optimisation problems with more criteria but of simple structure. Even in such cases, there are problems related to various important aspects of vector optimisation, such as the uniformity of representation of Pareto set, stopping tests or the accuracy of representing Pareto set, that are not fully covered by the broad literature on evolutionary algorithms in vector optimisation. These problems and related computational tests and experience are discussed in the paper. In order to apply evolutionary algorithms for decision support, it would be helpful to use them in an interactive mode. However, evolutionary algorithms are in their essence global and of batch type. Nevertheless, it is possible to introduce interactive aspects to evolutionary algorithms by focusing them on a part of Pareto set. The results of experimental tests of such modifications of evolutionary algorithms for vector optimisation are presented in the paper. Another issue related to vector optimisation problems with more than two criteria is the computational difficulty of estimating nadir points of Pareto set. The paper describes the use of diverse variants of evolutionary algorithms to the estimation of nadir points, together with experimental evidence.
Źródło:
Journal of Telecommunications and Information Technology; 2003, 3; 16-33
1509-4553
1899-8852
Pojawia się w:
Journal of Telecommunications and Information Technology
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Calculating surface current distribution in antenna array in the presence of mutual coupling by analytical solving of Pocklington’s integral equation
Autorzy:
Parhizgar, N.
Powiązania:
https://bibliotekanauki.pl/articles/141622.pdf
Data publikacji:
2018
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
antenna array
current distribution
DOA estimation
MUSIC algorithm
mutual coupling effect
Pocklington’s integral equation
Opis:
In this article, the current distribution of an antenna array in the presence of mutual coupling is calculated analytically by solving Pocklington’s integral equation. Blockpulse and Galerkin’s functions are used for numerical solving of Pocklington’s integral equation. In this work, the surface current distribution can be achieved for an antenna array in receiving mode, with any arbitrary structure and various numbers of elements. In all previous works, the authors have been tried to solve Pocklington’s integral equation for a single half dipole antenna in transmitting mode. Pocklington’s equation is somehow difficult to work with because of the singularity and existence of a sharp peak for a small value of wire’s radius. In order to calculate surface current distribution, for thin wires, singularity part is extracted from the kernel in aforementioned integral. Hence, the kernel is decomposed into singular and nonsingular parts. An inter-element mutual coupling effect between array elements and self-coupling for each element are assumed in this case. The validity of the proposed methodology is tested by numerical simulation results. The accuracy of the proposed method is evaluated by the multiple signal classification (MUSIC) algorithm for different scenarios to direction of arrival (DOA) estimation.
Źródło:
Archives of Electrical Engineering; 2018, 67, 1; 65-79
1427-4221
2300-2506
Pojawia się w:
Archives of Electrical Engineering
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Variable- and Fixed-Structure Augmented Interacting Multiple-Model Algorithms for Manoeuvring Ship Tracting Based on New Ship Models
Autorzy:
Semerdjiev, E.
Mihaylova, L.
Powiązania:
https://bibliotekanauki.pl/articles/911219.pdf
Data publikacji:
2000
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
model niepewności
estymacja parametryczna
Interacting Multiple Model (IMM) algorithm
model uncertainty
state and parameter estimation
Opis:
Real-world tracking applications are related to a number of difficulties caused by the presence of different kinds of uncertainty, e.g. unknown or incompletely known system models and statistics of random processes or abrupt changes in the system modes of functioning. These problems are especially complicated in the marine navigation practice, where the commonly-used simple models of rectilinear or curvilinear target motions are not adequate for highly non-linear dynamics of the manoeuvring ship motion. A solution to these problems is to derive more suitable descriptions of real ship dynamics and to design adaptive estimation algorithms. After an analysis of basic hydrodynamic models, new ship models are derived in the paper. They are implemented in two versions of the Interacting Multiple Model (IMM) algorithm which has become very popular recently. The first one is a standard IMM version based on fixed model structures (FS's). They represent various modes of ship motion, distinguished by their rates of turns. The same rate of turn is additionally adjusted in the proposed new augmented versions of the IMM (AIMM) algorithm by using FS's and variable structures (VS's) of adaptive models estimating the current change in the system control parameters. Monte Carlo simulation experiments indicate that the VS AIMM algorithm outperforms the FS AIMM and FS IMM ones with respect to both accuracy and adaptability.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2000, 10, 3; 591-604
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Parameter estimation for Weibull distribution with right censored data using EM algorithm
Zastosowanie algorytmu maksymalizacji wartości oczekiwanej do estymacji parametrów rozkładu Weibulla w przypadku danych obciętych prawostronnie
Autorzy:
Ferreira, L. A.
Silva, J. L.
Powiązania:
https://bibliotekanauki.pl/articles/301264.pdf
Data publikacji:
2017
Wydawca:
Polska Akademia Nauk. Polskie Naukowo-Techniczne Towarzystwo Eksploatacyjne PAN
Tematy:
algorytm EM
estymacja parametrów
estymator największej wiarygodności
niezawodność
EM algorithm
parameter estimation
maximum likelihood estimate
reliability
Opis:
Metoda największej wiarygodności (MLE) służy do estymacji parametrów modelu statystycznego dla zadanych danych. Metoda ta pozwala na estymację nieznanych parametrów modelu statystycznego. Parametry te otrzymuje się poprzez maksymalizację funkcji wiarygodności rozważanego modelu. Często w praktyce metoda ta może jednak nastręczać trudności związane z wielomodalnością funkcji wiarygodności oraz niemożnością uzyskania jawnych analitycznych rozwiązań równań wiarygodności. Równania takie można jedynie rozwiązywać za pomocą metod numerycznych. Trudności te dobrze ilustruje estymacja parametrów rozkładu Weibulla z wykorzystaniem metody największej wiarygodności wykonywana w oparciu o prawostronnie cenzurowane dane z eksploatacji. Rozwiązanie przedstawione w niniejszej pracy opiera się na zastosowaniu algorytmu maksymalizacji wartości oczekiwanej (EM). Możliwości aplikacyjne proponowanej metodyki badano na przykładzie danych eksploatacyjnych uzyskanych z przedsiębiorstwa petrochemicznego, dotyczących awarii pięciu pomp odśrodkowych.
The maximum-likelihood estimation (MLE) is a method of estimating the parameters of a statistical model for given data. This method allows us to estimate the unknown parameters of a statistical model. These parameters are obtained by maximizing the likelihood function of the model in question. In many practical situations the likelihood function is associated with complex models and the likelihood equation has no explicit analytical solution, it is only possible to have its resolution through numerical methods. The estimation of the parameters of the Weibull distribution by maximum-likelihood method based on information from a historical record with right censored data shows this difficulty. The solution presented in this article entails using the Expectation-Maximization (EM) algorithm. Actual data from the historical record of 5 centrifugal pumps failures of a petrochemical company were analyzed for application of the methodology.
Źródło:
Eksploatacja i Niezawodność; 2017, 19, 2; 310-315
1507-2711
Pojawia się w:
Eksploatacja i Niezawodność
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Regularyzacja identyfikacji obiektów złożonych opisanych modelami nieliniowymi
Regularized identification of complex objects described by nonlinear models
Autorzy:
Polak, A. G.
Mroczka, J.
Powiązania:
https://bibliotekanauki.pl/articles/151146.pdf
Data publikacji:
2007
Wydawca:
Stowarzyszenie Inżynierów i Techników Mechaników Polskich
Tematy:
regularyzacja estymacji
algorytm Levenberga-Marquardta
metoda Tichonowa-Phillipsa
regularized estimation
Levenberg-Marquardt algorithm
Tikhonov-Phillips method
Opis:
W referacie przedstawiono modyfikację regularyzacji Tichonowa-Phillipsa (TP) przystosowującą ją do estymacji parametrów modeli nieliniowych źle uwarunkowanych numerycznie. Zaproponowane podejście porównano z metodami Gaussa-Newtona (GN), Levenberga-Marquardta (LM) oraz metodą łączącą LM z TP (LMTP). Analizę właściwości czterech zaimplementowanych algorytmów przeprowadzono metodą Monte Carlo. Pokazała ona, że w przypadku identyfikacji modeli nieliniowych zawierających parametry słabo określone przez dane pomiarowe i jednocześnie charakteryzujące się "regularnym" rozkładem wartości w wektorze parametrów, najlepsze wyniki daje estymacja metodą Tichonowa-Phillipsa.
In the paper a modification of the Tikhonov-Phillips regularisation enabling the estimation of parameters of numerically ill-conditioned nonlinear models is presented. This approach was compared with the Gauss-Newton (GN) and Levenberg-Marquardt (LM) methods, as well as with a method combining LM with TP one (LMTP). The analysis of the four computer-implemented algorithms was done by the Monte Carlo simulations. They have shown that the result of identification of a nonlinear model possessing weakly defined, however "regularly" distributed parameters, is the most accurate when using the Tikhonov-Phillips method.
Źródło:
Pomiary Automatyka Kontrola; 2007, R. 53, nr 9 bis, 9 bis; 190-193
0032-4140
Pojawia się w:
Pomiary Automatyka Kontrola
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Pomiary mikrostężeń jonów chlorkowych w roztworach wodnych z użyciem nieliniowego algorytmu estymacji stanu
Measurements of chloride ion microconcentration in water solutions with use of the nonlinear state estimation algorithm
Autorzy:
Holiczer, A.
Powiązania:
https://bibliotekanauki.pl/articles/157236.pdf
Data publikacji:
2010
Wydawca:
Stowarzyszenie Inżynierów i Techników Mechaników Polskich
Tematy:
kulometria
mikrostężenia jonów chlorkowych
estymacja nieliniowa
krzepki algorytm
coulometry
chloride ion microconcentration
nonlinear estimation
robust algorithm
Opis:
W artykule przedstawiono metodę pomiaru mikrostężeń jonów chlorkowych w roztworach wodnych. Zaproponowano nową metodę detekcji punktu końcowego miareczkowania kulometrycznego przy użyciu nieliniowego estymatora stanu. W tym celu opracowano uproszczony model dynamiczny procesu wyjściowego elektrod detekcyjnych oraz ulepszono algorytm detekcji punktu przegięcia krzywej miareczkowania. Uzyskane rezultaty badań potwierdzają skuteczność zastosowanej metody, zwłaszcza przy pomiarach niskich stężeń, względem ogólnie stosowanej metody komparacyjnej.
The paper deals with problems of chloride ion microconcentration measurements. It extends the previously made achievements [1, 5, 8] and proposes a nonlinear solution for more precise measurements. There are various chloride ion measurement methods, the most common of which is the potentiometric one using ion-selective electrodes (ISE). The other, much simpler and cheaper, is amperostatic coulometric titration with current source supplied detection electrodes (Figs. 1 and 2). It is based mainly on the Faraday principles (1) and Nernst equation. The main problem connected with chloride ion concentration measurement, is accurate determination of the titration end-point. The METHODS presented in [1] are not efficient for low measurement ranges, since the unknown titration process initial conditions affect the measurement result. That is why a nonlinear state estimation algorithm (Fig. 5) is proposed. Due to complex titration curve equations (2) some simplifications have been made (4). The proposed algorithm is capable of detecting unknown signals, so even a simplified system model should be sufficient. The proposed second derivative estimator combined with the titration curve intersection point detection algorithm makes it possible to take measurements with better repeatability and lower detection limit compared with methods presented in [1]. The further research should be aimed at the algorithm optimisation and implementation to a real measurement system in order to construct and realise a prototype of the chloride ion concentration meter.
Źródło:
Pomiary Automatyka Kontrola; 2010, R. 56, nr 2, 2; 146-149
0032-4140
Pojawia się w:
Pomiary Automatyka Kontrola
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Methods of position estimation in parametric navigation
Autorzy:
Banachowicz, A.
Wolski, A.
Powiązania:
https://bibliotekanauki.pl/articles/197340.pdf
Data publikacji:
2017
Wydawca:
Politechnika Śląska. Wydawnictwo Politechniki Śląskiej
Tematy:
navigational data fusion
least squares estimation
Kalman filtering
estimation
navigation
algorithm of integrated navigation
fuzja danych nawigacyjnych
estymacja najmniejszych kwadratów
filtrowanie Kalmana
oszacowanie
nawigacja
algorytm zintegrowanej nawigacji
Opis:
The estimation of position coordinates of a navigating ship is one of the navigational subprocesses. The methods used in this process are either deterministic (the case of a minimum number of navigational parameters measurements) or probabilistic (in cases where we have access to information redundancy). Naturally, due to the accuracy and reliability of the calculated coordinates, probabilistic methods should be primarily used. The article presents the use of the method of least squares and Kalman filtering in algorithms in integrated navigation for the estimation of position coordinates, taking into account ship movement parameters.
Źródło:
Zeszyty Naukowe. Transport / Politechnika Śląska; 2017, 95; 19-25
0209-3324
2450-1549
Pojawia się w:
Zeszyty Naukowe. Transport / Politechnika Śląska
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Estimation of ship repair time using the genetic algorithm
Autorzy:
Zagan, Remus
Paprocka, Iwona
Manea, Mihaela-Greti
Manea, Emill
Powiązania:
https://bibliotekanauki.pl/articles/1955595.pdf
Data publikacji:
2021
Wydawca:
Politechnika Gdańska. Wydział Inżynierii Mechanicznej i Okrętownictwa
Tematy:
mean time of dry-docking
average repair time
maintenance duration prediction
maintenance duration estimation
ship maintenance
genetic algorithm
Opis:
Ship maintenance is regulated by both the state and the classification society. The scope of maintenance works depends on the age of the ship and includes a dock, intermediate and special inspection. The problem is to estimate the reliable time of the ship maintenance and the downtime at the shipyard. The purpose of this article is to develop a more accurate model to predict a ship’s overall maintenance time. A multiple linear regression model is developed to describe the impact of historical data on hull repair, painting time, piping, age, structural and hull plate replacement for ship maintenance. In the literature, the least squares method is used to estimate unknown regression coefficients. The original value of the article is the use of a genetic algorithm to estimate coefficient values of the multiple linear regression model. Necessary analysis and simulations are performed on the data collected for oil and chemical or product tankers. As a result, a significant improvement in the adequacy of the presented model was identified.
Źródło:
Polish Maritime Research; 2021, 3; 88-99
1233-2585
Pojawia się w:
Polish Maritime Research
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Ligament-based spine-segment mechanisms
Autorzy:
Ciszkiewicz, A.
Milewski, G.
Powiązania:
https://bibliotekanauki.pl/articles/202123.pdf
Data publikacji:
2018
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
intervertebral joint
optimization
parameters estimation
genetic algorithm
elastostatic analysis
staw międzykręgowy
optymalizacja
szacowanie parametrów
algorytm genetyczny
analiza elastostatyczna
Opis:
Nowadays, a growing interest in spine-segment mechanisms for humanoid robots can be observed. The ones currently available are mostly inspired by an intervertebral joint but rarely use its structure and behaviour as input data. The aim of this study was to propose and verify an approach to spine-segment mechanisms synthesis, in which the mechanisms were obtained directly from a ligament system of the intervertebral joint through numerical optimization. The approach consists of two independent optimization procedures performed with genetic algorithm. The first one searches for the optimal structure, while the second estimates its geometrical and stiffness parameters. The mechanisms are rated by their ability to reproduce the static behaviour of the joint in selected aspects. Both procedures use the lumbar L4-L5 intervertebral joint reference data. The approach was tested in two numerical scenarios. It was possible to obtain a mechanism with 7 flexible linear legs that accurately emulated the elastostatic behaviour of the intervertebral joint under moment loads. The results prove that the proposed method is feasible and worth exploring. It may be employed in design of bioinspired joints for use in humanoid robots and can also serve as an initial step in the design of prosthetic and orthotic devices for a human spine.
Źródło:
Bulletin of the Polish Academy of Sciences. Technical Sciences; 2018, 66, 5; 705-712
0239-7528
Pojawia się w:
Bulletin of the Polish Academy of Sciences. Technical Sciences
Dostawca treści:
Biblioteka Nauki
Artykuł
Wyświetlanie 1-25 z 32

Ta witryna wykorzystuje pliki cookies do przechowywania informacji na Twoim komputerze. Pliki cookies stosujemy w celu świadczenia usług na najwyższym poziomie, w tym w sposób dostosowany do indywidualnych potrzeb. Korzystanie z witryny bez zmiany ustawień dotyczących cookies oznacza, że będą one zamieszczane w Twoim komputerze. W każdym momencie możesz dokonać zmiany ustawień dotyczących cookies