Efficient Target Assignment via Binarized SHP Path Planning and Plasticity-Aware RL in Urban Adversarial Scenarios

Guardado en:

Bibliografiske detaljer
Udgivet i:	Applied Sciences vol. 15, no. 17 (2025), p. 9630-9654
Hovedforfatter:	Ding Xiyao
Andre forfattere:	Chen, Hao, Wang, Yu, Wei Dexing, Fu Ke, Liu Linyue, Benke, Gao, Liu, Quan, Huang, Jian
Udgivet:	MDPI AG
Fag:	Mathematical programming Unmanned aerial vehicles Integer programming Linear programming Dynamic programming Adaptability Heuristic Branch & bound algorithms Genetic algorithms Decision making Optimization Efficiency
Online adgang:	Citation/Abstract Full Text + Graphics Full Text - PDF
Tags:	Tilføj Tag Ingen Tags, Vær først til at tagge denne postø!

Beskrivelse
Resumen:	Accurate and feasible target assignment in an urban environment without road networks remains challenging. Existing methods exhibit critical limitations: computational inefficiency preventing real-time decision-making requirements and poor cross-scenario generalization, yielding task-specific policies that lack adaptability. To achieve efficient target assignment in urban adversarial scenarios, we propose an efficient traversable path generation method requiring only binarized images, along with four key constraint models serving as optimization objectives. Moreover, we model this optimization problem as a Markov decision process (MDP) and introduce the generalization sequential proximal policy optimization (GSPPO) algorithm within the reinforcement learning (RL) framework. Specifically, GSPPO integrates an exploration history representation module (EHR) and a neuron-specific plasticity enhancement module (NPE). EHR incorporates exploration history into the policy learning loop, which significantly improves learning efficiency. To mitigate the plasticity loss in neural networks, we propose an NPE module, which boosts the model’s representational capability and generalization across diverse tasks. Experiments demonstrate that our approach reduces planning time by four orders of magnitude compared to the online planning method. Against the benchmark algorithm, it achieves 94.16% higher convergence performance, 33.54% shorter assignment path length, 51.96% lower threat value, and 40.71% faster total time. Our approach supports real-time military reconnaissance and will also facilitate rescue operations in complex cities.
ISSN:	2076-3417
DOI:	10.3390/app15179630
Fuente:	Publicly Available Content Database