Linear Planner for the Elementary Blocks World


The Transactions of the Korea Information Processing Society (1994 ~ 2000), Vol. 4, No. 1, pp. 161-166, Jan. 1997
10.3745/KIPSTE.1997.4.1.161,   PDF Download:

Abstract

The blocks world is the primary problem domain in the artificial intelligence. Many planners have been developed in domain-independent. Gupta defined the deadlock in the blocks world, and he proved that decision making in the blocks world is NP-Complete problem. In this paper the properties of the deadlock are analyzed, and a heuristic algorithms which can handle the deadlock the Gupta''''s nondeterministic algorithm is proposed. ,


Statistics
Show / Hide Statistics

Statistics (Cumulative Counts from September 1st, 2017)
Multiple requests among the same browser session are counted as one view.
If you mouse over a chart, the values of data points will be shown.


Cite this article
[IEEE Style]
S. D. Hee, "Linear Planner for the Elementary Blocks World," The Transactions of the Korea Information Processing Society (1994 ~ 2000), vol. 4, no. 1, pp. 161-166, 1997. DOI: 10.3745/KIPSTE.1997.4.1.161.

[ACM Style]
Shim Dong Hee. 1997. Linear Planner for the Elementary Blocks World. The Transactions of the Korea Information Processing Society (1994 ~ 2000), 4, 1, (1997), 161-166. DOI: 10.3745/KIPSTE.1997.4.1.161.