We sets up the DPG algorithm structure above the probabilistic PlanGraph which have the rapidly propagating ability. Combing the Dynamic Programming, with forward search method, get a optimal planning solution in finite time step.
英
美
- DPG算法建立在具有迅速傳播能力的概率規劃圖（Probabilistic Graphplan）上，結合動(dòng)態(tài)編程（Dynamic Programming），用前向搜索的方法來(lái)求最優(yōu)規劃解。
