首页> 外文期刊>International Journal of Industrial Engineering >LEO SPACECRAFT SCHEDULING BY AI-BASED SEARCH
【24h】

LEO SPACECRAFT SCHEDULING BY AI-BASED SEARCH

机译:通过AI搜索进行LEO航天器调度

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

摘要

This paper explores utility of AI-based search methods in a complex optimization scenario, the optimal allotment of ground station support time to low earth orbiting (LEO) spacecraft with clashing visibilities being the context. Orbiting once every 100 or so minutes at a 800 km height, LEOs now form a critical infrastructure for natural resource management, rescue, crop yield estimation, flood control, communication, and space research and travel support worldwide. The problem is NP-complete. The present methodology exploits the structure of the profit function and constraints and invokes meta-heuristic methods to determine the optimum allocation. The paper solves a practical satellite support optimization problem routinely faced by mission managers. A spin-off of this work is that it can enable the decision maker to also determine optimal ground station locations and support capability deployment in diverse scenarios.
机译:本文探讨了在复杂的优化方案中基于AI的搜索方法的实用性,其中以碰撞可见性为背景,将地面站支持时间的最佳分配分配给低地球轨道(LEO)航天器。 LEO在800公里的高度每100分钟左右绕轨道运行一次,现在它已成为全球范围内自然资源管理,救援,作物产量估算,防洪,通信以及太空研究和旅行支持的关键基础设施。问题是NP完全的。本方法论利用了利润函数和约束的结构,并调用了元启发式方法来确定最优分配。本文解决了任务管理人员经常遇到的实际卫星支持优化问题。这项工作的一个副产品是,它可以使决策者还可以确定最佳的地面站位置,并支持在各种情况下进行能力部署。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号