翻訳と辞書
Words near each other
・ Satpakhali
・ Satpal
・ Satpal Gosain
・ Satpal Maharaj
・ Satpal Ram
・ Satpal Singh
・ Satpal Singh Satti
・ Satpanth
・ Satpara Dam
・ Satpara Lake
・ Satpara Stream
・ Satpati
・ Satpayev
・ Satphari
・ Satphere
Satplan
・ Satpokharee
・ Satprem
・ Satpuda Manudevi Temple, Adgaon
・ Satpula
・ Satpuli
・ Satpura Express
・ Satpura narrow gauge lines
・ Satpura National Park
・ Satpura Range
・ Satpura Thermal Power Station
・ Satr
・ SATRA
・ Satra
・ Satra (disambiguation)


Dictionary Lists
翻訳と辞書 辞書検索 [ 開発暫定版 ]
スポンサード リンク

Satplan : ウィキペディア英語版
Satplan
Satplan (better known as Planning as Satisfiability) is a method for automated planning. It converts the planning problem instance into an instance of the Boolean satisfiability problem, which is then solved using a method for establishing satisfiability such as the DPLL algorithm or WalkSAT.
Given a problem instance in planning, with a given initial state, a given set of actions, a goal, and a horizon length, a formula is generated so that the formula is satisfiable if and only if there is a plan with the given horizon length. This is similar to simulation of Turing machines with the satisfiability problem in the proof of Cook's theorem. A plan can be found by testing the satisfiability of the formulas for different horizon lengths. The simplest way of doing this is to go through horizon lengths sequentially, 0, 1, 2, and so on.
==See also==

* Graphplan

抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)
ウィキペディアで「Satplan」の詳細全文を読む



スポンサード リンク
翻訳と辞書 : 翻訳のためのインターネットリソース

Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.