An Optimized Type-2 Self-Organizing Fuzzy Logic Controller Applied in Anesthesia for Propofol Dosing to Regulate BIS

During general anesthesia, anesthesiologists who provide anesthetic dosage traditionally play a fundamental role to regulate Bispectral Index (BIS). However, in this paper, an optimized type-2 Self-Organizing Fuzzy Logic Controller (SOFLC) is designed for Target Controlled Infusion (TCI) pump related to propofol dosing guided by BIS, to realize automatic control of general anesthesia. The type-2 SOFLC combines a type-2 fuzzy logic controller with a self-organizing (SO) mechanism to facilitate online training while able to contend with operational uncertainties. A novel data driven Surrogate Model (SM) and Genetic Programming (GP) based strategy is introduced for optimizing the type-2 SOFLC parameters offline to handle inter-patient variability. A pharmacological model is built for simulation in which different optimization strategies are tested and compared. Simulation results are presented to demonstrate the applicability of our approach and show that the proposed optimization strategy can achieve better control performance in terms of steady state error and robustness

Adaptive structure radial basis function network model for processes with operating region migration

An adaptive structure radial basis function (RBF) network model is proposed in this paper to model nonlinear processes with operating region migration. The recursive orthogonal least squares algorithm is adopted to select new centers on-line, as well as to train the network weights. Based on the R matrix in the orthogonal decomposition, an initial center bank is formed and updated in each sample period. A new learning strategy is proposed to gain information from the new data for network structure adaptation. A center grouping algorithm is also developed to divide the centers into active and non-active groups, so that a structure with a smaller size is maintained in the final network model. The proposed RBF model is evaluated and compared to the two fixed-structure RBF networks by modeling a nonlinear time-varying numerical example. The results demonstrate that the proposed adaptive structure model is capable of adapting its structure to fit the operating region of the process effectively with a more compact structure and it significantly outperforms the two fixed structure RBF models

Swarm Robotics

This study analyzes and designs the Swarm intelligence (SI) that Self-organizing migrating algorithm (SOMA) represents to solve industrial practice as well as academic optimization problems, and applies them to swarm robotics. Specifically, the characteristics of SOMA are clarified, shaping the basis for the analysis of SOMA's strengths and weaknesses for the release of SOMA T3A, SOMA Pareto, and iSOMA, with outstanding performance, confirmed by well-known test suites from IEEE CEC 2013, 2015, 2017, and 2019. Besides, the dynamic path planning problem for swarm robotics is handled by the proposed algorithms considered as a prime instance. The computational and simulation results on Matlab have proven the performance of the novel algorithms as well as the correctness of the obstacle avoidance method for mobile robots and drones. Furthermore, two out of the three proposed versions achieved the tie for 3rd (the same ranking with HyDE-DF) and 5th place in the 100-Digit Challenge at CEC 2019, GECCO 2019, and SEMCCO 2019 competition, something that any other version of SOMA has yet to do. They show promising possibilities that SOMA and SI algorithms offer.Tato práce se zabývá analýzou a vylepšením hejnové inteligence, kterou představuje samoorganizující se migrační algoritmus s možností využití v průmyslové praxi a se zaměřením na hejnovou robotiku. Je analyzován algoritmus SOMA, identifikovány silné a slabé stránky a navrženy nové verze SOMA jako SOMA T3A, SOMA Pareto, iSOMA s vynikajícím výkonem, potvrzeným známými testovacími sadami IEEE CEC 2013, 2015, 2017 a 2019. Tyto verze jsou pak aplikovány na problém s dynamickým plánováním dráhy pro hejnovou robotiku. Výsledky výpočtů a simulace v Matlabu prokázaly výkonnost nových algoritmů a správnost metody umožňující vyhýbání se překážkám u mobilních robotů a dronů. Kromě toho dvě ze tří navržených verzí dosáhly na 3. a 5. místo v soutěži 100-Digit Challenge na CEC 2019, GECCO 2019 a SEMCCO 2019, což je potvrzení navržených inovací. Práce tak demonstruje nejen vylepšení SOMA, ale i slibné možnosti hejnové inteligence.460 - Katedra informatikyvyhově

Decentralized planning for self-adaptation in multi-cloud environment

The runtime management of Internet of Things (IoT) oriented applications deployed in multi-clouds is a complex issue due to the highly heterogeneous and dynamic execution environment. To effectively cope with such an environment, the cross-layer and multi-cloud effects should be taken into account and a decentralized self-adaptation is a promising solution to maintain and evolve the applications for quality assurance. An important issue to be tackled towards realizing this solution is the uncertainty effect of the adaptation, which may cause negative impact to the other layers or even clouds. In this paper, we tackle such an issue from the planning perspective, since an inappropriate planning strategy can fail the adaptation outcome. Therefore, we present an architectural model for decentralized self-adaptation to support the cross-layer and multi-cloud environment. We also propose a planning model and method to enable the decentralized decision making. The planning is formulated as a Reinforcement Learning problem and solved using the Q-learning algorithm. Through simulation experiments, we conduct a study to assess the effectiveness and sensitivity of the proposed planning approach. The results show that our approach can potentially reduce the negative impact on the cross-layer and multi-cloud environment

Network Partitioning in Distributed Agent-Based Models

Agent-Based Models (ABMs) are an emerging simulation paradigm for modeling complex systems, comprised of autonomous, possibly heterogeneous, interacting agents. The utility of ABMs lies in their ability to represent such complex systems as self-organizing networks of agents. Modeling and understanding the behavior of complex systems usually occurs at large and representative scales, and often obtaining and visualizing of simulation results in real-time is critical. The real-time requirement necessitates the use of in-memory computing, as it is difficult and challenging to handle the latency and unpredictability of disk accesses. Combining this observation with the scale requirement emphasizes the need to use parallel and distributed computing platforms, such as MPI-enabled CPU clusters. Consequently, the agent population must be partitioned across different CPUs in a cluster. Further, the typically high volume of interactions among agents can quickly become a significant bottleneck for real-time or large-scale simulations. The problem is exacerbated if the underlying ABM network is dynamic and the inter-process communication evolves over the course of the simulation. Therefore, it is critical to develop topology-aware partitioning mechanisms to support such large simulations. In this dissertation, we demonstrate that distributed agent-based model simulations benefit from the use of graph partitioning algorithms that involve a local, neighborhood-based perspective. Such methods do not rely on global accesses to the network and thus are more scalable. In addition, we propose two partitioning schemes that consider the bottom-up individual-centric nature of agent-based modeling. The First technique utilizes label-propagation community detection to partition the dynamic agent network of an ABM. We propose a latency-hiding, seamless integration of community detection in the dynamics of a distributed ABM. To achieve this integration, we exploit the similarity in the process flow patterns of a label-propagation community-detection algorithm and self-organizing ABMs. In the second partitioning scheme, we apply a combination of the Guided Local Search (GLS) and Fast Local Search (FLS) metaheuristics in the context of graph partitioning. The main driving principle of GLS is the dynamic modi?cation of the objective function to escape local optima. The algorithm augments the objective of a local search, thereby transforming the landscape structure and escaping a local optimum. FLS is a local search heuristic algorithm that is aimed at reducing the search space of the main search algorithm. It breaks down the space into sub-neighborhoods such that inactive sub-neighborhoods are removed from the search process. The combination of GLS and FLS allowed us to design a graph partitioning algorithm that is both scalable and sensitive to the inherent modularity of real-world networks

Self-Healing Distributed Scheduling Platform

International audienceDistributed systems require effective mechanisms to manage the reliable provisioning of computational resources from different and distributed providers. Moreover, the dynamic environment that affects the behaviour of such systems and the complexity of these dynamics demand autonomous capabilities to ensure the behaviour of distributed scheduling platforms and to achieve business and user objectives. In this paper we propose a self-adaptive distributed scheduling platform composed of multiple agents implemented as intelligent feedback control loops to support policy-based scheduling and expose self-healing capabilities. Our platform leverages distributed scheduling processes by (i) allowing each provider to maintain its own internal scheduling process, and (ii) implementing self-healing capabilities based on agent module recovery. Simulated tests are performed to determine the optimal number of agents to be used in the negotiation phase without affecting the scheduling cost function. Test results on a real-life platform are presented to evaluate recovery times and optimize platform parameters

Design and Optimization of High-Torque Ferrite Assisted Synchronous Reluctance Motor

Vysokomomentový asistovaný synchronní reluktanční motor může být, soudě podle nízkého počtu publikovaných článků, stále považován za relativně málo prozkoumané téma výzkumu. Tato ale i další výhody, jako nízká výrobní cena a vysoká hustota výkonu poutají pozornost výzkumných pracovníků. Navzdory tomu, že tento druh motoru je zajímavější z pohledu konvenčních nebo vysokootáčkových aplikací, tak se i trakční aplikace dostávají do popředí s tím, jak jsou objevovány vlastnosti tohoto motoru. Tato práce se zaměřuje na návrh tohoto typu motoru pro pohon lodi, který je navržen aby dosahoval vysokého momentu při nízkých otáčkách. Aplikace je definována výkonem 55 kW při 150 otáčkách za minutu a použitím levných feritových magnetů s cílem nízké ceny motoru. Návrh motoru je úzce propojen s optimalizačními algoritmy aby bylo dosaženo co nejlepšího výkonu v daném objemu stroje. Navzdory tomu, že návrh samotný je velice zajímavým tématem, tak práce deklaruje další teze, které jsou rovněž zajímavé a důležité. Vzhledem k tomu, že je práce zaměřena i na optimalizaci, tak prvním cílem práce je porovnání různých optimalizačních metod. V této práci jsou nejenom že různé druhy optimalizačních algoritmů, samoorganizující migrující algoritmus a genetický algoritmus, porovnány, ale jsou zde porovnány i různé optimalizační metody. Metoda založená na definování preferenčního vektoru a ideální multi-objektivní metody jsou v rovněž v této práci srovnány. Tyto algoritmy jsou srovnány v případě více optimalizovaných parametrů. Dalším scénářem pro porovnání ideálních multi-objektivních algoritmů je ten s menším počtem parametrů. Posledním cílem práce je laboratorní měření navrženého optimalizovaného stroje, které rovněž představuje další set výzev v této práci, které jsou diskutovány v poslední kapitole této práce.The high-torque assisted synchronous reluctance machine could be still considered, based on the relatively low amount of publications, as a rather unknown area of research. This and other main advantages, such as low manufacturing cost and a higher torque density of this machine type are driving researchers interest. Even though this machine type has become more interesting in the conventional or high-speed applications, the area of traction applications is slowly getting forward as the machine capabilities are discovered. This thesis is serving just this purpose of developing the ship propulsion driving motor, that is capable of sustaining the high-torque at low-speed. The application is defined by the 55 kW at 150 rpm using the low- cost ferrite magnets aiming to lower the cost. The design will be closely tied with optimization algorithms to deliver the best possible performance in the given volume. However the design challenge being difficult task on its own, the thesis is declaring other goals within, that are still very interesting and important. Since the optimization is included in the design process, the first goal, concluding from the given topic is to compare various optimization methods. Not only the two different optimization algorithms, self-organizing migrating algorithm and genetic algorithm, will be compared in the thesis, but even two multi-objective optimization approaches will be compared as well. The preference based vector and ideal multi-objective optimization techniques comparison will be demonstrated in one optimization scenario with a higher amount of optimized parameters. Other demonstrated goal within the thesis is the comparison of ideal multi-objective optimization with a lower number of parameters. The last goal will be the measurement of the designed and optimized machine, that introduced variety of challenges itself and all of them will be discussed within the last chapter.