Active Semantic Mapping with Mobile Manipulator in Horticultural Environments

Girish Chowdhary; Jose Cuaran; Kendall Koe; Kulbir Singh Ahluwalia; Naveen Kumar Uppalapati

REVIEW 4 major objections 5 minor 19 references

Active Semantic Mapping with Mobile Manipulator in Horticultural Environments

T0 review · 4 major / 5 minor · reviewed 2026-08-11 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗ Review JSON

Pith's one-line read A cluster-centric viewpoint planner cuts active semantic mapping runtime by 8% while better coping with segmentation noise.

desk verdict A modest but real efficiency gain for target-aware semantic mapping in row crops; the OSAMCEP metric and ray-casting downsampling are the contributions, but the 8% runtime claim rests on an uneven baseline. read the letter →

arxiv 2412.10515 v1 pith:OBQFQZDG submitted 2024-12-13 cs.RO

Jose Cuaran , Kulbir Singh Ahluwalia , Kendall Koe , Naveen Kumar Uppalapati , Girish Chowdhary This is my paper · ORCID

classification cs.RO

keywords activemappingnextbestviewsemanticoctreehorticulturalroboticsinformationgainmobilemanipulatorsegmentationnoisefruitcoverage

verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

This paper tries to establish that a mobile manipulator can actively build a semantic 3D map of horticultural plants more efficiently and more robustly than prior next-best-view methods by focusing viewpoints on fruit clusters instead of generic frontier voxels. It claims an 8% total runtime reduction over a frontier-based baseline and that its new information metric reaches 80% fruit surface coverage with about 10 viewpoints per plant, versus 11 to 17 for other metrics, when simulated segmentation noise is present. A sympathetic reader would care because target-aware reconstruction of individual fruits is what yield prediction and phenotyping need, and prior methods either required given bounding boxes or wasted planning time on unreachable viewpoints.

What carries the argument

The central object is the OSAMCEP information gain metric, defined as $G_v = \sum_{r \in R_v} \sum_{x \in X} I(x)$ where $I(x) = P_v(x) H(x)$ when the semantic class is unknown or a target and $\mathrm{dist}(x) < \mathrm{maxdist}$, and $I(x)=0$ otherwise. Here $P_v(x)$ is the cumulative visibility probability along a ray computed from occupancy probabilities, and $H(x)$ is the multi-class Shannon entropy of the semantic categorical distribution. The argument is carried by combining this metric with cluster-centric viewpoint sampling, distance-adaptive ray downsampling $d_s = \delta_S F_x / z$, and a bounded ray-casting region $b = L F_x / z$; these together reduce candidate evaluations and focus computation on semantic targets.

What would settle it

A direct test would run the pipeline in conditions with controlled plant sway, such as a fan generating periodic motion of leaves and fruits, and measure whether surface coverage and entropy gains over the frontier baseline disappear or reverse as sway amplitude increases; the paper already acknowledges erratic plant motion reduces reconstruction accuracy.

Watch

Extended reading notes

Core claim

The paper's central claim is that an active semantic mapping pipeline for row crops can be made both faster and more noise-tolerant by organizing viewpoint planning around semantic target clusters. Fruits are detected directly from a multi-class probabilistic semantic octree, grouped with DBSCAN, and viewpoints are sampled uniformly on spheres around cluster centroids. The paper introduces OSAMCEP, an information utility function that multiplies ray-wise visibility probability, multi-class entropy, and a proximity-to-target mask so that unknown or semantic voxels near fruits contribute only when likely visible. It also proposes a distance-adaptive ray-casting downsampling strategy that keeps the speed of sparse sampling while matching the viewpoint quality of dense sampling. In simulation, the full pipeline runs 8% faster than the frontier-based baseline while achieving similar entropy reduction and surface coverage, and the OSAMCEP metric outperforms baseline metrics under segmentation noise, requiring fewer viewpoints for the same coverage.

Load-bearing premise

The load-bearing premise is that the plants and fruits do not move while the robot builds the map and plans viewpoints, so that all registered scans refer to one static scene.

Editorial extensions

If this is right

If the 8% runtime reduction holds, active mapping in row crops becomes less costly for repeated in-field scans, making per-plant reconstruction practical for larger areas.
If OSAMCEP's advantage under segmentation noise is real, it suggests robustness to imperfect semantic segmentation should be a first-class criterion when designing information metrics, not an afterthought.
The distance-adaptive downsampling result implies ray-casting-based viewpoint evaluation can be made nearly as fast as sparse uniform sampling without sacrificing coverage of small targets.
The comparable performance of all metrics without noise, including random sampling, indicates that targeting clusters is what matters most, and metric choice mainly pays off in noisy conditions.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

One implied extension is that the same cluster-centric strategy could be applied to other target geometries, such as flowers or disease lesions, by changing only the target class in the semantic octree and the cluster size parameter.
A testable extension is to replace the fixed sphere sampling with an adaptive radius based on the estimated target size and sensor noise, which could further reduce the number of required viewpoints.
The static-environment assumption, noted by the paper as violated by wind, suggests that extending the map representation to include per-scan registration uncertainty or temporal states would be a natural next step, though the paper does not propose this.
Because the runtime gain comes mostly from avoiding unreachable viewpoint candidates, one could further speed up the pipeline by learning a reachability priors over the manipulator workspace rather than sampling and filtering.

Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Desk Editor's Note

read the letter

Here's the short version. The paper is a solid, incremental contribution to active semantic mapping for row-crop horticulture. It does three things that are new relative to its cited baselines: the OSAMCEP utility (Eqs. 1-4) which combines visibility, proximity, and multi-class entropy; distance-adaptive ray-casting downsampling (Eqs. 5-6) that keeps dense-sampling quality at sparse-sampling cost; and cluster-centric viewpoint sampling around DBSCAN fruit clusters. It also evaluates metric behavior under simulated segmentation noise, which is genuinely useful and too rare. The simulation ablation in Section IV-B is the strongest part: OSAMCEP reaches 80% surface coverage in roughly 10 viewpoints per plant versus 11-17 for the other metrics when noise is added, and the paper shares 10-trial averages. The authors also deserve credit for flagging the static-environment assumption in Section IV-C and admitting wind breaks it; that is the kind of honesty you want.

The main soft spot is the headline runtime claim. The 8% total runtime reduction in Section IV-A is against the frontier-based baseline from [6], but that baseline samples random candidates around ROI frontier voxels, and the paper itself says most of those candidates are unreachable by the manipulator, forcing repeated sampling and evaluation. The proposed method samples around cluster centroids and filters with a workspace check before evaluation. That asymmetry alone could explain the runtime gap, and the ablation in Section IV-B uses a free-moving camera, so it cannot isolate the runtime contribution. This is not a load-bearing fatal flaw for the mapping result, but the abstract's 'reduces total runtime by 8%' is a much weaker claim than it appears.

Also missing: error bars or significance tests on the 10-trial averages, and no released code or data despite a GitHub link in the abstract that appears bare. The real-world section is qualitative, fine as a sanity check but not evidence for the quantitative claims. Some hand-set parameters in Table I, like maxdist and epsilon, are reasonable but not swept.

Who this is for: robotics researchers working on active perception in agriculture or similar cluttered, target-centric scenes. They will get a clean, compact recipe for a cluster-centric NBV pipeline and a utility function that behaves well under segmentation noise. It deserves a serious referee; a full review will be more productive than a desk reject, and the baseline asymmetry should be addressed with a stronger comparison in revision.

Referee Report

4 major / 5 minor

Summary. The paper proposes an active semantic mapping pipeline for a mobile manipulator in horticultural rows. It uses Semantic Octomap, DBSCAN clustering of fruit voxels, spherical viewpoint sampling around cluster centroids, a distance-adaptive ray-downsampling scheme, and a new information utility OSAMCEP that weights multi-class entropy by visibility and proximity to semantic targets. The experiments compare the full pipeline with a frontier-based baseline and dense scanning in Gazebo, and separately compare OSAMCEP with other IG metrics in an ablation with a free-moving camera, under simulated segmentation noise. The headline results are an 8% reduction in total runtime versus the frontier baseline and faster entropy reduction / surface coverage under segmentation noise, e.g., about 10 viewpoints for 80% coverage versus 11-17 for other metrics. Real-world experiments on tomato plants are reported qualitatively.

Significance. If the empirical claims hold, this is a modest but useful engineering contribution: target-aware NBV planning that does not require given bounding boxes and explicitly models segmentation noise, with public code. The paper's strengths include 10-trial averaging, a head-to-head comparison with several established IG metrics, an explicit ray-casting efficiency experiment with timing numbers, and candid acknowledgement of the static-environment limitation and depth/segmentation noise in the field. The main uncertainty is whether the runtime and metric advantages are artifacts of uncontrolled baseline asymmetries and of optimizing the exact quantity used for evaluation.

major comments (4)

[Section IV-A, Fig. 4] The 8% total runtime reduction is confounded by an asymmetry in viewpoint-candidate generation. The frontier-based baseline samples random candidates around ROI frontier voxels, and the paper states that most of these random candidates are not reachable by the arm, forcing repeated sampling; the proposed method samples uniformly around fruit-cluster centroids and filters candidates into the manipulator workspace before evaluation. The runtime advantage is therefore attributed to NBV planning time, but it may be due to this candidate-generation/filtering difference rather than to OSAMCEP or the ray-casting acceleration. Please rerun the comparison with the frontier baseline using the same workspace-reachability filtering and comparable candidate generation (or with identical candidate sets, differing only in utility), and report the resulting runtime breakdown.
[Section IV-B, Eqs. (2)-(4) and Metrics paragraph] The evaluation of OSAMCEP is partly circular. The proposed utility is essentially a visibility-weighted multi-class entropy H(x) restricted to voxels within maxdist of a semantic target, while the evaluation metric is the total multi-class entropy summed over voxels inside a 3D bounding box enclosing each fruit cluster. With maxdist = 0.1 m and typical cluster size L = 0.1 m (Table I), the utility region and evaluation bounding box substantially overlap, so under segmentation noise OSAMCEP directly minimizes the score used to judge it. Please add evaluation metrics that are not the optimized objective—e.g., fruit surface F-score, Chamfer distance to the fruit mesh, or semantic voxel IoU—and, if the claim is about target-aware mapping, ablate maxdist and the bounding-box size independently.
[Sections IV-A and IV-B] Headline numerical claims are reported only as averages over 10 trials, with no error bars, standard deviations, or significance tests. This matters for the abstract's 8% runtime reduction and for the '10 viewpoints vs 11-17 viewpoints' statement, especially because some differences among IG metrics in the no-noise case are visibly small. Please report per-trial variance and test whether the differences are statistically significant, or, if the study is intended as a pilot, soften the definitive wording.
[Section IV-C] The real-world section is entirely qualitative: it states that the method 'effectively identifies complex viewpoints' and shows reconstructions, but gives no quantitative measures of coverage, completeness, or accuracy. The claim in the abstract that 'real-world experiments validate our method's effectiveness' is therefore stronger than the evidence. Also, key simulation evaluation details—how the ground-truth surface is generated and how 'observed surface points' are determined—are deferred to a supplementary document that is not visible in the manuscript; please include these details in the paper or appendix.

minor comments (5)

[Section III, Eqs. (5)-(6)] The symbol z is used for target distance but is never explicitly defined; please define it as the distance from the camera to the cluster centroid and state whether the same z is used in both equations.
[Section III, Eq. (2)] The condition 'semantic class lx is unknown or semantic target' needs a precise definition of lx from the categorical distribution pc(x), for example argmax class, a class with probability above a threshold, or 'unknown' when the maximum probability is below some value.
[Figure 3 caption] The caption says all methods execute 120 viewpoints, while the text in Section IV-A describes executing 12 viewpoints before moving to the next plants; please reconcile the counts.
[Section III, Viewpoint Planner] The phrase 'Viewpoints near the manipulator's workspace are filtered' is ambiguous: the text then says candidates are 'moved into' the workspace and further filtered by viewing direction; please clarify the filtering criterion.
[Section IV-B] The reported ray tracing times (2.58 ms, 45.21 ms, 2.50 ms) are not identified as averages over trials or as single measurements; please specify the statistics.

Circularity Check

0 steps flagged · score 0.0 of 10

No significant circularity: the runtime and mapping-quality claims rest on external baselines and an independent ground-truth surface-coverage metric; the overlap between the planning entropy and the evaluation entropy is standard NBV practice, not a definitional reduction.

full rationale

The paper's load-bearing claims are an 8% total runtime reduction versus the frontier-based baseline of Zaenker et al. and improved entropy/surface coverage for OSAMCEP, especially under simulated segmentation noise. The runtime claim is an empirical comparison with matched initialization against an external baseline; the paper attributes the gain to a concrete mechanism (frontier-based candidates frequently falling outside the manipulator workspace) and the comparison is not a renamed fit. OSAMCEP combines visibility Pv(x) from Delmerico et al., multi-class entropy H(x) from Asgharivaskasi and Atanasov, and a proximity gate, none of which are the authors' own unpublished constructs. The evaluation uses the same entropy measure, but this is the intended mechanism of information-gain planning rather than a tautology, and the paper additionally evaluates ground-truth-based surface coverage (Eq. 7), which is independent of the planning objective. Section IV-C explicitly flags wind-induced plant motion as violating the static-environment assumption; this is an honest limitation on generalizability, not a circular derivation. No load-bearing step is justified by a self-citation chain, and no fitted parameter is relabeled as a prediction. Therefore no significant circularity is established.

Assumptions & free parameters 9 free parameters · 5 assumptions · 0 invented entities

The headlined gains depend on hand-set parameters (Table I), a static-scene row-crop assumption, a specific synthetic segmentation-noise model, and correctness of the cited semantic octomap and visibility equations. None of these are derived or independently verified in the manuscript.

free parameters (9)

Map resolution delta_S = 0.015 m
Sets octree voxel size; directly determines the surface-coverage distance threshold and ray-casting step size.
Max range for mapping = 1.0 m
Depth observations beyond this range are not inserted; affects which viewpoints count as informative.
Segmentation correctness probability Pgt = 0.7
Injected noise uses 0.7 probability of correct class; all segmentation-noise results depend on this hand-set value.
Typical fruit cluster size L = 0.1 m
Used in Equations 5-6 to set ray-casting downsampling step and image-space bounding box.
Viewpoint sampling radius r = 0.4 m
Distance from cluster centroid at which candidate camera poses are sampled.
Azimuth samples N_phi = 10
Uniform angular grid density for viewpoint sampling.
Elevation samples N_theta = 5
Uniform angular grid density for viewpoint sampling over the range [30, 150] degrees.
Proximity threshold maxdist = 0.1 m
Defines which voxels near a semantic target contribute to OSAMCEP utility; couples the utility region to the evaluation bounding box.
DBSCAN neighborhood epsilon = 0.05 m
Set to the expected average fruit radius; controls which fruit voxels are merged into clusters and therefore where viewpoints are sampled.

assumptions (5)

domain assumption The scene is static while the map is being built.
The semantic octree inserts registered point clouds into one global map; moving plants invalidate the registration. Section IV-C says wind violates this and reduces accuracy.
domain assumption Plants grow in rows and plant height is known a priori.
Section III uses this to define initial sparse scanning poses and to filter arm workspace; if false, the planner setup and candidate sampling must change.
domain assumption Simulated segmentation noise with uniform label flips at Pgt=0.7 represents real segmentation errors.
Section IV injects noise this way; real Yolact errors in Section IV-C are missed detections and spatial mislabels, so the measured benefits may not transfer.
standard math Semantic Octomap update and visibility and entropy equations from [8] and [15] are correct.
Equations 3-4 are taken from previous work and are not rederived or verified in this paper.
domain assumption Ground-truth surface and cluster labels in the simulator are accurate.
Surface coverage (Equation 7) and total entropy evaluation compare against total points in ground-truth models from [6]; no procedure for generating this ground truth is provided.

how reviews work

0 comments

Cite this review

Pith. "Pith review of Active Semantic Mapping with Mobile Manipulator in Horticultural Environments." pith.science (2026). https://pith.science/paper/OBQFQZDG

@misc{pith2026241210515,
  author       = {Pith},
  title        = {Pith review of: Active Semantic Mapping with Mobile Manipulator in Horticultural Environments},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/OBQFQZDG}},
  note         = {Machine review of arXiv:2412.10515}
}

read the original abstract

Semantic maps are fundamental for robotics tasks such as navigation and manipulation. They also enable yield prediction and phenotyping in agricultural settings. In this paper, we introduce an efficient and scalable approach for active semantic mapping in horticultural environments, employing a mobile robot manipulator equipped with an RGB-D camera. Our method leverages probabilistic semantic maps to detect semantic targets, generate candidate viewpoints, and compute corresponding information gain. We present an efficient ray-casting strategy and a novel information utility function that accounts for both semantics and occlusions. The proposed approach reduces total runtime by 8% compared to previous baselines. Furthermore, our information metric surpasses other metrics in reducing multi-class entropy and improving surface coverage, particularly in the presence of segmentation noise. Real-world experiments validate our method's effectiveness but also reveal challenges such as depth sensor noise and varying environmental conditions, requiring further research.

Figures

Figures reproduced from arXiv: 2412.10515 by the authors.

**Figure 2.** System overview. Semantic extractor: semantic segmentation is used to extract fruits, leaves, and background in the scene. Mapping: a 3D semantic [PITH_FULL_IMAGE:figures/full_fig_p003_2.png] view at source ↗

**Figure 3.** Total entropy and surface coverage with our active mapping approach, [PITH_FULL_IMAGE:figures/full_fig_p005_3.png] view at source ↗

Figures from the paper (4 more)

**Figure 4.** Figure 4: Runtime comparison between our approach and two baselines. The [PITH_FULL_IMAGE:figures/full_fig_p005_4.png]

**Figure 5.** Figure 5: Entropy and surface coverage for different downsampling strategies. [PITH_FULL_IMAGE:figures/full_fig_p005_5.png]

**Figure 7.** Figure 7: Top left: Mobile manipulator in a high tunnel with tomato plants. Top [PITH_FULL_IMAGE:figures/full_fig_p006_7.png]

**Figure 6.** Figure 6: Entropy and surface coverage averaged over six plants vs the number [PITH_FULL_IMAGE:figures/full_fig_p006_6.png]

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

19 extracted references · 16 canonical work pages

[6]

Viewpoint planning for fruit size and position estimation,

T. Zaenker, C. Smitt, C. McCool, and M. Bennewitz, “Viewpoint planning for fruit size and position estimation,” in 2021 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS) . IEEE, 2021, pp. 3271–3277

work page 2021
[1]

Advances in visual perception for agricultural robotics,

G. Kootstra, “Advances in visual perception for agricultural robotics,” in Advances in agri-food robotics . Burleigh Dodds Science Publishing, 2024, pp. 3–36

work page 2024
[2]

Pag-nerf: Towards fast and efficient end-to-end panoptic 3d representations for agricultural robotics,

C. Smitt, M. Halstead, P. Zimmer, T. L ¨abe, E. Guclu, C. Stachniss, and C. McCool, “Pag-nerf: Towards fast and efficient end-to-end panoptic 3d representations for agricultural robotics,” IEEE Robotics and Automation Letters, vol. 9, no. 1, pp. 907–914, 2023

work page 2023
[3]

Panoptic mapping with fruit completion and pose estimation for horticultural robots,

Y . Pan, F. Magistri, T. L ¨abe, E. Marks, C. Smitt, C. McCool, J. Behley, and C. Stachniss, “Panoptic mapping with fruit completion and pose estimation for horticultural robots,” in 2023 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS) . IEEE, 2023, pp. 4226–4233

work page 2023
[4]

Semantic mapping for orchard environ- ments by merging two-sides reconstructions of tree rows,

W. Dong, P. Roy, and V . Isler, “Semantic mapping for orchard environ- ments by merging two-sides reconstructions of tree rows,” Journal of Field Robotics, vol. 37, no. 1, pp. 97–121, 2020

work page 2020
[5]

Attention-driven Next-best-view Planning for Efficient Reconstruction of Plants and Targeted Plant Parts

A. K. Burusa, E. J. van Henten, and G. Kootstra, “Attention-driven active vision for efficient reconstruction of plants and targeted plant parts,” arXiv preprint arXiv:2206.10274 , 2022

work page Pith review arXiv 2022
[7]

Nbv-sc: Next best view planning based on shape completion for fruit mapping and re- construction,

R. Menon, T. Zaenker, N. Dengler, and M. Bennewitz, “Nbv-sc: Next best view planning based on shape completion for fruit mapping and re- construction,” in 2023 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS) . IEEE, 2023, pp. 4197–4203

work page 2023
[8]

Semantic octree mapping and shannon mutual information computation for robot exploration,

A. Asgharivaskasi and N. Atanasov, “Semantic octree mapping and shannon mutual information computation for robot exploration,” IEEE Transactions on Robotics , 2023

work page 2023

Show all 19 references

[9]

Canopy volume measurement of fruit trees using robotic platform loaded lidar data,

P. Gao, J. Jiang, J. Song, F. Xie, Y . Bai, Y . Fu, Z. Wang, X. Zheng, S. Xie, and B. Li, “Canopy volume measurement of fruit trees using robotic platform loaded lidar data,” IEEE Access , vol. 9, pp. 156 246– 156 259, 2021

2021
[10]

4d crop monitoring: Spatio-temporal reconstruction for agriculture,

J. Dong, J. G. Burnham, B. Boots, G. Rains, and F. Dellaert, “4d crop monitoring: Spatio-temporal reconstruction for agriculture,” in2017 IEEE International Conference on Robotics and Automation (ICRA) . IEEE, 2017, pp. 3878–3885

2017
[11]

Rols: Robust object-level slam for grape counting,

A. K. Nellithimaru and G. A. Kantor, “Rols: Robust object-level slam for grape counting,” in Proceedings of the IEEE/CVF conference on computer vision and pattern recognition workshops , 2019, pp. 0–0

2019
[12]

3d move to see: Multi-perspective visual servoing towards the next best view within un- structured and occluded environments,

C. Lehnert, D. Tsai, A. Eriksson, and C. McCool, “3d move to see: Multi-perspective visual servoing towards the next best view within un- structured and occluded environments,” in 2019 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS) . IEEE, 2019, pp....

2019
[13]

Combining lo- cal and global viewpoint planning for fruit coverage,

T. Zaenker, C. Lehnert, C. McCool, and M. Bennewitz, “Combining lo- cal and global viewpoint planning for fruit coverage,” in 2021 European Conference on Mobile Robots (ECMR) . IEEE, 2021, pp. 1–7

2021
[14]

Octomap: An efficient probabilistic 3d mapping framework based on octrees,

A. Hornung, K. M. Wurm, M. Bennewitz, C. Stachniss, and W. Burgard, “Octomap: An efficient probabilistic 3d mapping framework based on octrees,” Autonomous robots, vol. 34, pp. 189–206, 2013

2013
[15]

A comparison of volumetric information gain metrics for active 3d object reconstruc- tion,

J. Delmerico, S. Isler, R. Sabzevari, and D. Scaramuzza, “A comparison of volumetric information gain metrics for active 3d object reconstruc- tion,” Autonomous Robots , vol. 42, no. 2, pp. 197–208, 2018

2018
[16]

Yolact: Real-time instance segmentation,

D. Bolya, C. Zhou, F. Xiao, and Y . J. Lee, “Yolact: Real-time instance segmentation,” in Proceedings of the IEEE/CVF international conference on computer vision , 2019, pp. 9157–9166

2019
[17]

A density-based al- gorithm for discovering clusters in large spatial databases with noise,

M. Ester, H.-P. Kriegel, J. Sander, and X. Xu, “A density-based al- gorithm for discovering clusters in large spatial databases with noise,” in Proceedings of the Second International Conference on Knowledge Discovery and Data Mining , ser. KDD’96. AAAI Press, 1996, p. 226–231

1996
[18]

Husky ur3 simulator,

QualiaT, “Husky ur3 simulator,” 2023, https://github.com/QualiaT/husky ur3 simulator

2023
[19]

AprilTag: A robust and flexible visual fiducial system,

E. Olson, “AprilTag: A robust and flexible visual fiducial system,” in Proceedings of the IEEE International Conference on Robotics and Automation (ICRA) . IEEE, May 2011, pp. 3400–3407

2011

Pith tools

Reviewed August 11, 2026 · model on record in the stance chip above.

[1] [6]

Viewpoint planning for fruit size and position estimation,

T. Zaenker, C. Smitt, C. McCool, and M. Bennewitz, “Viewpoint planning for fruit size and position estimation,” in 2021 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS) . IEEE, 2021, pp. 3271–3277

work page 2021

[2] [1]

Advances in visual perception for agricultural robotics,

G. Kootstra, “Advances in visual perception for agricultural robotics,” in Advances in agri-food robotics . Burleigh Dodds Science Publishing, 2024, pp. 3–36

work page 2024

[3] [2]

Pag-nerf: Towards fast and efficient end-to-end panoptic 3d representations for agricultural robotics,

C. Smitt, M. Halstead, P. Zimmer, T. L ¨abe, E. Guclu, C. Stachniss, and C. McCool, “Pag-nerf: Towards fast and efficient end-to-end panoptic 3d representations for agricultural robotics,” IEEE Robotics and Automation Letters, vol. 9, no. 1, pp. 907–914, 2023

work page 2023

[4] [3]

Panoptic mapping with fruit completion and pose estimation for horticultural robots,

Y . Pan, F. Magistri, T. L ¨abe, E. Marks, C. Smitt, C. McCool, J. Behley, and C. Stachniss, “Panoptic mapping with fruit completion and pose estimation for horticultural robots,” in 2023 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS) . IEEE, 2023, pp. 4226–4233

work page 2023

[5] [4]

Semantic mapping for orchard environ- ments by merging two-sides reconstructions of tree rows,

W. Dong, P. Roy, and V . Isler, “Semantic mapping for orchard environ- ments by merging two-sides reconstructions of tree rows,” Journal of Field Robotics, vol. 37, no. 1, pp. 97–121, 2020

work page 2020

[6] [5]

Attention-driven Next-best-view Planning for Efficient Reconstruction of Plants and Targeted Plant Parts

A. K. Burusa, E. J. van Henten, and G. Kootstra, “Attention-driven active vision for efficient reconstruction of plants and targeted plant parts,” arXiv preprint arXiv:2206.10274 , 2022

work page Pith review arXiv 2022

[7] [7]

Nbv-sc: Next best view planning based on shape completion for fruit mapping and re- construction,

R. Menon, T. Zaenker, N. Dengler, and M. Bennewitz, “Nbv-sc: Next best view planning based on shape completion for fruit mapping and re- construction,” in 2023 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS) . IEEE, 2023, pp. 4197–4203

work page 2023

[8] [8]

Semantic octree mapping and shannon mutual information computation for robot exploration,

A. Asgharivaskasi and N. Atanasov, “Semantic octree mapping and shannon mutual information computation for robot exploration,” IEEE Transactions on Robotics , 2023

work page 2023