Computing push plans for disk-shaped robots

M.T. Berg, de; D.H.P. Gerrits

Computing push plans for disk-shaped robots

M.T. Berg, de, D.H.P. Gerrits

Algorithms

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic

292 Downloads (Pure)

Abstract

Suppose we want to move a passive object along a given path, among obstacles in the plane, by pushing it with an active robot. We present two algorithms to compute a push plan for the case that the obstacles are non-intersecting line segments, and the object and robot are disks. The first algorithm assumes that the robot must maintain contact with the object at all times, and produces a shortest path. There are also situations, however, where the robot has no choice but to let go of the object occasionally. Our second algorithm handles such cases, but no longer guarantees that the produced path is the shortest possible.

Original language	English
Title of host publication	Abstracts 25th European Workshop on Computational Geometry (EuroCG'09, Brussels, Belgium, March 16-18, 2009)
Pages	49-52
Publication status	Published - 2009

Access to Document

Metis233413Final published version, 544 KB

Cite this

@inproceedings{cffb5aa0527846118bc26c23a4c683e2,

title = "Computing push plans for disk-shaped robots",

abstract = "Suppose we want to move a passive object along a given path, among obstacles in the plane, by pushing it with an active robot. We present two algorithms to compute a push plan for the case that the obstacles are non-intersecting line segments, and the object and robot are disks. The first algorithm assumes that the robot must maintain contact with the object at all times, and produces a shortest path. There are also situations, however, where the robot has no choice but to let go of the object occasionally. Our second algorithm handles such cases, but no longer guarantees that the produced path is the shortest possible.",

author = "{Berg, de}, M.T. and D.H.P. Gerrits",

year = "2009",

language = "English",

pages = "49--52",

booktitle = "Abstracts 25th European Workshop on Computational Geometry (EuroCG'09, Brussels, Belgium, March 16-18, 2009)",

}

TY - GEN

T1 - Computing push plans for disk-shaped robots

AU - Berg, de, M.T.

AU - Gerrits, D.H.P.

PY - 2009

Y1 - 2009

N2 - Suppose we want to move a passive object along a given path, among obstacles in the plane, by pushing it with an active robot. We present two algorithms to compute a push plan for the case that the obstacles are non-intersecting line segments, and the object and robot are disks. The first algorithm assumes that the robot must maintain contact with the object at all times, and produces a shortest path. There are also situations, however, where the robot has no choice but to let go of the object occasionally. Our second algorithm handles such cases, but no longer guarantees that the produced path is the shortest possible.

AB - Suppose we want to move a passive object along a given path, among obstacles in the plane, by pushing it with an active robot. We present two algorithms to compute a push plan for the case that the obstacles are non-intersecting line segments, and the object and robot are disks. The first algorithm assumes that the robot must maintain contact with the object at all times, and produces a shortest path. There are also situations, however, where the robot has no choice but to let go of the object occasionally. Our second algorithm handles such cases, but no longer guarantees that the produced path is the shortest possible.

M3 - Conference contribution

SP - 49

EP - 52

BT - Abstracts 25th European Workshop on Computational Geometry (EuroCG'09, Brussels, Belgium, March 16-18, 2009)

ER -

Computing push plans for disk-shaped robots

Abstract

Access to Document

Fingerprint

Cite this