Abstract: | This paper discusses the complexity of, and problem solving for, action planning in a simulated robot world. It firstly puts forward two kinds of typical action planning problems, then presents and proves the intractability of the problems in the simulated world. It also analyses the solving strategies for these problems and introduces some promising approaches to planning problems in simulated robot worlds. The results in this paper can be used as a reference for the study of planning, combinatorial search and other AI problem solving.
|