3678 search results - page 134 / 736 » On the Stable Paths Problem |
112
Voted
IROS
2006
IEEE
15 years 6 months ago
2006
IEEE
— We present an on-line, robust, and efficient path planner for the redundant Mitsubishi PA-10 arm with 7 degrees of freedom (DOF) in non-stationary environments. Because of the...
123
click to vote
ESA
2005
Springer
15 years 6 months ago
2005
Springer
This paper investigates, for the first time in the literature, the approximation of min-max (regret) versions of classical problems like shortest path, minimum spanning tree, and ...
103
Voted
APPROX
2000
Springer
15 years 5 months ago
2000
Springer
Motivated by the problem of WDM routing in all–optical networks, we study the following NP–hard problem. We are given a directed binary tree T and a set R of directed paths on ...
98
Voted
ICRA
1993
IEEE
15 years 5 months ago
1993
IEEE
Navigationalpath planning is a classicalproblem in autonomous mobile robotics. Most AI approachesto path planning use goal-directedheuristicsearch of problem spaces defined by spa...
96
Voted
EMSOFT
2006
Springer
15 years 4 months ago
2006
Springer
The paper deals with the problem of computing schedules for multi-threaded real-time programs. In [14] we introduced a scheduling method based on the geometrization of PV programs...