Real-Time Search Algorithms for Exploration and Mapping
In this paper, we consider the problem of exploring 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 the completeness and efficiency of two algorithms.
KeywordsUnknown Environment Virtual Agent Individual Exploration Exploration Algorithm Graph Search Algorithm
Unable to display preview. Download preview PDF.
- 1.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)Google Scholar
- 2.Albers, S., Henzinger, M.: Exploring Unknown Environments. In: Proceedings the 29th Annual ACM Symposium on Theory Computing, pp. 416–425 (1997)Google Scholar
- 3.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)Google Scholar
- 4.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)Google Scholar