随机最短路径问题的高效约束生成
Efficient Constraint Generation for Stochastic Shortest Path Problems
AI总结:
本文提出CG-iLAO*算法,通过线性规划重构启发式搜索,减少无效动作处理,提升求解效率。
摘要:
随机最短路径问题(SSPs)传统上通过贝尔曼备份计算每个状态的成本。贝尔曼备份通过迭代所有适用动作计算成本,并选择最小成本的动作。现有算法利用启发式函数仅对有潜力的状态应用贝尔曼备份,但每个备份仍需检查所有动作,浪费时间。本文提出通过线性规划重构启发式搜索,引入高效的约束生成技术,CG-iLAO*算法在多个问题中仅处理40%甚至1%的动作,平均减少3.5倍的成本计算,使求解速度提升2.8至3.7倍。
英文摘要:
Stochastic Shortest Path problems (SSPs) are traditionally solved by computing each state's cost-to-go by applying Bellman backups. A Bellman backup updates a state's cost-to-go by iterating through every applicable action, computing the cost-to-go after applying each one, and selecting a minimal action's cost-to-go. State-of-the-art algorithms use heuristic functions; these give an initial estimate of costs-to-go, and lets the algorithm apply Bellman backups only to promising states, determined by low estimated costs-to-go. However, each Bellman backup still considers all applicable actions, even if the heuristic tells us that some of these actions are too expensive, with the effect that such algorithms waste time on unhelpful actions. To address this gap we present a technique that uses the heuristic to avoid expensive actions, by reframing heuristic search in terms of linear programming and introducing an efficient implementation of constraint generation for SSPs. We present CG-iLAO*, a new algorithm that adapts iLAO* with our novel technique, and considers only 40% of iLAO*'s actions on many problems, and as few as 1% on some. Consequently, CG-iLAO* computes on average 3.5x fewer costs-to-go for actions than the state-of-the-art iLAO* and LRTDP, enabling it to solve problems faster an average of 2.8x and 3.7x faster, respectively.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。