Near-optimal search in continuous domains

Proceedings of the National Conference on Artificial Intelligence

Volumn 2, Issue , 2007, Pages 1158-1163

  Ieong, Samuel ^a   Lambert, Nicolas ^a   Shoham, Yoav ^a   Brafman, Ronen ^b  

^a Stanford University   (United States)

^b BEN GURION UNIVERSITY OF THE NEGEV   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

CONTINUOUS DOMAINS; DISCRETE TIME STEPS; HEURISTIC FUNCTIONS;

APPROXIMATION ALGORITHMS; DISCRETE TIME CONTROL SYSTEMS; HEURISTIC ALGORITHMS;

UNCERTAINTY ANALYSIS;

EID: 36349015999     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (13)

1. Abbeel, P.; Coates, A.; Quigley, M.; and Ng, A. Y. 2007. An application of reinforcement learning to aerobatic helicopter flight.
2. Bresina, J.; Dearden, R.; Meuleau, N.; Ramkrishnan, S.; Smith, D.; and Washington, R. 2002. Planning under continuous time and resource uncertainty: A challenge for AI. In Proc. 18th Conf. on Uncertainty in Artificial Intelligence, 77-84.
3. Guestrin, C.; Hauskrecht, M.; and Kveton, B. 2004. Solving factored mdps with continuous and discrete variables.
4. Hauskrecht, M., and Kveton, B. 2004. Linear program approximations for factored continuous-state markov decision processes. In NIPS 16, 859-902.
5. Kavraki, L. E.; Svestka, P.; Latombe, J.-C; ; and Overmars, M. 1996. Probabilistic roadmaps for path planning in high dimensional configuration spaces. In IEEE Trans on Robotics and Automation, volume 12, 566-580.
6. Latombe, J.-C. 1991. Robot Motion Planning. Kluwer Academic Publishers.
7. LaValle, S. M., and Kuffner, J. J. 1999. Randomized kinodynamic planning. In Proc. IEEE Int. Conf. Robotics and Automation, 473-479.
8. LaValle, S. M. 2006. Planning Algorithms. Cambridge University Press.
9. Mausam; Benazera, E.; Brafman, Ronen Meuleau, N.; and Hansen, E. A. 2005. Planning with continuous resources in stochastic domains. In Proc. 19th Int. Joint Conf. on Artificial Intelligence, 1244-1251.
10. Mladineo, F. H. 1986. An algorithm for finding the global maximum of a multimodal, multivariate function. Math. Program. 34(2):188-200.
11. Porta, J. M.; Vlassis, N.; Spaan, M. T.; and Poupart, P. 2006. Point-based value iteration for continuous POMDPs. J Machine Learning Research 7:2329-2367.
12. Roy, N., and Thrun, S. 2002. Motion planning through policy search. In Proc. IEEE Int. Conf. Intell. Robots and Sys.
13. Smith, M. 2006. Running the table: An AI for computer billiards. In Proc. 21st Nat. Conf. on Artificial Intelligence.