Learn More
Presents an algorithm for planning a collision-free path for a mobile robot in a planar workspace. The free space is structured by covering it with overlapping convex cells. In a first step, the algorithm searches for an itinerary which is the union of a set of cells and a trajectory skeleton inside it. Then, a more realistic trajectory, dealing with(More)
  • 1