Learning-based heuristics for risk-aware pathfinding in topographic environments for tactical agent simulation

This work presents a framework for risk-aware pathfinding in topographic terrains, designed to support realistic and tactical route planning in agent-based simulations. The proposed method enhances the A ∗ algorithm by incorporating topographic elevation and risk costs into its path cost estimation function, enabling the computation of paths that reflect tactical constraints in simulation scenarios. To improve the efficiency of heuristic estimations used in path search, we introduce the use of Deep Neural Networks (DNNs) trained to learn correction factors for heuristic functions. These models adjust distance and risk estimates during the search, outperforming conventional heuristic functions, particularly in complex environments. To reduce the computational overhead typically associated with DNN inferences, we use an Iterative Heuristic Map (IHM), a caching and batching mechanism that minimizes redundant model queries by reusing heuristic estimates for spatially related nodes. The framework introduces the notion of View Point Configurations (VPCs), a method to model multiple risk sources in a digital elevation model (DEM) by simulating the field of view from elevated risk points. VPCs enable the representation of dangerous and safe terrain areas and are used to train and evaluate DNN models. The presented work conducted comprehensive experiments in increasingly complex scenarios, including unitary, mixed, and multiple active VPC configurations. It also analyzes the risk exposure of the paths calculated by the proposed framework, comparing them with those generated by the baseline A ∗ algorithm. The results confirm the effectiveness of the framework in reducing computation costs, enhancing risk-aware DNN generalization, and improving tactical pathfinding in topographic terrains.

Authors

Institutions

Publication Details

Journal
Engineering Applications of Artificial Intelligence
Published
2026-06-16
DOI
https://doi.org/10.1016/j.engappai.2026.115406
Primary Topic
Robotic Path Planning Algorithms
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Learning-based heuristics for risk-aware pathfinding in topographic environments for tactical agent simulation

Edison Pignaton de Freitas, Luís Alvaro de Lima Silva, Thiago Rodrigues Silva, Luigi Perotti Souza
Engineering Applications of Artificial Intelligence
Robotic Path Planning Algorithms
article

Learning-based heuristics for risk-aware pathfinding in topographic environments for tactical agent simulation

Edison Pignaton de Freitas, Luís Alvaro de Lima Silva, Thiago Rodrigues Silva, Luigi Perotti Souza
article en

Abstract

This work presents a framework for risk-aware pathfinding in topographic terrains, designed to support realistic and tactical route planning in agent-based simulations. The proposed method enhances the A ∗ algorithm by incorporating topographic elevation and risk costs into its path cost estimation function, enabling the computation of paths that reflect tactical constraints in simulation scenarios. To improve the efficiency of heuristic estimations used in path search, we introduce the use of Deep Neural Networks (DNNs) trained to learn correction factors for heuristic functions. These models adjust distance and risk estimates during the search, outperforming conventional heuristic functions, particularly in complex environments. To reduce the computational overhead typically associated with DNN inferences, we use an Iterative Heuristic Map (IHM), a caching and batching mechanism that minimizes redundant model queries by reusing heuristic estimates for spatially related nodes. The framework introduces the notion of View Point Configurations (VPCs), a method to model multiple risk sources in a digital elevation model (DEM) by simulating the field of view from elevated risk points. VPCs enable the representation of dangerous and safe terrain areas and are used to train and evaluate DNN models. The presented work conducted comprehensive experiments in increasingly complex scenarios, including unitary, mixed, and multiple active VPC configurations. It also analyzes the risk exposure of the paths calculated by the proposed framework, comparing them with those generated by the baseline A ∗ algorithm. The results confirm the effectiveness of the framework in reducing computation costs, enhancing risk-aware DNN generalization, and improving tactical pathfinding in topographic terrains.

Engineering Applications of Artificial IntelligenceVol. 181
Universidade Federal do Rio Grande do Sul (BR), Universidade Federal de Santa Maria (BR)
Climate action
Openalex Percentile: Top 6%
Robotic Path Planning Algorithms
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.