Wyniki wyszukiwania - BazTech

Ograniczanie wyników

1 International Journal of Applied Mathematics and Computer Science

1 2005

Znaleziono wyników: 1

Liczba wyników na stronie

Wyniki wyszukiwania

Wyszukiwano:
w słowach kluczowych: planning complexity

Sortuj według:

Ogranicz wyniki do:

Non-cooperative game approach to multi-robot planning

Gałuszka A., Świerniak A.

International Journal of Applied Mathematics and Computer Science

2005

Vol. 15, no 3

359-367

A multi-robot environment with a STRIPS representation is considered. Under some assumptions such problems can be modelled as a STRIPS language (for instance, a Block World environment) with one initial state and a disjunction of goal states. If the STRIPS planning problem is invertible, then it is possible to apply the machinery for planning in the presence of incomplete information to solve the inverted problem and then to find a solution to the original problem. In the paper a planning algorithm that solves the problem described above is proposed and its computational complexity is analyzed. To make the plan precise, non-cooperative strategies are used.