Safe Pathfinding Using Abstract Hierarchical Graph and Influence Map

Pathfinding is widely used in virtual environments, such as computer games. Most pathfinding types involve shortest pathfinding, which explores the fastest path, but tactical paths can also be searched for using various properties. This paper provides a method for finding safe paths that maintain a...

Full description

Saved in:
Bibliographic Details
Published in2015 IEEE 27th International Conference on Tools with Artificial Intelligence (ICTAI) pp. 860 - 865
Main Authors Jong, Daeseong, Kwon, Ickhwan, Goo, Donghyun, Lee, DoHoon
Format Conference Proceeding Journal Article
LanguageEnglish
Published IEEE 01.11.2015
Subjects
abstraction
Algorithms
Artificial intelligence
Balancing
Computers
Conferences
Electronic & video games
Expert systems
Games
influence map
Mathematical model
Navigation
pathfinding
Risk
Safety
Search problems
Strategy
Virtual environments
Online AccessGet full text

Cover

More Information
Summary:Pathfinding is widely used in virtual environments, such as computer games. Most pathfinding types involve shortest pathfinding, which explores the fastest path, but tactical paths can also be searched for using various properties. This paper provides a method for finding safe paths that maintain a balance between path length and risks from hostile elements, as well as a method to reduce computation time using a hierarchical search strategy to enhance operational efficiency. Safe pathfinding uses the A* algorithm, referring to the influence map, which addresses the degree of risk in the terrain. The searched path represents its attributes regarding total length and cumulative risk.
Bibliography:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Conference-1
ObjectType-Feature-3
content type line 23
SourceType-Conference Papers & Proceedings-2
ISSN:1082-3409
2375-0197
DOI:10.1109/ICTAI.2015.125