A planning system for blocks-world domain

Author

Prasad, Bhanu

Author_Institution

Sch. of Comput. & Inf. Sci., Georgia Southwestern State Univ., Americus, GA, USA

fYear

2001

fDate

2001

Firstpage

59

Lastpage

64

Abstract

We present a planning system for the blocks-world domain. An important component of the system is a whole priority list, which guides the system in selecting suitable sub-goals in solving a given problem. This system is entirely different from existing systems, which are primarily based on either backtracking or on invariant intermediate states or random selection of subgoals. This system selects sub-goals in a systematic fashion. It generates a plan in polynomial time if there is no deadlock. The system has been implemented using Common Lisp. A graphical user interface is incorporated for the convenient specification of user inputs

Keywords

computational complexity; graphical user interfaces; planning (artificial intelligence); Common Lisp; blocks-world domain; graphical user interface; planning system; problem solving; sub-goal selection; user input specification; whole priority list; Bismuth; Computer science; Graphical user interfaces; Knowledge representation; Polynomials; Process planning; System recovery; Traveling salesman problems;

fLanguage

English

Publisher

ieee

Conference_Titel

Computer Systems and Applications, ACS/IEEE International Conference on. 2001

Conference_Location

Beirut

Print_ISBN

0-7695-1165-1

Type

conf

DOI

10.1109/AICCSA.2001.933952

Filename

933952