Solving Robot Navigation Problems with Initial Pose Uncertainty Using Real-Time Heuristic Search

Proceedings of the 4th International Conference on Artificial Intelligence Planning Systems, AIPS 1998

Volumn , Issue , 1998, Pages 145-153

  Koenig, Sven ^a   Simmons, Reid G ^b  

^a Georgia Institute of Technology   (United States)

^b Carnegie Mellon University ^*  (United States)

Author keywords

[No Author keywords available]

Indexed keywords

HEURISTIC METHODS; MODULAR ROBOTS; NAVIGATION; OPTIMIZATION; ROBOT PROGRAMMING;

DETERMINISTIC DOMAINS; GOAL-DIRECTED; MIN-MAX; NAVIGATION PROBLEM; NAVIGATION TASKS; PLAN EXECUTION; PLANNING TASKS; REAL- TIME; ROBOT NAVIGATION; UNCERTAINTY;

HEURISTIC ALGORITHMS;

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

References (20)

1. Barto, A.; Bradtke, S.; and Singh, S. 1995. Learning to act using real-time dynamicprogramming.Artificial Intelligence 73(1):81-138.
2. Bonet, B.; Locrincs, G.; and Geffner, H. 1997. Arobust andfast action selection mechanism. In Proceedingsof the NationalConferenceonArtificial Intelligence.
3. Chrisman, L. 1992. Reinforcement learning with perceptual aliasing: Theperceptual distinctions approach.In Proceedingsof the NationalConferenceonArtificial Intelligence, 183-188.
4. Dean,T.; Kaelbling, L.: Kirman,J.: and Nicholson, A. 1995. Planning under time constraints in stochastic domains.Artificial htelligence76(I-2):35-74.
5. Genesereth, M., and Nourbakhsh, I. 1993. Time-saving tips for problemsolving with incompleteinformation. In Proceedingsof the National Conferenceon Artificial Intelligence, 724-730.
6. Good,I. 1971. Twenty-sevenprinciples of rationality. In Godambe, V., and Sprott, D., ods., Foundationsof Statistical Inference. Holt, Rinehart, Winston.
7. Hegel M. 1996. The loss from imperfect value functions in expectation-based and minimax-basedtasks. Machine Learning22(1-3): 197-225.
8. Koenig, S., and Simmons,R. 1995. Real-time search in non-deterministic domains. In Proceedingsof the International Joint Conferenceon Artificial Intelligence, 1660-1667.
9. Koenig, S. 1997. Goal-Directed Acting with Incomplete lnfornution. Ph.D. Dissertation, School of Computer Science, Carnegie MellonUniversity, Pittsburgh (Pennsylvania).
10. Kohavi, Z. 1978. Switching and Finite AutomataTheol.. McGraw-Hill,second edition.
11. Korf, R. 1990.Real-timeheuristic search. Artificial Intelligence 42(2-3): 189-211.
12. Korf, R. 1993. Linear-spacebest-first search. Artificial Intelligence 62(1):41-78.
13. Littman, M. 1996. Algorithms for Sequential Decision Making. Ph.D. Dissertation, Department of Computer Science, BrownUniversity, Providence (Rhode Island). Available as Technical Report CS-96-09.
14. Lozano-Perez,T.; Mason,M.; and Taylor, R. 1984. Automaticsynthesis of fine-motionstrategies for robots. International Journalof RoboticsResearch3(1):3-24.
15. Nourbakhsh, I., and Genesereth, M. 1997. Teaching AI with robots. In Kortenkamp,D.; Bonasso,R.; and Murphy, R., eds., Artificial Intelligence BasedMobileRobotics: CaseStudies of Successful RobotSystems. MITPress.
16. Nourbakhsh,I. 1996. Interleaving Planning and Execution. Ph.D. Dissertation, Departmentof ComputerScience, StanfordUniversity, Stanford(California).
17. Pearl, J. 1985. Heuristics: Intelligent SearchStrategies for ComputerProblemSolving. Addison-Wesley.
18. Russell, S., and Wefald, E. 1991. Dothe Right Thing - Studies in LimitedRationali. MITPress.
19. Schapire, R. 1992. TheDesignandAnalysis of E17icient LearningAlgorithms. MITPress.
20. Stentz, A. 1995. The focussed D* algorithm for real-time replanning. In Proceedingsof the International Joint Conferenceon Artificial Intelligence, 1652-1659.