810 search results - page 59 / 162 » Solving Time-Dependent Planning Problems |
125
Voted
ATAL
2009
Springer
15 years 4 months ago
2009
Springer
Motion planning for mobile agents, such as robots, acting in the physical world is a challenging task, which traditionally concerns safe obstacle avoidance. We are interested in p...
139
Voted
KER
2007
15 years 3 months ago
2007
AI planning solves the problem of generating a correct and efficient ordered set of instantiated activities, from a knowledge base of generic actions, which when executed will tra...
127
Voted
CAEPIA
2007
Springer
15 years 10 months ago
2007
Springer
Consider a robot whose task is to pick up some colored balls from a grid, taking the red balls to a red spot, the blue balls to a blue spot and so on, one by one, without knowing e...
154
Voted
JAIR
2008
15 years 3 months ago
2008
Probabilistic planning problems are typically modeled as a Markov Decision Process (MDP). MDPs, while an otherwise expressive model, allow only for sequential, non-durative action...
118
Voted
EDBT
2006
ACM
16 years 3 months ago
2006
ACM
Navigational queries on Web-accessible life science sources pose unique query optimization challenges. The objects in these sources are interconnected to objects in other sources, ...