Satplan

Satplan

Satplan 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.

ee also

* Graphplan

References

* H. A. Kautz and B. Selman (1992). Planning as satisfiability. In "Proceedings of the Tenth European Conference on Artificial Intelligence (ECAI'92)", pages 359-363.

* H. A. Kautz and B. Selman (1996). Pushing the envelope: planning, propositional logic, and stochastic search. In "Proceedings of the Thirteenth National Conference on Artificial Intelligence (AAAI'96)", pages 1194-1201.


Wikimedia Foundation. 2010.

Игры ⚽ Поможем сделать НИР

Look at other dictionaries:

  • Artificial intelligence — AI redirects here. For other uses, see Ai. For other uses, see Artificial intelligence (disambiguation). TOPIO, a humanoid robot, played table tennis at Tokyo International Robot Exhibition (IREX) 2009.[1] Artificial intelligence ( …   Wikipedia

  • Automated planning and scheduling — is a branch of artificial intelligence that concerns the realization of strategies or action sequences, typically for execution by intelligent agents, autonomous robots and unmanned vehicles. Unlike classical control and classification problems,… …   Wikipedia

  • WalkSAT — GSAT and WalkSat are local search algorithms to solve Boolean satisfiability problems. Both algorithms work on formulae that are in, or have been converted into, conjunctive normal form. They start by assigning a random value to each variable. If …   Wikipedia

Share the article and excerpts

Direct link
… Do a right-click on the link above
and select “Copy Link”