Planning in domains with cost function dependent actions

Proceedings of the National Conference on Artificial Intelligence

Volumn 1, Issue , 2011, Pages 74-80

  Phillips, Mike ^a   Likhachev, Maxim ^a  

^a CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ACTION SPACES; ALTERNATIVE APPROACH; BATTERY POWER; DYNAMIC ENVIRONMENTS; EXPERIMENTAL ANALYSIS; ORDERS OF MAGNITUDE; PLANNING PROBLEM; SEARCH-BASED; SPEED-UPS; STATE VARIABLES; SUBOPTIMALITY; TIME STEP; TRAVERSAL TIME;

ARTIFICIAL INTELLIGENCE; AVAILABILITY; COST FUNCTIONS; COSTS; ENERGY UTILIZATION; ROBOTS;

ROBOT PROGRAMMING;

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

References (13)

1. Bhattacharya, S.; Roy, R.; and Bhattacharya, S. 1998. An exact depth-first algorithm for the pallet loading problem. European Journal of Operational Research 110(3):610-625. (Pubitemid 128386946)
2. Bonet, B., and Geffner, H. 2001. Planning as heuristic search. Artificial Intelligence 129(1-2):5-33.
3. Fujino, T., and Fujiwara, H. 1992. An efficient test generation algorithm based on search state dominance. In FTCS, 246-253.
4. Gaschnig, J. 1979. Performance measurement and analysis of certain search algorithms. Tech. Rep. CMU-CS-79-124, Carnegie Mellon University.
5. Gonzalez, J. P., and Stentz, A. 2005. Planning with uncertainty in position: An optimal and efficient planner. In in Proceedings of the IEEE International Conference on Intelligent Robots and Systems (IROS 05), 2435-2442.
6. Korsah, G. A.; Stentz, A. T.; and Dias, M. B. 2007. Dd*lite: Efficient incremental search with state dominance. Technical Report CMU-RI-TR-07-12, Robotics Institute, Pittsburgh, PA.
7. Likhachev, M.; Gordon, G.; and Thrun, S. 2003. ARA*: Anytime A*with provable bounds on sub-optimality. In Advances in Neural Information Processing Systems (NIPS) 16. Cambridge, MA: MIT Press.
8. Phillips, M., and Likhachev, M. 2011. Planning in domains with cost function dependent actions: Formal analysis. Pohl, I. 1970. First results on the effect of error in heuristic search. Machine Intelligence 5:219-236.
9. Tompkins, P. 2005. Mission-Directed Path Planning for Planetary Rover Exploration. Ph.D. Dissertation, Robotics Institute, Carnegie Mellon University, Pittsburgh, PA.
10. Xu, Y., and Yue, W. 2009. A generalized framework for bdd-based replanning a*search. In SNPD, 133-139.
11. Yahja, A.; Stentz, A.; Singh, S.; and Brumitt, B. L. 1998. Framed-quadtree path planning for mobile robots operating in sparse environments. In Proceedings of the IEEE International Conference on Robotics and Automation (ICRA), 650-655.
12. Yu, C. F., and Wah, B. W. 1988. Learning dominance relations in combinatorial search problems. IEEE Trans. Software Eng. 14(8): 1155-1175.
13. Zhou, R., and Hansen, E. A. 2002. Multiple sequence alignment using A*. In Proceedings of the National Conference on Artificial Intelligence (AAAI). Student abstract.