اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدHoming missile guidance law with imperfect measurements and imperfect information about the system
36
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
In this study, the generic imperfect dynamic models of air-to-surface missiles are given in addition to the related simple guidance law.
قيم البحث
اقرأ أيضاً
The impact of measurement imperfections on quantum metrology protocols has been largely ignored, even though these are inherent to any sensing platform in which the detection process exhibits noise that neither can be eradicated, nor translated onto
the sensing stage and interpreted as decoherence. In this work, we approach this issue in a systematic manner. Focussing firstly on pure states, we demonstrate how the form of the quantum Fisher information must be modified to account for noisy detection, and propose tractable methods allowing for its approximate evaluation. We then show that in canonical scenarios involving $N$ probes with local measurements undergoing readout noise, the optimal sensitivity dramatically changes its behaviour depending whether global or local control operations are allowed to counterbalance measurement imperfections. In the former case, we prove that the ideal sensitivity (e.g. the Heisenberg scaling) can always be recovered in the asymptotic $N$ limit, while in the latter the readout noise fundamentally constrains the quantum enhancement of sensitivity to a constant factor. We illustrate our findings with an example of an NV-centre measured via the repetitive readout procedure, as well as schemes involving spin-1/2 probes with bit-flip errors affecting their two-outcome measurements, for which we find the input states and control unitary operations sufficient to attain the ultimate asymptotic precision.
This paper studies the impact of imperfect information in online control with adversarial disturbances. In particular, we consider both delayed state feedback and inexact predictions of future disturbances. We introduce a greedy, myopic policy that y
ields a constant competitive ratio against the offline optimal policy with delayed feedback and inexact predictions. A special case of our result is a constant competitive policy for the case of exact predictions and no delay, a previously open problem. We also analyze the fundamental limits of online control with limited information by showing that our competitive ratio bounds for the greedy, myopic policy in the adversarial setting match (up to lower-order terms) lower bounds in the stochastic setting.
In the current work we address the problem of quantum process tomography (QPT) in the case of imperfect preparation and measurement of the states which are used for QPT. The fuzzy measurements approach which helps us to efficiently take these imperfe
ctions into account is considered. However, to implement such a procedure one should have a detailed information about the errors. An approach for obtaining the partial information about them is proposed. It is based on the tomography of the ideal identity gate. This gate could be implemented by performing the measurement right after the initial state preparation. By using the result of the identity gate tomography we were able to significantly improve further QPT procedures. The proposed approach has been tested experimentally on the IBM superconducting quantum processor. As a result, we have obtained an increase in fidelity from 89% to 98% for Hadamard transformation and from 77% to 95% for CNOT gate.
In this paper, we study Reinforcement Learning from Demonstrations (RLfD) that improves the exploration efficiency of Reinforcement Learning (RL) by providing expert demonstrations. Most of existing RLfD methods require demonstrations to be perfect a
nd sufficient, which yet is unrealistic to meet in practice. To work on imperfect demonstrations, we first define an imperfect expert setting for RLfD in a formal way, and then point out that previous methods suffer from two issues in terms of optimality and convergence, respectively. Upon the theoretical findings we have derived, we tackle these two issues by regarding the expert guidance as a soft constraint on regulating the policy exploration of the agent, which eventually leads to a constrained optimization problem. We further demonstrate that such problem is able to be addressed efficiently by performing a local linear search on its dual form. Considerable empirical evaluations on a comprehensive collection of benchmarks indicate our method attains consistent improvement over other RLfD counterparts.
Search has played a fundamental role in computer game research since the very beginning. And while online search has been commonly used in perfect information games such as Chess and Go, online search methods for imperfect information games have only
been introduced relatively recently. This paper addresses the question of what is a sound online algorithm in an imperfect information setting of two-player zero-sum games. We argue that the~fixed-strategy~definitions of exploitability and $epsilon$-Nash equilibria are ill-suited to measure an online algorithms worst-case performance. We thus formalize $epsilon$-soundness, a concept that connects the worst-case performance of an online algorithm to the performance of an $epsilon$-Nash equilibrium. As $epsilon$-soundness can be difficult to compute in general, we introduce a consistency framework -- a hierarchy that connects an online algorithms behavior to a Nash equilibrium. These multiple levels of consistency describe in what sense an online algorithm plays just like a fixed Nash equilibrium. These notions further illustrate the difference between perfect and imperfect information settings, as the same consistency guarantees have different worst-case online performance in perfect and imperfect information games. The definitions of soundness and the consistency hierarchy finally provide appropriate tools to analyze online algorithms in repeated imperfect information games. We thus inspect some of the previous online algorithms in a new light, bringing new insights into their worst-case performance guarantees.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
