ArticlePloS one2025
AntBot-EX: Enhancing robot search efficiency in complex post-disaster environments.
Article in PloS one, 2025. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 1 paper.
What it found
Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.
The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.
The trial behind it
Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.
Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.
Who cites it
1 citing paper in PubMed.
- An energy aware Q-learning framework for comprehensive coverage path planning in unknown complex environments.Scientific reports · 2025Article
Corrections and comments
PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.
Authors and funding
3 authors.
Funding
No grant is acknowledged in the PubMed record.
Abstract
In post-disaster scenarios, effective rescue operations hinge on deploying robots equipped with sophisticated path planning algorithms capable of navigating through complex and unknown environments, facilitating an exhaustive search for survivors. The inherent limitations of traditional Coverage Path Planning (CPP) algorithms, particularly their struggle to adapt to the highly dynamic and unpredictable nature of post-disaster environments characterized by collapsed structures, shifting debris fields, and unforeseen obstacles, hinder their effectiveness in time-sensitive rescue operations. To address the challenges, this paper introduces an innovative three-stage online CPP method, termed Ant Colony Optimization based Robot Exploration with Escape Mechanism (AntBot-EX). Our three-stage approach leverages the strengths of different algorithms. Firstly, we utilize a modified Ant Colony Optimization algorithm to explore the unknown environment efficiently, prioritizing uncharted territories and avoiding potential dead ends using an escape mechanism. Secondly, the remaining unexplored areas are segmented, enabling targeted path planning with the [Formula: see text] algorithm to maximize coverage. Thirdly, to address computational limitations in large and complex environments, a configurable boundary-aware and a score-based threshold are introduced to simplify paths by strategically disregarding irrelevant regions, optimizing search efficiency. Simulation results show that our method can basically achieve complete coverage in complex and unknown environments.
Indexed as
Identifiers
What OpenQuestion holds
Registered trials
Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.