The DOI matches its Crossref record; 62 of the 62 references it cites were found in a registry or an index; 4 of the 17 sources its claims cite were checked for support.
Unsupervised Active Visual Search With Monte Carlo Planning Under Uncertain Detections
Open accessAbstract
We propose a solution for Active Visual Search of objects in an environment, whose 2D floor map is the only known information. Our solution has three key features that make it more plausible and robust to detector failures compared to state-of-the-art methods: i) it is unsupervised as it does not need any training sessions. ii) During the exploration, a probability distribution on the 2D floor map is updated according to an intuitive mechanism, while an improved belief update increases the effectiveness of the agent's exploration. iii) We incorporate the awareness that an object detector may fail into the aforementioned probability modelling by exploiting the success statistics of a specific detector. Our solution is dubbed POMP-BE-PD (Pomcp-based Online Motion Planning with Belief by Exploration and Probabilistic Detection). It uses the current pose of an agent and an RGB-D observation to learn an optimal search policy, exploiting a POMDP solved by a Monte-Carlo planning approach. On the Active Vision Dataset Benchmark, we increase the average success rate over all the environments by a significant 35 % while decreasing the average path length by 4 % with respect to competing methods. Thus, our results are state-of-the-art, even without any training procedure.
Overview
CoChat Summary
TL;DR
POMP-BE-PD is an unsupervised active visual search method that plans online with POMCP in a known 2D floor map, using probabilistic object detection and an improved belief update. On the Active Vision Database benchmark it reports higher success rates than competing methods and its prior POMP formulation without any training procedure.
Key findings
- With the real detector, POMP-BE-PD reaches average SR 0.54, APL 39.44, and SPL 0.47 across the tested AVDB scenes, versus POMP’s 0.40, 41.13, and 0.50; the paper reports this as a 35% relative increase in success rate and a 4% decrease in average path length, or a 14% absolute SR increase in the conclusion.
- Probabilistic detection reduces false positives by about 32%, and the docking strategy reduces docking error by about 35.7% (Fig. 8).
- With ground-truth annotations, the improved belief update alone (POMP-BE) raises medium-scene SR from 0.76 to 0.85 and lowers APL from 29.64 to 25.50; hard-scene SR rises from 0.48 to 0.70.
- On the GT-object protocol in Table 1, POMP-BE-PD achieves average SR 0.90 versus POMP’s 0.76, with APL 18.10 versus 17.07 and SPL 0.72 versus 0.75.
Methods
- The task is modeled as a POMDP solved by Partially Observable Monte Carlo Planning (POMCP); the agent uses its pose and RGB-D observations, with a pose graph, candidate object locations, and a visibility matrix derived from the known 2D floor map.
- Detection uses the Target Driven Instance Detector (TDID), keeping detections with score > 0.9; class-specific F1 statistics feed a probabilistic detection vector and Bayesian update over object locations, with exploration terminating when a visible location’s probability exceeds threshold τ.
- Experiments use the Active Vision Database benchmark with 8 scenes (2 easy, 3 medium, 3 hard), metrics SR, APL, and SPL, a 200-step limit, and comparisons against Random Walk, EAT, DQN, DQN-TAM, and POMP.
Limitations
- Stated: no official code for published comparison methods was available, so comparisons follow the protocol from [9], which uses only GT annotations and a limited number of scenes; DQN and DQN-TAM use only two scenes and a different object subset, making their average column not meaningful for fair comparison.
- Evident from the text: the method assumes a known 2D floor map and relies on an off-the-shelf object detector whose class-specific F1 statistics must be available; performance depends on threshold τ and simulation budget.
- Evident from the text: evaluation is limited to the AVDB benchmark and selected scenes, and probabilistic detection can increase APL and reduce SPL in some settings.
Model-written summary. Check it against the paper before relying on it.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
0 Valid · 4 Not valid · 7 Not checked · 31 Own results and interpretations
The cited sources that could be checked couldn’t confirm or dispute this claim.
In the paper
“It is worth noting that for achieving these results both DQN approaches require 13 scenarios for training the best policy, while our method requires no training at all.”
§ 4 EXPERIMENTS > 4.1 Quantitative results
What the sources say
- Could not verifycites [47] sourceExperimental — accuracy not yet measured
The Introduction discusses deep reinforcement learning learning policies from observations, but does not describe two DQN approaches or their training requirements. Searches of our copy for DQN and 13 scenarios found no passage establishing that either approach required 13 scenarios to train its best policy; the cited paper’s Experiments section instead discusses MRF learning. (LLM, conf=0.76)
- Not checked — no full text of the sourcecites [48] source
plainstates a cause- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
- Could not verify
A result the paper reports from its own data — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“In all the scenarios, POMP-PD increments the SR by a large margin (19% - 25%) over our previous formulation POMP.”
§ 4 EXPERIMENTS > 4.2 Ablation studies
plainstates a cause- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
A result the paper states — it cites no source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“After every step in the real world, a Bayesian inference, combined with a probability distribution over all possible object locations, allows us to reduce the false positives error by 32%.”
plainstates a cause- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
In the paper
“This strategy achieves better performance than the Robust Visual Docking introduced in [12].”
§ 3 METHOD > 3.3 Exploration, localisation and approach
What the sources say
- Not matchedcites [12] Silver, Monte-Carlo planning in large POMDPs
Couldn’t be matched to a paper in Crossref, so it can’t be checked.
plainstates a cause- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: unclear — It is unclear whether the paper’s conclusions depend on it.
- Based: unclear — It is unclear why the paper says it holds.
- Not matched
A result the paper reports from its own data — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“First of all, we can notice a significant reduction (∼32% decrease) of false positives when introducing the Probabilistic Detection approach, thus increasing the robustness of our method.”
§ 4 EXPERIMENTS > 4.2 Ablation studies
plainstates a cause- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
14 more claims
Create a free account to see all 42 claims and every source verdict.
- It may state two separate claims as one. 19
- Probably not a substantial claim. 5
- The quote only partly states this claim. 2
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
Each contradiction between two passages listed here was confirmed by an independent check.
Rated minor: it would not touch a result — a value no result rests on, a p-value that stays on the same side of the significance level, or a conflict that is clerical, resolved elsewhere in the paper, or outside its own findings.
In the paper
§ 3 METHOD > 3.3 Exploration, localisation and approach
“The new belief is sampled from a uniform distribution over locations satisfying the pp constraint –namely, having the searched object in positions belonging to H \ pp.”
§ 3 METHOD > 3.3 Exploration, localisation and approach
“An auxiliary variable pp stores the current list of object locations not been observed yet, where pp = {j ∈ H | j not yet observed}.”
Citations
Cites
A note on two problems in connexion with graphs
Dijkstra, E. W. (1959) · Numerische Mathematik · doi:10.1007/bf01386390 · Cited by 29,065
Mastering the game of Go with deep neural networks and tree search
Silver, D., Huang, A., Maddison, C. J., Guez, A., Sifre, L., van den Driessche, G., Schrittwieser, J., Antonoglou, I., Panneershelvam, V., Lanctot, M., et al. (2016) · Nature · doi:10.1038/nature16961 · Cited by 15,612
(2006) · Springer eBooks · Cited by 8,123
Planning and acting in partially observable stochastic domains
Kaelbling, L. P., Littman, M. L., & Cassandra, A. R. (1998) · Artificial Intelligence · doi:10.1016/s0004-3702(98)00023-x · Cited by 4,149 · cited 2×
“We formulate the AVS problem as a Partially Observable Markov Decision Process (POMDP), which is a standard framework for modeling sequential decision processes under uncertainty in dynamical environments [26].”
BackgroundMethodA general reinforcement learning algorithm that masters chess, shogi, and Go through self-play
Silver, D., Hubert, T., Schrittwieser, J., Antonoglou, I., Lai, M., Guez, A., Lanctot, M., Sifre, L., Kumaran, D., Graepel, T., et al. (2018) · Science · doi:10.1126/science.aar6404 · Cited by 3,562 · cited 1×
“Popular MCTS-based approaches have been recently used also for developing agents with superhuman performance in the game of Go [43], [44].”
MethodA Survey of Monte Carlo Tree Search Methods
Browne, C. B., Powley, E., Whitehouse, D., Lucas, S. M., Cowling, P. I., Rohlfshagen, P., Tavener, S., Perez, D., Samothrakis, S., & Colton, S. (2012) · IEEE Transactions on Computational Intelligence and AI in Games · doi:10.1109/tciaig.2012.2186810 · Cited by 2,970 · cited 1×
“One of the most recent and efficient strategies for solving POMDPs in an approximate way is Monte Carlo Tree Search (MCTS) [28], [29], [30].”
MethodBandit Based Monte-Carlo Planning
Kocsis, L., & Szepesvári, C. (2006) · Lecture Notes in Computer Science · doi:10.1007/11871842_29 · Cited by 2,855 · cited 3×
“At each step, an action a is selected using UCT when the current history is inside the tree, and a uniform policy when the current history is outside the tree.”
MethodA Note on Two Problems in Connexion with Graphs
Dijkstra, E. W. (2022) · Edsger Wybe Dijkstra · doi:10.1145/3544585.3544600 · Cited by 1,353
The Complexity of Markov Decision Processes
Papadimitriou, C. H., & Tsitsiklis, J. N. (1987) · Mathematics of Operations Research · doi:10.1287/moor.12.3.441 · Cited by 1,329 · cited 1×
“Computing exact solutions for non-trivial POMDPs is often computationally intractable [27], but in the recent years impressive progress was made to develop approximate solvers.”
BackgroundEfficient Selectivity and Backup Operators in Monte-Carlo Tree Search
Coulom, R. (2007) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-75538-8_7 · Cited by 1,240 · cited 1×
“One of the most recent and efficient strategies for solving POMDPs in an approximate way is Monte Carlo Tree Search (MCTS) [27], [28], [29].”
Method
Research works printed but not linked: 1
- Mazzi, Active generation of logical rules for POMCP shielding, 1696
Cited by
Language-enhanced RNR-Map: Querying Renderable Neural Radiance Field maps with natural language
Taioli, F., Cunico, F., Girella, F., Bologna, R., Farinelli, A., & Cristani, M. (2023) · IEEE International Conference on Computer Vision Workshops · doi:10.1109/iccvw60793.2023.00504 · Cited by 13
“There is an extensive research area that focuses on how to build maps to aid navigation in indoor environments [1, 4, 19, 11, 15, 26].”
BackgroundSelf-citationTaioli, F., Zorzi, E., Franchi, G., Castellini, A., Farinelli, A., Cristani, M., & Wang, Y. (2025) · IEEE/CVF International Conference on Computer Vision (ICCV) · doi:10.1109/iccv51701.2025.01745 · Cited by 25
“Recent policies can be divided into two categories: training-based [10, 19, 31, 44, 52, 64] and zero-shot policies [11, 21, 54, 63, 65, 68, 71].”
Self-citationAlgorithmic Perspectives on Active Object Recognition Systems: A Survey
Wang, Y., Li, J., Du, Z., Xue, T., & Zhang, T. (2025) · Tsinghua Science & Technology · doi:10.26599/tst.2025.9010096
Self-citationAIDA: AI-Driven Intelligent Diagnostics and Analytics
Ruan, Z., Gobbo, S., Cima, L., Mondo, M., Sharifi, S., Munari, E., Scarpa, A., Khan, O. S., Ólafsson, S., Giachetti, A., et al. (2026) · Lecture notes in computer science · doi:10.1007/978-3-032-11381-8_11
Self-citationWang, Y., & Tian, G. (2026) · Expert Systems with Applications · doi:10.1016/j.eswa.2026.131538 · Cited by 1
Self-citation
Metadata
- Authors
- Taioli, F., Giuliari, F., Wang, Y., Berra, R., Castellini, A., Bue, A. D., Farinelli, A., Cristani, M., & Setti, F.
- Affiliations
- University of Verona (IT)
- Italian Institute of Technology (IT)
- Fondazione Bruno Kessler (IT)
- ORCID
- Venue
- IEEE Transactions on Pattern Analysis and Machine Intelligence
- Published
- 2024-12
- Volume
- 46
- Issue
- 12
- Pages
- 11047-11058
- ISSN
- 0162-8828 (ISSN-L)
- 2160-9292
- 1939-3539
- OpenAlex
- W4401990919
- Semantic Scholar
- ef7a7001c843104eb16b19575e1f9e822efa2d84
- Cited by
- 8
- References
- 60
- Citations by year
- 2026: 5 · 2025: 2
- FWCI
- 1.03
- Type
- journal article
- Language
- en
- Open access
- hybrid
- doi.org
- Locations
- IEEE Transactions on Pattern Analysis and Machine Intelligence (publishedVersion, cc-by)
- PubMed (publishedVersion)
- arXiv (Cornell University) (submittedVersion)
- PORTO@Iris (submittedVersion, cc-by)
- arXiv (Cornell University)
- 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 › Control and Systems Engineering › Robot Manipulation and Learning
- Keywords
- object detection, unsupervised learning, partially observable Markov decision processes, belief updating, sensor faults, probabilistic detection, online motion planning, floor maps, RGB-D sensing
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.
The claim verdicts this report counts are experimental: their accuracy is not yet measured.
A language model drew the claims from the paper on 2026-10-07, under version 3 of the claim definition (model deepseek-v4.1-flash, prompt extract-v3).
A second model labelled each claim on 2026-10-07 (model jev-1.13-20260917, definition revision gold-guideline-v0.2).
Cited sources are checked with a language model’s help (gpt-6-sol).
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: Unsupervised Active Visual Search With Monte Carlo Planning Under Uncertain Detections. https://app.cochat.ai/papers/10.1109/tpami.2024.3451994
- The paper
- Taioli, F., Giuliari, F., Wang, Y., Berra, R., Castellini, A., Bue, A. D., Farinelli, A., Cristani, M., & Setti, F. (2024). Unsupervised Active Visual Search With Monte Carlo Planning Under Uncertain Detections. IEEE Transactions on Pattern Analysis and Machine Intelligence. https://doi.org/10.1109/tpami.2024.3451994
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.