3678 search results - page 132 / 736 » On the Stable Paths Problem |
110
Voted
IJRR
2002
15 years 15 days ago
2002
We study the path planning problem, without obstacles, for closed kinematic chains with n links connected by spherical joints in space or revolute joints in the plane. The configu...
101
Voted
INFOCOM
2005
IEEE
15 years 6 months ago
2005
IEEE
Abstract— The current best-effort Internet cannot readily provide the service guarantees that VoIP applications often require. Path switching can potentially address this problem...
123
Voted
CORR
2010
Springer
15 years 28 days ago
2010
Springer
We investigate Monte Carlo Markov Chain (MCMC) procedures for the random sampling of some one-dimensional lattice paths with constraints, for various constraints. We will see that...
77
Voted
ENTCS
2006
15 years 25 days ago
2006
The standard translation of a Bounded Model Checking (BMC) instance into a satisfiability problem, (a.k.a SAT), might produce misleading results in the case when the model under v...
86
Voted
RAS
1998
15 years 14 days ago
1998
We present a new approach to the multi-robot path planning problem, where a number of robots are to change their positions through feasible motions in the same static environment....