987 resultados para DISTRIBUTED DELAYS
Resumo:
This paper extends the authors' earlier work which adapted robust multiplexed MPC for application to distributed control of multi-agent systems with non-interacting dynamics and coupled constraint sets in the presence of persistent unknown, but bounded disturbances. Specifically, we propose exploiting the single agent update nature of the multiplexed approach, and fix the update sequence to enable input move-blocking and increased discretisation rates. This permits a higher rate of individual policy update to be achieved, whilst incurring no additional computational cost in the corresponding optimal control problems to be solved. A disturbance feedback policy is included between updates to facilitate finding feasible solutions. The new formulation inherits the property of rapid response to disturbances from multiplexing the control and numerical results show that fixing the update sequence does not incur any loss in performance. © 2011 IFAC.
Resumo:
Distributed hybrid testing is a natural extension to and builds upon the local hybrid testing technique. Taking advantage of the hybrid nature of the test, it allows a sharing of resources and expertise between researchers from different disciplines by connecting multiple geographically distributed sites for joint testing. As part of the UK-NEES project, a successful series of three-site distributed hybrid tests have been carried out between Bristol, Cambridge and Oxford Universities. The first known multi-site distributed hybrid tests in the UK, they connected via a dedicated fibre network, using custom software, the geotechnical centrifuge at Cambridge to structural components at Bristol and Oxford. These experiments were to prove the connection and useful insights were gained into the issues involved with this distributed environment. A wider aim is towards providing a flexible testing framework to facilitate multi-disciplinary experiments such as the accurate investigation of the influence of foundations on structural systems under seismic and other loading. Time scaling incompatibilities mean true seismic soil structure interaction using a centrifuge at g is not possible, though it is clear that distributed centrifuge testing can be valuable in other problems. Development is continuing to overcome the issues encountered, in order to improve future distributed tests in the UK and beyond.
Resumo:
This paper presents explicit solutions for a class of decentralized LQG problems in which players communicate their states with delays. A method for decomposing the Bellman equation into a hierarchy of independent subproblems is introduced. Using this decomposition, all of the gains for the optimal controller are computed from the solution of a single algebraic Riccati equation. © 2012 AACC American Automatic Control Council).
Resumo:
Optically-fed distributed antenna system (DAS) technology is combined with passive ultra high frequency (UHF) radio frequency identification (RFID). It is shown that RFID signals can be carried on directly modulated radio over fiber links without impacting their performance. It is also shown that a multi-antenna DAS can greatly reduce the number of nulls experienced by RFID in a complex radio environment, increasing the likelihood of successful tag detection. Consequently, optimization of the DAS reduces nulls further. We demonstrate RFID tag reading using a three antenna DAS system over a 20mx6m area, limited by building constraints, where 100% of the test points can be successfully read. The detected signal strength from the tag is also observed to increase by an average of approximately 10dB compared with a conventional switched multi-antenna RFID system. This improvement is achieved at +31dBm equivalent isotropically radiated power (EIRP) from all three antenna units (AUs).
Resumo:
We describe simple yet scalable and distributed algorithms for solving the maximum flow problem and its minimum cost flow variant, motivated by problems of interest in objects similarity visualization. We formulate the fundamental problem as a convex-concave saddle point problem. We then show that this problem can be efficiently solved by a first order method or by exploiting faster quasi-Newton steps. Our proposed approach costs at most O(|ε|) per iteration for a graph with |ε| edges. Further, the number of required iterations can be shown to be independent of number of edges for the first order approximation method. We present experimental results in two applications: mosaic generation and color similarity based image layouting. © 2010 IEEE.