107 search results - page 20 / 22 » Approximate Linear Programming for Constrained Partially Obs... |
CDC
2008
IEEE
14 years 1 months ago
2008
IEEE
— In this paper we study the problem of dynamic optimization of ping schedule in an active sonar buoy network deployed to provide persistent surveillance of a littoral area throu...
AI
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. Current point-based planning algorithms for solving partially observable Markov decision processes (POMDPs) have demonstrated that a good approximation of the value funct...
IJCAI
2003
13 years 8 months ago
2003
A longstanding goal in planning research is the ability to generalize plans developed for some set of environments to a new but similar environment, with minimal or no replanning....
ICRA
2008
IEEE
14 years 1 months ago
2008
IEEE
— Target tracking has two variants that are often studied independently with different approaches: target searching requires a robot to find a target initially not visible, and ...
NIPS
2001
13 years 8 months ago
2001
Policy gradient methods for reinforcement learning avoid some of the undesirable properties of the value function approaches, such as policy degradation (Baxter and Bartlett, 2001...