1927 search results - page 116 / 386 » UMDAs for dynamic optimization problems |
119
Voted
ALDT
2009
Springer
15 years 7 months ago
2009
Springer
Abstract. An optimal probabilistic-planning algorithm solves a problem, usually modeled by a Markov decision process, by finding its optimal policy. In this paper, we study the k ...
103
Voted
ICCAD
1998
IEEE
15 years 5 months ago
1998
IEEE
- This paper presents an optimal algorithm for solving the problem of simultaneous fanout optimization and routing tree construction for an ordered set of critical sinks. The algor...
ICRA
1998
IEEE
15 years 5 months ago
1998
IEEE
In this paper we address the problem of energyoptimal gait generation for biped robots. Using a simpli ed robot dynamics that ignores the e ects of centripetal forces, we obtain u...
106
Voted
ERSHOV
1999
Springer
15 years 5 months ago
1999
Springer
Abstract. The paper describes a problem of multi-agent path planning in environment with obstacles. Novel approach to multi-agent optimal path planning, using graph representation ...
IJBC
2007
15 years 21 days ago
2007
f of the underlying abstract theorem avoids of referring to any results of applied algebraic topology and relies only on the Brouwer fixed point theorem. The second novelty is tha...