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.
Aug 20, 2020
Aug 20, 2020
|Non-cooperative game approach to multi-robot planning||Aug 20, 2020|
Kołodziej, Joanna Xhafa, Fatos Korbicz, Józef - red. Uciński, Dariusz - red.
Świerniak, Andrzej Kimmel, Marek - red. Świerniak, Andrzej - red.
Świerniak, Andrzej Polański, Andrzej Kimmel, Marek - red. Świerniak, Andrzej - red.
Czornik, Adam Świerniak, Andrzej Korbicz, Józef - red. Uciński, Dariusz - red.
Świerniak, Andrzej Duda, Zdzisław Korbicz, Józef - red. Uciński, Dariusz - red.
Boukas, El-Kebir Świerniak, Andrzej Yang, Hailang Owens, David H. - ed. Skoczowski, Stanisław - ed.