OpenAlex Citation Counts

OpenAlex Citations Logo

OpenAlex is a bibliographic catalogue of scientific papers, authors and institutions accessible in open access mode, named after the Library of Alexandria. It's citation coverage is excellent and I hope you will find utility in this listing of citing articles!

If you click the article title, you'll navigate to the article, as listed in CrossRef. If you click the Open Access links, you'll navigate to the "best Open Access location". Clicking the citation count will open this listing for that article. Lastly at the bottom of the page, you'll find basic pagination options.

Requested Article:

Deep reinforcement learning for optimal rescue path planning in uncertain and complex urban pluvial flood scenarios
Xiaoyan Li, Xuedong Liang, Xia Wang, et al.
Applied Soft Computing (2023) Vol. 144, pp. 110543-110543
Closed Access | Times Cited: 16

Showing 16 citing articles:

Real-time identification of borehole rescue environment situation in underground disaster areas based on multi-source heterogeneous data fusion
Guobin Cai, Xuezhao Zheng, Jun Guo, et al.
Safety Science (2024) Vol. 181, pp. 106690-106690
Closed Access | Times Cited: 27

Recent progress, challenges and future prospects of applied deep reinforcement learning : A practical perspective in path planning
Ye Zhang, Wang Zhao, Jingyu Wang, et al.
Neurocomputing (2024) Vol. 608, pp. 128423-128423
Closed Access | Times Cited: 17

An enhanced deep reinforcement learning approach for efficient, effective, and equitable disaster relief distribution
Moiz Ahmad, Muhammad Tayyab, Muhammad Salman Habib
Engineering Applications of Artificial Intelligence (2025) Vol. 143, pp. 110002-110002
Closed Access | Times Cited: 1

Emergency fire escape path planning model based on improved DDPG algorithm
Zengxi Feng, Chang Wang, Jianhu An, et al.
Journal of Building Engineering (2024) Vol. 95, pp. 110090-110090
Closed Access | Times Cited: 6

Hierarchical path planner combining probabilistic roadmap and deep deterministic policy gradient for unmanned ground vehicles with non-holonomic constraints
Jie Fan, Xudong Zhang, Kun Zheng, et al.
Journal of the Franklin Institute (2024) Vol. 361, Iss. 8, pp. 106821-106821
Closed Access | Times Cited: 5

Application of machine learning-based surrogate models for urban flood depth modeling in Ho Chi Minh City, Vietnam
Thanh Quang Dang, Ba Hoang Tran, Quyen Ngoc Le, et al.
Applied Soft Computing (2023) Vol. 150, pp. 111031-111031
Closed Access | Times Cited: 13

Dynamic impact assessment of urban floods on the compound spatial network of buildings-roads-emergency service facilities
Yawen Zang, Jing Huang, Huimin Wang
The Science of The Total Environment (2024) Vol. 926, pp. 172007-172007
Closed Access | Times Cited: 4

Modeling virtual agent behavior using an adaptive multi-plan evacuation strategy
Dilyana Budakova, Velyo Vasilev, Lyudmil Dakovski
AIP conference proceedings (2025) Vol. 3274, pp. 040004-040004
Closed Access

Cluster-based prepositioning network for enhanced recovery resilience of critical infrastructure system using multiplex network
Ying Wang, Ou Zhao, Limao Zhang
Applied Soft Computing (2025), pp. 112987-112987
Closed Access

Rescue path planning for urban flood: A deep reinforcement learning–based approach
Xiaoyan Li, Xia Wang
Risk Analysis (2024)
Closed Access | Times Cited: 2

Deep Reinforcement Learning for Multi-Objective Real-Time Pump Operation in Rainwater Pumping Stations
Jingul Joo, In-Seon Jeong, Seung‐Ho Kang
Water (2024) Vol. 16, Iss. 23, pp. 3398-3398
Open Access | Times Cited: 1

An Incremental Optimization Approach to Address the Spatiotemporal Reward Coupling Effects in Deep Reinforcement Learning for Path Planning
Wang Zhao, Zikang Xie, Hongyu Wu, et al.
2021 6th International Conference on Automation, Control and Robotics Engineering (CACRE) (2024), pp. 124-128
Closed Access

3D path planning of unmanned ground vehicles based on improved DDQN
Can Tang, Tao Peng, Xingxing Xie, et al.
The Journal of Supercomputing (2024) Vol. 81, Iss. 1
Closed Access

Page 1

Scroll to top