【24h】

Cooperating intelligent agents for distributed satellite systems

机译:协作的分布式卫星系统智能代理

获取原文

摘要

An approach has been developed that models individual satellites as intelligent agents and allows them to cooperate in system-level problem solving. ^As an initial test, agents were programmed to solve the well-understood n-queens problem (place n queens on a nxn chessboard such that none can attack the others). ^The intelligent agent approach produced encouraging results compared to conventional approaches. ^Intelligent agents solved a 34x34 board in 77 moves compared to over two billion moves required by conventional means. ^This research is being extended to the (more challenging) minimum queens problem (find the fewest queens that provide full coverage on an nxn board). ^This better reflects one problem faced by TechSat 21 (find the fewest number of satellites that provide coverage over a specified area). ^The results will be evaluated for application to constellation design, cluster pattern management, and several mission aspects including cooperative signal processing, target detection, and target tracking. ^In addition, intelligent agents may be applied to selected nondeterministic polynomial complete (NP-Complete) problems to evaluate their effectiveness on tasks such as scheduling. ^(Author)
机译:已经开发出一种方法,将单个卫星建模为智能代理,并允许它们在系统级问题解决中进行协作。 ^作为初始测试,对代理进行了编程以解决众所周知的n皇后问题(将n个皇后放在nxn棋盘上,以使每个人都不能攻击其他皇后)。 ^与传统方法相比,智能代理方法产生了令人鼓舞的结果。 ^智能代理解决了34x34棋盘的77步棋,而传统方式需要超过20亿步棋。 ^这项研究正在扩展到(更具挑战性的)最小皇后问题(找到在nxn板上可以完全覆盖的最少皇后)。 ^这更好地反映了TechSat 21所面临的一个问题(找到在指定区域提供覆盖的最少数量的卫星)。 ^将对结果进行评估,以应用于星座设计,集群模式管理以及包括协同信号处理,目标检测和目标跟踪在内的多个任务方面。 ^此外,可以将智能代理应用于选定的不确定性多项式完全(NP-Complete)问题,以评估其在诸如计划之类的任务上的有效性。 ^(作者)

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号