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ę "a* algorithm" wg kryterium: Wszystkie pola

  Lista filtrów
Wyrównaj
Wyświetlanie 1-15 z 81
Tytuł:
A new algorithm for a CFE-approximated solution of a discrete-time noninteger-order state equation
Autorzy:
Oprzędkiewicz, K.
Stanisławski, R.
Gawin, E.
Mitkowski, W.
Powiązania:
https://bibliotekanauki.pl/articles/199796.pdf
Data publikacji:
2017
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
fractional order calculus
discrete-time noninteger-order state equation
continuous fraction expansion
Al-Alaoui operator
równanie dyskretne
aproksymacja Al-Alaoui
CFE
Opis:
In the paper, a new method for solution of linear discrete-time fractional-order state equation is presented. The proposed method is simpler than other methods using directly discrete-time version of the Grünwald-Letnikov operator. The method is dedicated to use with any approximator to the operator expressed by a discrete transfer function, e.g. CFE-based Al-Alaoui approximation. A simulation example confirms the usefulness of the method.
Źródło:
Bulletin of the Polish Academy of Sciences. Technical Sciences; 2017, 65, 4; 429-437
0239-7528
Pojawia się w:
Bulletin of the Polish Academy of Sciences. Technical Sciences
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Obstacle avoidance method of autonomous vehicle based on fusion improved A*APF algorithm
Autorzy:
Qian, Yubin
Sun, Hongtao
Feng, Song
Powiązania:
https://bibliotekanauki.pl/articles/2204535.pdf
Data publikacji:
2023
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
obstacle avoidance
path planning
fuzzy control
tracking control
unikanie przeszkód
planowanie ścieżki
kontroler rozmyty
kontroler śledzenia
Opis:
This paper proposes an autonomous obstacle avoidance method combining improved A-star (A*) and improved artificial potential field (APF) to solve the planning and tracking problems of autonomous vehicles in a road environment. The A*APF algorithm to perform path planning tasks, and based on the longitudinal braking distance model, a dynamically changing obstacle influence range is designed. When there is no obstacle affecting the controlled vehicle, the improved A* algorithm with angle constraint combined with steering cost can quickly generate the optimal route and reduce turning points. If the controlled vehicle enters the influence domain of obstacle, the improved artificial potential field algorithm will generate lane changing paths and optimize the local optimal locations based on simulated annealing. Pondering the influence of surrounding participants, the four-mode obstacle avoidance process is established, and the corresponding safe distance condition is analyzed. A particular index is introduced to comprehensively evaluate speed, risk warning, and safe distance factors, so the proposed method is designed based on the fuzzy control theory. In the tracking task, a model predictive controller in the light of the kinematics model is devised to make the longitudinal and lateral process of lane changing meet comfort requirements, generating a feasible autonomous lane-change path. Finally, the simulation was performed in the Matlab/Simulink and Carsim combined environment. The proposed fusion path generation algorithm can overcome the shortcomings of the traditional single method and better adapt to the dynamic environment. The feasibility of the obstacle avoidance algorithm is verified in the three-lane simulation scenario to meet safety and comfort requirements.
Źródło:
Bulletin of the Polish Academy of Sciences. Technical Sciences; 2023, 71, 2; art. no. e144624
0239-7528
Pojawia się w:
Bulletin of the Polish Academy of Sciences. Technical Sciences
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Control system with a non-parametric predictive algorithm for a high-speed rotating machine with magnetic bearings
Autorzy:
Kurnyta-Mazurek, Paulina
Szolc, Tomasz
Henzel, Maciej
Falkowski, Krzysztof
Powiązania:
https://bibliotekanauki.pl/articles/2086845.pdf
Data publikacji:
2021
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
magnetic bearing
predictive algorithms
high speed rotating machine
łożysko magnetyczne
algorytm predykcyjny
maszyna wirująca dużej prędkości
Opis:
This paper deals with research on the magnetic bearing control systems for a high-speed rotating machine. Theoretical and experimental characteristics of the control systems with the model algorithmic control (MAC) algorithm and the proportional-derivative (PD) algorithm are presented. The MAC algorithm is the non-parametric predictive control method that uses an impulse response model. A laboratory model of the rotor-bearing unit under study consists of two active radial magnetic bearings and one active axial (thrust) magnetic bearing. The control system of the rotor position in air gaps consists of the fast prototyping control unit with a signal processor, the input and output modules, power amplifiers, contactless eddy current sensors and the host PC with dedicated software. Rotor displacement and control current signals were registered during investigations using a data acquisition (DAQ) system. In addition, measurements were performed for various rotor speeds, control algorithms and disturbance signals generated by the control system. Finally, the obtained time histories were presented, analyzed and discussed in this paper.
Źródło:
Bulletin of the Polish Academy of Sciences. Technical Sciences; 2021, 69, 6; e138998, 1--9
0239-7528
Pojawia się w:
Bulletin of the Polish Academy of Sciences. Technical Sciences
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A greedy algorithm for the DNA sequencing by hybridization with positive and negative errors and information about repetitions
Autorzy:
Kwarciak, K.
Formanowicz, P.
Powiązania:
https://bibliotekanauki.pl/articles/202322.pdf
Data publikacji:
2011
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
DNA sequencing
l-mer multiplicity
greedy algorithm
combinatorial problems
Opis:
In this paper a greedy algorithm for some variants of the sequencing by hybridization method is presented. In the standard version of the method information about repetitions is not available. In the paper it is assumed that a partial information of this type is a part of the problem instance. Here two simple but realistic models of this information are taken into consideration. The first one assumes it is known if a given element of a spectrum appears in the target sequence once or more than once. The second model uses the knowledge is a given element of a spectrum occurs in the analyzed sequence once, twice or at least three times. The proposed greedy algorithm solves the variant of the problem with positive and negative errors. Results of a computational experiment are reported which, among others, confirm that the additional information leads to the improvement of the obtained solutions. They also show that the more precise model of information increases the quality of reconstructed sequences.
Źródło:
Bulletin of the Polish Academy of Sciences. Technical Sciences; 2011, 59, 1; 111-115
0239-7528
Pojawia się w:
Bulletin of the Polish Academy of Sciences. Technical Sciences
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Determination of synchronous generator nonlinear model parameters based on power rejection tests using a gradient optimization algorithm
Autorzy:
Boboń, A.
Nocoń, A.
Paszek, S.
Pruski, P.
Powiązania:
https://bibliotekanauki.pl/articles/200774.pdf
Data publikacji:
2017
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
gradient optimization algorithms
synchronous generator model
parameter estimation
load rejection test
algorytm optymalizacji gradientu
modele generatorów synchronicznych
estymacja parametrów
test odrzucenia ładunku
Opis:
The paper presents a method for determining electromagnetic parameters of different synchronous generator models based on dynamic waveforms measured at power rejection. Such a test can be performed safely under normal operating conditions of a generator working in a power plant. A generator model was investigated, expressed by reactances and time constants of steady, transient, and subtransient state in the d and q axes, as well as the circuit models (type (3,3) and (2,2)) expressed by resistances and inductances of stator, excitation, and equivalent rotor damping circuits windings. All these models approximately take into account the influence of magnetic core saturation. The least squares method was used for parameter estimation. There was minimized the objective function defined as the mean square error between the measured waveforms and the waveforms calculated based on the mathematical models. A method of determining the initial values of those state variables which also depend on the searched parameters is presented. To minimize the objective function, a gradient optimization algorithm finding local minima for a selected starting point was used. To get closer to the global minimum, calculations were repeated many times, taking into account the inequality constraints for the searched parameters. The paper presents the parameter estimation results and a comparison of the waveforms measured and calculated based on the final parameters for 200 MW and 50 MW turbogenerators.
Źródło:
Bulletin of the Polish Academy of Sciences. Technical Sciences; 2017, 65, 4; 479-488
0239-7528
Pojawia się w:
Bulletin of the Polish Academy of Sciences. Technical Sciences
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
GPU-based tuning of quantum-inspired genetic algorithm for a combinatorial optimization problem
Autorzy:
Nowotniak, R.
Kucharski, J.
Powiązania:
https://bibliotekanauki.pl/articles/201268.pdf
Data publikacji:
2012
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
quantum-inspired genetic algorithm
evolutionary computing
meta-optimization
parallel algorithms
GPGPU
Opis:
This paper concerns efficient parameters tuning (meta-optimization) of a state-of-the-art metaheuristic, Quantum-Inspired Genetic Algorithm (QIGA), in a GPU-based massively parallel computing environment (NVidia CUDATMtechnology). A novel approach to parallel implementation of the algorithm has been presented. In a block of threads, each thread transforms a separate quantum individual or different quantum gene; In each block, a separate experiment with different population is conducted. The computations have been distributed to eight GPU devices, and over 400× speedup has been gained in comparison to Intel Core i7 2.93GHz CPU. This approach allows efficient meta-optimization of the algorithm parameters. Two criteria for the meta-optimization of the rotation angles in quantum genes state space have been considered. Performance comparison has been performed on combinatorial optimization (knapsack problem), and it has been presented that the tuned algorithm is superior to Simple Genetic Algorithm and to original QIGA algorithm.
Źródło:
Bulletin of the Polish Academy of Sciences. Technical Sciences; 2012, 60, 2; 323-330
0239-7528
Pojawia się w:
Bulletin of the Polish Academy of Sciences. Technical Sciences
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A robust fixed-lag smoothing algorithm for dynamic systems with correlated sensor malfunctions
Autorzy:
Grishin, Y. P.
Janczak, D.
Powiązania:
https://bibliotekanauki.pl/articles/199833.pdf
Data publikacji:
2014
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
outliers
robust signal processing
nonlinear filtering
fault detection
systems with changing structures
Opis:
A new robust fixed-lag smoothing algorithm for fault-tolerant signal processing in stochastic dynamic systems in the presence of correlated sensor malfunctions has been developed. The algorithm is developed using a state vector augmentation method and the Gaussian approximation of the current estimate probability density function. The algorithm can be used in the real-time fault-tolerant control systems as well as in radar tracking systems working in the complex interference environment. The performance of the developed algorithm are evaluated by simulations and compared with smoothing and nonlinear filtering algorithms.
Źródło:
Bulletin of the Polish Academy of Sciences. Technical Sciences; 2014, 62, 3; 517-523
0239-7528
Pojawia się w:
Bulletin of the Polish Academy of Sciences. Technical Sciences
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A novel hybrid cuckoo search algorithm for optimization of a line-start PM synchronous motor
Autorzy:
Knypiński, Łukasz
Powiązania:
https://bibliotekanauki.pl/articles/2204509.pdf
Data publikacji:
2023
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
hybrid cuckoo search algorithm
heuristic algorithms
multi-objective optimization
permanent magnet synchronous motor
PMSM
algorytm kukułki hybrydowy
algorytm Cuckoo
algorytm heurystyczny
optymalizacja wielocelowa
silnik synchroniczny z magnesem trwałym
Opis:
The paper presents a novel hybrid cuckoo search (CS) algorithm for the optimization of the line-start permanent magnet synchronous motor (LSPMSM). The hybrid optimization algorithm developed is a merger of the heuristic algorithm with the deterministic Hooke–Jeeves method. The hybrid optimization procedure developed was tested on analytical benchmark functions and the results were compared with the classical cuckoo search algorithm, genetic algorithm, particle swarm algorithm and bat algorithm. The optimization script containing a hybrid algorithm was developed in Delphi Tiburón. The results presented show that the modified method is characterized by better accuracy. The optimization procedure developed is related to a mathematical model of the LSPMSM. The multi-objective compromise function was applied as an optimality criterion. Selected results were presented and discussed.
Źródło:
Bulletin of the Polish Academy of Sciences. Technical Sciences; 2023, 71, 1; art. no. e144586
0239-7528
Pojawia się w:
Bulletin of the Polish Academy of Sciences. Technical Sciences
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
BentSign: keyed hash algorithm based on bent Boolean function and chaotic attractor
Autorzy:
Todorova, M.
Stoyanov, B.
Szczypiorski, K.
Graniszewski, W.
Kordov, K.
Powiązania:
https://bibliotekanauki.pl/articles/202221.pdf
Data publikacji:
2019
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
hash algorithm
chaotic attractor
Bent Boolean function
pseudorandom bit generation scheme
chaotyczny atraktor
funkcja Bent Boolean
pseudolosowy schemat generowania bitów
Opis:
In this study, we propose a novel keyed hash algorithm based on a Boolean function and chaotic attractor. The hash algorithm called BentSign is based on two Signature attractors and XOR function and a bent Boolean function. The provided theoretical and experimental results confirm that the novel scheme can generate output hashes with a good level of security, collision resistance, and protection against most common attacks.
Źródło:
Bulletin of the Polish Academy of Sciences. Technical Sciences; 2019, 67, 3; 557-569
0239-7528
Pojawia się w:
Bulletin of the Polish Academy of Sciences. Technical Sciences
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Multi-sourced power system restoration strategy based on modified Prim’s algorithm
Autorzy:
Łukaszewski, Artur
Nogal, Łukasz
Powiązania:
https://bibliotekanauki.pl/articles/2086893.pdf
Data publikacji:
2021
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
self-healing grid
micro-grid
reconfiguration
greedy algorithms
graph theory
simulations
Prim’s algorithm
siatka samoleczenia
mikrosiatka
rekonfiguracja
algorytmy zachłanne
teoria grafów
symulacje
algorytm Prima
Opis:
Self-healing grids are one of the most developing concepts applied in electrical engineering. Each restoration strategy requires advanced algorithms responsible for the creation of local power systems. Multi-agent automation solutions dedicated for smart grids are mostly based on Prim’s algorithm. Graph theory in that field also leaves many problems unsolved. This paper is focused on a variation of Prim’s algorithm utility for a multi-sourced power system topology. The logic described in the paper is a novel concept combined with a proposal of a multi-parametrized weight calculation formula representing transmission features of energy delivered to loads present in a considered grid. The weight is expressed as the combination of three elements: real power, reactive power, and real power losses. The proposal of a novel algorithm was verified in a simulation model of a power system. The new restoration logic was compared with the proposal of the strategy presented in other recently published articles. The novel concept of restoration strategy dedicated to multi-sourced power systems was verified positively by simulations. The proposed solution proved its usefulness and applicability.
Źródło:
Bulletin of the Polish Academy of Sciences. Technical Sciences; 2021, 69, 5; e137942, 1--12
0239-7528
Pojawia się w:
Bulletin of the Polish Academy of Sciences. Technical Sciences
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Closed-loop control algorithm for some class of nonholonomic systems using polar representation
Autorzy:
Pazderski, D.
Szulczyński, P.
Kozłowski, K.
Powiązania:
https://bibliotekanauki.pl/articles/201607.pdf
Data publikacji:
2012
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
polar coordinates
nonholonomic system
discontinuous stabilization at the origin
Opis:
This paper is focused on the convergence problem defined for some class of a two input affine nonholonomic driftless system with three-dimensional state. The problem is solved based on a polar transformation which is singular at the origin. The convergence is ensured using static-state feedback. The necessary conditions for construction of the algorithm are formally discussed. The solution, in general, is local, and the feasible domain is strictly related to the properties of the control system. In order to improve algorithm robustness a simple hybrid algorithm is formulated. The general theory is illustrated by two particular systems and the results of numerical simulations are provided.
Źródło:
Bulletin of the Polish Academy of Sciences. Technical Sciences; 2012, 60, 3; 521-535
0239-7528
Pojawia się w:
Bulletin of the Polish Academy of Sciences. Technical Sciences
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A study on color vegetation canopy images denoising algorithm
Autorzy:
Wang, C.
Liu, Y.
Wang, P.
Powiązania:
https://bibliotekanauki.pl/articles/199849.pdf
Data publikacji:
2020
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
image denoising
color vegetation canopy images
adaptive mean filtering
color space
Opis:
Due to the characteristics of color vegetation canopy images which have multiple details and Gaussion noise interference, the adaptive mean filtering (AMF) algorithm is used to perform the denoising experiments on noised images in RGB and YUV color space. Based on the single color characteristics of color vegetation canopy images, a simplified AMF algorithm is proposed in this paper to shorten the overall running time of the denoising algorithm by simplifying the adaptive denoising processing of the component V, which contains less image details. Experimental results show that this method can effectively reduce the running time of the algorithm while maintaining a good denoising effect.
Źródło:
Bulletin of the Polish Academy of Sciences. Technical Sciences; 2020, 68, 3; 609-626
0239-7528
Pojawia się w:
Bulletin of the Polish Academy of Sciences. Technical Sciences
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Analysis of multi-step algorithms for cognitive maps learning
Autorzy:
Jastriebow, A.
Poczęta, K.
Powiązania:
https://bibliotekanauki.pl/articles/201551.pdf
Data publikacji:
2014
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
cognitive maps
multistep learning algorithm
gradient method
Hebbian algorithm
mapy poznawcze
wieloetapowe nauki algorytmu
metoda gradientu
algorytm kWTA
Opis:
This article is devoted to the analysis of multi-step algorithms for cognitive maps learning. Cognitive maps and multi-step supervised learning based on a gradient method and unsupervised one based on the non-linear Hebbian algorithm were described. Comparative analysis of these methods to one-step algorithms, from the point of view of the speed of convergence of a learning algorithm and the influence on the work of the decision systems was performed. Simulation results were done on prepared software tool ISEMK. Obtained results show that implementation of the multi-step technique gives certain possibilities to get quicker values of target relations values and improve the operation of the learned system.
Źródło:
Bulletin of the Polish Academy of Sciences. Technical Sciences; 2014, 62, 4; 735-741
0239-7528
Pojawia się w:
Bulletin of the Polish Academy of Sciences. Technical Sciences
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Algorithm for solution of systems of singularly perturbed differential equations with adifferential turning point
Autorzy:
Sobchuk, Valentyn
Zelenska, Iryna
Laptiev, Oleksandr
Powiązania:
https://bibliotekanauki.pl/articles/27311440.pdf
Data publikacji:
2023
Wydawca:
Polska Akademia Nauk. Czasopisma i Monografie PAN
Tematy:
singular perturbations
asymptotics
Airy-Langer functions
small parameter
turning points
punkt zwrotny
funkcje Airy'ego-Langera
asymptota
perturbacja singularna
parametr niski
Opis:
The dynamic development of science requires constant improvement of approaches to modeling physical processes and phenomena. Practically all scientific problems can be described by systems of differential equations. Many scientific problems are described by systems of differential equations of a special class, which belong to the group of so-called singularly perturbed differential equations. Mathematical models of processes described by such differential equations contain a small parameter near the highest derivatives, and it was the presence of this small factor that led to the creation of a large mathematical theory. The work proposes a developed algorithm for constructing uniform asymptotics of solutions to systems of singularly perturbed differential equations.
Źródło:
Bulletin of the Polish Academy of Sciences. Technical Sciences; 2023, 71, 3; art. no. e145682
0239-7528
Pojawia się w:
Bulletin of the Polish Academy of Sciences. Technical Sciences
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Scheduling of unit-length jobs with bipartite incompatibility graphs on four uniform machines
Autorzy:
Furmańczyk, H.
Kubale, M.
Powiązania:
https://bibliotekanauki.pl/articles/200295.pdf
Data publikacji:
2017
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
equitable coloring
NP-hardness
polynomial algorithm
scheduling
uniform machine
kolorowanie grafów
twardość NP
algorytm wielomianowy
planowanie
Opis:
In the paper we consider the problem of scheduling n identical jobs on 4 uniform machines with speeds s1 ≥ s2 ≥ s3 ≥ s4, respectively. Our aim is to find a schedule with a minimum possible length. We assume that jobs are subject to some kind of mutual exclusion constraints modeled by a bipartite incompatibility graph of degree Δ, where two incompatible jobs cannot be processed on the same machine. We show that the general problem is NP-hard even if s1 = s2 = s3. If, however, Δ ≤ 4 and s1 ≥ 12s2, s2 = s3 = s4, then the problem can be solved to optimality in time O(n1.5). The same algorithm returns a solution of value at most 2 times optimal provided that s1 ≥ 2s2. Finally, we study the case s1 ≥ s2 ≥ s3 = s4 and give a 32/15-approximation algorithm running also in O(n1.5) time.
Źródło:
Bulletin of the Polish Academy of Sciences. Technical Sciences; 2017, 65, 1; 29-34
0239-7528
Pojawia się w:
Bulletin of the Polish Academy of Sciences. Technical Sciences
Dostawca treści:
Biblioteka Nauki
Artykuł
Wyświetlanie 1-15 z 81

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