516 search results - page 103 / 104 » Motion Planning of Legged Robots |
COMPGEOM
1994
ACM
13 years 10 months ago
1994
ACM
We consider the problem of bounding the combinatorial complexity of a single cell in an arrangement of n low-degree algebraic surface patches in 3-space. We show that this complex...
SIAMCOMP
2008
13 years 6 months ago
2008
Our goal is to find an approximate shortest path for a point robot moving in a planar subdivision with n vertices. Let 1 be a real number. Distances in each face of this subdivis...
ESA
2009
Springer
14 years 22 days ago
2009
Springer
Abstract. We study an extensive class of movement minimization problems which arise from many practical scenarios but so far have little theoretical study. In general, these proble...
FCT
2003
Springer
13 years 11 months ago
2003
Springer
The purpose of this paper is to investigate the properties of a certain class of highly visible spaces. For a given geometric space C containing obstacles specified by disjoint s...
DCOSS
2011
Springer
12 years 6 months ago
2011
Springer
Abstract—We first present a problem called precedence constrained two traveling salesman (PC2TSP). We propose a nearoptimal heuristic to PC2TSP to generate tours by clustering p...