Finding Sub-optimal Solutions for Problems of Path Planning for Multiple Robots in θ-like Environments

@inproceedings{Surynek2009FindingSS,
  title={Finding Sub-optimal Solutions for Problems of Path Planning for Multiple Robots in θ-like Environments},
  author={Pavel Surynek},
  year={2009}
}
A problem of path planning for multiple robots is addressed in this paper. A specific case of the problem with so called θ-like environments is studied. This case of the problem represent one of the most difficult cases and an eventual solving method for this case can be used as a building block for more general solving procedures. We propose a solving method for multirobot path planning in θ-like environments that constructs a solution by composing it of the pre-calculated shortest solutions… CONTINUE READING