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: Temat

  Lista filtrów

Dostawca treści

Wyrównaj
Wyświetlanie 1-15 z 1766
Tytuł:
2D microgravity test-bed for the validation of space robot control algorithms
Autorzy:
Oleś, J.
Kindracki, J.
Rybus, T.
Mężyk, Ł.
Paszkiewicz, P.
Moczydłowski, R.
Barciński, T.
Seweryn, K.
Wolański, P.
Powiązania:
https://bibliotekanauki.pl/articles/384755.pdf
Data publikacji:
2017
Wydawca:
Sieć Badawcza Łukasiewicz - Przemysłowy Instytut Automatyki i Pomiarów
Tematy:
space debris
Active Debris Removal
Kessler syndrome
microgravity simulator
space robot
robotic arm
manipulator
control algorithm
Opis:
The utilization of satellites equipped with robotic arms is one of the existing strategies for Active Debris Removal (ADR). Considering that the time intended for on-orbit capturing manoeuvres is strictly limited, any given space robot should possess a certain level of autonomy. This paper is about the control of on-orbit space robots and the testing of such objects in laboratory conditions. The Space Research Centre of the Polish Academy of Sciences (CBK PAN) possesses a planar air bearing microgravity simulator used for the testing of advanced control algorithms of space robots supported on air bearings. This paper presents recent upgrades to the testing facility. Firstly, the base of the space robot is now equipped with manoeuvre thrusters using compressed nitrogen and therefore allowing for position control of the entire system. Secondly, a signal from an external vision system, referencing the position and orientation of the robot’s parts is used by the control system for the closed loop control.
Źródło:
Journal of Automation Mobile Robotics and Intelligent Systems; 2017, 11, 2; 95-104
1897-8649
2080-2145
Pojawia się w:
Journal of Automation Mobile Robotics and Intelligent Systems
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A Bayes algorithm for model compatibility and comparison of ARMA( p; q) models
Autorzy:
Tripathi, Praveen Kumar
Sen, Rijji
Upadhyay, S. K.
Powiązania:
https://bibliotekanauki.pl/articles/1054568.pdf
Data publikacji:
2021-06-04
Wydawca:
Główny Urząd Statystyczny
Tematy:
ARMA model
exact likelihood
Gibbs sampler
Metropolis algorithm
posterior predictive loss
model compatibility
Ljung-Box-Pierce statistic
GDP growth rate
Opis:
The paper presents a Bayes analysis of an autoregressive-moving average model and its components based on exact likelihood and weak priors for the parameters where the priors are defined so that they incorporate stationarity and invertibility restrictions naturally. A Gibbs- Metropolis hybrid scheme is used to draw posterior-based inferences for the models under consideration. The compatibility of the models with the data is examined using the Ljung- Box-Pierce chi-square-based statistic. The paper also compares different compatible models through the posterior predictive loss criterion in order to recommend the most appropriate one. For a numerical illustration of the above, data on the Indian gross domestic product growth rate at constant prices are considered. Differencing the data once prior to conducting the analysis ensured their stationarity. Retrospective short-term predictions of the data are provided based on the final recommended model. The considered methodology is expected to offer an easy and precise method for economic data analysis.
Źródło:
Statistics in Transition new series; 2021, 22, 2; 95-123
1234-7655
Pojawia się w:
Statistics in Transition new series
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A branch hash function as a method of message synchronization in anonymous P2P conversations
Autorzy:
Kobusińska, A.
Brzeziński, J.
Boroń, M.
Inatlewski, Ł.
Jabczyński, M.
Maciejewski, M.
Powiązania:
https://bibliotekanauki.pl/articles/331275.pdf
Data publikacji:
2016
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
peer-to-peer system
synchronization algorithm
conversations
anonymity
system peer-to-peer
algorytm synchronizacji
anonimowość
Opis:
Currently existing solutions rarely protect message integrity, authenticity and user anonymity without burdening the user with details of key management. To address this problem, we present Aldeon—a protocol for anonymous group conversations in a peer-to-peer system. The efficiency of Aldeon is based on a novel tree synchronization algorithm, which is proposed and discussed in this paper. By using this algorithm, a significant reduction in the number of exchanged messages is achieved. In the paper, the formal definition of the proposed hash branch function and the proof of its efficiency are presented.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2016, 26, 2; 479-493
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A collision avoidance algorithm in Simultaneous Localization and Mapping problem for mobile platforms
Autorzy:
Małecki, Tomasz
Narkiewicz, Janusz
Powiązania:
https://bibliotekanauki.pl/articles/2086976.pdf
Data publikacji:
2022
Wydawca:
Polskie Towarzystwo Mechaniki Teoretycznej i Stosowanej
Tematy:
algorithm
modeling
path planning
SLAM
Opis:
A collision avoidance algorithm applicable in simultaneous localization and mapping (SLAM) has been developed with a prospect of an on-line application for mobile platforms to search and map the operation area and avoid contact with obstacles. The algorithm, which was implemented in MATLAB software, is based on a linear discrete-time state transition model for determination of the platform position and orientation, and a ‘force’ points method for collision avoidance and definition of the next-step of platform motion. The proposed approach may be incorporated into real-time applications with limited on-board computational resources.
Źródło:
Journal of Theoretical and Applied Mechanics; 2022, 60, 2; 317--328
1429-2955
Pojawia się w:
Journal of Theoretical and Applied Mechanics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A Comparative Study of PID Controller Tuning Using GA, EP, PSO and ACO
Autorzy:
Nagaraj, B.
Vijayakumar, P.
Powiązania:
https://bibliotekanauki.pl/articles/384767.pdf
Data publikacji:
2011
Wydawca:
Sieć Badawcza Łukasiewicz - Przemysłowy Instytut Automatyki i Pomiarów
Tematy:
ant colony algorithm
evolutionary program
genetic algorithm particle swarm optimization and soft computing
Opis:
Proportional - Integral - Derivative control schemes continue to provide the simplest and effective solutions to most of the control engineering applications today. How ever PID controller are poorly tuned in practice with most of the tuning done manually which is difficult and time consuming. This article comes up with a hybrid approach involving Genetic Algorithm (GA), Evolutionary Pro gramming (EP), Particle Swarm Optimization (PSO) and Ant Colony Optimization (ACO). The proposed hybrid algorithm is used to tune the PID parameters and its per formance has been compared with the conventional me thods like Ziegler Nichols and Cohen Coon method. The results obtained reflect that use of heuristic algorithm based controller improves the performance of process in terms of time domain specifications, set point tracking, and regulatory changes and also provides an optimum stability. Speed control of DC motor process is used to assess the efficacy of the heuristic algorithm methodology
Źródło:
Journal of Automation Mobile Robotics and Intelligent Systems; 2011, 5, 2; 42-48
1897-8649
2080-2145
Pojawia się w:
Journal of Automation Mobile Robotics and Intelligent Systems
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A comparative study on multi-swarm optimisation and bat algorithm for unconstrained non linear optimisation problems
Autorzy:
Baidoo, E.
Opoku Oppong, S
Powiązania:
https://bibliotekanauki.pl/articles/117918.pdf
Data publikacji:
2016
Wydawca:
Polskie Towarzystwo Promocji Wiedzy
Tematy:
swarm intelligence
bio-inspired
bat algorithm
multi-swarm optimisation
nonlinear optimisation
Opis:
A study branch that mocks-up a population of network of swarms or agents with the ability to self-organise is Swarm intelligence. In spite of the huge amount of work that has been done in this area in both theoretically and empirically and the greater success that has been attained in several aspects, it is still ongoing and at its infant stage. An immune system, a cloud of bats, or a flock of birds are distinctive examples of a swarm system. In this study, two types of meta-heuristics algorithms based on population and swarm intelligence - Multi Swarm Optimization (MSO) and Bat algorithms (BA) – are set up to find optimal solutions of continuous non-linear optimisation models. In order to analyze and compare perfect solutions at the expense of performance of both algorithms, a chain of computational experiments on six generally used test functions for assessing the accuracy and the performance of algorithms, in swarm intelligence fields are used. Computational experiments show that MSO algorithm seems much superior to BA.
Źródło:
Applied Computer Science; 2016, 12, 4; 59-77
1895-3735
Pojawia się w:
Applied Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A comparison of hole-filling methods in 3D
Autorzy:
Pérez, E.
Salamanca, S.
Merchán, P.
Adán, A.
Powiązania:
https://bibliotekanauki.pl/articles/331035.pdf
Data publikacji:
2016
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
3D polygonal model
repairing meshes
hole filling
restoration algorithm
model wielokątny 3D
renowacja siatki
algorytm renowacji
Opis:
This paper presents a review of the most relevant current techniques that deal with hole-filling in 3D models. Contrary to earlier reports, which approach mesh repairing in a sparse and global manner, the objective of this review is twofold. First, a specific and comprehensive review of hole-filling techniques (as a relevant part in the field of mesh repairing) is carried out. We present a brief summary of each technique with attention paid to its algorithmic essence, main contributions and limitations. Second, a solid comparison between 34 methods is established. To do this, we define 19 possible meaningful features and properties that can be found in a generic hole-filling process. Then, we use these features to assess the virtues and deficiencies of the method and to build comparative tables. The purpose of this review is to make a comparative hole-filling state-of-the-art available to researchers, showing pros and cons in a common framework.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2016, 26, 4; 885-903
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A comparison of hydrological drought characteristics defined by the POT and SPA methods in the Dunajec River basin
Autorzy:
Baran-Gurgul, K.
Powiązania:
https://bibliotekanauki.pl/articles/60557.pdf
Data publikacji:
2014
Wydawca:
Polska Akademia Nauk. Stowarzyszenie Infrastruktura i Ekologia Terenów Wiejskich PAN
Tematy:
comparison
hydrological drought
drought characteristics
peak over threshold
sequent peak algorithm
Dunajec River
river basin
low flow
drought duration
drought deficit
Opis:
This paper addresses the problem of how drought definition by POT and SPA methods influences drought characteristics. Using the 1984- 2013 daily flows at 24 selected gauging stations in the Dunajec river basin and assuming two threshold levels Q70% and Q95% and four minimum drought durations (5, 7, 10 and 14 days) as the pre-set criteria, it was shown that, when compared to the POT method, the application of the SPA method usually leads to less number of droughts and, consequently, of longer duration. The SPA method, differently from POT, reduces dramatically the number of inter-event times, which suggests that some adjacent POT droughts may be dependent and should be pooled.
Źródło:
Infrastruktura i Ekologia Terenów Wiejskich; 2014, IV/3
1732-5587
Pojawia się w:
Infrastruktura i Ekologia Terenów Wiejskich
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A comparison of nature inspired algorithms for the quadratic assignment problem
Autorzy:
Chmiel, W.
Kadłuczka, P.
Kwiecień, J.
Filipowicz, B.
Powiązania:
https://bibliotekanauki.pl/articles/202135.pdf
Data publikacji:
2017
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
permutation problem
quadratic assignment problem
ant algorithm
bees algorithm
problem permutacji
problem przydziału kwadratowego
algorytm Ant Colony
algorytm pszczół
Opis:
This paper presents an application of the ant algorithm and bees algorithm in optimization of QAP problem as an example of NP-hard optimization problem. The experiments with two types of algorithms: the bees algorithm and the ant algorithm were performed for the test instances of the quadratic assignment problem from QAPLIB, designed by Burkard, Karisch and Rendl. On the basis of the experiments results, an influence of particular elements of algorithms, including neighbourhood size and neighbourhood search method, will be determined.
Źródło:
Bulletin of the Polish Academy of Sciences. Technical Sciences; 2017, 65, 4; 513-522
0239-7528
Pojawia się w:
Bulletin of the Polish Academy of Sciences. Technical Sciences
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A comprehensive study on the application of firefly algorithm in prediction of energy dissipation on block ramps
Autorzy:
Mahdavi-Meymand, Amin
Sulisz, Wojciech
Zounemat-Kermani, Mohammad
Powiązania:
https://bibliotekanauki.pl/articles/2087026.pdf
Data publikacji:
2022
Wydawca:
Polska Akademia Nauk. Polskie Naukowo-Techniczne Towarzystwo Eksploatacyjne PAN
Tematy:
firefly algorithm
machine learning
energy dissipation
block ramp
Opis:
In this study novel integrative machine learning models embedded with the firefly algorithm (FA) were developed and employed to predict energy dissipation on block ramps. The used models include multi-layer perceptron neural network (MLPNN), adaptive neuro-fuzzy inference system (ANFIS), group method of data handling (GMDH), support vector regression (SVR), linear equation (LE), and nonlinear regression equation (NE). The investigation focused on the evaluation of the performance of standard and integrative models in different runs. The performances of machine learning models and the nonlinear equation are higher than the linear equation. The results also show that FA increases the performance of all applied models. Moreover, the results indicate that the ANFIS-FA is the most stable integrative model in comparison to the other embedded methods and reveal that GMDH and SVR are the most stable technique among all applied models. The results also show that the accuracy of the LE-FA technique is relatively low, RMSE=0.091. The most accurate results provide SVR-FA, RMSE=0.034.
Źródło:
Eksploatacja i Niezawodność; 2022, 24, 2; 200--210
1507-2711
Pojawia się w:
Eksploatacja i Niezawodność
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A container ship traffic model for simulation studies
Autorzy:
Wawrzyniak, Jakub
Drozdowski, Maciej
Sanlaville, Éric
Powiązania:
https://bibliotekanauki.pl/articles/2172133.pdf
Data publikacji:
2022
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
benchmark instances
algorithm evaluation
data analysis
container ship
traffic modeling
marine logistics
instancje wzorcowe
ocena algorytmu
analiza danych
kontenerowiec
modelowanie ruchu
logistyka morska
Opis:
The aim of this paper is to develop a container ship traffic model for port simulation studies. Such a model is essential for terminal design analyses and testing the performance of optimization algorithms. This kind of studies requires accurate information about the ship stream to build test scenarios and benchmark instances. A statistical model of ship traffic is developed on the basis of container ship arrivals in eight world ports. The model provides three parameters of the arriving ships: ship size, arrival time and service time. The stream of ships is divided into classes according to vessel sizes. For each class, service time distributions and mixes of return time distributions are provided. A model of aperiodic arrivals is also proposed. Moreover, the results achieved are used to compare port specific features.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2022, 32, 4; 537--552
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A control algorithm for joint flight of a group of drones
Autorzy:
Sabziev, Elkhan
Powiązania:
https://bibliotekanauki.pl/articles/2116418.pdf
Data publikacji:
2021
Wydawca:
Politechnika Śląska. Wydawnictwo Politechniki Śląskiej
Tematy:
group flight
drone
algorithm
lot grupowy
dron
algorytm
Opis:
Using drones in groups in the military field is not a novel idea. A massive attack by a large amount of equipment is known to be very difficult to prevent. Therefore, it is a good tactic to sacrifice some of the relatively cheap drones to destroy special enemy targets in a massive attack. This raises the issue of joint control of the behaviour of a group of drones. This paper proposes a System of Systems ideology-based decision-making system that allows to individually control each drone in a group flight. An algorithm is developed that allows controlling drones by controlling their speed.
Źródło:
Zeszyty Naukowe. Transport / Politechnika Śląska; 2021, 110; 157--167
0209-3324
2450-1549
Pojawia się w:
Zeszyty Naukowe. Transport / Politechnika Śląska
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A custom co-processor for the discovery of low autocorrelation binary sequences
Autorzy:
Russek, P.
Karwatowski, M.
Jamro, E.
Wiatr, K.
Powiązania:
https://bibliotekanauki.pl/articles/114571.pdf
Data publikacji:
2016
Wydawca:
Stowarzyszenie Inżynierów i Techników Mechaników Polskich
Tematy:
LABS
SDLS algorithm
custom processors
HLS
FPGA
Opis:
We present a custom processor that was designed to enhance algorithms of finding Low Autocorrelation Binary Sequences (LABS). Finding LABS is very computationally exhaustive, but no custom computing solutions have been reported in the literature so far. A computational kernel which allowed creating an effective single-purpose processor was determined and an appropriate architecture was proposed. The selected elements of the architecture were coded in High-Level Synthesis (HLS) language to speed up the design process. Afterwards, the processor was verified and tested in Xilinx’s Virtex7 FPGA. At the beginning of the paper, we briefly present the finding LABS problem and its importance. Later, we deliver the algorithm, its custom processor structure, and implementation results in terms of the processor performance, size and power.
Źródło:
Measurement Automation Monitoring; 2016, 62, 5; 154-156
2450-2855
Pojawia się w:
Measurement Automation Monitoring
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A differential evolution approach to dimensionality reduction for classification needs
Autorzy:
Martinović, G.
Bajer, D.
Zorić, B.
Powiązania:
https://bibliotekanauki.pl/articles/331498.pdf
Data publikacji:
2014
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
classification
differential evolution
feature subset selection
k-nearest neighbour algorithm
wrapper method
ewolucja różnicowa
selekcja cech
algorytm najbliższego sąsiada
Opis:
The feature selection problem often occurs in pattern recognition and, more specifically, classification. Although these patterns could contain a large number of features, some of them could prove to be irrelevant, redundant or even detrimental to classification accuracy. Thus, it is important to remove these kinds of features, which in turn leads to problem dimensionality reduction and could eventually improve the classification accuracy. In this paper an approach to dimensionality reduction based on differential evolution which represents a wrapper and explores the solution space is presented. The solutions, subsets of the whole feature set, are evaluated using the k-nearest neighbour algorithm. High quality solutions found during execution of the differential evolution fill the archive. A final solution is obtained by conducting k-fold cross-validation on the archive solutions and selecting the best one. Experimental analysis is conducted on several standard test sets. The classification accuracy of the k-nearest neighbour algorithm using the full feature set and the accuracy of the same algorithm using only the subset provided by the proposed approach and some other optimization algorithms which were used as wrappers are compared. The analysis shows that the proposed approach successfully determines good feature subsets which may increase the classification accuracy.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2014, 24, 1; 111-122
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
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ł
Wyświetlanie 1-15 z 1766

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