A Fresh look at sensor-based navigation: Navigation with sensing costs

AAAI Workshop - Technical Report

Volumn WS-08-10, Issue , 2008, Pages 11-17

  Bnaya, Zahy ^a   Felner, Ariel ^a   Shimony, Eyal ^a   Kaminka, Gal A ^b   Merdler, Efi ^b  

^a BEN GURION UNIVERSITY OF THE NEGEV   (Israel)

^b BAR ILAN UNIVERSITY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL EFFORT; HEURISTIC FUNCTIONS; TOTAL COSTS; TRAVEL COSTS;

ARTIFICIAL INTELLIGENCE; HEURISTIC ALGORITHMS; HEURISTIC METHODS; NAVIGATION; WIRELESS TELECOMMUNICATION SYSTEMS;

COSTS;

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

References (16)

1. Bar-Noy, A., and Schieber, B. 1991. The Canadian traveller problem. In SODA '91: Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms, 261-270. Philadelphia, PA, USA: Society for Industrial and Applied Mathematics.
2. Burgard, W.; Moors, M.; Stachniss, C.; and Schneider, F. 2005. Coordinated multi-robot exploration. IEEE Transactions on Robotics.
3. * in unknown physical environments. Journal of Artificial Intelligence Research 21:631-679.
4. Hansen, E. A. 2007. Indefinite-horizon POMDPs with action-based termination. In AAAI, 1237-1242.
5. Heckerman, D.; Horvitz, E.; and Middleton, B. 1993. An approximate nonmyopic computation for value of information. IEEE Trans. Pattern Anal. Mach. Intell. 15(3):292-298.
6. * lite. In Proceedings of the Eighteenth National Conference on Artificial Intelligence (AAAI), 476-483.
7. *. In Advances in Neural Information Processing Systems 14 (NIPS). MIT Press, Cambridge, MA.
8. Koenig, S.; Smirnov, Y.; and Tovey, C. 2003. Performance bounds for planning in unknown terrain. Artificial Intelligence Journal 147(1-2):253-279.
9. Koenig, S. 2001. Agent-centered search. Artificial Intelligence Magazine 22(4):109-131.
10. Korf, R. E. 1990. Real-time heuristic search. Artificial Intelligence 42(3): 189-211.
11. Okabe, A.; Boots, B.; and Sugihara, K. 1992. Spatial Tessellations, Concepts, and Applications of Voronoi Diagrams. UK: Wiley, Chichester.
12. Pineau, J.; Gordon, G.; and Thrun, S. 2003. Point-based value iteration: An anytime algorithm for POMDPs. In International Joint Conference on Artificial Intelligence (IJ-CAI), 1025-1032.
13. Puterman, M. 1994. Markov Decision Processes. New York: Wiley.
14. Shani, G.; Brafman, R. I.; and Shimony, S. E. 2006. Prioritizing point-based POMDP solvers. In Fiirnkranz, J.; Scheffer, T.; and Spiliopoulou, M., eds., ECML, volume 4212 of Lecture Notes in Computer Science, 389-400. Springer.
15. Stentz, A. 1994. Optimal and efficient path planning for partially-known environments. In Proceedings of the IEEE International Conference on Robotics and Automation, 3310-3317.
16. Szepesvri, C. 2004. Shortest path discovery problems: A framework, algorithms and experimental results. In Proceedings of AAAI-2004, 550-555.