• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 65
  • 16
  • 11
  • 10
  • 5
  • 2
  • 2
  • 1
  • 1
  • Tagged with
  • 144
  • 144
  • 51
  • 35
  • 31
  • 23
  • 21
  • 19
  • 19
  • 17
  • 16
  • 14
  • 14
  • 14
  • 14
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.
111

Digitalizace rozvodny vysokého napětí při použití komunikačního standardu IEC61850 / Communication standard IEC61850 for MV substation

Lednický, Pavel January 2011 (has links)
ABB s r.o. is one of the most important companies that are concerned with setting of trends in electro-energetic field. One of these trends is digitalization of medium voltage substations that leads to simplified of internal connection and easier connection of substation to the control system. This thesis deals possibilities of connection of communication, methods of controlling logical operations by centralized or distributed system and compares potential of these systems.
112

A Hybrid Method for Distributed Multi-Agent Mission Planning System

Nicholas S Schultz (8747079) 22 April 2020 (has links)
<div>The goal of this research is to develop a method of control for a team of unmanned aerial and ground robots that is resilient, robust, and scalable given both complete and incomplete information of the environment. The method presented in this paper integrates approximate and optimal methods of path planning integrated with a market-based task allocation strategy. Further work presents a solution to unmanned ground vehicle path planning within the developed mission planning system framework under incomplete information. Deep reinforcement learning is proposed to solve movement through unknown terrain environment. The final demonstration for Advantage-Actor Critic deep reinforcement learning elicits successful implementation of the proposed model.</div>
113

Second Order Sufficient Optimality Conditions for Nonlinear Parabolic Control Problems with State Constraints

Raymond, Jean-Pierre, Tröltzsch, Fredi 30 October 1998 (has links)
In this paper, optimal control problems for semilinear parabolic equations with distributed and boundary controls are considered. Pointwise constraints on the control and on the state are given. Main emphasis is laid on the discussion of second order sufficient optimality conditions. Sufficiency for local optimality is verified under different assumptions imposed on the dimension of the domain and on the smoothness of the given data.
114

Lipschitz stability of solutions to linear-quadratic parabolic control problems with respect to perturbations

Tröltzsch, F. 30 October 1998 (has links)
We consider a class of control problems governed by a linear parabolic initial-boundary value problem with linear-quadratic objective and pointwise constraints on the control. The control system contains different types of perturbations. They appear in the linear part of the objective functional, in the right hand side of the equation, in its boundary condition, and in the initial value. Making use of parabolic regularity in the whole scale of $L^p$ the known Lipschitz stability in the $L^2$-norm is improved to the supremum-norm.
115

Advanced Proportional Servo Valve Control with Customized Control Code using White Space

Lauer, Peter January 2016 (has links)
An industrial control valve has been designed by Eaton (AxisPro® valve). The servo performance valve has onboard electronics that features external and internal sensor interfaces, advanced control modes and network capability. Advanced control modes are implement in the valves firmware. With the help of the white space it is possilbe to execute custom code directly on the valve that interact with these controls. Small OEM applications, like rubber moulding machines, benefit from the comination of build in controls and custom code, to provide adaptations for their special machines.
116

Social Behavior based Collaborative Self-organization in Multi-robot Systems

Tamzidul Mina (9755873) 14 December 2020 (has links)
<div>Self-organization in a multi-robot system is a spontaneous process where some form of overall order arises from local interactions between robots in an initially disordered system. Cooperative coordination strategies for self-organization promote teamwork to complete a task while increasing the total utility of the system. In this dissertation, we apply prosocial behavioral concepts such as altruism and cooperation in multi-robot systems and investigate their effects on overall system performance on given tasks. We stress the significance of this research in long-term applications involving minimal to no human supervision, where self-sustainability of the multi-robot group is of utmost importance for the success of the mission at hand and system re-usability in the future.</div><div><br></div><div>For part of the research, we take bio-inspiration of cooperation from the huddling behavior of Emperor Penguins in the Antarctic which allows them to share body heat and survive one of the harshest environments on Earth as a group. A cyclic energy sharing concept is proposed for a convoying structured multi-robot group inspired from penguin movement dynamics in a huddle with carefully placed induction coils to facilitate directional energy sharing with neighbors and a position shuffling algorithm, allowing long-term survival of the convoy as a group in the field. Simulation results validate that the cyclic process allows individuals an equal opportunity to be at the center of the group identified as the most energy conserving position, and as a result robot groups were able to travel over 4 times the distance during convoying with the proposed method without any robot failing as opposed to without the shuffling and energy sharing process. </div><div><br></div><div>An artificial potential based Adaptive Inter-agent Spacing (AIS) control law is also proposed for efficient energy distribution in an unstructured multi-robot group aimed at long-term survivability goals in the field. By design, as an altruistic behavior higher energy bearing robots are dispersed throughout the group based on their individual energy levels to counter skewed initial distributions for faster group energy equilibrium attainment. Inspired by multi-huddle merging and splitting behavior of Emperor Penguins, a clustering and sequential merging based systematic energy equilibrium attainment method is also proposed as a supplement to the AIS controller. The proposed system ensures that high energy bearing agents are not over crowded by low energy bearing agents. The AIS controller proposed for the unstructured energy sharing and distribution process yielded 55%, 42%, 23% and 33% performance improvements in equilibrium attainment convergence time for skewed, bi-modal, normal and random initial agent resource level distributions respectively on a 2D plane using the proposed energy distribution method over the control method of no adaptive spacing. Scalability analysis for both energy sharing concepts confirmed their application with consistently improved performances different sized groups of robots. Applicability of the AIS controller as a generalized resource distribution method under certain constraints is also discussed to establish its significance in various multi-robot applications.</div><div><br></div><div>A concept of group based survival from damaging directional external stimuli is also adapted from the Emperor Penguin huddling phenomenon where individuals on the damaging stimuli side continuously relocate to the leeward side of the group following the group boundary using Gaussian Processes Machine Learning based global health-loss rate minima estimations in a distributed manner. The method relies on cooperation from all robots where individuals take turns being sheltered by the group from the damaging external stimuli. The distributed global health loss rate minima estimation allowed the development of two settling conditions. The global health loss rate minima settling method yielded 12.6%, 5.3%, 16.7% and 14.2% improvement in average robot health over the control case of no relocation, while an optimized health loss rate minima settling method further improved on the global health loss rate settling method by 3.9%, 1.9%, 1.7% and 0.6% for robot group sizes 26, 35, 70 and 107 respectively.</div><div><br></div><div>As a direct application case study of collaboration in multi-robot systems, a distributed shape formation strategy is proposed where robots act as beacons to help neighbors settle in a prescribed formation by local signaling. The process is completely distributed in nature and does not require any external control due to the cooperation between robots. Beacon robots looking for a robot to settle as a neighbor and continue the shape formation process, generates a surface gradient throughout the formed shape that allow robots to determine the direction of the structure forming frontier along the dynamically changing structure surface and eventually reach the closest beacon. Simulation experiments validate complex shape formation in 2D and 3D using the proposed method. The importance of group collaboration is emphasized in this case study without which the shape formation process would not be possible, without a centralized control scheme directing individual agents to specific positions in the structure. </div><div> </div><div>As the final application case study, a collaborative multi-agent transportation strategy is proposed for unknown objects with irregular shape and uneven weight distribution. Although, the proposed system is robust to single robot object transportation, the proposed methodology of transport is focused on robots regulating their effort while pushing objects from an identified pushing location hoping other robots support the object moment on the other end of the center of mass to prevent unintended rotation and create an efficient path of the object to the goal. The design of the object transportation strategy takes cooperation cues from human behaviors when coordinating pushing of heavy objects from two ends. Collaboration is achieved when pushing agents can regulate their effort with one another to maintain an efficient path for the object towards the set goal. Numerous experiments of pushing simple shapes such as disks and rectangular boxes and complex arbitrary shapes with increasing number of robots validate the significance and effectiveness of the proposed method. Detailed robustness studies of changing weight of objects during transportation portrayed the importance of cooperation in multi-agent systems in countering unintended drift effects of the object and maintain a steady efficient path to the goal. </div><div><br></div><div>Each case study is presented independent of one another with the Penguin huddling based self-organizations in response to internal and external stimuli focused on fundamental self-organization methods, and the structure formation and object transportation strategies focused on cooperation in specific applications. All case studies are validated by relevant simulation and experiments to establish the effectiveness of altruistic and cooperative behaviors in multi-robot systems.</div>
117

Stability and Control in Complex Networks of Dynamical Systems

Manaffam, Saeed 01 January 2015 (has links)
Stability analysis of networked dynamical systems has been of interest in many disciplines such as biology and physics and chemistry with applications such as LASER cooling and plasma stability. These large networks are often modeled to have a completely random (Erdös-Rényi) or semi-random (Small-World) topologies. The former model is often used due to mathematical tractability while the latter has been shown to be a better model for most real life networks. The recent emergence of cyber physical systems, and in particular the smart grid, has given rise to a number of engineering questions regarding the control and optimization of such networks. Some of the these questions are: How can the stability of a random network be characterized in probabilistic terms? Can the effects of network topology and system dynamics be separated? What does it take to control a large random network? Can decentralized (pinning) control be effective? If not, how large does the control network needs to be? How can decentralized or distributed controllers be designed? How the size of control network would scale with the size of networked system? Motivated by these questions, we began by studying the probability of stability of synchronization in random networks of oscillators. We developed a stability condition separating the effects of topology and node dynamics and evaluated bounds on the probability of stability for both Erdös-Rényi (ER) and Small-World (SW) network topology models. We then turned our attention to the more realistic scenario where the dynamics of the nodes and couplings are mismatched. Utilizing the concept of ε-synchronization, we have studied the probability of synchronization and showed that the synchronization error, ε, can be arbitrarily reduced using linear controllers. We have also considered the decentralized approach of pinning control to ensure stability in such complex networks. In the pinning method, decentralized controllers are used to control a fraction of the nodes in the network. This is different from traditional decentralized approaches where all the nodes have their own controllers. While the problem of selecting the minimum number of pinning nodes is known to be NP-hard and grows exponentially with the number of nodes in the network we have devised a suboptimal algorithm to select the pinning nodes which converges linearly with network size. We have also analyzed the effectiveness of the pinning approach for the synchronization of oscillators in the networks with fast switching, where the network links disconnect and reconnect quickly relative to the node dynamics. To address the scaling problem in the design of distributed control networks, we have employed a random control network to stabilize a random plant network. Our results show that for an ER plant network, the control network needs to grow linearly with the size of the plant network.
118

Evolvable Production Systems: Demand Responsive Planning

Akillioglu, Hakan January 2011 (has links)
Dynamic and unforeseeable characteristic of the current market and production environment is not feasible to be met through pre-set parameters being dependent on the predictions. Handling this matter requires to keep focus on production system adaptability. Evolvable Production System has achieved fully system reconfigurability through process oriented modularity and multi agent based distributed control system architecture. One of the essential enhancements provided by EPS on the shop floor is achieving minimized/eliminated system setup time in response to changing product requirements. Manufacturing planning and control system, on the other hand, follows hierarchical principles which are quite much reliant on the predicted information so to structure production and planning environment on it. Production system limitations, such as lack of adaptability in response to changing conditions, are in fact influencing the planning system to be structured on the predictions. The enhancements which are ensured by the architecture of EPS enable to relax the constraints on planning system which are imposed by the limitations of production system. These enhancements have an effect at different levels in the planning hierarchy. On the light of these improvements, the planning framework as it is used so far in the industry becomes invalid and this arise a requirement for planning system structure to be designed according to a fully reconfigurable system to be able to benefit such a production system by all means. This thesis targets to enlighten the relation between the production system characteristics and planning system structure by emphasizing the planning problems and proposing a planning reference architecture solution to be able achieve a responsive planning framework. / <p>QC 20140916</p>
119

EFFICIENT RESOURCE ALLOCATION IN NETWORKS: FROM CENTRALIZED TO DISTRIBUTED APPROACHES

Ciyuan Zhang (17409372) 21 November 2023 (has links)
<p dir="ltr">Network models are essential for representing a myriad of real-world problems. Two of the most important categories of networks are centralized and distributed networks. In this thesis, we investigate the efficient resource allocation for one centralized communication network and two distributed epidemic networks.</p><p dir="ltr">In Chapter 2, we study three proposed centralized coded caching schemes with uncoded pre-fetching for scenarios where end users are grouped into classes with different file demand sets. We provide a lower bound for the transmission rate for the system with heterogeneous user profiles. Then the transmission rates of the three schemes are compared with the lower bound to evaluate their gap to optimality, and also compared with each other to show that each scheme can outperform the other two when certain conditions are met. Finally, we propose a cache distribution method that results in a minimal peak rate and a minimal average rate for one of the schemes when the users’ storage is relatively small compared with the size of the library.</p><p dir="ltr">In Chapter 3, we examine a discrete-time networked SIR (susceptible-infected-recovered) epidemic model, where the infection, graph, and recovery parameters may be time-varying. We propose a stochastic framework to estimate the system states from observed testing data and provide an analytic expression for the error of the estimation algorithm. We validate some of our assumptions for the stochastic framework with real COVID-19 testing data. We identify the system parameters with the system states from our estimation algorithm. Employing the estimated system states, we provide a novel distributed eradication strategy that guarantees at least exponential convergence to the set of healthy states. We illustrate the results via simulations over northern Indiana, USA.</p><p dir="ltr">In Chapter 4, we propose a novel discrete-time multi-virus SIR model that captures the spread of competing SIR epidemics over a population network. First, we provide a sufficient condition for the infection level of all the viruses over the networked model to converge to zero in exponential time. Second, we propose an observation model which captures the summation of all the viruses’ infection levels in each node, which represents the individuals who are infected by different viruses but share similar symptoms. We present a sufficient condition for the model to be strongly locally observable. We propose a distributed Luenberger observer for the system state estimation. We demonstrate how to calculate the observer gain for the estimator and prove that the estimation error of our proposed estimator converges to zero asymptotically with the observer gain found. We also propose a distributed feedback controller which guarantees that all viruses are eradicated at an exponential rate. We then show via simulations that the estimation error of the Luenberger observer converges to zero before the viruses die out.</p><p dir="ltr">We conclude in Chapter 5, where we summarize the findings of this thesis and introduce several challenging open research questions that arise from its results. These questions encompass a range of topics, including the design of optimal testing strategies for large populations, the investigation of estimation techniques in the presence of noisy measurement models, the extension of the SIR epidemic model to more complex models like SEIR and SAIR, and the exploration of efficient vaccine allocation schemes.</p>
120

Phase Locking in Coupled Oscillators as Hybrid Automata

Calvitti, Alan 27 April 2004 (has links)
No description available.

Page generated in 0.1076 seconds