Skip to main content

Thank you for visiting nature.com. You are using a browser version with limited support for CSS. To obtain the best experience, we recommend you use a more up to date browser (or turn off compatibility mode in Internet Explorer). In the meantime, to ensure continued support, we are displaying the site without styles and JavaScript.

Advertisement

Scientific Reports
  • View all journals
  • Search
  • My Account Login
  • Content Explore content
  • About the journal
  • Publish with us
  • Sign up for alerts
  • RSS feed
  1. nature
  2. scientific reports
  3. articles
  4. article
Multi-resolution field-based algorithm for autonomous robot exploration
Download PDF
Download PDF
  • Article
  • Open access
  • Published: 05 April 2026

Multi-resolution field-based algorithm for autonomous robot exploration

  • Zhipeng Zhai1,2,3,
  • Limin Xu1,2,3,
  • Yuanbin Zhang1,2,3,
  • Guodong Zhang1,2,3 &
  • …
  • Yu Chen1,2,3 

Scientific Reports , Article number:  (2026) Cite this article

  • 883 Accesses

  • Metrics details

We are providing an unedited version of this manuscript to give early access to its findings. Before final publication, the manuscript will undergo further editing. Please note there may be errors present which affect the content, and all legal disclaimers apply.

Subjects

  • Engineering
  • Mathematics and computing

Abstract

This paper proposes a robot autonomous exploration algorithm based on multi-resolution fields to solve the problems of low efficiency, high path repetition, and limited environmental adaptability in complex environments. First, OctoMap’s layered architecture is used to create a multi-resolution voxel map. A coarse-fine dual stage is then used to detect frontiers and balance point numbers. Second, polar coordinate sampling is utilized to avoid the sampling points being too concentrated in the center of the circle, and the scoring function is constructed by combining the distance decay function to prevent the robot from repeating the search. Finally, Monte Carlo integration’s gain calculation method is introduced to eliminate step errors caused by discretization and improve gain calculation accuracy. Simulation experiments are carried out in different environments, and the data prove that the method in this paper is better than the comparison algorithm in terms of moving distance, running time and exploration efficiency. The results show that the algorithm proposed in this paper effectively improves the robot’s autonomous exploration performance in unknown complex environments and provides a new solution for practical applications.

Similar content being viewed by others

Enhancing autonomous exploration for robotics via real time map optimization and improved frontier costs

Article Open access 10 April 2025

Multi-area collision-free path planning and efficient task scheduling optimization for autonomous agricultural robots

Article Open access 07 August 2024

Purely vision-based collective movement of robots

Article Open access 02 June 2025

Data availability

The accessibility of the raw data and code utilized in this study is restricted. Should further experimental data be required related to the results, interested parties should contact the corresponding author.

References

  1. Gao, Y. & Chien, S. Review on space robotics: Toward top-level science through space exploration. Sci. Robot. 2, eaan5074 (2017).

    Google Scholar 

  2. Delmerico, J. et al. The current state and future outlook of rescue robotics. J. Field Robot. 36, 1171–1191 (2019).

    Google Scholar 

  3. Nahavandi, S. et al. A comprehensive review on autonomous navigation. ACM Comput. Surv. 57, 1–67 (2025).

    Google Scholar 

  4. Zhang, S., Zhang, X., Li, T., Yuan, J. & Fang, Y. Fast active aerial exploration for traversable path finding of ground robots in unknown environments. IEEE Trans. Instrum. Meas. 71, 1–13 (2022).

    Google Scholar 

  5. Jones, M., Djahel, S. & Welsh, K. Path-planning for unmanned aerial vehicles with environment complexity considerations: A survey. ACM Comput. Surv. 55, 1–39 (2023).

    Google Scholar 

  6. Liu, L. et al. Path planning techniques for mobile robots: Review and prospect. Expert Syst. Appl. 227, 120254 (2023).

    Google Scholar 

  7. Garaffa, L. C., Basso, M., Konzen, A. A. & de Freitas, E. P. Reinforcement learning for mobile robotics exploration: A survey. IEEE Trans. Neural Netw. Learn. Syst. 34, 3796–3810 (2021).

    Google Scholar 

  8. Batinovic, A., Petrovic, T., Ivanovic, A., Petric, F. & Bogdan, S. A multi-resolution frontier-based planner for autonomous 3d exploration. IEEE Robot. Autom. Lett. 6, 4528–4535 (2021).

    Google Scholar 

  9. Wang, J. & Zheng, E. Path planning of a mobile robot based on the improved rapidly exploring random trees star algorithm. Electronics 13, 2340 (2024).

    Google Scholar 

  10. Zhu, H. et al. Dsvp: Dual-stage viewpoint planner for rapid exploration by dynamic expansion. In 2021 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS), 7623–7630, https://doi.org/10.1109/IROS51168.2021.9636473 (2021).

  11. Cao, C., Zhu, H., Choset, H. & Zhang, J. Tare: A hierarchical framework for efficiently exploring complex 3d environments. Robot. Sci. Syst. 5, 2 (2021).

    Google Scholar 

  12. Yamauchi, B. A frontier-based approach for autonomous exploration. In Proceedings 1997 IEEE International Symposium on Computational Intelligence in Robotics and Automation CIRA’97.’Towards New Computational Principles for Robotics and Automation’, 146–151 (IEEE, 1997).

  13. Faigl, J. & Kulich, M. On determination of goal candidates in frontier-based multi-robot exploration. In 2013 European Conference on Mobile Robots, 210–215 (IEEE, 2013).

  14. Applegate, D. L., Bixby, R. E., Chvátal, V. & Cook, W. J. The traveling salesman problem: a computational study. In The Traveling Salesman Problem (Princeton university press, 2011).

  15. González-Banos, H. H. & Latombe, J.-C. Navigation strategies for exploring indoor environments. Int. J. Robot. Res. 21, 829–848 (2002).

    Google Scholar 

  16. Bircher, A., Kamel, M., Alexis, K., Oleynikova, H. & Siegwart, R. Receding horizon“ next-best-view” planner for 3d exploration. In 2016 IEEE international conference on robotics and automation (ICRA), 1462–1468 (IEEE, 2016).

  17. LaValle, S. Rapidly-exploring random trees: A new tool for path planning. Res. Rep. 9811 (1998).

  18. Dang, T. et al. Graph-based subterranean exploration path planning using aerial and legged robots. J. Field Robot. 37, 1363–1388 (2020).

    Google Scholar 

  19. Selin, M., Tiger, M., Duberg, D., Heintz, F. & Jensfelt, P. Efficient autonomous exploration planning of large-scale 3-d environments. IEEE Robot. Autom. Lett. 4, 1699–1706 (2019).

    Google Scholar 

  20. Zhang, J. & Singh, S. Loam: Lidar odometry and mapping in real-time. In Proceedings of the IEEE International Conference on Robotics and Automation (ICRA), 3917–3923, https://doi.org/10.1109/ICRA.2014.6907231 (IEEE, 2014).

  21. Wurm, K. M., Hornung, A., Bennewitz, M., Stachniss, C. & Burgard, W. Octomap: A probabilistic, flexible, and compact 3d map representation for robotic systems. In Proc. of the ICRA 2010 workshop on best practice in 3D perception and modeling for mobile manipulation, vol. 2, 3 (2010).

  22. Li, Y. et al. Voxel field fusion for 3d object detection. In Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition, 1120–1129 (2022).

  23. Dharmadhikari, M. et al. Motion primitives-based path planning for fast and agile exploration using aerial robots. In 2020 IEEE International Conference on Robotics and Automation (ICRA), 179–185, https://doi.org/10.1109/ICRA40945.2020.9196964 (2020).

Download references

Funding

This work was supported in part by the Henan Province Key Research and Development Project (Grant No. 241111213000), in part by the Scientific Research Team Plan of Zhengzhou University of Aeronautics (Grant Nos. 23ZHTD01007, 24ZHTD01001), in part by the Zhengzhou University of Aeronautics Research Platform Open Fund Project (Grant No. ZHKF-230204), in part by the Henan Provincial Key Technology Research and Development Program (Grant Nos. 232102220025, 252102210023), in part by the Henan Key Laboratory of General Aviation Technology, in part by the Henan Province Collaborative Innovation Center of Aeronautics and Astronautics Electronic Information Technology, and in part by the Henan Province Special and Urgent Subject Group of Aeronautical and Astronautical Intelligent Engineering.

Author information

Authors and Affiliations

  1. School of Electronics and Information, Zhengzhou University of Aeronautics, Zhengzhou, 450046, Henan, China

    Zhipeng Zhai, Limin Xu, Yuanbin Zhang, Guodong Zhang & Yu Chen

  2. Henan Key Laboratory of General Aviation Technology, Zhengzhou, 450046, Henan, China

    Zhipeng Zhai, Limin Xu, Yuanbin Zhang, Guodong Zhang & Yu Chen

  3. Collaborative Innovation Center of Aeronautics and Astronautics Electronic Information Technology, Zhengzhou, 450046, Henan, China

    Zhipeng Zhai, Limin Xu, Yuanbin Zhang, Guodong Zhang & Yu Chen

Authors
  1. Zhipeng Zhai
    View author publications

    Search author on:PubMed Google Scholar

  2. Limin Xu
    View author publications

    Search author on:PubMed Google Scholar

  3. Yuanbin Zhang
    View author publications

    Search author on:PubMed Google Scholar

  4. Guodong Zhang
    View author publications

    Search author on:PubMed Google Scholar

  5. Yu Chen
    View author publications

    Search author on:PubMed Google Scholar

Contributions

Z.Z. developed the methodology, performed the simulations, and drafted the main text of the manuscript. L.X. and Y.Z. reviewed and edited the manuscript and evaluated the simulation results. G.Z. and Y.C. organized the data and managed the project. The final manuscript was reviewed and approved by all authors.

Corresponding author

Correspondence to Limin Xu.

Ethics declarations

Competing interests

The authors declare no competing interests.

Additional information

Publisher’s note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Open Access This article is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License, which permits any non-commercial use, sharing, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons licence, and indicate if you modified the licensed material. You do not have permission under this licence to share adapted material derived from this article or parts of it. The images or other third party material in this article are included in the article’s Creative Commons licence, unless indicated otherwise in a credit line to the material. If material is not included in the article’s Creative Commons licence and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder. To view a copy of this licence, visit http://creativecommons.org/licenses/by-nc-nd/4.0/.

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Zhai, Z., Xu, L., Zhang, Y. et al. Multi-resolution field-based algorithm for autonomous robot exploration. Sci Rep (2026). https://doi.org/10.1038/s41598-026-46119-3

Download citation

  • Received: 20 June 2025

  • Accepted: 24 March 2026

  • Published: 05 April 2026

  • DOI: https://doi.org/10.1038/s41598-026-46119-3

Share this article

Anyone you share the following link with will be able to read this content:

Sorry, a shareable link is not currently available for this article.

Provided by the Springer Nature SharedIt content-sharing initiative

Keywords

  • Multi-resolution field
  • Autonomous robot exploration
  • Frontier detection
Download PDF

Advertisement

Explore content

  • Research articles
  • News & Comment
  • Collections
  • Subjects
  • Follow us on Facebook
  • Follow us on X
  • Sign up for alerts
  • RSS feed

About the journal

  • About Scientific Reports
  • Contact
  • Journal policies
  • Guide to referees
  • Calls for Papers
  • Editor's Choice
  • Journal highlights
  • Open Access Fees and Funding

Publish with us

  • For authors
  • Language editing services
  • Open access funding
  • Submit manuscript

Search

Advanced search

Quick links

  • Explore articles by subject
  • Find a job
  • Guide to authors
  • Editorial policies

Scientific Reports (Sci Rep)

ISSN 2045-2322 (online)

nature.com footer links

About Nature Portfolio

  • About us
  • Press releases
  • Press office
  • Contact us

Discover content

  • Journals A-Z
  • Articles by subject
  • protocols.io
  • Nature Index

Publishing policies

  • Nature portfolio policies
  • Open access

Author & Researcher services

  • Reprints & permissions
  • Research data
  • Language editing
  • Scientific editing
  • Nature Masterclasses
  • Research Solutions

Libraries & institutions

  • Librarian service & tools
  • Librarian portal
  • Open research
  • Recommend to library

Advertising & partnerships

  • Advertising
  • Partnerships & Services
  • Media kits
  • Branded content

Professional development

  • Nature Awards
  • Nature Careers
  • Nature Conferences

Regional websites

  • Nature Africa
  • Nature China
  • Nature India
  • Nature Japan
  • Nature Middle East
  • Privacy Policy
  • Use of cookies
  • Legal notice
  • Accessibility statement
  • Terms & Conditions
  • Your US state privacy rights
Springer Nature

© 2026 Springer Nature Limited

Nature Briefing AI and Robotics

Sign up for the Nature Briefing: AI and Robotics newsletter — what matters in AI and robotics research, free to your inbox weekly.

Get the most important science stories of the day, free in your inbox. Sign up for Nature Briefing: AI and Robotics