20 search results - page 3 / 4 » Lower Bounds for Randomized k-Server and Motion Planning Alg... |
ICRA
2003
IEEE
13 years 10 months ago
2003
IEEE
This paper presents an algorithm, called PCG, for planning the foothold positions of spider-like robots in planar tunnels bounded by piecewise linear walls. The paper focuses on 3-...
ICRA
2006
IEEE
13 years 11 months ago
2006
IEEE
— We explore an online problem where a group of robots has to find a target whose position is unknown in an unknown planar environment whose geometry is acquired by the robots d...
IFM
2010
Springer
13 years 3 months ago
2010
Springer
Abstract. The automata-based model checking approach for randomized distributed systems relies on an operational interleaving semantics of the system by means of a Markov decision ...
COMPGEOM
1995
ACM
13 years 8 months ago
1995
ACM
We present a simple but powerful new probabilistic technique for analyzing the combinatorial complexity of various substructures in arrangements of piecewise-linear surfaces in hig...
SMA
2010
ACM
13 years 5 months ago
2010
ACM
Designing a fixture layout of an object can be reduced to computing the largest simplex and the resulting simplex is classified using the radius of the largest inscribed ball cent...