首页> 外文会议>International Conference on Computing, Networking and Communications >Cognitive mission planning and system orchestration
【24h】

Cognitive mission planning and system orchestration

机译:认知任务计划和系统编排

获取原文

摘要

We present an approach to increase likelihood that an automated reasoning system will make the best decisions for a system and sensor resource manager (SSRM) with limited resources. The introduction of automated game theory to mission planning allows for a modular architecture and scalable approach across a range of platforms and facilitates rapid integration of new modes and technology. Game theory enhances a multi-objective management system, enabling it to intelligently coordinate and optimally achieve disparate mission objectives of a converged system. Our solution may also save money by offering a Pareto efficient process for mission plan validation, which reduces time needed to validate scenarios. An area of significant contribution in our work is our new genetic linear optimization, which is an innovative, developmental extension of our efforts comparing genetic algorithms with linear programming. We show results in receiver-operating characteristic (ROC) curves and compare the performance. We also quantify the performance improvement across all combinations of decisions or players in a linear program. We further enhance decision making by combining the best parts of multiple solutions. Our design provides insight into the most important or optimal weights for degrees of freedom and can be used to efficiently tune those weights. We also discuss tradeoffs for improving processing time with a sensitivity analysis.
机译:我们提出一种方法来增加自动推理系统为资源有限的系统和传感器资源管理器(SSRM)做出最佳决策的可能性。将自动博弈论引入任务计划后,可以在各种平台上实现模块化架构和可扩展方法,并有助于快速集成新模式和新技术。博弈论增强了多目标管理系统,使其能够智能地协调并最佳地实现融合系统的不同任务目标。我们的解决方案还可以通过提供帕累托高效的任务计划验证流程来节省资金,从而减少验证场景所需的时间。新的遗传线性优化在我们的工作中发挥了重要作用,这是我们将遗传算法与线性规划进行比较的努力的创新性和发展性扩展。我们以接收器工作特性(ROC)曲线显示结果并比较性能。我们还量化了线性计划中所有决策或参与者组合的绩效提升。通过结合多个解决方案的最佳组成部分,我们进一步增强了决策能力。我们的设计可洞悉自由度最重要或最理想的权重,并可用于有效地调整这些权重。我们还讨论了通过敏感性分析来缩短处理时间的折衷方案。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号