810 search results - page 74 / 162 » Solving Time-Dependent Planning Problems |
AAAI
1997
13 years 9 months ago
1997
Markov Decision Processes (MDPs), currently a popular method for modeling and solving decision theoretic planning problems, are limited by the Markovian assumption: rewards and dy...
ICML
2009
IEEE
14 years 9 months ago
2009
IEEE
Relational world models that can be learned from experience in stochastic domains have received significant attention recently. However, efficient planning using these models rema...
AAI
2004
13 years 8 months ago
2004
Work allocation planning is a vital and notoriously difficult task in areas characterised by large work forces, contiguous and sometimes overlapping shifts, regulatory and corpora...
ICRA
2010
IEEE
13 years 6 months ago
2010
IEEE
— The DPC algorithm developed in our previous work is an efficient way of computing optimal trajectories for multiple robots in a distributed fashion with timeparameterized cons...
IROS
2009
IEEE
14 years 2 months ago
2009
IEEE
— Sampling-based motion planners are often used to solve very high-dimensional planning problems. Many recent algorithms use projections of the state space to estimate properties...