Pith. sign in

REVIEW 2 major objections 6 minor 158 references

Coverage Path Planning: Classical Foundations, Recent Advances, and Future Directions

T0 review · 2 major / 6 minor · reviewed 2026-07-14 · grok-4.5

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

Pith's one-line read A problem-driven survey of 125 coverage-path-planning works maps classical foundations onto six modern categories and states the field’s open challenges.

desk verdict Solid, usable CPP survey that actually unifies classical foundations with multi-robot, 3D, constrained, learning, and visual work—worth keeping on the shelf. read the letter →

arxiv 2607.10649 v1 pith:NHDD5YXK submitted 2026-07-12 cs.RO cs.AI

Zongyuan Shen , Shalabh Gupta , Shancheng Zhao , Dehua Zhou , Gao Wang , Zhongqiang Ren , Yaming Ou , Yikui Zhai
show 1 more author
C. L. Philip Chen
This is my paper · ORCID
classification cs.ROcs.AI
keywords coveragepathplanningmotionandunknownenvironmentsautonomousrobotsmulti-robotsystems3Dlearning-basedvisual
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

Coverage path planning asks a robot to traverse every part of a workspace while cutting path length, overlap, turns, and energy. Classical work largely treated a single robot on a known 2D map; newer systems face multi-robot teams, 3D surfaces, battery and curvature limits, learned policies, and camera-based inspection. This paper surveys 125 representative works, mostly from 2015–2026, and organizes them into six categories so that formulations, algorithms, strengths, and limits can be compared under the same problem factors: map knowledge, geometry, robot constraints, sensing goals, and coordination. The authors argue that subarea decomposition, non-local online guidance, and hybrid learning-plus-planning are the main recent trends, and they list concrete open problems in scalable online planning, heterogeneous multi-robot teams, online 3D/visual coverage, and resource-aware platforms. A sympathetic reader gets a single map of where the field has moved and which gaps still block deployable systems.

What carries the argument

The six-category problem-driven taxonomy (single-robot, multi-robot, 3D, constrained, learning-based, visual CPP), with each method further typed offline vs online and scored by how map knowledge, workspace geometry, robot constraints, sensing objectives, and coordination shape the formulation.

What would settle it

A documented, large body of peer-reviewed CPP methods from 2015–2026 that either cannot be placed in the six categories without severe distortion or is systematically omitted relative to included work of similar impact, which would show the taxonomy or the 125-work sample is not representative.

Watch

Extended reading notes

Core claim

The paper claims that recent coverage path planning is best understood through a problem-driven six-category taxonomy—single-robot, multi-robot, 3D, constrained, learning-based, and visual CPP—built from 125 representative works and explicitly linked to classical pre-2015 methods, and that this organization both summarizes current practice and exposes open challenges in online scalability, multi-robot coordination, 3D and visual coverage, platform constraints, and learning-enhanced planning.

Load-bearing premise

That the authors’ hand-picked set of 125 works and the six-category split fairly represent the whole field, without a published search protocol that would let someone check what was left out.

Share X Bluesky LinkedIn Reddit HN

Signed reviews

No signed human review yet.

Editorial analysis

A structured set of objections, weighed in public.

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

Referee Report

2 major / 6 minor

Summary. This manuscript surveys coverage path planning (CPP), organizing 125 representative works (primarily 2015–2026) into a problem-driven six-category taxonomy: single-robot, multi-robot, 3D, constrained, learning-based, and visual CPP, with offline/online splits where appropriate. It links recent methods to classical foundations (cellular decomposition, STC, Morse, Boustrophedon, etc.), summarizes formulations, representative algorithms, strengths, and limitations for each family, and contrasts prior surveys in Table I. Comparison tables (II–VII), a timeline of online single-robot methods (Fig. 4), and a concluding discussion of open challenges (scalable online planning, multi-robot coordination, 3D/visual coverage, platform-constrained coverage, learning-enhanced hybrids) support the claim of a unified, up-to-date overview of the field.

Significance. If accepted as a structured map of the literature, the paper fills a clear gap: earlier surveys are either classical/2D-focused ([19], [20]), application-narrow ([21]–[23]), or incomplete on multi-robot, 3D, constrained, learning-based, and visual CPP (Table I). The problem-driven taxonomy, explicit strengths/limitations per family, and classical-to-recent linkage are useful for both newcomers and specialists. The comparison tables and open-challenge section are concrete contributions typical of high-value robotics surveys. No machine-checked proofs or new algorithms are claimed; the value is organizational and navigational, and that value is delivered.

major comments (2)
  1. Abstract and §I.C claim a survey of “125 representative works” with a six-category taxonomy that “fully” covers the field (Table I). The manuscript does not state a reproducible inclusion protocol (search queries, venues, years, exclusion rules, or how borderline works were assigned). For a survey whose central claim is completeness and balance, a short Methods-style paragraph (even if selection remains expert judgment) would make the corpus claim auditable and reduce the risk that underrepresented subareas (e.g., marine multi-robot, industrial spray painting beyond PaintNet) appear systematically omitted. This is standard survey hygiene and does not require redoing the taxonomy.
  2. §VI (learning-based CPP) and §VII (visual CPP) are thinner and less systematically tabulated than §§II–V. Table VII lists learning-enhanced components, but the text underplays failure modes that matter for the survey’s own future-work claim (completeness, safety, sim-to-real, and when learned policies should be subordinated to classical completeness mechanisms). A short subsection or expanded “Strengths and Limitations” that ties learning/visual methods back to the completeness and online-hole issues developed in §II.B would better support the hybrid-framework recommendation in §VIII.
minor comments (6)
  1. Fig. 2 taxonomy is dense; some leaf labels (e.g., “2). Rank-based methods” under offline single-robot) are hard to parse at a glance. A cleaner hierarchical layout or color coding by offline/online would help.
  2. Table I uses “Full / Partial / Limited / None” without a one-line operational definition in the caption beyond the footnote; moving that definition into the caption would improve standalone readability.
  3. Notation for ε* / ε*+ / C* is consistent in the text but appears with slight typographic variation (epsilon vs. ε, asterisk placement). Standardize in the camera-ready version.
  4. Several 2025–2026 citations (including author-affiliated CAP, Multi-CAP, C*) are appropriate as exemplars but should be clearly marked as recent/preprint where applicable so readers can judge maturity.
  5. §VIII future-work bullets are strong; a brief prioritization (e.g., which open problem is most blocking for field deployment) would make the section more actionable without lengthening it much.
  6. Minor copy-edits: “UA Vs” spacing, occasional missing spaces before citations, and “H ¨offmann” / accent consistency in the bibliography.

Circularity Check

0 steps flagged · score 0.0 of 10

No circularity: pure literature survey with no derivation, prediction, or first-principles claim that reduces to its inputs.

full rationale

The paper is a problem-driven taxonomy of 125 CPP works (primarily 2015–2026) organized into six categories (single-robot, multi-robot, 3D, constrained, learning-based, visual). Its central claims are organizational and navigational: category definitions, method summaries with strengths/limitations, comparison tables (I–VII), linkage of recent methods to classical foundations, and open challenges (Abstract; §I.C–D; §VIII). There are no equations, fitted parameters, uniqueness theorems, or predictions. Author self-citations (e.g., ε*, C*, CT-CPP, CAP, Multi-CAP) appear only as representative examples placed inside the taxonomy they survey; they do not force the taxonomy, completeness claim, or any result by construction. Self-citation of active contributors’ algorithms is normal for a survey and does not constitute circularity under the stated patterns. No load-bearing step reduces a claimed result to its own inputs. Score 0 with empty steps is the correct honest finding.

Assumptions & free parameters 2 free parameters · 3 assumptions · 1 invented entities

As a survey, the load-bearing commitments are definitional and selection-related rather than fitted constants or new physical entities. The central claim rests on a standard definition of CPP, a problem-driven six-way taxonomy, and the representativeness of the curated 125-paper corpus.

free parameters (2)
  • Corpus size and membership (125 works)
    The survey’s scope claim depends on which papers were included; the number and set are author-chosen without a published search protocol or quantitative selection rule.
  • Primary time window (mainly 2015–2026)
    The recency framing is a design choice that shapes which methods are emphasized relative to classical pre-2015 foundations.
assumptions (3)
  • domain assumption CPP is the problem of generating trajectories that completely cover a target workspace while minimizing task-specific costs (path length, overlap, turns, energy).
    Stated in the Abstract and §I; standard robotics definition used as the organizing object of the survey.
  • ad hoc to paper CPP methods are usefully partitioned into single-robot, multi-robot, 3D, constrained, learning-based, and visual categories (with offline/online splits).
    The six-category taxonomy is the paper’s organizing device (§I.A–C, Fig. 2); alternative taxonomies (by algorithm family only, by application domain only) are possible.
  • domain assumption Prior surveys leave a gap that a unified classical-to-recent treatment across all six categories can fill.
    Table I and §I.B–C justify the survey’s existence by comparing coverage of earlier reviews.
invented entities (1)
  • Six-category problem-driven CPP taxonomy (including learning-based and visual CPP as first-class survey pillars)
    purpose: Organize recent literature and compare methods by problem setting rather than only by classical algorithm family.
    The taxonomy is a conceptual construct of the survey; categories reuse known problem names but the unified six-way framing is the paper’s structure.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Coverage Path Planning: Classical Foundations, Recent Advances, and Future Directions." pith.science (2026). https://pith.science/paper/NHDD5YXK

@misc{pith2026260710649,
  author       = {Pith},
  title        = {Pith review of: Coverage Path Planning: Classical Foundations, Recent Advances, and Future Directions},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/NHDD5YXK}},
  note         = {Machine review of arXiv:2607.10649}
}
read the original abstract

Coverage path planning (CPP) is a fundamental problem in robot motion planning, whose aim is to produce robot trajectories that provide complete coverage of target workspaces while minimizing task-specific objectives such as path length, overlap, number of turns, and energy consumption. CPP has widespread applications in cleaning, inspection, mapping, agriculture, manufacturing, surveillance, demining, and environmental monitoring. Although classical CPP has been extensively studied, recent advances have extended CPP beyond single-robot settings to multi-robot systems, complex 3D environments, constrained platforms, learning-based coverage planning, and visual coverage tasks. This paper presents a comprehensive survey of 125 representative works published primarily between 2015 and 2026, while presenting the evolution of recent developments in light of the classical CPP methods published before 2015. The CPP methods are organized into six main categories: single-robot CPP, multi-robot CPP, 3D CPP, constrained CPP, learning-based CPP, and visual CPP. For each category, the review summarizes the main planning formulations, representative algorithms, strengths, and limitations. In addition, the review analyzes how environmental knowledge, workspace geometry, robot constraints, sensing objectives, and coordination requirements shape the CPP problem. The survey further discusses open challenges in scalable online planning, multi-robot coordination, 3D and visual coverage, unified platform-constrained and resource-aware coverage, and learning-enhanced coverage. Thus, the survey provides a structured overview of recent CPP developments and future research directions.

Figures

Figures reproduced from arXiv: 2607.10649 by the authors.

Figure 1
Figure 1. Application examples of CPP. weeding [14] and farming [15]); and hazardous operations (e.g., offshore oil spill cleaning [16] and mine counter mea￾sures [17]) [PITH_FULL_IMAGE:figures/full_fig_p001_1.png] view at source ↗
Figure 2
Figure 2. Taxonomy of CPP methods. ent platform-specific constraints, such as battery capacities, bounded curvatures, tethered cable limits, and morphological restrictions. Recently, learning-based CPP has emerged as a novel methodology, where learning techniques are integrated into classical CPP frameworks to support specific planning components. Finally, visual CPP shifts the focus from phys￾ical area coverage to trajectory… view at source ↗
Figure 3
Figure 3. Illustration of the subarea-decomposition method in [24]. The [PITH_FULL_IMAGE:figures/full_fig_p003_3.png] view at source ↗
Figures from the paper (12 more)
Figure 4
Figure 4. Figure 4: Timeline of the evolution of online single-robot CPP methods. [PITH_FULL_IMAGE:figures/full_fig_p004_4.png]
Figure 5
Figure 5. Figure 5: Illustration of the ε ∗ [40] operation at level 0 of MAPS, where it selects the target cell from the robot’s local neighborhood. can be grouped into deterministic-rule based, potential-field based, and reward-function based methods. a) Deterministic-rule-based methods:…
Figure 6
Figure 6. Figure 6: Illustration of the connectivity-aware local method SP2E [45]. [PITH_FULL_IMAGE:figures/full_fig_p005_6.png]
Figure 8
Figure 8. Figure 8: Illustration of the spanning-tree-based method MSTC [PITH_FULL_IMAGE:figures/full_fig_p007_8.png]
Figure 9
Figure 9. Figure 9: Illustration of the subarea-decomposition method in [58]. [PITH_FULL_IMAGE:figures/full_fig_p008_9.png]
Figure 11
Figure 11. Figure 11: Concepts of resilience and efficiency in the CARE algo [PITH_FULL_IMAGE:figures/full_fig_p009_11.png]
Figure 12
Figure 12. Figure 12: The method incrementally partitions the environment [PITH_FULL_IMAGE:figures/full_fig_p009_12.png]
Figure 12
Figure 12. Figure 12: Illustration of the subarea-decomposition method Multi [PITH_FULL_IMAGE:figures/full_fig_p010_12.png]
Figure 13
Figure 13. Figure 13: Illustration of the layered-coverage method CT-CPP [6]. [PITH_FULL_IMAGE:figures/full_fig_p011_13.png]
Figure 15
Figure 15. Figure 15: Illustration of the decomposition-based method in [100]. (a) [PITH_FULL_IMAGE:figures/full_fig_p012_15.png]
Figure 16
Figure 16. Figure 16: Robot examples with different platform-specific constraints: [PITH_FULL_IMAGE:figures/full_fig_p013_16.png]
Figure 17
Figure 17. Figure 17: Illustration of a typical visual CPP pipeline. Candidate viewpoints are generated around the target surface, connected into an [PITH_FULL_IMAGE:figures/full_fig_p017_17.png]

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

158 extracted references · 1 linked inside Pith

  1. [19]

    Coverage for robotics–a survey of recent results,

    H. Choset, “Coverage for robotics–a survey of recent results,”Annals of mathematics and artificial intelligence, vol. 31, no. 1, pp. 113–126, 2001

    2001

  2. [20]

    A survey on coverage path planning for robotics,

    E. Galceran and M. Carreras, “A survey on coverage path planning for robotics,”Robotics and Autonomous systems, vol. 61, no. 12, pp. 1258–1276, 2013

    2013

  3. [21]

    Indoor coverage path planning: Survey, implementation, analysis,

    R. Bormann, F. Jordan, J. Hampp, and M. H ¨agele, “Indoor coverage path planning: Survey, implementation, analysis,” inIEEE International Conference on Robotics and Automation, 2018, pp. 1718–1725

    2018

  4. [23]

    Optimal guidance track gen- eration for precision agriculture: A review of coverage path planning techniques,

    M. H ¨offmann, S. Patel, and C. B ¨uskens, “Optimal guidance track gen- eration for precision agriculture: A review of coverage path planning techniques,”Journal of Field Robotics, vol. 41, no. 3, pp. 823–844, 2024

    2024

  5. [1]

    Anytime replanning of robot coverage paths for partially unknown environments,

    M. Ramesh, F. Imeson, B. Fidan, and S. L. Smith, “Anytime replanning of robot coverage paths for partially unknown environments,”IEEE Transactions on Robotics, vol. 40, pp. 4190–4206, 2024

    2024

  6. [2]

    SLAM based shape adaptive coverage control using autonomous vehicles,

    J. Song and S. Gupta, “SLAM based shape adaptive coverage control using autonomous vehicles,” in2015 10th System of Systems Engineer- ing Conference, 2015, pp. 268–273

    2015

  7. [3]

    Autonomous mapping of underwater 3-D structures: From view planning to execu- tion,

    N. Palomeras, N. Hurt ´os, M. Carreras, and P. Ridao, “Autonomous mapping of underwater 3-D structures: From view planning to execu- tion,”IEEE Robotics and Automation Letters, vol. 3, no. 3, pp. 1965– 1971, 2018

    1965

  8. [4]

    Coverage path planning with track spacing adaptation for autonomous underwater vehicles,

    V . Yordanova and B. Gips, “Coverage path planning with track spacing adaptation for autonomous underwater vehicles,”IEEE Robotics and Automation Letters, vol. 5, no. 3, pp. 4774–4780, 2020

    2020

Show all 158 references
  1. [5]

    Structured light-based underwater collision-free navigation and dense mapping system for refined exploration in unknown dark environ- ments,

    Y . Ou, J. Fan, C. Zhou, S. Kang, Z. Zhang, Z.-G. Hou, and M. Tan, “Structured light-based underwater collision-free navigation and dense mapping system for refined exploration in unknown dark environ- ments,”IEEE Transactions on Systems, Man, and Cybernetics, vol. 55, no. 1, ...

    2025

  2. [6]

    CT-CPP: Coverage path planning for 3D terrain reconstruction using dynamic coverage trees,

    Z. Shen, J. Song, K. Mittal, and S. Gupta, “CT-CPP: Coverage path planning for 3D terrain reconstruction using dynamic coverage trees,” IEEE Robotics and Automation Letters, vol. 7, no. 1, pp. 135–142, 2022

    2022

  3. [7]

    FC- Planner: A skeleton-guided planning framework for fast aerial coverage of complex 3D scenes,

    C. Feng, H. Li, M. Zhang, X. Chen, B. Zhou, and S. Shen, “FC- Planner: A skeleton-guided planning framework for fast aerial coverage of complex 3D scenes,” inIEEE International Conference on Robotics and Automation, 2024, pp. 8686–8692

    2024

  4. [8]

    Online view planning for inspecting unexplored underwater structures

    E. Vidal, J. D. Hern ´andez, K. Istenic, and M. Carreras, “Online view planning for inspecting unexplored underwater structures.”IEEE Robotics and Automation Letters, vol. 2, no. 3, pp. 1436–1443, 2017

    2017

  5. [9]

    Cellular decom- position for nonrepetitive coverage task with minimum discontinuities,

    T. Yang, J. V . Miro, Q. Lai, Y . Wang, and R. Xiong, “Cellular decom- position for nonrepetitive coverage task with minimum discontinuities,” IEEE/ASME Transactions on Mechatronics, vol. 25, no. 4, pp. 1698– 1708, 2020

    2020

  6. [10]

    Complete and near-optimal path planning for simultaneous sensor-based inspection and footprint coverage in robotic crack filling,

    K. Yu, C. Guo, and J. Yi, “Complete and near-optimal path planning for simultaneous sensor-based inspection and footprint coverage in robotic crack filling,” inIEEE International Conference on Robotics and Automation, 2019, pp. 8812–8818

    2019

  7. [11]

    Complete and near- optimal robotic crack coverage and filling in civil infrastructure,

    V . Veeraraghavan, K. Hunte, J. Yi, and K. Yu, “Complete and near- optimal robotic crack coverage and filling in civil infrastructure,”IEEE Transactions on Robotics, vol. 40, pp. 2850–2867, 2024

    2024

  8. [12]

    PaintCopter: An autonomous UA V for spray painting on three-dimensional surfaces,

    A. S. Vempati, M. Kamel, N. Stilinovic, Q. Zhang, D. Reusser, I. Sa, J. Nieto, R. Siegwart, and P. Beardsley, “PaintCopter: An autonomous UA V for spray painting on three-dimensional surfaces,”IEEE Robotics and Automation Letters, vol. 3, no. 4, pp. 2862–2869, 2018

    2018

  9. [13]

    Uniform coverage of automotive surface patches,

    P. N. Atkar, A. Greenfield, D. C. Conner, H. Choset, and A. A. Rizzi, “Uniform coverage of automotive surface patches,”International Journal of Robotics Research, vol. 24, no. 11, pp. 883–898, 2005

    2005

  10. [14]

    Online coverage planning for an autonomous weed mowing robot with curvature constraints,

    P. Maini, B. M. Gonultas, and V . Isler, “Online coverage planning for an autonomous weed mowing robot with curvature constraints,”IEEE Robotics and Automation Letters, vol. 7, no. 2, pp. 5445–5452, 2022

    2022

  11. [15]

    Coverage path planning on three-dimensional terrain for arable farming,

    J. Jin and L. Tang, “Coverage path planning on three-dimensional terrain for arable farming,”Journal of Field Robotics, vol. 28, no. 3, pp. 424–440, 2011

    2011

  12. [16]

    Adaptive cleaning of oil spills by autonomous vehicles under partial information,

    J. Song, S. Gupta, J. Hare, and S. Zhou, “Adaptive cleaning of oil spills by autonomous vehicles under partial information,” inOCEANS 2019 MTS/IEEE San Diego, 2013, pp. 1–5

    2019

  13. [17]

    Symbolic analysis of sonar data for underwater target detection,

    K. Mukherjee, S. Gupta, A. Ray, and S. Phoha, “Symbolic analysis of sonar data for underwater target detection,”IEEE Journal of Oceanic Engineering, vol. 36, no. 2, pp. 219–230, 2011

    2011

  14. [18]

    C ∗: A coverage path planning algorithm for unknown environments using rapidly covering graphs,

    Z. Shen, J. P. Wilson, and S. Gupta, “C ∗: A coverage path planning algorithm for unknown environments using rapidly covering graphs,” IEEE Transactions on Robotics, vol. 42, pp. 1233–1253, 2026

    2026

  15. [22]

    Survey on coverage path planning with unmanned aerial vehicles,

    T. M. Cabreira, L. B. Brisolara, and F. J. Paulo R, “Survey on coverage path planning with unmanned aerial vehicles,”Drones, vol. 3, no. 1, p. 4, 2019

    2019

  16. [24]

    Optimal partitioning of non-convex environments for minimum turn coverage planning,

    M. Ramesh, F. Imeson, B. Fidan, and S. L. Smith, “Optimal partitioning of non-convex environments for minimum turn coverage planning,” IEEE Robotics and Automation Letters, vol. 7, no. 4, pp. 9731–9738, 2022

    2022

  17. [25]

    Exact cell decomposition,

    J.-C. Latombe, “Exact cell decomposition,” inRobot motion planning. Springer, 1991, pp. 200–247

    1991

  18. [26]

    Coverage of known spaces: The boustrophedon cellular decomposition,

    H. Choset, “Coverage of known spaces: The boustrophedon cellular decomposition,”Autonomous Robots, vol. 9, no. 3, pp. 247–253, 2000

    2000

  19. [27]

    Morse decompositions for coverage tasks,

    E. U. Acar, H. Choset, A. A. Rizzi, P. N. Atkar, and D. Hull, “Morse decompositions for coverage tasks,”International Journal of Robotics Research, vol. 21, no. 4, pp. 331–344, 2002

    2002

  20. [28]

    J. W. Milnor,Morse theory. Princeton university press, 1963, no. 51

    1963

  21. [29]

    Sensor-based coverage of unknown environments: Incremental construction of morse decompositions,

    E. U. Acar and H. Choset, “Sensor-based coverage of unknown environments: Incremental construction of morse decompositions,” International Journal of Robotics Research, vol. 21, no. 4, pp. 345–366, 2002

    2002

  22. [30]

    Efficient complete coverage of a known arbitrary environment with applications to aerial opera- tions,

    A. Xu, C. Viriyasuthee, and I. Rekleitis, “Efficient complete coverage of a known arbitrary environment with applications to aerial opera- tions,”Autonomous Robots, vol. 36, no. 4, pp. 365–381, 2014

    2014

  23. [31]

    Coverage path planning in belief space,

    R. Schirmer, P. Biber, and C. Stachniss, “Coverage path planning in belief space,” inIEEE International Conference on Robotics and Automation, 2019, pp. 7604–7610. 19

    2019

  24. [32]

    The constriction decomposition method for coverage path planning,

    S. Brown and S. L. Waslander, “The constriction decomposition method for coverage path planning,” inIEEE/RSJ International Conference on Intelligent Robots and Systems, 2016, pp. 3233–3238

    2016

  25. [33]

    On minimizing turns in robot coverage path planning,

    S. Bochkarev and S. L. Smith, “On minimizing turns in robot coverage path planning,” inIEEE International Conference on Automation Science and Engineering, 2016, pp. 1237–1242

    2016

  26. [34]

    Minimum-length coverage path planning for grid environments with approximation guarantees,

    M. Ramesh, F. Imeson, B. Fidan, and S. L. Smith, “Minimum-length coverage path planning for grid environments with approximation guarantees,”IEEE Robotics and Automation Letters, vol. 10, no. 10, pp. 10 674–10 681, 2025

    2025

  27. [35]

    Spanning-tree based coverage of contin- uous areas by a mobile robot,

    Y . Gabriely and E. Rimon, “Spanning-tree based coverage of contin- uous areas by a mobile robot,”Annals of Mathematics and Artificial Intelligence, vol. 31, no. 1-4, pp. 77–98, 2001

    2001

  28. [36]

    Competitive on-line coverage of grid environments by a mobile robot,

    Y . Gabriely and E. Rimon, “Competitive on-line coverage of grid environments by a mobile robot,”Computational Geometry, vol. 24, no. 3, pp. 197–224, 2003

    2003

  29. [37]

    BSA: a complete coverage algorithm,

    E. Gonzalez, O. Alvarez, Y . Diaz, C. Parra, and C. Bustacara, “BSA: a complete coverage algorithm,” inIEEE International Conference on Robotics and Automation, 2005, pp. 2040–2044

    2005

  30. [38]

    Brick&Mortar: An on-line multi-agent exploration algorithm,

    E. Ferranti, N. Trigoni, and M. Levene, “Brick&Mortar: An on-line multi-agent exploration algorithm,” inIEEE International Conference on Robotics and Automation, 2007, pp. 761–767

    2007

  31. [39]

    BA*: an online complete coverage algorithm for cleaning robots,

    H. H. Viet, V .-H. Dang, M. N. U. Laskar, and T. Chung, “BA*: an online complete coverage algorithm for cleaning robots,”Applied Intelligence, vol. 39, no. 2, pp. 217–235, 2013

    2013

  32. [40]

    ϵ ⋆: An online coverage path planning algo- rithm,

    J. Song and S. Gupta, “ϵ ⋆: An online coverage path planning algo- rithm,”IEEE Transactions on Robotics, vol. 34, no. 2, pp. 526–533, 2018

    2018

  33. [41]

    A bioinspired neural network for real-time concurrent map building and complete coverage robot navigation in unknown environments,

    C. Luo and S. X. Yang, “A bioinspired neural network for real-time concurrent map building and complete coverage robot navigation in unknown environments,”IEEE Transactions on Neural Networks and Learning Systems, vol. 19, no. 7, pp. 1279–1298, 2008

    2008

  34. [42]

    Complete coverage autonomous underwater vehicles path planning based on glasius bio-inspired neural network algorithm for discrete and centralized programming,

    B. Sun, D. Zhu, C. Tian, and C. Luo, “Complete coverage autonomous underwater vehicles path planning based on glasius bio-inspired neural network algorithm for discrete and centralized programming,”IEEE Transactions on Cognitive and Developmental Systems, vol. 11, no. 1, pp. 7...

    2019

  35. [43]

    Improved BINN-based underwater topography scanning coverage path planning for auv in internet of underwater things,

    W. Cai, S. Zhang, M. Zhang, and C. Wang, “Improved BINN-based underwater topography scanning coverage path planning for auv in internet of underwater things,”IEEE Internet of Things Journal, vol. 10, no. 20, pp. 18 375–18 386, 2023

    2023

  36. [44]

    PPCPP: A predator–prey-based approach to adaptive coverage path planning,

    M. Hassan and D. Liu, “PPCPP: A predator–prey-based approach to adaptive coverage path planning,”IEEE Transactions on Robotics, vol. 36, no. 1, pp. 284–301, 2019

    2019

  37. [45]

    SP2E: Online spiral coverage with proactive prevention extremum for unknown environments,

    L. Li, D. Shi, S. Jin, S. Yang, Y . Lian, and H. Liu, “SP2E: Online spiral coverage with proactive prevention extremum for unknown environments,”Journal of Intelligent & Robotic Systems, vol. 108, no. 2, p. 30, 2023

    2023

  38. [46]

    An improved algorithm for complete coverage path planning based on biologically inspired neural network,

    L. Han, X. Tan, Q. Wu, and X. Deng, “An improved algorithm for complete coverage path planning based on biologically inspired neural network,”IEEE Transactions on Cognitive and Developmental Systems, vol. 15, no. 3, pp. 1605–1617, 2023

    2023

  39. [47]

    Complete coverage path planning algorithm based on improved bi- ologically inspired neural networks in spray painting,

    L. Huo, Y . Liu, Z. Chen, Y . Yang, X. Yan, H. Xia, and Q. Sun, “Complete coverage path planning algorithm based on improved bi- ologically inspired neural networks in spray painting,”IEEE Robotics and Automation Letters, vol. 10, no. 6, pp. 5697–5704, 2025

    2025

  40. [48]

    Hierarchy coverage path planning with proactive extremum prevention in unknown envi- ronments,

    L. Li, D. Shi, S. Jin, X. Zhou, Y . Li, and B. Bai, “Hierarchy coverage path planning with proactive extremum prevention in unknown envi- ronments,”IEEE Robotics and Automation Letters, vol. 10, no. 4, pp. 3358–3365, 2025

    2025

  41. [49]

    CAP: A connectivity-aware hierarchical coverage path planning algorithm for unknown environments using coverage guidance graph,

    Z. Shen, B. Shirose, P. Sriganesh, and M. Travers, “CAP: A connectivity-aware hierarchical coverage path planning algorithm for unknown environments using coverage guidance graph,” inIEEE/RSJ International Conference on Intelligent Robots and Systems, 2025, pp. 13 244–13 249

    2025

  42. [50]

    Full coverage path planning recombination framework for unmanned vehicles with multi-objective constraints,

    J. Fu, W. Yao, G. Sun, J. Liu, and L. Wu, “Full coverage path planning recombination framework for unmanned vehicles with multi-objective constraints,”IEEE Transactions on Industrial Electronics, vol. 71, no. 8, pp. 9276–9286, 2024

    2024

  43. [51]

    Online exploratory coverage path planning of incremental slam for autonomous vehicles,

    J. Fu, H. Zhu, K. Zhang, T. Ma, J. Liu, and Y . Li, “Online exploratory coverage path planning of incremental slam for autonomous vehicles,” IEEE Transactions on Industrial Informatics, vol. 22, no. 3, pp. 1861– 1870, 2026

    2026

  44. [52]

    An artificially weighted spanning tree coverage algorithm for decentralized flying robots,

    W. Dong, S. Liu, Y . Ding, X. Sheng, and X. Zhu, “An artificially weighted spanning tree coverage algorithm for decentralized flying robots,”IEEE Transactions on Automation Science and Engineering, vol. 17, no. 4, pp. 1689–1698, 2020

    2020

  45. [53]

    MSTC*: Multi-robot coverage path planning under physical constrain,

    J. Tang, C. Sun, and X. Zhang, “MSTC*: Multi-robot coverage path planning under physical constrain,” inIEEE International Conference on Robotics and Automation, 2021, pp. 2518–2524

    2021

  46. [54]

    TMSTC*: A path planning algorithm for minimizing turns in multi-robot coverage,

    J. Lu, B. Zeng, J. Tang, T. L. Lam, and J. Wen, “TMSTC*: A path planning algorithm for minimizing turns in multi-robot coverage,” IEEE Robotics and Automation Letters, vol. 8, no. 8, pp. 5275–5282, 2023

    2023

  47. [55]

    Priority-aware multi-robot coverage path planning,

    K. Lee, H. Kim, J. Li, and J. Park, “Priority-aware multi-robot coverage path planning,”IEEE Robotics and Automation Letters, vol. 11, no. 3, pp. 3534–3541, 2026

    2026

  48. [56]

    A novel cooperative path planning for multirobot persistent coverage in complex environ- ments,

    Y . Tang, R. Zhou, G. Sun, B. Di, and R. Xiong, “A novel cooperative path planning for multirobot persistent coverage in complex environ- ments,”IEEE Sensors Journal, vol. 20, no. 8, pp. 4485–4495, 2020

    2020

  49. [57]

    Area coverage with multiple capacity- constrained robots,

    S. Agarwal and S. Akella, “Area coverage with multiple capacity- constrained robots,”IEEE Robotics and Automation Letters, vol. 7, no. 2, pp. 3734–3741, 2022

    2022

  50. [58]

    Multi-UA V coverage path planning based on balanced graph partitioning,

    M. Cao, Z. Yang, and H. Miao, “Multi-UA V coverage path planning based on balanced graph partitioning,”IEEE Robotics and Automation Letters, vol. 11, no. 4, pp. 4409–4416, 2026

    2026

  51. [59]

    CoMAEA: A collision-avoiding multi-agent evolutionary algorithm for coverage path planning,

    T. Huang, X.-W. Ma, X.-T. Liu, and Y .-J. Gong, “CoMAEA: A collision-avoiding multi-agent evolutionary algorithm for coverage path planning,”IEEE Transactions on Evolutionary Computation, 2026

    2026

  52. [60]

    Redundancy, efficiency and robustness in multi-robot coverage,

    N. Hazon and G. A. Kaminka, “Redundancy, efficiency and robustness in multi-robot coverage,” inIEEE International Conference on Robotics and Automation, 2005, pp. 735–741

    2005

  53. [61]

    Multirobot forest coverage for weighted and unweighted terrain,

    X. Zheng, S. Koenig, D. Kempe, and S. Jain, “Multirobot forest coverage for weighted and unweighted terrain,”IEEE Transactions on Robotics, vol. 26, no. 6, pp. 1018–1031, 2010

    2010

  54. [62]

    Mixed integer programming for time-optimal multi-robot coverage path planning with efficient heuristics,

    J. Tang and H. Ma, “Mixed integer programming for time-optimal multi-robot coverage path planning with efficient heuristics,”IEEE Robotics and Automation Letters, vol. 8, no. 10, pp. 6491–6498, 2023

    2023

  55. [63]

    Large-scale multirobot coverage path planning on grids with path deconfliction,

    J. Tang, Z. Mao, and H. Ma, “Large-scale multirobot coverage path planning on grids with path deconfliction,”IEEE Transactions on Robotics, vol. 41, pp. 3348–3367, 2025

    2025

  56. [64]

    Dynamic task-priority coverage planning for efficient multi-robot collaboration,

    Y . Chen, Z. Zeng, Z. Lai, W. Jiang, H. Lu, H. Zhang, and Y . Wang, “Dynamic task-priority coverage planning for efficient multi-robot collaboration,”IEEE Transactions on Industrial Electronics, vol. 73, no. 2, pp. 2521–2532, 2026

    2026

  57. [65]

    Efficient multi-robot coverage of a known environment,

    N. Karapetyan, K. Benson, C. McKinney, P. Taslakian, and I. Rekleitis, “Efficient multi-robot coverage of a known environment,” inIEEE/RSJ International Conference on Intelligent Robots and Systems, 2017, pp. 1846–1852

    2017

  58. [66]

    Equitable persistent coverage of non-convex environments with graph- based planning,

    J. M. Palacios-Gas ´os, D. Tardioli, E. Montijano, and C. Sag ¨u´es, “Equitable persistent coverage of non-convex environments with graph- based planning,”International Journal of Robotics Research, vol. 38, no. 14, pp. 1674–1694, 2019

    2019

  59. [67]

    Scalable coverage path planning of multi-robot teams for monitoring non-convex areas,

    L. Collins, P. Ghassemi, E. T. Esfahani, D. Doermann, K. Dantu, and S. Chowdhury, “Scalable coverage path planning of multi-robot teams for monitoring non-convex areas,” inIEEE International Conference on Robotics and Automation, 2021, pp. 7393–7399

    2021

  60. [68]

    Least squares quantization in pcm,

    S. Lloyd, “Least squares quantization in pcm,”IEEE Transactions on Information Theory, vol. 28, no. 2, pp. 129–137, 1982

    1982

  61. [69]

    Optimal multi-robot coverage path planning for agricultural fields using motion dynamics,

    J. C. Choton and P. Prabhakar, “Optimal multi-robot coverage path planning for agricultural fields using motion dynamics,” inIEEE In- ternational Conference on Robotics and Automation, 2023, pp. 11 817– 11 823

    2023

  62. [70]

    UB-ANC planner: Energy efficient coverage path planning with multiple drones,

    J. Modares, F. Ghanei, N. Mastronarde, and K. Dantu, “UB-ANC planner: Energy efficient coverage path planning with multiple drones,” inIEEE International Conference on Robotics and Automation, 2017, pp. 6182–6189

    2017

  63. [71]

    Turn-minimizing multi- robot coverage,

    I. Vandermeulen, R. Groß, and A. Kolling, “Turn-minimizing multi- robot coverage,” inIEEE International Conference on Robotics and Automation, 2019, pp. 1014–1020

    2019

  64. [72]

    Memetic algorithm based on sequential variable neighborhood descent for the minmax multiple traveling salesman problem,

    Y . Wang, Y . Chen, and Y . Lin, “Memetic algorithm based on sequential variable neighborhood descent for the minmax multiple traveling salesman problem,”Computers & Industrial Engineering, vol. 106, pp. 105–122, 2017

    2017

  65. [73]

    Line coverage with multiple robots,

    S. Agarwal and S. Akella, “Line coverage with multiple robots,” in IEEE International Conference on Robotics and Automation, 2020, pp. 3248–3254

    2020

  66. [74]

    Energy-aware multi- uav coverage mission planning with optimal speed of flight,

    D. Datsko, F. Nekovar, R. Penicka, and M. Saska, “Energy-aware multi- uav coverage mission planning with optimal speed of flight,”IEEE Robotics and Automation Letters, vol. 9, no. 3, pp. 2893–2900, 2024

    2024

  67. [75]

    Multiregional coverage path planning for multiple energy constrained UA Vs,

    J. Xie and J. Chen, “Multiregional coverage path planning for multiple energy constrained UA Vs,”IEEE Transactions on Intelligent Trans- portation Systems, vol. 23, no. 10, pp. 17 366–17 381, 2022. 20

    2022

  68. [76]

    Multi-region joint coverage for environmental monitoring using energy-constrained UA Vs,

    C. Zhang, C. Xu, X. Cheng, X. Li, G. Li, and B. He, “Multi-region joint coverage for environmental monitoring using energy-constrained UA Vs,”IEEE Transactions on Instrumentation and Measurement, vol. 74, pp. 1–13, 2025

    2025

  69. [77]

    Real-time path- reconfigurable coverage planning for multi-UA V missions over disjoint areas,

    C. Luo, J. Guo, Z. Liu, L. Liu, and C. Luo, “Real-time path- reconfigurable coverage planning for multi-UA V missions over disjoint areas,”IEEE Robotics and Automation Letters, vol. 11, no. 2, pp. 1226– 1233, 2026

    2026

  70. [78]

    APF-CPP: An artificial potential field based multi-robot online coverage path planning approach,

    Z. Wang, X. Zhao, J. Zhang, N. Yang, P. Wang, J. Tang, J. Zhang, and L. Shi, “APF-CPP: An artificial potential field based multi-robot online coverage path planning approach,”IEEE Robotics and Automation Letters, vol. 9, no. 11, pp. 9199–9206, 2024

    2024

  71. [79]

    BoB: an online cov- erage approach for multi-robot systems,

    H. H. Viet, V .-H. Dang, S. Choi, and T. C. Chung, “BoB: an online cov- erage approach for multi-robot systems,”Applied Intelligence, vol. 42, no. 2, pp. 157–173, 2015

    2015

  72. [80]

    Neural-dynamics- driven complete area coverage navigation through cooperation of multiple mobile robots,

    C. Luo, S. X. Yang, X. Li, and M. Q.-H. Meng, “Neural-dynamics- driven complete area coverage navigation through cooperation of multiple mobile robots,”IEEE Transactions on Industrial Electronics, vol. 64, no. 1, pp. 750–760, 2017

    2017

  73. [81]

    Dec-PPCPP: A decentralized predator–prey-based approach to adaptive coverage path planning amid moving obstacles,

    M. Hassan, D. Mustafic, and D. Liu, “Dec-PPCPP: A decentralized predator–prey-based approach to adaptive coverage path planning amid moving obstacles,” inIEEE/RSJ International Conference on Intelligent Robots and Systems, 2020, pp. 11 732–11 739

    2020

  74. [82]

    A herd-foraging-based approach to adaptive coverage path planning in dual environments,

    J. Zhang, P. Zu, K. Liu, and M. Zhou, “A herd-foraging-based approach to adaptive coverage path planning in dual environments,”IEEE Transactions on Cybernetics, vol. 54, no. 3, pp. 1882–1893, 2024

    2024

  75. [83]

    CARE: Cooperative autonomy for resilience and efficiency of robot teams for complete coverage of unknown environments under robot failures,

    J. Song and S. Gupta, “CARE: Cooperative autonomy for resilience and efficiency of robot teams for complete coverage of unknown environments under robot failures,”Autonomous Robots, vol. 44, pp. 647–671, 2020

    2020

  76. [84]

    Online concurrent multi-robot coverage path planning,

    R. Mitra and I. Saha, “Online concurrent multi-robot coverage path planning,” inIEEE/RSJ International Conference on Intelligent Robots and Systems, 2025, pp. 8691–8698

    2025

  77. [85]

    CCIBA*: An improved BA* based collaborative coverage path planning method for multiple unmanned surface mapping vehicles,

    Y . Ma, Y . Zhao, Z. Li, H. Bi, J. Wang, R. Malekian, and M. A. Sotelo, “CCIBA*: An improved BA* based collaborative coverage path planning method for multiple unmanned surface mapping vehicles,” IEEE Transactions on Intelligent Transportation Systems, vol. 23, no. 10, pp. 19 ...

    2022

  78. [86]

    MAC- Planner: A novel task allocation and path planning framework for multi-robot online coverage processes,

    Z. Wang, X. Lyu, J. Zhang, P. Wang, Y . Zhong, and L. Shi, “MAC- Planner: A novel task allocation and path planning framework for multi-robot online coverage processes,”IEEE Robotics and Automation Letters, vol. 10, no. 5, pp. 4404–4411, 2025

    2025

  79. [87]

    Complete coverage search for multiple autonomous underwater vehicles based on neuronal activity reassignment,

    Z. Cao, H. Fan, X. Hu, Y . Chen, and S. Kang, “Complete coverage search for multiple autonomous underwater vehicles based on neuronal activity reassignment,”IEEE Transactions on Intelligent Transportation Systems, vol. 26, no. 7, pp. 9693–9710, 2025

    2025

  80. [88]

    Multi-CAP: A multi-robot connectivity-aware hierarchical coverage path planning algorithm for unknown environments,

    Z. Shen, B. Shirose, P. Sriganesh, B. Vundurthy, H. Choset, and M. Travers, “Multi-CAP: A multi-robot connectivity-aware hierarchical coverage path planning algorithm for unknown environments,”arXiv preprint arXiv:2509.14941, 2025

    2025

  81. [89]

    Scalable online coverage path planning for multi- robot systems,

    R. Mitra and I. Saha, “Scalable online coverage path planning for multi- robot systems,” inIEEE/RSJ International Conference on Intelligent Robots and Systems, 2022, pp. 10 102–10 109

    2022

  82. [90]

    Online on-demand multi-robot coverage path planning,

    R. Mitra and I. Saha, “Online on-demand multi-robot coverage path planning,” inIEEE International Conference on Robotics and Automa- tion, 2024, pp. 14 583–14 589

    2024

  83. [91]

    DMT-CPP: A delaunay-graph-based framework for real-time multi-robot online target coverage,

    P. Wang, Z. Wang, L. Shi, and M. Q.-H. Meng, “DMT-CPP: A delaunay-graph-based framework for real-time multi-robot online target coverage,”IEEE Robotics and Automation Letters, 2026

    2026

  84. [92]

    Recursive non-uniform coverage of unknown terrains for UA Vs,

    S. A. Sadat, J. Wawerla, and R. T. Vaughan, “Recursive non-uniform coverage of unknown terrains for UA Vs,” inIEEE/RSJ international conference on intelligent robots and systems, 2014, pp. 1742–1747

    2014

  85. [93]

    Fractal trajectories for online non-uniform aerial coverage,

    S. A. Sadat, J. Wawerla, and R. Vaughan, “Fractal trajectories for online non-uniform aerial coverage,” inIEEE International Conference on Robotics and Automation, 2015, pp. 2971–2976

    2015

  86. [94]

    Multi-layer coverage path planner for autonomous structural inspection of high-rise structures,

    S. Jung, S. Song, P. Youn, and H. Myung, “Multi-layer coverage path planner for autonomous structural inspection of high-rise structures,” in IEEE/RSJ International Conference on Intelligent Robots and Systems, 2018, pp. 1–9

    2018

  87. [95]

    An autonomous integrated system for 3-D underwater terrain map reconstruction,

    Z. Shen, J. Song, K. Mittal, and S. Gupta, “An autonomous integrated system for 3-D underwater terrain map reconstruction,” inProceedings OCEANS’16 MTS/IEEE, 2016, pp. 1–6

    2016

  88. [96]

    Autonomous 3-D mapping and safe-path planning for underwater terrain reconstruction using multi-level coverage trees,

    Z. Shen, J. Song, K. Mittal, and S. Gupta, “Autonomous 3-D mapping and safe-path planning for underwater terrain reconstruction using multi-level coverage trees,” inProceedings OCEANS’17 MTS/IEEE, 2017, pp. 1–6

    2017

  89. [97]

    Coverage path planning with real-time replanning and surface reconstruction for inspection of three-dimensional underwater structures using autonomous underwater vehicles,

    E. Galceran, R. Campos, N. Palomeras, D. Ribas, M. Carreras, and P. Ridao, “Coverage path planning with real-time replanning and surface reconstruction for inspection of three-dimensional underwater structures using autonomous underwater vehicles,”Journal of Field Robotics, vo...

    2015

  90. [98]

    Energy-efficient coverage path planning for general terrain surfaces,

    C. Wu, C. Dai, X. Gong, Y .-J. Liu, J. Wang, X. D. Gu, and C. C. Wang, “Energy-efficient coverage path planning for general terrain surfaces,” IEEE Robotics and Automation Letters, vol. 4, no. 3, pp. 2584–2591, 2019

    2019

  91. [99]

    Energy-aware UA V coverage planning in mountainous terrain via contour-aligned path generation,

    Q. Shao, X. Mao, and W. Xu, “Energy-aware UA V coverage planning in mountainous terrain via contour-aligned path generation,”IEEE Robotics and Automation Letters, vol. 10, no. 12, pp. 12 373–12 380, 2025

    2025

  92. [100]

    Robot coverage path planning for general surfaces using quadratic differentials,

    Y .-Y . Lin, C.-C. Ni, N. Lei, X. David Gu, and J. Gao, “Robot coverage path planning for general surfaces using quadratic differentials,” in IEEE International Conference on Robotics and Automation, 2017, pp. 5005–5011

    2017

  93. [101]

    Hierarchically accelerated coverage path planning for redundant manipulators,

    Y . Wang and M. Gleicher, “Hierarchically accelerated coverage path planning for redundant manipulators,” inIEEE International Confer- ence on Robotics and Automation, 2025, pp. 12 098–12 104

    2025

  94. [102]

    Optimal object placement for minimum discontinuity non-revisiting coverage task,

    T. Yang, J. V . Miro, Y . Wang, and R. Xiong, “Optimal object placement for minimum discontinuity non-revisiting coverage task,” inIEEE International Conference on Robotics and Automation, 2021, pp. 8422– 8428

    2021

  95. [103]

    Optimal non-redundant manipulator surface coverage with rank-deficient ma- nipulability constraints

    T. Yang, L. Huang, J. V . Mir ´o, Y . Wang, and R. Xiong, “Optimal non-redundant manipulator surface coverage with rank-deficient ma- nipulability constraints.” inRobotics: Science and Systems, 2024

    2024

  96. [104]

    An improved maximal continuity graph solver for non-redundant manipulator non-revisiting coverage,

    T. Yang, J. V . Miro, Y . Wang, and R. Xiong, “An improved maximal continuity graph solver for non-redundant manipulator non-revisiting coverage,”IEEE Transactions on Automation Science and Engineering, vol. 22, pp. 3822–3834, 2024

    2024

  97. [105]

    Template- free nonrevisiting uniform coverage path planning on curved surfaces,

    T. Yang, J. V . Miro, M. Nguyen, Y . Wang, and R. Xiong, “Template- free nonrevisiting uniform coverage path planning on curved surfaces,” IEEE/ASME Transactions on Mechatronics, vol. 28, no. 4, pp. 1853– 1861, 2023

    2023

  98. [106]

    Geometry-aware coverage path planning for depowdering on complex 3D surfaces,

    V .-T. Do and Q.-C. Pham, “Geometry-aware coverage path planning for depowdering on complex 3D surfaces,”IEEE Robotics and Automation Letters, vol. 8, no. 9, pp. 5552–5559, 2023

    2023

  99. [107]

    Con- strained CVT meshes and a comparison of triangular mesh generators,

    H. Nguyen, J. Burkardt, M. Gunzburger, L. Ju, and Y . Saka, “Con- strained CVT meshes and a comparison of triangular mesh generators,” Computational Geometry, vol. 42, no. 1, pp. 1–19, 2009

    2009

  100. [108]

    Online coverage of planar environments by a battery powered autonomous mobile robot,

    I. Shnaps and E. Rimon, “Online coverage of planar environments by a battery powered autonomous mobile robot,”IEEE Transactions on Automation Science and Engineering, vol. 13, no. 2, pp. 425–436, 2016

    2016

  101. [109]

    Online coverage by a tethered autonomous mobile robot in planar unknown environments,

    I. Shnaps and E. Rimon, “Online coverage by a tethered autonomous mobile robot in planar unknown environments,”IEEE Transactions on Robotics, vol. 30, no. 4, pp. 966–974, 2014

    2014

  102. [110]

    Coverage path planning under the energy con- straint,

    M. Wei and V . Isler, “Coverage path planning under the energy con- straint,” inIEEE International Conference on Robotics and Automation, 2018, pp. 368–373

    2018

  103. [111]

    ϵ ⋆+: An online coverage path planning algorithm for energy-constrained autonomous vehicles,

    Z. Shen, J. P. Wilson, and S. Gupta, “ϵ ⋆+: An online coverage path planning algorithm for energy-constrained autonomous vehicles,” in Global Oceans 2020: Singapore – U.S. Gulf Coast, 2020, pp. 1–6

    2020

  104. [112]

    A formal basis for the heuristic determination of minimum cost paths,

    P. E. Hart, N. J. Nilsson, and B. Raphael, “A formal basis for the heuristic determination of minimum cost paths,”IEEE Transactions on Systems, Man, and Cybernetics, vol. 4, no. 2, pp. 100–107, 1968

    1968

  105. [113]

    ECO-CPP: Energy constrained online coverage path planning,

    S. Dogru and L. Marques, “ECO-CPP: Energy constrained online coverage path planning,”Robotics and Autonomous Systems, vol. 157, p. 104242, 2022

    2022

  106. [114]

    Near-optimal area- coverage path planning of energy-constrained aerial robots with appli- cation in autonomous environmental monitoring,

    K. R. Jensen-Nau, T. Hermans, and K. K. Leang, “Near-optimal area- coverage path planning of energy-constrained aerial robots with appli- cation in autonomous environmental monitoring,”IEEE Transactions on Automation Science and Engineering, vol. 18, no. 3, pp. 1453–1468, 2020

    2020

  107. [115]

    The haidou-1 hybrid underwater vehicle for the mariana trench science exploration to 10,908 m depth,

    J. Wang, Y . Tang, S. Li, Y . Lu, J. Li, T. Liu, Z. Jiang, C. Chen, Y . Cheng, D. Yuet al., “The haidou-1 hybrid underwater vehicle for the mariana trench science exploration to 10,908 m depth,”Journal of Field Robotics, vol. 41, no. 4, pp. 1054–1079, 2024

    2024

  108. [116]

    Configuration identification for a freeform modu- lar self-reconfigurable robot-FreeSN,

    Y . Tu and T. L. Lam, “Configuration identification for a freeform modu- lar self-reconfigurable robot-FreeSN,”IEEE Transactions on Robotics, vol. 39, no. 6, pp. 4636–4652, 2023

    2023

  109. [117]

    AG-CVG: Coverage planning with a mobile recharging ugv and an energy-constrained UA V ,

    N. Karapetyan, A. B. Asghar, A. Bhaskar, G. Shi, D. Manocha, and P. Tokekar, “AG-CVG: Coverage planning with a mobile recharging ugv and an energy-constrained UA V ,” inIEEE International Conference on Robotics and Automation, 2024, pp. 2617–2623. 21

    2024

  110. [118]

    On curves of minimal length with a constraint on average curvature, and with prescribed initial and terminal positions and tangents,

    L. E. Dubins, “On curves of minimal length with a constraint on average curvature, and with prescribed initial and terminal positions and tangents,”American Journal of Mathematics, vol. 79, no. 3, pp. 497–516, 1957

    1957

  111. [119]

    Generalized multi-speed dubins motion model,

    J. P. Wilson, S. Gupta, and T. A. Wettergren, “Generalized multi-speed dubins motion model,”IEEE Transactions on Robotics, vol. 41, pp. 2861–2878, 2025

    2025

  112. [120]

    An online coverage path planning algorithm for curvature-constrained AUVs,

    Z. Shen, J. P. Wilson, and S. Gupta, “An online coverage path planning algorithm for curvature-constrained AUVs,” inOCEANS 2019 MTS/IEEE SEATTLE. IEEE, 2019, pp. 1–5

    2019

  113. [121]

    Online exploration and coverage planning in unknown obstacle-cluttered environments,

    X. Kan, H. Teng, and K. Karydis, “Online exploration and coverage planning in unknown obstacle-cluttered environments,”IEEE Robotics and Automation Letters, vol. 5, no. 4, pp. 5969–5976, 2020

    2020

  114. [122]

    Semi-boustrophedon coverage with a dubins vehicle,

    J. S. Lewis, W. Edwards, K. Benson, I. Rekleitis, and J. M. O’Kane, “Semi-boustrophedon coverage with a dubins vehicle,” inIEEE/RSJ International Conference on Intelligent Robots and Systems, 2017, pp. 5630–5637

    2017

  115. [123]

    Multi-robot dubins coverage with autonomous surface ve- hicles,

    N. Karapetyan, J. Moulton, J. S. Lewis, A. Q. Li, J. M. O’Kane, and I. Rekleitis, “Multi-robot dubins coverage with autonomous surface ve- hicles,” inIEEE International Conference on Robotics and Automation, 2018, pp. 2373–2379

    2018

  116. [124]

    Collision-free coverage path planning for the variable-speed curvature- constrained robot,

    L. Li, D. Shi, S. Jin, Y . Sun, X. Zhou, S. Yang, and H. Liu, “Collision-free coverage path planning for the variable-speed curvature- constrained robot,” inIEEE International Conference on Robotics and Automation, 2023, pp. 3600–3606

    2023

  117. [125]

    NEPTUNE: Nonentangling trajectory planning for multiple tethered unmanned vehicles,

    M. Cao, K. Cao, S. Yuan, T.-M. Nguyen, and L. Xie, “NEPTUNE: Nonentangling trajectory planning for multiple tethered unmanned vehicles,”IEEE Transactions on Robotics, vol. 39, no. 4, pp. 2786– 2804, 2023

    2023

  118. [126]

    A 2-approximation algorithm for the online tethered coverage problem

    G. Sharma, P. Poudel, A. Dutta, V . Zeinali, T. T. Khoei, and J.-H. Kim, “A 2-approximation algorithm for the online tethered coverage problem.” inRobotics: Science and systems, 2019

    2019

  119. [127]

    Spanning- tree based coverage for a tethered robot,

    X. Peng, F. Schwarzentruber, O. Simonin, and C. Solnon, “Spanning- tree based coverage for a tethered robot,”IEEE Robotics and Automa- tion Letters, vol. 10, no. 2, pp. 1888–1895, 2025

    2025

  120. [128]

    Online complete coverage path planning of a reconfigurable robot using gla- sius bio-inspired neural network and genetic algorithm,

    S. B. P. Samarakoon, M. V . J. Muthugala, and M. R. Elara, “Online complete coverage path planning of a reconfigurable robot using gla- sius bio-inspired neural network and genetic algorithm,” inIEEE/RSJ International Conference on Intelligent Robots and Systems, 2022, pp. 5744–5751

    2022

  121. [129]

    Online coverage path planning scheme for a size-variable robot,

    M. V . J. Muthugala, S. B. P. Samarakoon, and M. R. Elara, “Online coverage path planning scheme for a size-variable robot,” inIEEE International Conference on Robotics and Automation, 2023, pp. 5688– 5694

    2023

  122. [130]

    Improving coverage performance of a size-reconfigurable robot based on overlapping and reconfiguration reduction criteria,

    M. V . J. Muthugala, S. B. P. Samarakoon, I. Wijegunawardana, and M. R. Elara, “Improving coverage performance of a size-reconfigurable robot based on overlapping and reconfiguration reduction criteria,” in IEEE International Conference on Robotics and Automation, 2025, pp. 7902–7908

    2025

  123. [131]

    Complete coverage path planning for omnidirectional self- reconfigurable cleaning robot usingaGBNN,

    L. Yi, A. A. Hayat, A. W. Y . Sang, A. V . Le, T. Qinrui, and M. R. Elara, “Complete coverage path planning for omnidirectional self- reconfigurable cleaning robot usingaGBNN,”IEEE Transactions on Automation Science and Engineering, vol. 23, pp. 2212–2230, 2026

    2026

  124. [132]

    Adaptive deep path: Efficient coverage of a known environment under various configurations,

    X. Chen, T. M. Tucker, T. R. Kurfess, and R. Vuduc, “Adaptive deep path: Efficient coverage of a known environment under various configurations,” inIEEE/RSJ International Conference on Intelligent Robots and Systems, 2019, pp. 3549–3556

    2019

  125. [133]

    CPPNet: A coverage path planning network,

    Z. Shen, P. Agrawal, J. P. Wilson, R. Harvey, and S. Gupta, “CPPNet: A coverage path planning network,” inOCEANS 2021: San Diego–Porto. IEEE, 2021, pp. 1–5

    2021

  126. [134]

    PaintNet: Unstructured multi-path learning from 3D point clouds for robotic spray painting,

    G. Tiboni, R. Camoriano, and T. Tommasi, “PaintNet: Unstructured multi-path learning from 3D point clouds for robotic spray painting,” in IEEE/RSJ International Conference on Intelligent Robots and Systems, 2023, pp. 3857–3864

    2023

  127. [135]

    Multi-robot coverage and exploration using spatial graph neural networks,

    E. Tolstaya, J. Paulos, V . Kumar, and A. Ribeiro, “Multi-robot coverage and exploration using spatial graph neural networks,” inIEEE/RSJ International Conference on Intelligent Robots and Systems, 2021, pp. 8944–8950

    2021

  128. [136]

    Multi-UA V coverage path planning: A distributed online cooperation method,

    W. Hu, Y . Yu, S. Liu, C. She, L. Guo, B. Vucetic, and Y . Li, “Multi-UA V coverage path planning: A distributed online cooperation method,”IEEE Transactions on Vehicular Technology, vol. 72, no. 9, pp. 11 727–11 740, 2023

    2023

  129. [137]

    Energy constrained multi-agent reinforcement learning for coverage path plan- ning,

    C. Zhao, J. Liu, S.-U. Yoon, X. Li, H. Li, and Z. Zhang, “Energy constrained multi-agent reinforcement learning for coverage path plan- ning,” inIEEE/RSJ International Conference on Intelligent Robots and Systems, 2023, pp. 5590–5597

    2023

  130. [138]

    A hierarchical multi robot coverage strategy for large maps with reinforcement learning and dense segmented siamese network,

    Y . Huang, Y . Wang, Z. Li, H. Zhang, and C. Zhang, “A hierarchical multi robot coverage strategy for large maps with reinforcement learning and dense segmented siamese network,”IEEE Robotics and Automation Letters, vol. 10, no. 1, pp. 444–451, 2025

    2025

  131. [139]

    UA V coverage path planning under varying power constraints using deep reinforcement learning,

    M. Theile, H. Bayerlein, R. Nai, D. Gesbert, and M. Caccamo, “UA V coverage path planning under varying power constraints using deep reinforcement learning,” inIEEE/RSJ International Conference on Intelligent Robots and Systems, 2020, pp. 1444–1449

    2020

  132. [140]

    Learning to coordinate for a worker- station multi-robot system in planar coverage tasks,

    J. Tang, Y . Gao, and T. L. Lam, “Learning to coordinate for a worker- station multi-robot system in planar coverage tasks,”IEEE Robotics and Automation Letters, vol. 7, no. 4, pp. 12 315–12 322, 2022

    2022

  133. [141]

    A decentralized partially observable markov decision process for dynamic obstacle avoidance and complete area coverage using multiple reconfigurable robots,

    J. J. J. Pey, S. B. P. Samarakoon, M. V . J. Muthugala, and M. R. Elara, “A decentralized partially observable markov decision process for dynamic obstacle avoidance and complete area coverage using multiple reconfigurable robots,” inIEEE/RSJ International Conference on Intell...

    2024

  134. [142]

    Online coverage and inspection planning for 3D modeling,

    S. Song, D. Kim, and S. Jo, “Online coverage and inspection planning for 3D modeling,”Autonomous Robots, vol. 44, no. 8, pp. 1431–1450, 2020

    2020

  135. [143]

    Three-dimensional coverage planning for an underwater inspection robot,

    B. Englot and F. S. Hover, “Three-dimensional coverage planning for an underwater inspection robot,”International Journal of Robotics Research, vol. 32, no. 9-10, pp. 1048–1073, 2013

    2013

  136. [144]

    Sampling-based view planning for 3D visual coverage task with unmanned aerial vehicle,

    W. Jing, J. Polden, W. Lin, and K. Shimada, “Sampling-based view planning for 3D visual coverage task with unmanned aerial vehicle,” in IEEE/RSJ International Conference on Intelligent Robots and Systems, 2016, pp. 1808–1815

    2016

  137. [145]

    Sampling-based coverage motion planning for industrial inspection application with redundant robotic system,

    W. Jing, J. Polden, C. F. Goh, M. Rajaraman, W. Lin, and K. Shimada, “Sampling-based coverage motion planning for industrial inspection application with redundant robotic system,” inIEEE/RSJ International Conference on Intelligent Robots and Systems, 2017, pp. 5211–5218

    2017

  138. [146]

    Coverage path planning using path primitive sampling and primitive coverage graph for visual inspection,

    W. Jing, D. Deng, Z. Xiao, Y . Liu, and K. Shimada, “Coverage path planning using path primitive sampling and primitive coverage graph for visual inspection,” inIEEE/RSJ International Conference on Intelligent Robots and Systems, 2019, pp. 1472–1479

    2019

  139. [147]

    Multi-UA V coverage path planning for the inspection of large and complex structures,

    W. Jing, D. Deng, Y . Wu, and K. Shimada, “Multi-UA V coverage path planning for the inspection of large and complex structures,” in IEEE/RSJ International Conference on Intelligent Robots and Systems, 2020, pp. 1480–1486

    2020

  140. [148]

    A new clustering-based view planning method for building inspection with drone,

    Y . Zheng, G. Liu, Y . Ding, and G. Tian, “A new clustering-based view planning method for building inspection with drone,”IEEE Robotics and Automation Letters, vol. 9, no. 11, pp. 9781–9788, 2024

    2024

  141. [149]

    A novel view planning with joint optimization for efficient 3D building inspection,

    T. Zhang, G. Liu, and G. Tian, “A novel view planning with joint optimization for efficient 3D building inspection,”IEEE Robotics and Automation Letters, vol. 11, no. 2, pp. 1162–1169, 2026

    2026

  142. [150]

    Multifactorial evolution: Toward evolutionary multitasking,

    A. Gupta, Y .-S. Ong, and L. Feng, “Multifactorial evolution: Toward evolutionary multitasking,”IEEE Transactions on Evolutionary Com- putation, vol. 20, no. 3, pp. 343–357, 2015

    2015

  143. [151]

    Three-dimensional coverage path planning via viewpoint resampling and tour optimization for aerial robots,

    A. Bircher, M. Kamel, K. Alexis, M. Burri, P. Oettershagen, S. Omari, T. Mantel, and R. Siegwart, “Three-dimensional coverage path planning via viewpoint resampling and tour optimization for aerial robots,” Autonomous Robots, vol. 40, no. 6, pp. 1059–1078, 2016

    2016

  144. [152]

    Coverage path planning with adaptive viewpoint sampling to construct 3D models of complex structures for the purpose of inspection,

    R. Almadhoun, T. Taha, D. Gan, J. Dias, Y . Zweiri, and L. Seneviratne, “Coverage path planning with adaptive viewpoint sampling to construct 3D models of complex structures for the purpose of inspection,” in IEEE/RSJ International Conference on Intelligent Robots and Systems,...

    2018

  145. [153]

    Optimization based multi- view coverage path planning for autonomous structure from motion recordings,

    S. Lindner, C. Garbe, and K. Mombaur, “Optimization based multi- view coverage path planning for autonomous structure from motion recordings,”IEEE Robotics and Automation Letters, vol. 4, no. 4, pp. 3278–3285, 2019

    2019

  146. [154]

    Coverage path planning for robotic quality inspection with control on measurement uncertainty,

    Y . Liu, W. Zhao, H. Liu, Y . Wang, and X. Yue, “Coverage path planning for robotic quality inspection with control on measurement uncertainty,”IEEE/ASME Transactions on Mechatronics, vol. 27, no. 5, pp. 3482–3493, 2022

    2022

  147. [155]

    Hierarchical coverage path planning in complex 3D environments,

    C. Cao, J. Zhang, M. Travers, and H. Choset, “Hierarchical coverage path planning in complex 3D environments,” inIEEE International Conference on Robotics and Automation, 2020, pp. 3206–3212

    2020

  148. [156]

    Sweep-Your-Map: Efficient coverage planning for aerial teams in large-scale environments,

    D. Morilla-Cabello, L. Bartolomei, L. Teixeira, E. Montijano, and M. Chli, “Sweep-Your-Map: Efficient coverage planning for aerial teams in large-scale environments,”IEEE Robotics and Automation Letters, vol. 7, no. 4, pp. 10 810–10 817, 2022

    2022

  149. [157]

    SMART: Self- morphing adaptive replanning tree,

    Z. Shen, J. P. Wilson, S. Gupta, and R. Harvey, “SMART: Self- morphing adaptive replanning tree,”IEEE Robotics and Automation Letters, vol. 8, no. 11, pp. 7312–7319, 2023

    2023

  150. [158]

    Motion planning in dynamic environments: A survey from classical to modern methods,

    Z. Shen, Y . Ou, S. Gupta, S. Zhao, D. Zhou, G. Wang, Z. Ren, J. Fan, and L. Cheng, “Motion planning in dynamic environments: A survey from classical to modern methods,”arXiv preprint arXiv:2606.02677, 2026

    2026 arXiv

Pith tools

Reviewed July 14, 2026 · model on record in the stance chip above.