TY - GEN
A1 - Gałuszka, Adam
A1 - Świerniak, Andrzej
A2 - Korbicz, Józef - red.
A2 - Uciński, Dariusz - red.
PB - Zielona Góra: Uniwersytet Zielonogórski
N2 - 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.
N2 - 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.
L1 - http://zbc.uz.zgora.pl/Content/57522/AMCS_2005_15_3_5.pdf
L2 - http://zbc.uz.zgora.pl/Content/57522
KW - planning problems
KW - multi-robot environment
KW - STRIPS language
KW - non-cooperative games
KW - planning complexity
T1 - Non-cooperative game approach to multi-robot planning
UR - http://zbc.uz.zgora.pl/dlibra/docmetadata?id=57522
ER -