排序方式: 共有4条查询结果,搜索用时 15 毫秒
1
1.
This paper considers the problem of guiding N interceptors so that they intercept or rendezvous with N targets at the same time T. It is assumed that the interceptors and targets are described by linear time-varying differential equations (deterministic or stochastic). Under certain assumptions both the optimal (static or dynamic) interceptor-target allocation and the guidance of each interceptor for the optimal allocation can be obtained with modest real-time and storage computer requirements. 相似文献
2.
We consider the distributed detection problem, in which a set of decision makers (DMs) receive observations of the environment and transmit finite-valued messages to other DMs according to prespecified communication protocols. A designated primary DM makes the find decision on one out of two alternative hypotheses. All DMs make decisions, in order to maximize a measure of organizational performance. We discuss three different types of decision rules (deterministic, independent randomization, and dependent randomization), and their implications on the organizational performance. Each DM is described by its individual receiver operating characteristic (ROC) curve, which is concave. We determine that concavity is not guaranteed for the case of the ROC curve of a team of DMs, even if the decision rules are perfectly continuous and if the individual ROC curves are strictly concave and smooth unless dependent randomization is allowed 相似文献
3.
State Estimation for Discrete Systems with Switching Parameters 总被引:1,自引:0,他引:1
The problem of state estimation for discrete systems with parameters which may be switching within a finite set of values is considered. In the general case it is shown that the optimal estimator requires a bank of elemental estimators with its number growing exponentially with time. For the Markov parameter case, it is found that the optimal estimator requires only N2 elemental estimators where N is the number of possible parameter values. 相似文献
4.
Papastavrou J.D. Athans M. 《IEEE transactions on aerospace and electronic systems》1992,28(3):639-653
The problem of decentralized binary hypothesis testing by a team consisting of N decision makers (DMs) in tandem is considered. Each DM receives an observation and transmits a binary message to its successor; the last DM has to decide which hypothesis is true. The necessary and sufficient condition for the probability of error to go asymptotically to zero as N →∞ is that the log-likelihood ratio of the observation of each DM be unbounded. The result is generalized for multiple hypotheses and multiple messages. An easily implementable suboptimal decision scheme is also considered; in this case, the necessary and sufficient condition for the probability of error to asymptotically go to zero is that the log-likelihood ratio of the observation of each DM be unbounded from both above and below. The tradeoff between the complexity of the decision rules and their performance is examined, and numerical results are presented, in order to demonstrate that the performance of both decision schemes is comparable 相似文献
1