A Research of HTN-Based Anytime Planning Algorithm on FPS Games

Jie Liang Dong

doi:10.4028/www.scientific.net/AMM.548-549.1553

Paper Titles

A Neural-Q-Learning Based Approach for Delay Tolerant Underwater Acoustic Wireless Sensor Networks
p.1530

Research and Application of Information Management for NC Equipment
p.1536

A Level-Dependence Model and it’s Application in SFMEA
p.1543

Information Processing in Searching Tweets
p.1549

A Research of HTN-Based Anytime Planning Algorithm on FPS Games
p.1553

A MapReduce Model to Process Massive Switching Center Data Set
p.1557

Pixel Value Graphical Password Scheme: Identifying Design Features and Requirements
p.1561

Study on the Multi-Layer Structure Design of the Power Marketing Demand Side Monitoring Center System
p.1566

Modeling and Simulation of Indoor Millimeter Wave Propagation Characteristics
p.1571

HomeApplied Mechanics and MaterialsApplied Mechanics and Materials Vols. 548-549A Research of HTN-Based Anytime Planning Algorithm...

A Research of HTN-Based Anytime Planning Algorithm on FPS Games

Abstract:

With the development of game industry, the requirements of game AI are also increasing. Recently a planning formalism called HTN (Hierarchical Task Network) was used to design AI behaviors. In this paper we describe how to implement an anytime planner based on HTN to handle a dynamic environment, which is the key feature of computer game worlds. This planner allows agent to interrupt its sequence of actions at anytime based on the changes of environment meanwhile return a valid replacement plan. We use Unreal Tournament 2004 which is a famous first-person shooter game as the platform and test our anytime planner.

You might also be interested in these eBooks

View Preview

Info:

Periodical:

Applied Mechanics and Materials (Volumes 548-549)

Pages:

1553-1556

DOI:

https://doi.org/10.4028/www.scientific.net/AMM.548-549.1553

Citation:

Cite this paper

Online since:

April 2014

Authors:

Jie Liang Dong

Keywords:

Anytime Algorithm, Game Ai, HTN Planning

Export:

RIS, BibTeX

Price:

Permissions CCC:

Request Permissions

Permissions PLS:

Request Permissions

Сopyright:

Citation:

References

[1] Nau, Dana S., et al. SHOP2: An HTN planning system., J. Artif. Intell. Res. (JAIR) 20 (2003): 379-404.

Google Scholar

[2] Erol, Kutluhan, James Hendler, and Dana S. Nau. HTN planning: Complexity and expressivity., AAAI. Vol. 94. (1994).

Google Scholar

[3] Zilberstein, Shlomo. Using anytime algorithms in intelligent systems., AI magazine 17. 3 (1996): 73.

Google Scholar

[4] Erol, Kutluhan, James A. Hendler, and Dana S. Nau. UMCP: A Sound and Complete Procedure for Hierarchical Task-network Planning., AIPS. Vol. 94. (1994).

Google Scholar

[5] Hawes, Nick. Anytime planning for agent behaviour., (2001): 157-166.

Google Scholar