Abstract
We consider the problem of exploring an unknown environment with an intelligent virtual agent. Traditionally research efforts to address the exploration and mapping problem have focused on the graph-based space representations and the graph search algorithms. In this paper, we propose DFS-RTA* and DFS-PHA*, two real-time graph search algorithms for exploring and mapping an unknown environment. Both algorithms are based upon the simple depth-first search strategy. However, they adopt different real-time shortest path-finding methods for fast backtracking to the last unexhausted node. Through some experiments with a virtual agent deploying in a 3D interactive computer game environment, we confirm completeness and efficiency of two algorithms.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Adobbati, R., Marshall, A.N., Scholer, A., Tejada, S., Kaminka, G.A., Schaffer, S., Sollitto, C.: GameBots: A 3D Virtual World Test Bed for Multiagent Research. In: Proceedings of the 2nd International Workshop on Infrastructure for Agents, MAS, and Scable MAS (2001)
Albers, S., Henzinger, M.: Exploring Unknown Environments. In: Proceedings the 29th Annual ACM Symposium on Theory Computing, pp. 416–425 (1997)
Bender, M., Fernandez, A., Ron, D., Sahai, A., Vadhan, S.: The Power of a Pebble: Exploring and Mapping Directed Graphs. In: Proceedings of STOC 1998, pp. 269–278 (1998)
Deng, X., Kameda, T., Papadimitriou, C.: How to Learn in an Unknown Environment. In: Proceedings of the 32nd Symposium on the Foundations of Computer Science, pp. 298–303 (1991)
Felner, A., Stern, R., Kraus, S., Ben-Yair, A., Netanyahu, N.S.: PHA*: Finding the Shortest Path with A* in An Unknown Physical Environment. Journal of Artificial Intelligence Research (JAIR) 21, 631–670 (2004)
Korf, R.E.: Real-time Heuristic Search. Artificial Intelligence 42(3), 189–211 (1990)
Kwek, S.: On a simple Depth-First Search Strategy for exploring Unknown Graphs. In: Rau-Chaplin, A., Dehne, F., Sack, J.-R., Tamassia, R. (eds.) WADS 1997. LNCS, vol. 1272, pp. 345–353. Springer, Heidelberg (1997)
Pearl, J., Kim, J.E.: Studies in Semi-Admissible Heuristics. IEEE Transaction on PAMI 4(201), 392–400 (1982)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kim, IC. (2006). Exploring an Unknown Environment with an Intelligent Virtual Agent. In: Euzenat, J., Domingue, J. (eds) Artificial Intelligence: Methodology, Systems, and Applications. AIMSA 2006. Lecture Notes in Computer Science(), vol 4183. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11861461_20
Download citation
DOI: https://doi.org/10.1007/11861461_20
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40930-4
Online ISBN: 978-3-540-40931-1
eBook Packages: Computer ScienceComputer Science (R0)