Abstract
Thanks to the advances in graphical hardware in the last years, virtual worlds are becoming increasingly popular. Moreover, there exist now standard formats for describing 3D scenes on the web and there is a number of development tools available such as, in the computer games community, editors to design new maps and agent behaviors for popular 3D action games such Unreal, Half-life, or Quake, not to mention general SDKs such as Discreet’s Gmax or Intrinsic’s Alchemy. Nevertheless, it is difficult to “populate” such worlds with virtual agents representing life-like creatures which could autonomously navigate and react to their changing environment, and also possibly interact with users. Pathplanning problems are thus a key issue in the so-called “Game AI” domain [4], and have been tackled up to now with traditional AI techniques such as the classical A* algorithm or more modern extensions, heavily relying on the complete knowledge of the complete virtual environment to define an optimal trajectory for computer-controlled characters. Such classical path-finding is however usually limited to a single goal point and basically amount to compute an optimal or near-optimal trajectory avoiding collision with known obstacles. We will see however that pathfinding can be rephrased as an optimization problem and that constraint-based techniques can be applied to give a reactive anytime algorithm that produce life-like, if not optimal, behaviors for virtual creatures [1]. For the constraint solving aspects, we use a method called Adaptive Search which is based on local search techniques applied to CSPs, inspired by methods such as GSAT and Tabu Search [2]. We are also interested in this work in more complex path-planning, where several goals have to be satisfied by the autonomous agent, which has thus to pass through several destination points in the virtual environment, and we call this problem multi-goal path-finding. This problem appears in a virtual environment or 3D game when, for instance, the user ask some helper agent to go and pick several items and to meet him at some further point. This could also be the case for an autonomous creature who has to “survive” in an unknown environment and for instance look for food but also for water, and so on so forth. In this case also considering multi-goal path-planning as an optimization problem (an instance of the well-known Traveling Salesman Problem) amounts to design new algorithms based on local search techniques, which are also reactive and exhibit opportunistic behaviors for artificial creatures [3].
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
P. Codognet. Animating virtual creatures by constraint-based adaptive search. In proc. VSMM2000, 4th Int. Conf. on Virtual Systems and Multimedia, Gifu, Japan, IOS Press 2000.
P. Codognet and D. Diaz. Yet Another Local Search Method for Constraint Solving. In Proc. SAGA01, 1st International Symposim on Stochastic Algorithms: Foundations and Applications, LNCS 2246, Springer Verlag 2001.
P. Codognet Multi-Goal Path-Finding for Autonomous Agents in Virtual Worlds In Entertainment Computing: Technologies and Applications, Kluwer Academic Publisher 2002.
S. Woodcock. Game AI: the state of the industry. Game developer, 7 (8), August 2000 & 8 (8), August 2001 & 9(8), August 2002.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Codognet, P. (2002). Intelligent Agents in Virtual Worlds. In: Yakhno, T. (eds) Advances in Information Systems. ADVIS 2002. Lecture Notes in Computer Science, vol 2457. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36077-8_24
Download citation
DOI: https://doi.org/10.1007/3-540-36077-8_24
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-00009-9
Online ISBN: 978-3-540-36077-3
eBook Packages: Springer Book Archive