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ę "Multi-agent systems" wg kryterium: Temat

  Lista filtrów
Wyrównaj
    Wyświetlanie 1-7 z 7
    Tytuł:
    Evacuation by leader-follower model with bounded confidence and predictive mechanisms
    Autorzy:
    Almeida, Ricardo
    Girejko, Ewa
    Machado, Luis
    Malinowska, Agnieszka B.
    Martins, Natália
    Powiązania:
    https://bibliotekanauki.pl/articles/1845516.pdf
    Data publikacji:
    2021
    Wydawca:
    Polska Akademia Nauk. Czytelnia Czasopism PAN
    Tematy:
    multi-agent systems
    emergency
    model predictive control
    bounded confidence
    Opis:
    This paper studies an evacuation problem described by a leader-follower model with bounded confidence under predictive mechanisms. We design a control strategy in such a way that agents are guided by a leader, which follows the evacuation path. The proposed evacuation algorithm is based on Model Predictive Control (MPC) that uses the current and the past information of the system to predict future agents’ behaviors. It can be observed that, with MPC method, the leader-following consensus is obtained faster in comparison to the conventional optimal control technique. The effectiveness of the developed MPC evacuation algorithm with respect to different parameters and different time domains is illustrated by numerical examples.
    Źródło:
    Archives of Control Sciences; 2021, 31, 3; 629-644
    1230-2384
    Pojawia się w:
    Archives of Control Sciences
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Evacuation by leader-follower model with bounded confidence and predictive mechanisms
    Autorzy:
    Almeida, Ricardo
    Girejko, Ewa
    Machado, Luis
    Malinowska, Agnieszka B.
    Martins, Natália
    Powiązania:
    https://bibliotekanauki.pl/articles/1845527.pdf
    Data publikacji:
    2021
    Wydawca:
    Polska Akademia Nauk. Czytelnia Czasopism PAN
    Tematy:
    multi-agent systems
    emergency
    model predictive control
    bounded confidence
    Opis:
    This paper studies an evacuation problem described by a leader-follower model with bounded confidence under predictive mechanisms. We design a control strategy in such a way that agents are guided by a leader, which follows the evacuation path. The proposed evacuation algorithm is based on Model Predictive Control (MPC) that uses the current and the past information of the system to predict future agents’ behaviors. It can be observed that, with MPC method, the leader-following consensus is obtained faster in comparison to the conventional optimal control technique. The effectiveness of the developed MPC evacuation algorithm with respect to different parameters and different time domains is illustrated by numerical examples.
    Źródło:
    Archives of Control Sciences; 2021, 31, 3; 629-644
    1230-2384
    Pojawia się w:
    Archives of Control Sciences
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Distributed event-triggered generalized Nash equilibrium seeking for aggregative games on unbalanced digraphs
    Autorzy:
    Cai, Xin
    Nan, Xinyuan
    Gao, Bingpeng
    Powiązania:
    https://bibliotekanauki.pl/articles/2175114.pdf
    Data publikacji:
    2022
    Wydawca:
    Polska Akademia Nauk. Czytelnia Czasopism PAN
    Tematy:
    aggregative games
    coupled constraints
    generalized Nash equilibrium
    multi-agent systems
    Opis:
    This paper addresses the problem of seeking generalized Nash equilibrium for constrained aggregative games with double-integrator agents who communicate with each other on an unbalanced directed graph. An auxiliary variable is introduced to balance the consensus terms in the designed algorithm by estimating the left eigenvector of the Laplacian matrix associated with the zero eigenvalue in a distributed manner. Moreover, an event-triggered broadcasting scheme is proposed to reduce communication loads in the network. It is shown that the proposed communication scheme is free of the Zeno behavior and the asymptotic convergence of the designed algorithm is obtained. Simulation results are demonstrated to validate the proposed methods.
    Źródło:
    Archives of Control Sciences; 2022, 32, 4; 783--800
    1230-2384
    Pojawia się w:
    Archives of Control Sciences
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Cluster consensus of general fractional-order nonlinear multi agent systems via adaptive sliding mode controller
    Autorzy:
    Yaghoubi, Zahra
    Talebi, Heidar Ali
    Powiązania:
    https://bibliotekanauki.pl/articles/230002.pdf
    Data publikacji:
    2019
    Wydawca:
    Polska Akademia Nauk. Czytelnia Czasopism PAN
    Tematy:
    nonlinear multi agent systems
    cluster consensus
    fractional-order systems
    adaptive sliding mode controller
    Opis:
    In this paper cluster consensus is investigated for general fractional-order multi agent systems with nonlinear dynamics via adaptive sliding mode controller. First, cluster consensus for fractional-order nonlinear multi agent systems with general form is investigated. Then, cluster consensus for the fractional-order nonlinear multi agent systems with first-order and general form dynamics is investigated by using adaptive sliding mode controller. Sufficient conditions for achieving cluster consensus for general fractional-order nonlinear multi agent systems are proved based on algebraic graph theory, Lyapunov stability theorem and Mittag-Leffler function. Finally, simulation examples are presented for first-order and general form multi agent systems, i.e. a single-link flexible joint manipulator which demonstrates the efficiency of the proposed adaptive controller.
    Źródło:
    Archives of Control Sciences; 2019, 29, 4; 643-665
    1230-2384
    Pojawia się w:
    Archives of Control Sciences
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Asymptotic guarantee of success for multi-agent memetic systems
    Autorzy:
    Byrski, A.
    Schaefer, R.
    Smołka, M.
    Cotta, C.
    Powiązania:
    https://bibliotekanauki.pl/articles/201942.pdf
    Data publikacji:
    2013
    Wydawca:
    Polska Akademia Nauk. Czytelnia Czasopism PAN
    Tematy:
    computational multi-agent systems
    asymptotic analysis
    global optimization
    parallel evolutionary algorithms
    Markov chain modeling
    Opis:
    The paper introduces a stochastic model for a class of population-based global optimization meta-heuristics, that generalizes existing models in the following ways. First of all, an individual becomes an active software agent characterized by the constant genotype and the meme that may change during the optimization process. Second, the model embraces the asynchronous processing of agent’s actions. Third, we consider a vast variety of possible actions that include the conventional mixing operations (e.g. mutation, cloning, crossover) as well as migrations among demes and local optimization methods. Despite the fact that the model fits many popular algorithms and strategies (e.g. genetic algorithms with tournament selection) it is mainly devoted to study memetic algorithms. The model is composed of two parts: EMAS architecture (data structures and management strategies) allowing to define the space of states and the framework for stochastic agent actions and the stationary Markov chain described in terms of this architecture. The probability transition function has been obtained and the Markov kernels for sample actions have been computed. The obtained theoretical results are helpful for studying metaheuristics conforming to the EMAS architecture. The designed synchronization allows the safe, coarse-grained parallel implementation and its effective, sub-optimal scheduling in a distributed computer environment. The proved strong ergodicity of the finite state Markov chain results in the asymptotic stochastic guarantee of success, which in turn imposes the liveness of a studied metaheuristic. The Markov chain delivers the sampling measure at an arbitrary step of computations, which allows further asymptotic studies, e.g. on various kinds of the stochastic convergence.
    Źródło:
    Bulletin of the Polish Academy of Sciences. Technical Sciences; 2013, 61, 1; 257-278
    0239-7528
    Pojawia się w:
    Bulletin of the Polish Academy of Sciences. Technical Sciences
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Off-line and dynamic production scheduling - a comparative case study
    Autorzy:
    Bożek, A.
    Wysocki, M.
    Powiązania:
    https://bibliotekanauki.pl/articles/406687.pdf
    Data publikacji:
    2016
    Wydawca:
    Polska Akademia Nauk. Czytelnia Czasopism PAN
    Tematy:
    flexible job shop
    lot streaming
    off-line scheduling
    dynamic scheduling
    tabu search
    constraint programming
    dispatching rule
    Petri nets
    multi-agent systems
    Opis:
    A comprehensive case study of manufacturing scheduling solutions development is given. It includes highly generalized scheduling problem as well as a few scheduling modes, methods and problem models. The considered problem combines flexible job shop structure, lot streaming with variable sublots, transport times, setup times, and machine calendars. Tabu search metaheuristic and constraint programming methods have been used for the off-line scheduling. Two dynamic scheduling methods have also been implemented, i.e., dispatching rules for the completely reactive scheduling and a multi-agent system for the predictivereactive scheduling. In these implementations three distinct models of the problem have been used, based on: graph representation, optimal constraint satisfaction, and Petri net formalism. Each of these solutions has been verified in computational experiments. The results are compared and some findings about advantages, disadvantages, and suggestions on using the solutions are formulated.
    Źródło:
    Management and Production Engineering Review; 2016, 7, 1; 21-32
    2080-8208
    2082-1344
    Pojawia się w:
    Management and Production Engineering Review
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Distributed control systems integration and management with an ontology-based multi-agent system
    Autorzy:
    Choiński, D.
    Senik, M.
    Powiązania:
    https://bibliotekanauki.pl/articles/201395.pdf
    Data publikacji:
    2018
    Wydawca:
    Polska Akademia Nauk. Czytelnia Czasopism PAN
    Tematy:
    distributed control system
    multi-agent system
    software based integration systems
    ontology
    Petri nets
    system wieloagentowy
    ontologia
    sieci Petriego
    inteligentny system kontroli
    Opis:
    The purpose of this study is to create, analyze and reuse an ontology-based approach during implementation of a multi-agent system (MAS) capable of integrating different elements of a distributed control system (DCS). Ontology is considered as knowledge about a particular domain. It includes static description of the domain’s structure and properties, by means of which it is possible to define the domain’s dynamic states, transitions between those states and conditions of those transitions. Because of that, it is possible to analyze such ontology in terms of modal logic in predicate logic settings.
    Źródło:
    Bulletin of the Polish Academy of Sciences. Technical Sciences; 2018, 66, 5; 613-620
    0239-7528
    Pojawia się w:
    Bulletin of the Polish Academy of Sciences. Technical Sciences
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
      Wyświetlanie 1-7 z 7

      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