poster

Where do we go now?: anytime algorithms for path planning

Authors:

Stefan J. JohanssonAuthors Info & Claims

FDG '09: Proceedings of the 4th International Conference on Foundations of Digital Games

Pages 248 - 255

https://doi.org/10.1145/1536513.1536558

Published: 26 April 2009 Publication History

Abstract

Commercial computer games has become one of the largest industries in the area of entertainment. Real Time Strategy (Rts) based games is one of the most important among different types of computer games and is also considered to be a good research platform within Artificial Intelligence (Ai). There exists a number of algorithms that can deal with the Ai related problems of this domain, e.g. the ones of getting as cheap or fast as possible from one point to another (i.e. path planning). However most of the algorithms used in academia are better suited for problems that do not need to be solved within tight time frames. Anytime algorithms (Aa) are algorithms that can be stopped at any point in time and yet come up with a preliminary solution. We believe that by making algorithms anytime, we can optimize their behaviors to better suit the Rts domain. This study will introduce a tool for evaluating path planning algorithms and compare the performances of A*, Recursive Best First Search (Rbfs), Potential Fields (Pf) and their anytime versions for the path planning problem.

References

[1]

S. Aine, P. Chakrabarti, and R. Kumar. AWA* - a window anytime heuristic search algorithm. In Proceedings of the 20th International Joint Conference of Artificial Intelligence, Hyberabad, India, 2007.

Digital Library

[2]

M. Buro and T. Furtak. RTS games and real-time AI research. In Proceedings of the Behavior Representation in Modeling and Simulation Conference (BRIMS), Arlington VA, 2004.

[3]

M. Buro and T. Furtak. On the development of a free RTS game engine. Technical report, Department of Computer Science, University of Alberta, 2005.

[4]

J. David. Artificial Intelligence for Computer Games: An Introduction. AK Peters Ltd., 2004.

Digital Library

[5]

T. Dean and Boddy M. Solving time-dependent planning problems. In Proceedings of the 11th International Joint Conference on Artificial Intelligence, Detroit, Michigan, 1989.

[6]

K. Fujisawa, S. Hayakawa, T. Aoki, T. and Suzuki, and S. Okuma. Real time motion planning for autonomous mobile robot using framework of anytime algorithm. In IEEE International Conference on Robotics and Automation, Detroit, MI, 1999.

[7]

D. Furcy. ITSA*: Iterative tunneling search with A*. In Proceedings of AAAI Workshop on Heuristic Search, Memory-Based Heuristics and Their Applications, 2006.

[8]

Johan Hagelbäck and Stefan J. Johansson. The rise of potential fields in real time strategy bots. In Proceedings of Artificial Intelligence and Interactive Digital Entertainment (AIIDE), 2008.

[9]

A. Hansen and R. Zhou. Anytime heuristic search. Journal of Artificial Intelligence Research, 2006.

Digital Library

[10]

J. Klienberg and E. Tardos. Algorithm Design. Pearson/Addison-Wesley, 2006.

Digital Library

[11]

W. Kywe, D. Fujiwara, and K. Murakami. Scheduling of image processing using anytime algorithm for real-time system. In Proceedings of IEEE International Conference on Pattern Recognition, 2006.

Digital Library

[12]

J. Laird and M. Lent. Human-level AIs killer application: Interactive computer games, 2001. University of Michigan.

[13]

M. Likhachev, G. Gordon, and S. Thrun. ARA*: Anytime A* with provable bounds on sub-optimality. Advances in Neural Information Processing Systems, 16, 2004.

[14]

Daniele Loiacono, Julian Togelius, Pier Luca Lanzi, Leonard Kinnaird-Heether, Simon M. Lucas, Matt Simmerson, Diego Perez, Robert G. Reynolds, and Yago Saez. The wcci 2008 simulated car racing competition. In Proceedings of IEEE Computational Intelligence and Games, 2008.

[15]

M. Mateas. Expressive ai: Games and artificial intelligence, 2003. The Georgia Institute of Technology, Atlanta.

[16]

Jeff Orkin. Agent architecture considerations for real-time planning in games. In In proceedings of Artificial Intelligence in Interactive and Digital Entertainment (AIIDE), Marina del Ray, CA, 2005.

[17]

S. J. Russell and P. Norvig. Artificial Intelligence: A Modern Approach. Prentice Hall, 2003. 2nd edition.

Digital Library

[18]

W. Zhang. Complete anytime beam search. In Proceedings of 14th National Conference of Artificial Intelligence - AAAI, Monterey, 1998.

Digital Library

[19]

R. Zhou and E. Hansen. Beam-stack search: Integrating backtracking with beam search. In Proceedings of the 15th international Conference on Automated Planning and Scheduling, Monterey, 2005.

[20]

S. Zilberstein. Using anytime algorithms in intelligent systems. AI Magazine, 17(3), 1996.

Cited By

Liu WZheng ZCai K(2013)Bi-level programming based real-time path planning for unmanned aerial vehiclesKnowledge-Based Systems10.1016/j.knosys.2013.01.01144(34-47)Online publication date: 1-May-2013
https://dl.acm.org/doi/10.1016/j.knosys.2013.01.011
Shieh JKeogh E(2010)Polishing the Right AppleProceedings of the 2010 IEEE International Conference on Data Mining10.1109/ICDM.2010.120(461-470)Online publication date: 13-Dec-2010
https://dl.acm.org/doi/10.1109/ICDM.2010.120

Recommendations

Why Does Time Go Faster As We Get Older?

Persons in every age group wonder why time seems to move so much faster than it did in their pasts. It seems as if there is never enough time to get everything done and that the situation only gets worse. Many explanations have been offered for this, ...
Linux to Go
When things go wrong
WSC '05: Proceedings of the 37th conference on Winter simulation

When performing simulation projects, all analysts or project managers are taught to follow the simulation process: Define, Formulate, Verify/Validate, Analyze, and Recommend. However, few of us are taught what to do when all does not go well. Most ...

Comments

Information & Contributors

Information

Published In

cover image ACM Other conferences

FDG '09: Proceedings of the 4th International Conference on Foundations of Digital Games

April 2009

386 pages

ISBN:9781605584379

DOI:10.1145/1536513

Conference Chair:
Jim Whitehead
UC Santa Cruz
,
Program Chair:
R. Michael Young
North Carolina State University

Copyright © 2009 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

SASDG: The Society for the Advancement of the Science of Digital Games

In-Cooperation

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 26 April 2009

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Poster

Conference

FDG '09

Sponsor:

SASDG

FDG '09: International Conference on the Foundations of Digital Games

April 26 - 30, 2009

Florida, Orlando

Acceptance Rates

Overall Acceptance Rate 152 of 415 submissions, 37%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

2
Total Citations
View Citations
421
Total Downloads

Downloads (Last 12 months)3
Downloads (Last 6 weeks)0

Reflects downloads up to 01 Mar 2025

Other Metrics

View Author Metrics

Citations

Cited By

Liu WZheng ZCai K(2013)Bi-level programming based real-time path planning for unmanned aerial vehiclesKnowledge-Based Systems10.1016/j.knosys.2013.01.01144(34-47)Online publication date: 1-May-2013
https://dl.acm.org/doi/10.1016/j.knosys.2013.01.011
Shieh JKeogh E(2010)Polishing the Right AppleProceedings of the 2010 IEEE International Conference on Data Mining10.1109/ICDM.2010.120(461-470)Online publication date: 13-Dec-2010
https://dl.acm.org/doi/10.1109/ICDM.2010.120

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Figures

Tables

Media

View Table of Conten