810 search results - page 125 / 162 » Solving Time-Dependent Planning Problems |
CSL
2003
Springer
14 years 1 months ago
2003
Springer
Many verification, planning, and control problems can be modeled as games played on state-transition graphs by one or two players whose conflicting goals are to form a path in th...
AI
2001
Springer
14 years 13 days ago
2001
Springer
Reinforcement learning techniques are increasingly being used to solve di cult problems in control and combinatorial optimization with promising results. Implicit imitation can acc...
DBVIS
1995
13 years 11 months ago
1995
More and more of our customers have to deal with very large datasets like elevation data and digital roadmaps covering Europe or even the entire world, very large images e.g. from...
CDC
2008
IEEE
13 years 10 months ago
2008
IEEE
Open channel flow is traditionally described by hyperbolic conservation laws (the Saint-Venant equations), that can be controlled using boundary conditions. For horizontal friction...
AAAI
2006
13 years 9 months ago
2006
We introduce point-based dynamic programming (DP) for decentralized partially observable Markov decision processes (DEC-POMDPs), a new discrete DP algorithm for planning strategie...