The DOI matches its Crossref record; 23 of the 28 references it cites were found in a registry or an index.
An Environmental-Complexity-Based Navigation Method Based on Hierarchical Deep Reinforcement Learning
Abstract
Navigation methods based on deep reinforcement learning (RL) have recently exhibited superior performance, particularly for navigation in dynamic environments. However, most existing methods solely rely on deep neural network feature encoders to extract features from raw LiDAR data, lacking an explicit representation of environmental structure. This limitation hinders effective environmental representation and interpretability, constraining navigation performance improvement. To solve this problem, we propose two quantitative metrics based on laser scans, which explicitly represent environmental complexity and show great interpretability. Furthermore, we propose an environmental-complexity-based navigation method based on hierarchical deep RL with the proposed metrics. Experimental results show that the proposed method achieves better navigation performance than baselines, especially in challenging scenarios with corners and dynamic obstacles.
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
Citations
Cites
Adam: A Method for Stochastic Optimization
Kingma, D. P., & Ba, J. (2014) · arXiv · doi:10.48550/arxiv.1412.6980 · Cited by 98,946
LeCun, Y., Bengio, Y., & Hinton, G. (2015) · Nature · doi:10.1038/nature14539 · Cited by 84,126
Proximal Policy Optimization Algorithms
Schulman, J., Wolski, F., Dhariwal, P., Radford, A., & Klimov, O. (2017) · arXiv · doi:10.48550/arxiv.1707.06347 · Cited by 10,625
Reinforcement Learning: An Introduction
Johnson, J. D., Li, J., & Chen, Z. (2000) · Neurocomputing · doi:10.1016/s0925-2312(00)00324-6 · Cited by 8,414
Soft actor-critic Off-policy maximum entropy deep reinforcement learning with a stochastic actor
Haarnoja, T., Zhou, A., Abbeel, P., & Levine, S. (2018) · arXiv · doi:10.48550/arxiv.1801.01290 · Cited by 5,594
The dynamic window approach to collision avoidance
Fox, D., Burgard, W., & Thrun, S. (1997) · IEEE Robotics & Automation Magazine · doi:10.1109/100.580977 · Cited by 3,771
Addressing Function Approximation Error in Actor-Critic Methods
Fujimoto, S., van Hoof, H., & Meger, D. (2018) · arXiv · doi:10.48550/arxiv.1802.09477 · Cited by 3,650
Tai, L., Paolo, G., & Liu, M. (2017) · 2017 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS) · doi:10.1109/iros.2017.8202134 · Cited by 834
Chen, C., Liu, Y., Kreiss, S., & Alahi, A. (2019) · 2019 International Conference on Robotics and Automation (ICRA) · doi:10.1109/icra.2019.8794134 · Cited by 615
Motion Planning Among Dynamic, Decision-Making Agents with Deep Reinforcement Learning
Everett, M., Chen, Y. F., & How, J. P. (2018) · 2018 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS) · doi:10.1109/iros.2018.8593871 · Cited by 614
Cited by
Robotic Motion Planning Based on Deep Reinforcement Learning and Artificial Neural Networks
Liu, H., Li, X., Dong, M., et al. (2024) · IEEE Transactions on Automation Science and Engineering · doi:10.1109/tase.2024.3486064 · Cited by 16
“Furthermore, integrate the proposed SG and FP mechanisms into a more general framework, named as TPP-DRL-M, and compare it with other state-of-the-art path planning methods (EC-HRL [30] and TPP-DRL [5]) in the scenarios shown in Fig.”
Li, H., Hou, Y., Pan, W., Chen, H., Gai, J., & Bu, L. (2025) · International Journal of Human-Computer Interaction · doi:10.1080/10447318.2025.2524499 · Cited by 6
Rapid Generalization of Motion Planning for Robot Manipulator Among Locally Changed Environments
Li, X., Xiao, X., Liu, H., & Shen, B. (2025) · IEEE Transactions on Industrial Informatics · doi:10.1109/tii.2025.3637078
“…verified that obtaining a sufficient amount of accurate pretraining data or valuable human experience and knowledge for robots can speed up the training [5], [6], but such process is time-consuming and expensive, and motion planning tasks with multiobjective optimization exacerbate this situation.”
DSAC-ICM: A Distributional Reinforcement Learning Framework for Path Planning in 3D Uneven Terrains
Zhou, Y., Liu, F., Liu, Z., Ji, X., & Yin, G. (2026) · Sensors · doi:10.3390/s26030853
Long-Range Mapless Navigation with Structure-Aware Hierarchical Reinforcement Learning
Fan, W., Ma, Z., Firkat, E., & Hamdulla, A. (2026) · International Conference on Electronics Technology and Artificial Intelligence (ETAI) · doi:10.1109/etai68332.2026.11485153
“To facilitate fast local assessment without explicit mapping [6], we introduce a LiDAR-based structure-aware environment summary, capturing local geometric discontinuities and obstacle proximity.”
Metadata
- Authors
- Chen, P., Liu, Q., Li, Y., & Ma, S.
- Affiliations
- Harbin Institute of Technology (CN)
- Venue
- 2024 IEEE International Conference on Robotics and Automation (ICRA)
- Publisher
- IEEE
- Published
- 2024-05-13
- Pages
- 5119-5125
- ISSN
- 1050-4729 (ISSN-L)
- OpenAlex
- W4401415589
- Cited by
- 6
- References
- 28
- Citations by year
- 2026: 3 · 2025: 2 · 2024: 1
- FWCI
- 1.73
- Type
- conference paper
- Language
- en
- Open access
- closed
- Locations
- Proceedings - IEEE International Conference on Robotics and Automation/Proceedings (publishedVersion)
- Funders
- National Natural Science Foundation of China
- Shenzhen Fundamental Research Program
- Topics
- Physical Sciences › Computer Science › Artificial Intelligence › Reinforcement Learning in Robotics
- Physical Sciences › Computer Science › Computer Vision and Pattern Recognition › Robotics and Sensor-Based Localization
- Physical Sciences › Engineering › Automotive Engineering › Autonomous Vehicle Technology and Safety
- Keywords
- robot navigation, environmental complexity, hierarchical deep reinforcement learning, LiDAR, environmental representation, interpretability, dynamic obstacles, corners
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: An Environmental-Complexity-Based Navigation Method Based on Hierarchical Deep Reinforcement Learning. https://app.cochat.ai/papers/10.1109/icra57147.2024.10610970
- The paper
- Chen, P., Liu, Q., Li, Y., & Ma, S. (2024). An Environmental-Complexity-Based Navigation Method Based on Hierarchical Deep Reinforcement Learning. 2024 IEEE International Conference on Robotics and Automation (ICRA). https://doi.org/10.1109/icra57147.2024.10610970
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.