Motion planning for unlabeled discs with optimality guarantees
We study the problem of path planning for unlabeled (indistinguishable) unit-disc robots in a
planar environment cluttered with polygonal obstacles. We introduce an algorithm which …
planar environment cluttered with polygonal obstacles. We introduce an algorithm which …
Efficient multi-robot motion planning for unlabeled discs in simple polygons
We consider the following motion-planning problem: we are given mm unit discs in a simple
polygon with nn vertices, each at their own start position, and we want to move the discs to a …
polygon with nn vertices, each at their own start position, and we want to move the discs to a …
[PDF][PDF] Subdimensional Expansion: A Framework for Computationally Tractable Multirobot Path Planning.
G Wagner - 2015 - kilthub.cmu.edu
Planning optimal paths for large numbers of robots is computationally expensive. In this
thesis, we present a new framework for multirobot path planning called subdimensional …
thesis, we present a new framework for multirobot path planning called subdimensional …
Development Of Path Following and Cooperative Motion Control Algorithms for Autonomous Underwater Vehicles
BK Sahu - 2015 - ethesis.nitrkl.ac.in
Research on autonomous underwater vehicle (AUV) is motivating and challenging owing to
their specific applications such as defence, mine counter measure, pipeline inspections …
their specific applications such as defence, mine counter measure, pipeline inspections …