【24h】

Maximizing Future Options: An On-Line Real-Time Planning Method

机译:最大化未来选择:一种在线实时计划方法

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

摘要

In highly dynamic environments with uncertainty the elaboration of long or rigid plans is useless because the constructed plans are frequently dismissed by the arrival or new unexpected situations; in these cases, a "second-best" plan could rescue the situation. We present a new real-time planning method where we take into consideration the number and quality of future options of the next action to choose, in contrast to most planning methods that just take into account the intrinsic value of the chosen plan or the maximum valued future option. We apply our method to the Robocup simulated soccer competition, which is indeed highly dynamic and involves uncertainty. We propose a specific architecture for implementing this method in the context of a player agent in the Robocup competition, and we present experimental evidence showing the potential of our method.
机译:在不确定的高度动态的环境中,冗长或僵化的计划的制定是无用的,因为建造的计划经常由于到达或新的意外情况而被取消。在这些情况下,“次优”计划可以挽救局势。我们提出了一种新的实时计划方法,其中考虑了下一个要选择的行动的未来选择的数量和质量,而大多数计划方法只考虑了所选择计划的内在价值或最大价值。未来的选择。我们将我们的方法应用于Robocup模拟足球比赛,这确实是高度动态的并且涉及不确定性。我们提出了一种特定的体系结构,用于在Robocup竞赛中的球员代理的情况下实施此方法,并且我们提供了实验证据,证明了该方法的潜力。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号