6 search results - page 1 / 2 » Minimum-Link Paths Among Obstacles in the Plane |
COMPGEOM
1990
ACM
13 years 9 months ago
1990
ACM
Given a set of nonintersecting polygonal obstacles in the plane, the link distance between two points s and t is the minimum number of edges required to form a polygonal path conn...
COMGEO
2000
ACM
13 years 4 months ago
2000
ACM
Given a set X of points in the plane, two distinguished points s,t X, and a set of obstacles represented by line segments, we wish to compute a simple polygonal path from s to t...
COMPGEOM
2008
ACM
13 years 6 months ago
2008
ACM
This video illustrates an algorithm for computing a maximum number of disjoint paths for unit disks moving among a set of dynamic obstacles in the plane. The problem is motivated ...
ICRA
2010
IEEE
13 years 3 months ago
2010
IEEE
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...
ICRA
2007
IEEE
13 years 11 months ago
2007
IEEE
— We introduce a method for constructing provably safe smooth feedback laws for car-like robots in obstaclecluttered polygonal environments. The robot is taken to be a point with...