...
首页> 外文期刊>IEEE transactions on automation science and engineering >Degree of Redundancy of Linear Systems Using Implicit Set Covering
【24h】

Degree of Redundancy of Linear Systems Using Implicit Set Covering

机译:使用隐式集合覆盖的线性系统的冗余度

获取原文
获取原文并翻译 | 示例
           

摘要

In this paper, we present a set covering problem (SCP) formulation to compute the degree of redundancy of linear systems. Computing the degree of redundancy of a linear system allows for the evaluation of the quality of the sensor network. The formulation is equivalent to solving the linear matroid cogirth problem, finding the cardinality of the smallest cocircuit of a matroid. We also discuss existing methods developed to solve the matroid cogirth problem and the SCP. Computational results are provided to validate a branch-and-cut algorithm that addresses the SCP formulation.
机译:在本文中,我们提出了一种覆盖问题(SCP)公式,用于计算线性系统的冗余度。计算线性系统的冗余度可以评估传感器网络的质量。该公式等效于解决线性拟阵的同余问题,找到拟阵的最小协电路的基数。我们还将讨论为解决拟阵阵同伴问题和SCP而开发的现有方法。提供计算结果以验证可解决SCP公式的分支剪切算法。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号