Filters








2,402 Hits in 10.7 sec

Guaranteed State Estimation Using a Bundle of Interval Observers with Adaptive Gains Applied to the Induction Machine

Manuel Schwartz, Stefan Krebs, Sören Hohmann
2021 Sensors  
The scope of this paper is the design of an interval observer bundle for the guaranteed state estimation of an uncertain induction machine with linear, time-varying dynamics.  ...  Hence, based on a reduced-order hybrid interval observer structure, the guaranteed enclosure within intervals of the magnetizing current's estimates is improved using a bundle of interval observers.  ...  In the case of a induction machine with similar time constants, the coupling of such state estimators to a bundle to improve the performance is not feasible.  ... 
doi:10.3390/s21082584 pmid:33917007 fatcat:2w3q3j2cfjfjvj3xnq3qg63gxi

Guaranteed state estimation using a bundle of interval observers with adaptive gains applied to the induction machine

Manuel Schwartz, Stefan Krebs, Sören Hohmann
2021
he scope of this paper is the design of an interval observer bundle for the guaranteed state estimation of an uncertain induction machine with linear, time-varying dynamics.  ...  Hence, based on a reduced-order hybrid interval observer structure, the guaranteed enclosure within intervals of the magnetizing current's estimates is improved using a bundle of interval observers.  ...  In the case of a induction machine with similar time constants, the coupling of such state estimators to a bundle to improve the performance is not feasible.  ... 
doi:10.5445/ir/1000131392 fatcat:shxkt7jcxvdxjgxp4bvvl4guzq

Fixed-structure robust controller design for chatter mitigation in high-speed milling

N. J. M. van Dijk, N. van de Wouw, H. Nijmeijer
2014 International Journal of Robust and Nonlinear Control  
The control design problem is cast into a nonsmooth optimization problem, which is solved using bundle methods.  ...  Chatter is an instability phenomenon in high-speed milling that limits machining productivity by the induction of tool vibrations, inferior machining accuracy, noise, and wear of machine components.  ...  ACKNOWLEDGEMENTS This work is supported by the Dutch Ministry of Economic Affairs, Agriculture and Innovation within the framework of Innovation Oriented Research Programmes (IOP) Precision Technology.  ... 
doi:10.1002/rnc.3280 fatcat:3agfnik7lfd3nizcyc5tyrkdry

Near-Optimal Decremental SSSP in Dense Weighted Digraphs [article]

Aaron Bernstein, Maximilian Probst Gutenberg, Christian Wulff-Nilsen
2020 arXiv   pre-print
ratio of the graph.  ...  In a breakthrough result, Forster et al. showed that it is possible to achieve total update time mn^0.9+o(1)log W if the algorithm is allowed to return (1+ϵ)-approximate paths, instead of exact ones [STOC  ...  (V, τ ) form an AT O(G, 2αδ)-bundle with the guarantees given in Theorem 4.4, as required.  ... 
arXiv:2004.04496v2 fatcat:s3timkyn5bayrd6qbsh6b6aesq

ANTS 2020 Program

2020 2020 IEEE International Conference on Advanced Networks and Telecommunications Systems (ANTS)  
Our approach for problem solving consists in iteratively applying a fixed-point method to the cells, and, for each cell, deriving an algorithm guaranteeing optimum for single-cell optimization.  ...  Therefore, a significant amount of performance gain can be achieved by the proposed TTLS scheme as compared to the CTLS scheme under a practical (erroneous feedback) scenario. pp. 1-6 15:18 Design of transmitter  ...  With the anycast service, a data bundle can be delivered to any member of the anycast group.  ... 
doi:10.1109/ants50601.2020.9342833 fatcat:ldgs2gnywnagpjk7sza6edc44e

2020 Index IEEE Transactions on Power Systems Vol. 35

2020 IEEE Transactions on Power Systems  
., Assessing the Impact of VSC-HVDC on the Interdependence of Power System Dynamic Performance in Uncertain Mixed AC/DC Systems; TPWRS Jan. 2020 63-74 Moeini, A., see Rimorov, D., TPWRS Sept. 2020 3825  ...  -3834 Moeini, A., see Hajebrahimi, A., TPWRS Sept. 2020 3706-3718 Mohammadi, A., see 1834-1845 Mohammadi, F., see Jafarishiadeh, F  ...  Iravani, A., +, TPWRS July 2020 2981-2992 Robust Dynamic State Estimation of Synchronous Machines With Asymp- totic State Estimation Error Performance Guarantees.  ... 
doi:10.1109/tpwrs.2020.3040894 fatcat:jjw2rnzr2re6fejvariekzr5uy

Why Are There Still So Many Jobs? The History and Future of Workplace Automation

David H. Autor
2015 Journal of Economic Perspectives  
(Autor 2015 as well as the essay "The Paradox of Abundance: Automation Anxiety Returns" (Autor forthcoming  ...  ■ This paper draws from an essay prepared for the Federal Reserve Bank of Kansas City's economic policy symposium on " Re-Evaluating Labor Market Dynamics," August 21-23, 2014, in Jackson Hole, Wyoming  ...  Machine learning applies statistics and inductive reasoning to supply best-guess answers where formal procedural rules are unknown.  ... 
doi:10.1257/jep.29.3.3 fatcat:4u267zaeiff5tbfiyxx2cnjp4m

Sentiment Analysis [chapter]

2017 Encyclopedia of Machine Learning and Data Mining  
To classify a test instance, IR first finds the interval in which the estimated posterior probability fits and predicts the isotonic regression estimate of this interval as the calibrated posterior probability  ...  This bound states that with probability 1 ı, the true mean of a random variable of range R will not differ from the estimated mean after n independent observations by more than: D r R 2 ln.1=ı/ 2n : (1  ...  Symbolic Dynamic Programming, Fig. 1 A formal description of the BoxWorld adapted from Boutilier et al. (2001) .  ... 
doi:10.1007/978-1-4899-7687-1_100512 fatcat:ce4yyqo2czftzcx2kbauglh3fu

Spike-Timing-Dependent Plasticity [chapter]

2017 Encyclopedia of Machine Learning and Data Mining  
To classify a test instance, IR first finds the interval in which the estimated posterior probability fits and predicts the isotonic regression estimate of this interval as the calibrated posterior probability  ...  This bound states that with probability 1 ı, the true mean of a random variable of range R will not differ from the estimated mean after n independent observations by more than: D r R 2 ln.1=ı/ 2n : (1  ...  Symbolic Dynamic Programming, Fig. 1 A formal description of the BoxWorld adapted from Boutilier et al. (2001) .  ... 
doi:10.1007/978-1-4899-7687-1_774 fatcat:2jprihjaxfbtpb3ttwuuz3u34y

AI-Assisted Framework for Green-Routing and Load Balancing in Hybrid Software-Defined Networking: Proposal, Challenges and Future Perspective

Richard Etengu, Saw Chin Tan, Ching Kwang Lee, Fouad Mohammed Abbou, Teong Che Chuah
2020 IEEE Access  
with guaranteed quality of service (QoS), in transitional hybrid SDN/OSPF networks.  ...  Previously, fast HA were proposed to achieve cost-effective energy-aware routing (EAR) and load balancing with QoS guarantees, but optimization efforts in a dynamic scenario can be a challenge.  ...  the controller is enabled to perform queries at defined time intervals so as to select the finest path using the current network state, to provision new path with the help of the received information.  ... 
doi:10.1109/access.2020.3022291 fatcat:ebznmgl4gfde3kbrewuiphgtme

Conference Guide [Front matter]

2020 2020 16th International Conference on Control, Automation, Robotics and Vision (ICARCV)  
Firstly, considering the topological structure among the followers, a kind of adaptive distributed observer is designed to estimate the whole states of all the leaders.  ...  Then, the method based on reachability analysis is used to obtain the bounds of the system state. Finally, one example is simulated to prove the effectiveness of the designed interval observer.  ...  To protect the privacy of node' value, we employ the cryptography of homomorphic encryption to encrypt initial integer state of each agent, without revealing to other agents the real value in the network  ... 
doi:10.1109/icarcv50220.2020.9305477 fatcat:4h7gpoj7ljgsrlkjoyw3qcfzxi

Finish Them!: Pricing Algorithms for Human Computation [article]

Yihan Gao, Aditya Parameswaran
2014 arXiv   pre-print
Given a batch of human computation tasks, a commonly ignored aspect is how the price (i.e., the reward paid to human workers) of these tasks must be set or varied in order to meet latency or cost constraints  ...  Often, the price is set up-front and not modified, leading to either a much higher monetary cost than needed (if the price is set too high), or to a much larger latency than expected (if the price is set  ...  State Space: After discretization, we can represent the state of processing of the batch of tasks at any time interval using a finite Markov chain.  ... 
arXiv:1408.6292v1 fatcat:oormebj7kbdenpg2q7674xt2x4

Brain–Machine Interface Engineering

Justin C. Sanchez, José C. Principe
2007 Synthesis Lectures on Biomedical Engineering  
This current research taking us to yet another unexplored direction, which is perhaps the best indication of the strong foundations of the early collaboration with Duke.  ...  Although there is plenty of room for future improvement, the combination of critical evaluation of current approaches and a vision of nueroengineering are helping us develop an understanding on how to  ...  (observer) where the observer gain is optimized to minimize the state estimation error variance.  ... 
doi:10.2200/s00053ed1v01y200710bme017 fatcat:jm6kaqyjurgddmssiru2fy435i

On-Demand Delivery from Stores: Dynamic Dispatching and Routing with Random Demand [article]

Sheng Liu, Zhixing Luo
2022 arXiv   pre-print
We also perform several policy experiments to understand the value of dynamic dispatching and routing with varying fleet sizes and dispatch frequencies.  ...  The system operator needs to dispatch a set of drivers and specify their delivery routes facing random demand that arrives over a fixed number of periods.  ...  We observe that the adaptive myopic policy behaves similarly to the simple myopic policy used by the company.  ... 
arXiv:2107.13058v2 fatcat:yay3n4nt4bcljk64aamyz36vce

Group testing: an information theory perspective [article]

Matthew Aldridge, Oliver Johnson, Jonathan Scarlett
2019 arXiv   pre-print
We assess the theoretical guarantees not only in terms of scaling laws, but also in terms of the constant factors, leading to the notion of the rate and capacity of group testing, indicating the amount  ...  In addition, we survey results concerning a number of variations on the standard group testing problem, including partial recovery criteria, adaptive algorithms with a limited number of stages, constrained  ...  Adaptive algorithm The adaptive algorithm uses J = O(log n) stages of adaptivity, with all stages except the last using a common procedure.  ... 
arXiv:1902.06002v1 fatcat:25wri4yzkfgetcd2jxcsintzje
« Previous Showing results 1 — 15 out of 2,402 results