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ę "Karcz-Dulęba, I." wg kryterium: Autor

  Lista filtrów
Wyrównaj
    Wyświetlanie 1-6 z 6
    Tytuł:
    Asymptotic behaviour of a discrete dynamical system generated by a simple evolutionary process
    Autorzy:
    Karcz-Dulęba, I.
    Powiązania:
    https://bibliotekanauki.pl/articles/907236.pdf
    Data publikacji:
    2004
    Wydawca:
    Uniwersytet Zielonogórski. Oficyna Wydawnicza
    Tematy:
    ewolucja fenotypowa
    dynamika populacji
    populacja mała
    zachowanie asymptotyczne
    phenotypic evolution
    population dynamics
    small populations
    asymptotic behaviour
    space of population states
    Opis:
    A simple model of phenotypic evolution is introduced and analysed in a space of population states. The expected values of the population states generate a discrete dynamical system. The asymptotic behaviour of the system is studied with the use of classical tools of dynamical systems. The number, location and stability of fixed points of the system depend on parameters of a fitness function and the parameters of the evolutionary process itself. The influence of evolutionary process parameters on the stability of the fixed points is discussed. For large values of the standard deviation of mutation, fixed points become unstable and periodical orbits arise. An analysis of the periodical orbits is presented.
    Źródło:
    International Journal of Applied Mathematics and Computer Science; 2004, 14, 1; 79-90
    1641-876X
    2083-8492
    Pojawia się w:
    International Journal of Applied Mathematics and Computer Science
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    The impatience mechanism as a diversity maintaining and saddle crossing strategy
    Autorzy:
    Karcz-Duleba, I.
    Powiązania:
    https://bibliotekanauki.pl/articles/330803.pdf
    Data publikacji:
    2016
    Wydawca:
    Uniwersytet Zielonogórski. Oficyna Wydawnicza
    Tematy:
    phenotypic evolution
    impatience operator
    extra knowledge
    polarization of population
    maintaining population diversity
    saddle crossing
    ewolucja fenotypowa
    wiedza dodatkowa
    różnorodność populacji
    Opis:
    The impatience mechanism diversifies the population and facilitates escaping from a local optima trap by modifying fitness values of poorly adapted individuals. In this paper, two versions of the impatience mechanism coupled with a phenotypic model of evolution are studied. A population subordinated to a basic version of the impatience mechanism polarizes itself and evolves as a dipole centered around an averaged individual. In the modified version, the impatience mechanism is supplied with extra knowledge about a currently found optimum. In this case, the behavior of a population is quite different than previously—considerable diversification is also observed, but the population is not polarized and evolves as a single cluster. The impatience mechanism allows crossing saddles relatively fast in different configurations of bimodal and multimodal fitness functions. Actions of impatience mechanisms are shown and compared with evolution without the impatience and with a fitness sharing. The efficiency of crossing saddles is experimentally examined for different fitness functions. Results presented in the paper confirm good properties of the impatience mechanism in diversity maintaining and saddle crossing.
    Źródło:
    International Journal of Applied Mathematics and Computer Science; 2016, 26, 4; 905-918
    1641-876X
    2083-8492
    Pojawia się w:
    International Journal of Applied Mathematics and Computer Science
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Time to the convergence of evolution in the space of population states
    Autorzy:
    Karcz-Dulęba, I.
    Powiązania:
    https://bibliotekanauki.pl/articles/907643.pdf
    Data publikacji:
    2004
    Wydawca:
    Uniwersytet Zielonogórski. Oficyna Wydawnicza
    Tematy:
    ewolucja fenotypowa
    układ dynamiczny
    punkt stały
    phenotypic evolution
    dynamical system
    time to convergence
    fixed points
    Opis:
    Phenotypic evolution of two-element populations with proportional selection and normally distributed mutation is considered. Trajectories of the expected location of the population in the space of population states are investigated. The expected location of the population generates a discrete dynamical system. The study of its fixed points, their stability and time to convergence is presented. Fixed points are located in the vicinity of optima and saddles. For large values of the standard deviation of mutation, fixed points become unstable and periodical orbits arise. In this case, fixed points are also moved away from optima. The time to convergence to fixed points depends not only on the mutation rate, but also on the distance of the points from unstability. Results show that a population spends most time wandering slowly towards the optimum with mutation as the main evolution factor.
    Źródło:
    International Journal of Applied Mathematics and Computer Science; 2004, 14, 3; 279-287
    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 methods solving repeatable inverse kinematics for robot manipulators
    Autorzy:
    Duleba, I.
    Karcz-Duleba, I.
    Powiązania:
    https://bibliotekanauki.pl/articles/229288.pdf
    Data publikacji:
    2018
    Wydawca:
    Polska Akademia Nauk. Czytelnia Czasopism PAN
    Tematy:
    manipulator
    inverse kinematics
    repeatability
    optimization
    algorithms
    Opis:
    In this paper two recent methods of solving a repeatable inverse kinematic task are compared. The methods differ substantially although both are rooted in optimization techniques. The first one is based on a paradigm of continuation methods while the second one takes advantage of consecutive approximations. The methods are compared based on a quality of provided results and other quantitative and qualitative factors. In order to get a statistically valuable comparison, some data are collected from simulations performed on pendula robots with different paths to follow, initial configurations and a degree of redundancy.
    Źródło:
    Archives of Control Sciences; 2018, 28, 1; 5-18
    1230-2384
    Pojawia się w:
    Archives of Control Sciences
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Suboptimal approximations in repeatable inverse kinematics for robot manipulators
    Autorzy:
    Duleba, I.
    Karcz-Duleba, I.
    Powiązania:
    https://bibliotekanauki.pl/articles/201509.pdf
    Data publikacji:
    2017
    Wydawca:
    Polska Akademia Nauk. Czytelnia Czasopism PAN
    Tematy:
    manipulator
    inverse kinematics
    repeatability
    optimization
    odwrotna kinematyka
    powtarzalność
    optymalizacja
    Opis:
    In this paper a repeatable inverse kinematic task was solved via an approximation of a pseudo-inverse Jacobian matrix of a robot manipulator. An entry configuration to the task was optimized and a task-dependent definition of an approximation region, in a configuration space, was utilized. As a side effect, a relationship between manipulability and optimally augmented forward kinematics was established and independence of approximation task solutions on rotations in augmented components of kinematics was proved. A simulation study was performed on planar pendula manipulators. It was demonstrated that selection of an initial configuration to the repeatable inverse kinematic task heavily impacts solvability of the task and its quality. Some remarks on a formulation of the approximation task and its numerical aspects were also provided.
    Źródło:
    Bulletin of the Polish Academy of Sciences. Technical Sciences; 2017, 65, 2; 209-217
    0239-7528
    Pojawia się w:
    Bulletin of the Polish Academy of Sciences. Technical Sciences
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    A fast evaluation of initial configurations in repeatable inverse kinematics for redundant manipulators
    Autorzy:
    Duleba, I.
    Karcz-Duleba, I.
    Mielczarek, A.
    Powiązania:
    https://bibliotekanauki.pl/articles/329751.pdf
    Data publikacji:
    2018
    Wydawca:
    Uniwersytet Zielonogórski. Oficyna Wydawnicza
    Tematy:
    robot manipulator
    repeatable inverse kinematics
    initial configuration
    manipulator robotyczny
    kinematyka odwrotna
    konfiguracja początkowa
    Opis:
    A repeatable inverse kinematic task in robot manipulators consists in finding a loop (cyclic trajectory) in a configuration space, which corresponds to a given loop in a task space. In the robotic literature, an entry configuration to the trajectory is fixed and given by a user. In this paper the assumption is released and a new, indirect method is introduced to find entry configurations generating short trajectories. The method avoids a computationally expensive evaluation of (infinite) many entry configurations for redundant manipulators (for each of them, repeatable inverse kinematics should be run). Some fast-to-compute functions are proposed to evaluate entry configurations and their correlations with resulting lengths of trajectories are computed. It appears that only an original function, based on characteristics of a manipulability subellipsoid, properly distinguishes entry configurations that generate short trajectories. This function can be used either to choose one from a few possible entry configurations or as an optimized function to compute the best initial configuration.
    Źródło:
    International Journal of Applied Mathematics and Computer Science; 2018, 28, 3; 483-492
    1641-876X
    2083-8492
    Pojawia się w:
    International Journal of Applied Mathematics and Computer Science
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
      Wyświetlanie 1-6 z 6

      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