首页> 外文会议>IEEE International Conference on Information Science and Technology >Decision-theoretic planning of emergency task network
【24h】

Decision-theoretic planning of emergency task network

机译:紧急任务网络的决策定理规划

获取原文

摘要

Emergency Response Task Planning (ERTP) is a kind of Random Sequential Decision Making Problems (RSDMP). There have been few relevant researches so far, and the classic Markov Decision Processes (MDP) is not completely suitable for it because of the curse of dimensionality. In order to solve ERTP, this paper proposes a Markov decision method based on Acceptable Risk Level (ARL) and Dynamic Constraint Satisfaction Problem (DCSP). On the one hand, the decision maker's risk attitude can be reflected by ARL, and on the other hand the new method is able to reduce the total state space of the problem and increase computation efficiency. Experiment results prove that the new method has much higher computation efficiency than classic MDP algorithms and DCSP based MDP algorithms, and it's more suitable for complex RSDMPs.
机译:紧急响应任务规划(ERTP)是一种随机顺序决策问题(RSDMP)。 到目前为止还有很少的相关研究,并且由于维度的诅咒,经典的马尔可夫决策过程(MDP)并不完全适合它。 为了解决ERTP,本文提出了一种基于可接受的风险级别(ARL)和动态约束满足问题(DCSP)的马尔可夫决策方法。 一方面,决策者的风险态度可以由ARL反映,另一方面,新方法能够减少问题的总状态空间并提高计算效率。 实验结果证明,新方法的计算效率远远超过经典MDP算法和基于DCSP的MDP算法,它更适合复杂的RSDMP。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号