{"as_of":"2026-08-21T05:15:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:5c49af19635379f1924a4277e18e570bca39a9049c9517e43db6f94cad6c78b1","coverage":[{"denominator":158,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":100,"source":"paper_references, paper_reference_links","source_observed_at":"2026-07-14T10:13:59.462645Z","state":"measured"},{"denominator":100,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":100,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-20T06:33:59.587034+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2607.10649/citation-record","integrity":"/paper/2607.10649/integrity","json":"/paper/2607.10649/citation-record.json","paper":"/paper/2607.10649"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T10:13:59.462645Z","title":"Anytime replanning of robot coverage paths for partially unknown environments,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.10649","last_updated":"2026-07-12T08:33:42Z","snapshot_observed_at":"2026-08-14T09:47:44.872181Z","submitted_at":"2026-07-12T08:33:42Z","title":"Coverage Path Planning: Classical Foundations, Recent Advances, and Future Directions","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-07-14T10:13:59.462645Z"},"links":{"citing_paper":"/paper/2607.10649"},"observation_digest":"sha256:6a942aebe62e299a206b63432dfd9cf5927f2a1bc42643e2ff0ab90da2493c5f","observation_id":"7659da23-de32-45e7-a34a-9aa0cee3187e","resolution":{"observed_at":"2026-07-14T10:13:59.462645Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T10:13:59.462645Z","title":"SLAM based shape adaptive coverage control using autonomous vehicles,","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2607.10649","last_updated":"2026-07-12T08:33:42Z","snapshot_observed_at":"2026-08-14T09:47:44.872181Z","submitted_at":"2026-07-12T08:33:42Z","title":"Coverage Path Planning: Classical Foundations, Recent Advances, and Future Directions","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-07-14T10:13:59.462645Z"},"links":{"citing_paper":"/paper/2607.10649"},"observation_digest":"sha256:2d923484a7bf1df5e004d9ae700af8b1ec3d8f80bd967415044322bbb83735cc","observation_id":"be9b54b5-6e32-4d0c-b164-b3b13abc531f","resolution":{"observed_at":"2026-07-14T10:13:59.462645Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T10:13:59.462645Z","title":"Autonomous mapping of underwater 3-D structures: From view planning to execu- tion,","venue":null,"work_id":null,"year":1965},"citing_paper":{"arxiv_id":"2607.10649","last_updated":"2026-07-12T08:33:42Z","snapshot_observed_at":"2026-08-14T09:47:44.872181Z","submitted_at":"2026-07-12T08:33:42Z","title":"Coverage Path Planning: Classical Foundations, Recent Advances, and Future Directions","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-07-14T10:13:59.462645Z"},"links":{"citing_paper":"/paper/2607.10649"},"observation_digest":"sha256:29a2a1547076f14e3f905e88792d9cedf4f66a98275771e2ad94ffb7d45312c4","observation_id":"fe577f22-086c-4b0e-b443-74b128c9dd3d","resolution":{"observed_at":"2026-07-14T10:13:59.462645Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T10:13:59.462645Z","title":"Coverage path planning with track spacing adaptation for autonomous underwater vehicles,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.10649","last_updated":"2026-07-12T08:33:42Z","snapshot_observed_at":"2026-08-14T09:47:44.872181Z","submitted_at":"2026-07-12T08:33:42Z","title":"Coverage Path Planning: Classical Foundations, Recent Advances, and Future Directions","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-07-14T10:13:59.462645Z"},"links":{"citing_paper":"/paper/2607.10649"},"observation_digest":"sha256:52ad7f164c93325531ef6ed3aa3918ddd4e3b449218590e714de1f99d63d5620","observation_id":"c35ad7e1-e1b1-4c9b-af47-0a775bdd9f6f","resolution":{"observed_at":"2026-07-14T10:13:59.462645Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T10:13:59.462645Z","title":"Structured light-based underwater collision-free navigation and dense mapping system for refined exploration in unknown dark environ- ments,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.10649","last_updated":"2026-07-12T08:33:42Z","snapshot_observed_at":"2026-08-14T09:47:44.872181Z","submitted_at":"2026-07-12T08:33:42Z","title":"Coverage Path Planning: Classical Foundations, Recent Advances, and Future Directions","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-07-14T10:13:59.462645Z"},"links":{"citing_paper":"/paper/2607.10649"},"observation_digest":"sha256:01b28e8e58c59d6dc5ac9b98829ec705d3f410b4cb3e3130d050255e533d9df1","observation_id":"1c02282c-444d-46d5-9bc8-c92c8ae038c7","resolution":{"observed_at":"2026-07-14T10:13:59.462645Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T10:13:59.462645Z","title":"CT-CPP: Coverage path planning for 3D terrain reconstruction using dynamic coverage trees,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.10649","last_updated":"2026-07-12T08:33:42Z","snapshot_observed_at":"2026-08-14T09:47:44.872181Z","submitted_at":"2026-07-12T08:33:42Z","title":"Coverage Path Planning: Classical Foundations, Recent Advances, and Future Directions","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-07-14T10:13:59.462645Z"},"links":{"citing_paper":"/paper/2607.10649"},"observation_digest":"sha256:377b2386ffad37e98eadfb860da3a11a5ae88ff5a2816f6c1f1abaf8b0ffa5d0","observation_id":"88f6c82a-9835-4336-95cc-57ea4101d7a9","resolution":{"observed_at":"2026-07-14T10:13:59.462645Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T10:13:59.462645Z","title":"FC- Planner: A skeleton-guided planning framework for fast aerial coverage of complex 3D scenes,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.10649","last_updated":"2026-07-12T08:33:42Z","snapshot_observed_at":"2026-08-14T09:47:44.872181Z","submitted_at":"2026-07-12T08:33:42Z","title":"Coverage Path Planning: Classical Foundations, Recent Advances, and Future Directions","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-07-14T10:13:59.462645Z"},"links":{"citing_paper":"/paper/2607.10649"},"observation_digest":"sha256:7429a9730cb505fd6519159610372523e8d83b0388a81dbd3e75a58a0d939f92","observation_id":"a2989b19-e3a1-46c3-a116-b8c65f5c6ada","resolution":{"observed_at":"2026-07-14T10:13:59.462645Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T10:13:59.462645Z","title":"Online view planning for inspecting unexplored underwater structures","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2607.10649","last_updated":"2026-07-12T08:33:42Z","snapshot_observed_at":"2026-08-14T09:47:44.872181Z","submitted_at":"2026-07-12T08:33:42Z","title":"Coverage Path Planning: Classical Foundations, Recent Advances, and Future Directions","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-07-14T10:13:59.462645Z"},"links":{"citing_paper":"/paper/2607.10649"},"observation_digest":"sha256:a5d3b641065eb644ee6e69a4fe1a196acbe8c88dd86049525ebf451031db3a85","observation_id":"b347dd38-c6e5-4429-a42e-c68b8a38be6d","resolution":{"observed_at":"2026-07-14T10:13:59.462645Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T10:13:59.462645Z","title":"Cellular decom- position for nonrepetitive coverage task with minimum discontinuities,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.10649","last_updated":"2026-07-12T08:33:42Z","snapshot_observed_at":"2026-08-14T09:47:44.872181Z","submitted_at":"2026-07-12T08:33:42Z","title":"Coverage Path Planning: Classical Foundations, Recent Advances, and Future Directions","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-07-14T10:13:59.462645Z"},"links":{"citing_paper":"/paper/2607.10649"},"observation_digest":"sha256:f6f26c8408c0dde0330639c2d75e2307cb61b77cfa1b4353d40a40b7f8c7a439","observation_id":"b3f1c126-2eb3-48f3-aa77-db95676de012","resolution":{"observed_at":"2026-07-14T10:13:59.462645Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T10:13:59.462645Z","title":"Complete and near-optimal path planning for simultaneous sensor-based inspection and footprint coverage in robotic crack filling,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.10649","last_updated":"2026-07-12T08:33:42Z","snapshot_observed_at":"2026-08-14T09:47:44.872181Z","submitted_at":"2026-07-12T08:33:42Z","title":"Coverage Path Planning: Classical Foundations, Recent Advances, and Future Directions","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-07-14T10:13:59.462645Z"},"links":{"citing_paper":"/paper/2607.10649"},"observation_digest":"sha256:7a9416af3a0d550a43062f6c7d6395c5eead2493edd19fa1e951d8b6cdf671d2","observation_id":"bb7a2365-7a15-403b-bdeb-996520866789","resolution":{"observed_at":"2026-07-14T10:13:59.462645Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T10:13:59.462645Z","title":"Complete and near- optimal robotic crack coverage and filling in civil infrastructure,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.10649","last_updated":"2026-07-12T08:33:42Z","snapshot_observed_at":"2026-08-14T09:47:44.872181Z","submitted_at":"2026-07-12T08:33:42Z","title":"Coverage Path Planning: Classical Foundations, Recent Advances, and Future Directions","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-07-14T10:13:59.462645Z"},"links":{"citing_paper":"/paper/2607.10649"},"observation_digest":"sha256:9aabb324e78df67071265e7ee7215773dfe224b8af9723ebb71de9ed5ecb81b2","observation_id":"2c51df95-0e56-4199-91f2-d419f745172b","resolution":{"observed_at":"2026-07-14T10:13:59.462645Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T10:13:59.462645Z","title":"PaintCopter: An autonomous UA V for spray painting on three-dimensional surfaces,","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2607.10649","last_updated":"2026-07-12T08:33:42Z","snapshot_observed_at":"2026-08-14T09:47:44.872181Z","submitted_at":"2026-07-12T08:33:42Z","title":"Coverage Path Planning: Classical Foundations, Recent Advances, and Future Directions","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-07-14T10:13:59.462645Z"},"links":{"citing_paper":"/paper/2607.10649"},"observation_digest":"sha256:ca73e34db0dab65bd87da096b39cdc3241ddb71756d713f14eea6c2ef7725cc3","observation_id":"4429b176-0395-417f-a42e-8d20a4bee7df","resolution":{"observed_at":"2026-07-14T10:13:59.462645Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T10:13:59.462645Z","title":"Uniform coverage of automotive surface patches,","venue":null,"work_id":null,"year":2005},"citing_paper":{"arxiv_id":"2607.10649","last_updated":"2026-07-12T08:33:42Z","snapshot_observed_at":"2026-08-14T09:47:44.872181Z","submitted_at":"2026-07-12T08:33:42Z","title":"Coverage Path Planning: Classical Foundations, Recent Advances, and Future Directions","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-07-14T10:13:59.462645Z"},"links":{"citing_paper":"/paper/2607.10649"},"observation_digest":"sha256:c84f43102d2d26a7ec9ecb4b467c031a07748d1af42730d3e73cd06a1813158e","observation_id":"4a663262-59bf-465b-8480-7f4b2457f777","resolution":{"observed_at":"2026-07-14T10:13:59.462645Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T10:13:59.462645Z","title":"Online coverage planning for an autonomous weed mowing robot with curvature constraints,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.10649","last_updated":"2026-07-12T08:33:42Z","snapshot_observed_at":"2026-08-14T09:47:44.872181Z","submitted_at":"2026-07-12T08:33:42Z","title":"Coverage Path Planning: Classical Foundations, Recent Advances, and Future Directions","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-07-14T10:13:59.462645Z"},"links":{"citing_paper":"/paper/2607.10649"},"observation_digest":"sha256:1f04c9b9651507c8666994ffa7db59fb72251194e6c7102304498bdc655c7c6c","observation_id":"c576bba3-16fb-480e-91e3-327498734b7f","resolution":{"observed_at":"2026-07-14T10:13:59.462645Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T10:13:59.462645Z","title":"Coverage path planning on three-dimensional terrain for arable farming,","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2607.10649","last_updated":"2026-07-12T08:33:42Z","snapshot_observed_at":"2026-08-14T09:47:44.872181Z","submitted_at":"2026-07-12T08:33:42Z","title":"Coverage Path Planning: Classical Foundations, Recent Advances, and Future Directions","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-07-14T10:13:59.462645Z"},"links":{"citing_paper":"/paper/2607.10649"},"observation_digest":"sha256:b21b9108035f3527e0e431c1bfd9ff130337db95fa5f852d5ca09b4fdc463729","observation_id":"fe0738e6-3851-41be-970f-9cfe59edde32","resolution":{"observed_at":"2026-07-14T10:13:59.462645Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T10:13:59.462645Z","title":"Adaptive cleaning of oil spills by autonomous vehicles under partial information,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.10649","last_updated":"2026-07-12T08:33:42Z","snapshot_observed_at":"2026-08-14T09:47:44.872181Z","submitted_at":"2026-07-12T08:33:42Z","title":"Coverage Path Planning: Classical Foundations, Recent Advances, and Future Directions","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-07-14T10:13:59.462645Z"},"links":{"citing_paper":"/paper/2607.10649"},"observation_digest":"sha256:b47a6514163f2a8082045cab54825dd594f1204d2d4e42bc590820b90adcfd81","observation_id":"1264e3ef-4eb4-4be3-9a17-ef8db8fb1710","resolution":{"observed_at":"2026-07-14T10:13:59.462645Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T10:13:59.462645Z","title":"Symbolic analysis of sonar data for underwater target detection,","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2607.10649","last_updated":"2026-07-12T08:33:42Z","snapshot_observed_at":"2026-08-14T09:47:44.872181Z","submitted_at":"2026-07-12T08:33:42Z","title":"Coverage Path Planning: Classical Foundations, Recent Advances, and Future Directions","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-07-14T10:13:59.462645Z"},"links":{"citing_paper":"/paper/2607.10649"},"observation_digest":"sha256:d32ab2c22cfdea7dca5755a373492b4afb259690d13a0377cc6697e7af3b28b9","observation_id":"892a09f4-4508-4fda-94a5-e2652f4a7c1a","resolution":{"observed_at":"2026-07-14T10:13:59.462645Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T10:13:59.462645Z","title":"C ∗: A coverage path planning algorithm for unknown environments using rapidly covering graphs,","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.10649","last_updated":"2026-07-12T08:33:42Z","snapshot_observed_at":"2026-08-14T09:47:44.872181Z","submitted_at":"2026-07-12T08:33:42Z","title":"Coverage Path Planning: Classical Foundations, Recent Advances, and Future Directions","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-07-14T10:13:59.462645Z"},"links":{"citing_paper":"/paper/2607.10649"},"observation_digest":"sha256:f8653ef41f27a0db7547704463429163d177721b16ff1c22c5f69d06f024f254","observation_id":"cb43cb09-ab2e-4771-bba8-3b44403ab4eb","resolution":{"observed_at":"2026-07-14T10:13:59.462645Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T10:13:59.462645Z","title":"Coverage for robotics–a survey of recent results,","venue":null,"work_id":null,"year":2001},"citing_paper":{"arxiv_id":"2607.10649","last_updated":"2026-07-12T08:33:42Z","snapshot_observed_at":"2026-08-14T09:47:44.872181Z","submitted_at":"2026-07-12T08:33:42Z","title":"Coverage Path Planning: Classical Foundations, Recent Advances, and Future Directions","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-07-14T10:13:59.462645Z"},"links":{"citing_paper":"/paper/2607.10649"},"observation_digest":"sha256:fb5036a2ca171de82d99ed0d6d7796b67f1168e20baa6acaaa7f77f17d02dbc7","observation_id":"fc1d7369-e359-4e14-a71a-dabd86118a6b","resolution":{"observed_at":"2026-07-14T10:13:59.462645Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T10:13:59.462645Z","title":"A survey on coverage path planning for robotics,","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2607.10649","last_updated":"2026-07-12T08:33:42Z","snapshot_observed_at":"2026-08-14T09:47:44.872181Z","submitted_at":"2026-07-12T08:33:42Z","title":"Coverage Path Planning: Classical Foundations, Recent Advances, and Future Directions","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-07-14T10:13:59.462645Z"},"links":{"citing_paper":"/paper/2607.10649"},"observation_digest":"sha256:252123265157f5d243684aadd83fe0362b4e0d10123954b27e15cd111a35ba17","observation_id":"cc01a4dd-6e80-4328-b01f-773da60728dd","resolution":{"observed_at":"2026-07-14T10:13:59.462645Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T10:13:59.462645Z","title":"Indoor coverage path planning: Survey, implementation, analysis,","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2607.10649","last_updated":"2026-07-12T08:33:42Z","snapshot_observed_at":"2026-08-14T09:47:44.872181Z","submitted_at":"2026-07-12T08:33:42Z","title":"Coverage Path Planning: Classical Foundations, Recent Advances, and Future Directions","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-07-14T10:13:59.462645Z"},"links":{"citing_paper":"/paper/2607.10649"},"observation_digest":"sha256:387b5c5c6a5e9b5465bee2a6c841e3cda8beb7144880ed15cb1fd85f0213a98b","observation_id":"463df149-e7ea-4e2c-8053-242c93ad859b","resolution":{"observed_at":"2026-07-14T10:13:59.462645Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T10:13:59.462645Z","title":"Survey on coverage path planning with unmanned aerial vehicles,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.10649","last_updated":"2026-07-12T08:33:42Z","snapshot_observed_at":"2026-08-14T09:47:44.872181Z","submitted_at":"2026-07-12T08:33:42Z","title":"Coverage Path Planning: Classical Foundations, Recent Advances, and Future Directions","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-07-14T10:13:59.462645Z"},"links":{"citing_paper":"/paper/2607.10649"},"observation_digest":"sha256:c31f483bb7636ff10d947db7cea7641b36bc227bfaaa6bed4fa972c3bbfe09af","observation_id":"702368a6-326a-4e35-aaf9-3b6c937830b1","resolution":{"observed_at":"2026-07-14T10:13:59.462645Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T10:13:59.462645Z","title":"Optimal guidance track gen- eration for precision agriculture: A review of coverage path planning techniques,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.10649","last_updated":"2026-07-12T08:33:42Z","snapshot_observed_at":"2026-08-14T09:47:44.872181Z","submitted_at":"2026-07-12T08:33:42Z","title":"Coverage Path Planning: Classical Foundations, Recent Advances, and Future Directions","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-07-14T10:13:59.462645Z"},"links":{"citing_paper":"/paper/2607.10649"},"observation_digest":"sha256:9ae62df7ca5e87c260e7eb3464867c0c12e8341396d1186c7dd7216eb77a8dd0","observation_id":"ad4655d3-398d-4ce8-be06-8a0018309944","resolution":{"observed_at":"2026-07-14T10:13:59.462645Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T10:13:59.462645Z","title":"Optimal partitioning of non-convex environments for minimum turn coverage planning,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.10649","last_updated":"2026-07-12T08:33:42Z","snapshot_observed_at":"2026-08-14T09:47:44.872181Z","submitted_at":"2026-07-12T08:33:42Z","title":"Coverage Path Planning: Classical Foundations, Recent Advances, and Future Directions","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-07-14T10:13:59.462645Z"},"links":{"citing_paper":"/paper/2607.10649"},"observation_digest":"sha256:26121f5d4cd958270aa305c658ee4bf98cace95f59153fd8dba830fd05322d34","observation_id":"338137cd-0006-4380-a59f-096c4644808b","resolution":{"observed_at":"2026-07-14T10:13:59.462645Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T10:13:59.462645Z","title":"Exact cell decomposition,","venue":null,"work_id":null,"year":1991},"citing_paper":{"arxiv_id":"2607.10649","last_updated":"2026-07-12T08:33:42Z","snapshot_observed_at":"2026-08-14T09:47:44.872181Z","submitted_at":"2026-07-12T08:33:42Z","title":"Coverage Path Planning: Classical Foundations, Recent Advances, and Future Directions","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-07-14T10:13:59.462645Z"},"links":{"citing_paper":"/paper/2607.10649"},"observation_digest":"sha256:19aca98a0ca60de2451a940685dc75f8a1d236936aa96b07ee00f9c7d589bc63","observation_id":"c26cb7f3-cb83-4653-973a-e71e728ffaec","resolution":{"observed_at":"2026-07-14T10:13:59.462645Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T10:13:59.462645Z","title":"Coverage of known spaces: The boustrophedon cellular decomposition,","venue":null,"work_id":null,"year":2000},"citing_paper":{"arxiv_id":"2607.10649","last_updated":"2026-07-12T08:33:42Z","snapshot_observed_at":"2026-08-14T09:47:44.872181Z","submitted_at":"2026-07-12T08:33:42Z","title":"Coverage Path Planning: Classical Foundations, Recent Advances, and Future Directions","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-07-14T10:13:59.462645Z"},"links":{"citing_paper":"/paper/2607.10649"},"observation_digest":"sha256:151a77cf30eefd3bc0cae64de0f9d59fb059339deff376aa687db4b020353d15","observation_id":"75c74577-f7f1-438c-957a-ab9f1e774ec4","resolution":{"observed_at":"2026-07-14T10:13:59.462645Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T10:13:59.462645Z","title":"Morse decompositions for coverage tasks,","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2607.10649","last_updated":"2026-07-12T08:33:42Z","snapshot_observed_at":"2026-08-14T09:47:44.872181Z","submitted_at":"2026-07-12T08:33:42Z","title":"Coverage Path Planning: Classical Foundations, Recent Advances, and Future Directions","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-07-14T10:13:59.462645Z"},"links":{"citing_paper":"/paper/2607.10649"},"observation_digest":"sha256:cee4bb0d224f1e273582a3a52f14d65376ecf3e8064db5435cd361984d792d5a","observation_id":"f76fe7b7-241d-4649-a1d9-f91dc2c3b25b","resolution":{"observed_at":"2026-07-14T10:13:59.462645Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T10:13:59.462645Z","title":null,"venue":null,"work_id":null,"year":1963},"citing_paper":{"arxiv_id":"2607.10649","last_updated":"2026-07-12T08:33:42Z","snapshot_observed_at":"2026-08-14T09:47:44.872181Z","submitted_at":"2026-07-12T08:33:42Z","title":"Coverage Path Planning: Classical Foundations, Recent Advances, and Future Directions","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-07-14T10:13:59.462645Z"},"links":{"citing_paper":"/paper/2607.10649"},"observation_digest":"sha256:35403560a1a3561c02194bed066f45ab17f7e5ae04c09eea1c8b2f8ddb072198","observation_id":"780f1f62-da60-42f8-a8c7-41187bd65298","resolution":{"observed_at":"2026-07-14T10:13:59.462645Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T10:13:59.462645Z","title":"Sensor-based coverage of unknown environments: Incremental construction of morse decompositions,","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2607.10649","last_updated":"2026-07-12T08:33:42Z","snapshot_observed_at":"2026-08-14T09:47:44.872181Z","submitted_at":"2026-07-12T08:33:42Z","title":"Coverage Path Planning: Classical Foundations, Recent Advances, and Future Directions","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-07-14T10:13:59.462645Z"},"links":{"citing_paper":"/paper/2607.10649"},"observation_digest":"sha256:5266b962238d1c35c2405452701e290ecc86c5fbe960872a8d339a91235a0eb4","observation_id":"04fd3c17-f2a2-46d3-976d-d438426d819e","resolution":{"observed_at":"2026-07-14T10:13:59.462645Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T10:13:59.462645Z","title":"Efficient complete coverage of a known arbitrary environment with applications to aerial opera- tions,","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2607.10649","last_updated":"2026-07-12T08:33:42Z","snapshot_observed_at":"2026-08-14T09:47:44.872181Z","submitted_at":"2026-07-12T08:33:42Z","title":"Coverage Path Planning: Classical Foundations, Recent Advances, and Future Directions","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-07-14T10:13:59.462645Z"},"links":{"citing_paper":"/paper/2607.10649"},"observation_digest":"sha256:41d48bd38152b6f622579350d592b71128b187e0d96b56ef8ce5a23aab6c78c2","observation_id":"571c60ef-291a-47f0-ab5b-ca72444d9740","resolution":{"observed_at":"2026-07-14T10:13:59.462645Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T10:13:59.462645Z","title":"Coverage path planning in belief space,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.10649","last_updated":"2026-07-12T08:33:42Z","snapshot_observed_at":"2026-08-14T09:47:44.872181Z","submitted_at":"2026-07-12T08:33:42Z","title":"Coverage Path Planning: Classical Foundations, Recent Advances, and Future Directions","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-07-14T10:13:59.462645Z"},"links":{"citing_paper":"/paper/2607.10649"},"observation_digest":"sha256:b2936519826cdbc507cf5c4070e3af4188a4b4295c19cf4072122e59bc8eeee4","observation_id":"2000a658-a626-425d-8e7c-28e570c75da2","resolution":{"observed_at":"2026-07-14T10:13:59.462645Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T10:13:59.462645Z","title":"The constriction decomposition method for coverage path planning,","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2607.10649","last_updated":"2026-07-12T08:33:42Z","snapshot_observed_at":"2026-08-14T09:47:44.872181Z","submitted_at":"2026-07-12T08:33:42Z","title":"Coverage Path Planning: Classical Foundations, Recent Advances, and Future Directions","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-07-14T10:13:59.462645Z"},"links":{"citing_paper":"/paper/2607.10649"},"observation_digest":"sha256:ee4dd7e50e501699fc603d69450c5147960ef8c8fd6e31da43c03489ad04ebcc","observation_id":"6e4d061f-c106-4b20-95c4-8b3ec2de358f","resolution":{"observed_at":"2026-07-14T10:13:59.462645Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T10:13:59.462645Z","title":"On minimizing turns in robot coverage path planning,","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2607.10649","last_updated":"2026-07-12T08:33:42Z","snapshot_observed_at":"2026-08-14T09:47:44.872181Z","submitted_at":"2026-07-12T08:33:42Z","title":"Coverage Path Planning: Classical Foundations, Recent Advances, and Future Directions","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-07-14T10:13:59.462645Z"},"links":{"citing_paper":"/paper/2607.10649"},"observation_digest":"sha256:59bcebaeb65fe954b610ea021f69780f1e83ade52de7732b7203e4fa764d2dce","observation_id":"8e76646c-27c9-444b-9285-f9f455b21153","resolution":{"observed_at":"2026-07-14T10:13:59.462645Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T10:13:59.462645Z","title":"Minimum-length coverage path planning for grid environments with approximation guarantees,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.10649","last_updated":"2026-07-12T08:33:42Z","snapshot_observed_at":"2026-08-14T09:47:44.872181Z","submitted_at":"2026-07-12T08:33:42Z","title":"Coverage Path Planning: Classical Foundations, Recent Advances, and Future Directions","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-07-14T10:13:59.462645Z"},"links":{"citing_paper":"/paper/2607.10649"},"observation_digest":"sha256:696834214eb1ac00d2004c39d9226e0872b64fca7ebda5b54b056cb342f1976b","observation_id":"f9719bce-8800-4c42-a118-83a81742705f","resolution":{"observed_at":"2026-07-14T10:13:59.462645Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T10:13:59.462645Z","title":"Spanning-tree based coverage of contin- uous areas by a mobile robot,","venue":null,"work_id":null,"year":2001},"citing_paper":{"arxiv_id":"2607.10649","last_updated":"2026-07-12T08:33:42Z","snapshot_observed_at":"2026-08-14T09:47:44.872181Z","submitted_at":"2026-07-12T08:33:42Z","title":"Coverage Path Planning: Classical Foundations, Recent Advances, and Future Directions","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-07-14T10:13:59.462645Z"},"links":{"citing_paper":"/paper/2607.10649"},"observation_digest":"sha256:0aeaa544a87d73f302434930dbc548db4d1b3bdf976d8cc214854b5ce3ec1a51","observation_id":"71855c2c-4ec3-45a8-adc9-dab81d0163b4","resolution":{"observed_at":"2026-07-14T10:13:59.462645Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T10:13:59.462645Z","title":"Competitive on-line coverage of grid environments by a mobile robot,","venue":null,"work_id":null,"year":2003},"citing_paper":{"arxiv_id":"2607.10649","last_updated":"2026-07-12T08:33:42Z","snapshot_observed_at":"2026-08-14T09:47:44.872181Z","submitted_at":"2026-07-12T08:33:42Z","title":"Coverage Path Planning: Classical Foundations, Recent Advances, and Future Directions","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-07-14T10:13:59.462645Z"},"links":{"citing_paper":"/paper/2607.10649"},"observation_digest":"sha256:7205af3ba27503396aa14ae407edbb1bcaf3d31c2619313ea84b6fe5dfb0c871","observation_id":"4d3d0110-05b4-413f-9f6f-1c5eb589f0b8","resolution":{"observed_at":"2026-07-14T10:13:59.462645Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T10:13:59.462645Z","title":"BSA: a complete coverage algorithm,","venue":null,"work_id":null,"year":2005},"citing_paper":{"arxiv_id":"2607.10649","last_updated":"2026-07-12T08:33:42Z","snapshot_observed_at":"2026-08-14T09:47:44.872181Z","submitted_at":"2026-07-12T08:33:42Z","title":"Coverage Path Planning: Classical Foundations, Recent Advances, and Future Directions","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-07-14T10:13:59.462645Z"},"links":{"citing_paper":"/paper/2607.10649"},"observation_digest":"sha256:7069bcc3dfc5ec79cf1c5f1f4e582b4b57391f3027719cad70012785039651b7","observation_id":"ef8be12b-70c9-4985-a663-9d74575408c1","resolution":{"observed_at":"2026-07-14T10:13:59.462645Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T10:13:59.462645Z","title":"Brick&Mortar: An on-line multi-agent exploration algorithm,","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2607.10649","last_updated":"2026-07-12T08:33:42Z","snapshot_observed_at":"2026-08-14T09:47:44.872181Z","submitted_at":"2026-07-12T08:33:42Z","title":"Coverage Path Planning: Classical Foundations, Recent Advances, and Future Directions","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-07-14T10:13:59.462645Z"},"links":{"citing_paper":"/paper/2607.10649"},"observation_digest":"sha256:002b2e659a48b0860fb9d80b0f89bba05a33e88db62e0926652831585727c795","observation_id":"a60fe8b7-46ac-4ad1-b78d-272b4b792c44","resolution":{"observed_at":"2026-07-14T10:13:59.462645Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T10:13:59.462645Z","title":"BA*: an online complete coverage algorithm for cleaning robots,","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2607.10649","last_updated":"2026-07-12T08:33:42Z","snapshot_observed_at":"2026-08-14T09:47:44.872181Z","submitted_at":"2026-07-12T08:33:42Z","title":"Coverage Path Planning: Classical Foundations, Recent Advances, and Future Directions","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-07-14T10:13:59.462645Z"},"links":{"citing_paper":"/paper/2607.10649"},"observation_digest":"sha256:ecb6198420b5148071163fa8a0a428c92f9f83a4404bfb392a42550ec95aac2a","observation_id":"a82e5bf9-7446-41d4-aed9-e79deab1cbc8","resolution":{"observed_at":"2026-07-14T10:13:59.462645Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T10:13:59.462645Z","title":"ϵ ⋆: An online coverage path planning algo- rithm,","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2607.10649","last_updated":"2026-07-12T08:33:42Z","snapshot_observed_at":"2026-08-14T09:47:44.872181Z","submitted_at":"2026-07-12T08:33:42Z","title":"Coverage Path Planning: Classical Foundations, Recent Advances, and Future Directions","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-07-14T10:13:59.462645Z"},"links":{"citing_paper":"/paper/2607.10649"},"observation_digest":"sha256:e2fac7f47199d4fafa479aff5390d9b7ceee2ce7770eb36754dbb477379f2edb","observation_id":"cb632f04-1563-4544-bad3-fbb0ddf34366","resolution":{"observed_at":"2026-07-14T10:13:59.462645Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T10:13:59.462645Z","title":"A bioinspired neural network for real-time concurrent map building and complete coverage robot navigation in unknown environments,","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2607.10649","last_updated":"2026-07-12T08:33:42Z","snapshot_observed_at":"2026-08-14T09:47:44.872181Z","submitted_at":"2026-07-12T08:33:42Z","title":"Coverage Path Planning: Classical Foundations, Recent Advances, and Future Directions","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-07-14T10:13:59.462645Z"},"links":{"citing_paper":"/paper/2607.10649"},"observation_digest":"sha256:727625145118c02551b25d42689107ea9a836d4620f5c8eaedd294b8108fb203","observation_id":"49e12c01-dcf5-4c18-aa81-2d697fffd012","resolution":{"observed_at":"2026-07-14T10:13:59.462645Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T10:13:59.462645Z","title":"Complete coverage autonomous underwater vehicles path planning based on glasius bio-inspired neural network algorithm for discrete and centralized programming,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.10649","last_updated":"2026-07-12T08:33:42Z","snapshot_observed_at":"2026-08-14T09:47:44.872181Z","submitted_at":"2026-07-12T08:33:42Z","title":"Coverage Path Planning: Classical Foundations, Recent Advances, and Future Directions","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-07-14T10:13:59.462645Z"},"links":{"citing_paper":"/paper/2607.10649"},"observation_digest":"sha256:f9a09c6dcab8b5a9a7a2e9f0ce1c7804987eb96595c66f3d38b55818ded89660","observation_id":"43f99a3f-973b-43ae-9d22-b438be2b3cf8","resolution":{"observed_at":"2026-07-14T10:13:59.462645Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T10:13:59.462645Z","title":"Improved BINN-based underwater topography scanning coverage path planning for auv in internet of underwater things,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.10649","last_updated":"2026-07-12T08:33:42Z","snapshot_observed_at":"2026-08-14T09:47:44.872181Z","submitted_at":"2026-07-12T08:33:42Z","title":"Coverage Path Planning: Classical Foundations, Recent Advances, and Future Directions","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-07-14T10:13:59.462645Z"},"links":{"citing_paper":"/paper/2607.10649"},"observation_digest":"sha256:8af28e0d10d35614a0b7a07516b77c5a3eb0d48bf43a133d41f27563fde8e7ee","observation_id":"7d236811-ee1a-46b7-8b07-feb7e7b6de64","resolution":{"observed_at":"2026-07-14T10:13:59.462645Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T10:13:59.462645Z","title":"PPCPP: A predator–prey-based approach to adaptive coverage path planning,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.10649","last_updated":"2026-07-12T08:33:42Z","snapshot_observed_at":"2026-08-14T09:47:44.872181Z","submitted_at":"2026-07-12T08:33:42Z","title":"Coverage Path Planning: Classical Foundations, Recent Advances, and Future Directions","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-07-14T10:13:59.462645Z"},"links":{"citing_paper":"/paper/2607.10649"},"observation_digest":"sha256:dca617d73d10a910cb466db6b6ad3876366ecb04592190b550d91678a09d4f5f","observation_id":"8d017338-87cf-4965-bc16-0b0c1747cd8a","resolution":{"observed_at":"2026-07-14T10:13:59.462645Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T10:13:59.462645Z","title":"SP2E: Online spiral coverage with proactive prevention extremum for unknown environments,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.10649","last_updated":"2026-07-12T08:33:42Z","snapshot_observed_at":"2026-08-14T09:47:44.872181Z","submitted_at":"2026-07-12T08:33:42Z","title":"Coverage Path Planning: Classical Foundations, Recent Advances, and Future Directions","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-07-14T10:13:59.462645Z"},"links":{"citing_paper":"/paper/2607.10649"},"observation_digest":"sha256:5dc8f12986a335f535d15eaee23e05e878debd5008e744734e73b1ab26a13c32","observation_id":"5e8f4fde-48ed-45c1-b1ae-233e7d79a955","resolution":{"observed_at":"2026-07-14T10:13:59.462645Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T10:13:59.462645Z","title":"An improved algorithm for complete coverage path planning based on biologically inspired neural network,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.10649","last_updated":"2026-07-12T08:33:42Z","snapshot_observed_at":"2026-08-14T09:47:44.872181Z","submitted_at":"2026-07-12T08:33:42Z","title":"Coverage Path Planning: Classical Foundations, Recent Advances, and Future Directions","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-07-14T10:13:59.462645Z"},"links":{"citing_paper":"/paper/2607.10649"},"observation_digest":"sha256:be83b1a6c825908885c5f63e4cf87c3d91b6d282cfcfc92805ae42d742871c9d","observation_id":"c208b028-e146-4ce7-ad2b-215b9ff45a90","resolution":{"observed_at":"2026-07-14T10:13:59.462645Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T10:13:59.462645Z","title":"Complete coverage path planning algorithm based on improved bi- ologically inspired neural networks in spray painting,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.10649","last_updated":"2026-07-12T08:33:42Z","snapshot_observed_at":"2026-08-14T09:47:44.872181Z","submitted_at":"2026-07-12T08:33:42Z","title":"Coverage Path Planning: Classical Foundations, Recent Advances, and Future Directions","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-07-14T10:13:59.462645Z"},"links":{"citing_paper":"/paper/2607.10649"},"observation_digest":"sha256:7802255f0069df8a847f0293873182d65df3d6a1dd465ae1305142f02f9a1288","observation_id":"660bd1d5-f338-45fc-8807-867a3cf5e1b4","resolution":{"observed_at":"2026-07-14T10:13:59.462645Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T10:13:59.462645Z","title":"Hierarchy coverage path planning with proactive extremum prevention in unknown envi- ronments,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.10649","last_updated":"2026-07-12T08:33:42Z","snapshot_observed_at":"2026-08-14T09:47:44.872181Z","submitted_at":"2026-07-12T08:33:42Z","title":"Coverage Path Planning: Classical Foundations, Recent Advances, and Future Directions","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-07-14T10:13:59.462645Z"},"links":{"citing_paper":"/paper/2607.10649"},"observation_digest":"sha256:78e649213c87f36f296453523ca503afbb60b7801a0efe18fec62867f7a011dd","observation_id":"526c581f-2de9-454d-a6e0-b2877b5e81ae","resolution":{"observed_at":"2026-07-14T10:13:59.462645Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T10:13:59.462645Z","title":"CAP: A connectivity-aware hierarchical coverage path planning algorithm for unknown environments using coverage guidance graph,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.10649","last_updated":"2026-07-12T08:33:42Z","snapshot_observed_at":"2026-08-14T09:47:44.872181Z","submitted_at":"2026-07-12T08:33:42Z","title":"Coverage Path Planning: Classical Foundations, Recent Advances, and Future Directions","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-07-14T10:13:59.462645Z"},"links":{"citing_paper":"/paper/2607.10649"},"observation_digest":"sha256:3c9ecd986903f775c8f0904fcd83c853ecc73276a2a064a919578160bad91a37","observation_id":"5a073e60-95c0-4b55-afb2-4ed743958562","resolution":{"observed_at":"2026-07-14T10:13:59.462645Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T10:13:59.462645Z","title":"Full coverage path planning recombination framework for unmanned vehicles with multi-objective constraints,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.10649","last_updated":"2026-07-12T08:33:42Z","snapshot_observed_at":"2026-08-14T09:47:44.872181Z","submitted_at":"2026-07-12T08:33:42Z","title":"Coverage Path Planning: Classical Foundations, Recent Advances, and Future Directions","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-07-14T10:13:59.462645Z"},"links":{"citing_paper":"/paper/2607.10649"},"observation_digest":"sha256:0d2e1a2b4d261b10b4ffc86c48296a9f1fe294a0577e38790b1515c009ce7644","observation_id":"c9b997a2-165c-46f5-a6dd-a6a83a0d7951","resolution":{"observed_at":"2026-07-14T10:13:59.462645Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T10:13:59.462645Z","title":"Online exploratory coverage path planning of incremental slam for autonomous vehicles,","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.10649","last_updated":"2026-07-12T08:33:42Z","snapshot_observed_at":"2026-08-14T09:47:44.872181Z","submitted_at":"2026-07-12T08:33:42Z","title":"Coverage Path Planning: Classical Foundations, Recent Advances, and Future Directions","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-07-14T10:13:59.462645Z"},"links":{"citing_paper":"/paper/2607.10649"},"observation_digest":"sha256:d2cea79fcfb8fd165599382467be04b2b2d434a7da601f848d92bd831678940c","observation_id":"38219e35-cb96-4d26-9c3e-9c47e56776d4","resolution":{"observed_at":"2026-07-14T10:13:59.462645Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T10:13:59.462645Z","title":"An artificially weighted spanning tree coverage algorithm for decentralized flying robots,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.10649","last_updated":"2026-07-12T08:33:42Z","snapshot_observed_at":"2026-08-14T09:47:44.872181Z","submitted_at":"2026-07-12T08:33:42Z","title":"Coverage Path Planning: Classical Foundations, Recent Advances, and Future Directions","version":1},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-07-14T10:13:59.462645Z"},"links":{"citing_paper":"/paper/2607.10649"},"observation_digest":"sha256:9f0be3e9125ce8fcff08a655922061f178cf31de04a4d40044178385500cc7a7","observation_id":"dd50257c-f35b-4639-aa64-55f5593280d0","resolution":{"observed_at":"2026-07-14T10:13:59.462645Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T10:13:59.462645Z","title":"MSTC*: Multi-robot coverage path planning under physical constrain,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.10649","last_updated":"2026-07-12T08:33:42Z","snapshot_observed_at":"2026-08-14T09:47:44.872181Z","submitted_at":"2026-07-12T08:33:42Z","title":"Coverage Path Planning: Classical Foundations, Recent Advances, and Future Directions","version":1},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-07-14T10:13:59.462645Z"},"links":{"citing_paper":"/paper/2607.10649"},"observation_digest":"sha256:087488b7dacbe3135badf6b319cf4f279e95e6eedb77913c8e8fc9fe301e8267","observation_id":"965d51a8-03d8-46ae-988d-2911b74da634","resolution":{"observed_at":"2026-07-14T10:13:59.462645Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T10:13:59.462645Z","title":"TMSTC*: A path planning algorithm for minimizing turns in multi-robot coverage,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.10649","last_updated":"2026-07-12T08:33:42Z","snapshot_observed_at":"2026-08-14T09:47:44.872181Z","submitted_at":"2026-07-12T08:33:42Z","title":"Coverage Path Planning: Classical Foundations, Recent Advances, and Future Directions","version":1},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-07-14T10:13:59.462645Z"},"links":{"citing_paper":"/paper/2607.10649"},"observation_digest":"sha256:d43e460d4512fb25c848433357c032e90d20f4daaf3c0bde3d9f0228a8dad688","observation_id":"5e730cdf-6bd7-4b8a-892d-845ccb4cc8d8","resolution":{"observed_at":"2026-07-14T10:13:59.462645Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T10:13:59.462645Z","title":"Priority-aware multi-robot coverage path planning,","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.10649","last_updated":"2026-07-12T08:33:42Z","snapshot_observed_at":"2026-08-14T09:47:44.872181Z","submitted_at":"2026-07-12T08:33:42Z","title":"Coverage Path Planning: Classical Foundations, Recent Advances, and Future Directions","version":1},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-07-14T10:13:59.462645Z"},"links":{"citing_paper":"/paper/2607.10649"},"observation_digest":"sha256:902c7b42d11bc6218a096358c3f2c93396def3e34c4cd212eae287f0f43eb2de","observation_id":"e29858ff-de9c-4a54-9ce0-c64eda4b7e99","resolution":{"observed_at":"2026-07-14T10:13:59.462645Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T10:13:59.462645Z","title":"A novel cooperative path planning for multirobot persistent coverage in complex environ- ments,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.10649","last_updated":"2026-07-12T08:33:42Z","snapshot_observed_at":"2026-08-14T09:47:44.872181Z","submitted_at":"2026-07-12T08:33:42Z","title":"Coverage Path Planning: Classical Foundations, Recent Advances, and Future Directions","version":1},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-07-14T10:13:59.462645Z"},"links":{"citing_paper":"/paper/2607.10649"},"observation_digest":"sha256:5c1526577a72078870effbdf0fef85a1a99463325398fa75761dac45c7ba200f","observation_id":"aa9abac6-6798-4a8c-a61c-283fd9fb6770","resolution":{"observed_at":"2026-07-14T10:13:59.462645Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T10:13:59.462645Z","title":"Area coverage with multiple capacity- constrained robots,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.10649","last_updated":"2026-07-12T08:33:42Z","snapshot_observed_at":"2026-08-14T09:47:44.872181Z","submitted_at":"2026-07-12T08:33:42Z","title":"Coverage Path Planning: Classical Foundations, Recent Advances, and Future Directions","version":1},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-07-14T10:13:59.462645Z"},"links":{"citing_paper":"/paper/2607.10649"},"observation_digest":"sha256:6e81a39581f153b90e9c0ec06b1777cb9fdfa2bd85eb50704608e5f29d28d708","observation_id":"7bfd6b80-d9aa-4850-a4d1-db27b141af08","resolution":{"observed_at":"2026-07-14T10:13:59.462645Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T10:13:59.462645Z","title":"Multi-UA V coverage path planning based on balanced graph partitioning,","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.10649","last_updated":"2026-07-12T08:33:42Z","snapshot_observed_at":"2026-08-14T09:47:44.872181Z","submitted_at":"2026-07-12T08:33:42Z","title":"Coverage Path Planning: Classical Foundations, Recent Advances, and Future Directions","version":1},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-07-14T10:13:59.462645Z"},"links":{"citing_paper":"/paper/2607.10649"},"observation_digest":"sha256:8f0cb101011cd1df288f2708c0381e2281d715305a7a7529dd1d096c31e3247f","observation_id":"cb058139-834b-4339-92d0-6bee7ce3fa0e","resolution":{"observed_at":"2026-07-14T10:13:59.462645Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T10:13:59.462645Z","title":"CoMAEA: A collision-avoiding multi-agent evolutionary algorithm for coverage path planning,","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.10649","last_updated":"2026-07-12T08:33:42Z","snapshot_observed_at":"2026-08-14T09:47:44.872181Z","submitted_at":"2026-07-12T08:33:42Z","title":"Coverage Path Planning: Classical Foundations, Recent Advances, and Future Directions","version":1},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-07-14T10:13:59.462645Z"},"links":{"citing_paper":"/paper/2607.10649"},"observation_digest":"sha256:448eb0ff35a286616f42005eaa514f01e653beaa9fcb1ed0ee3f28657945c710","observation_id":"a2e5d8b2-47be-44c0-9692-5b86fc533fad","resolution":{"observed_at":"2026-07-14T10:13:59.462645Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T10:13:59.462645Z","title":"Redundancy, efficiency and robustness in multi-robot coverage,","venue":null,"work_id":null,"year":2005},"citing_paper":{"arxiv_id":"2607.10649","last_updated":"2026-07-12T08:33:42Z","snapshot_observed_at":"2026-08-14T09:47:44.872181Z","submitted_at":"2026-07-12T08:33:42Z","title":"Coverage Path Planning: Classical Foundations, Recent Advances, and Future Directions","version":1},"reference_index":60,"source":"pdf_text","source_observed_at":"2026-07-14T10:13:59.462645Z"},"links":{"citing_paper":"/paper/2607.10649"},"observation_digest":"sha256:b3b5ccf7dab9bf56192684397c4b9f82d8ec53e7a17459738d7d13db4ced7e9b","observation_id":"432b5d46-62e8-462d-a5b1-4e9919b28565","resolution":{"observed_at":"2026-07-14T10:13:59.462645Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T10:13:59.462645Z","title":"Multirobot forest coverage for weighted and unweighted terrain,","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2607.10649","last_updated":"2026-07-12T08:33:42Z","snapshot_observed_at":"2026-08-14T09:47:44.872181Z","submitted_at":"2026-07-12T08:33:42Z","title":"Coverage Path Planning: Classical Foundations, Recent Advances, and Future Directions","version":1},"reference_index":61,"source":"pdf_text","source_observed_at":"2026-07-14T10:13:59.462645Z"},"links":{"citing_paper":"/paper/2607.10649"},"observation_digest":"sha256:43febe79ef5d57d58436977c706c1417d2be358423be06f553fffc9a5b83e6a0","observation_id":"4c2b7bb3-4b20-48cf-9e34-ae4fd2089dd8","resolution":{"observed_at":"2026-07-14T10:13:59.462645Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T10:13:59.462645Z","title":"Mixed integer programming for time-optimal multi-robot coverage path planning with efficient heuristics,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.10649","last_updated":"2026-07-12T08:33:42Z","snapshot_observed_at":"2026-08-14T09:47:44.872181Z","submitted_at":"2026-07-12T08:33:42Z","title":"Coverage Path Planning: Classical Foundations, Recent Advances, and Future Directions","version":1},"reference_index":62,"source":"pdf_text","source_observed_at":"2026-07-14T10:13:59.462645Z"},"links":{"citing_paper":"/paper/2607.10649"},"observation_digest":"sha256:ee7b1c8e9dcbe7f7a5aefe2420f77809ed3c87dfada3ddfd44f3b3e1acac4c07","observation_id":"92538cbc-0d3f-4ede-9abe-74bbb02568be","resolution":{"observed_at":"2026-07-14T10:13:59.462645Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T10:13:59.462645Z","title":"Large-scale multirobot coverage path planning on grids with path deconfliction,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.10649","last_updated":"2026-07-12T08:33:42Z","snapshot_observed_at":"2026-08-14T09:47:44.872181Z","submitted_at":"2026-07-12T08:33:42Z","title":"Coverage Path Planning: Classical Foundations, Recent Advances, and Future Directions","version":1},"reference_index":63,"source":"pdf_text","source_observed_at":"2026-07-14T10:13:59.462645Z"},"links":{"citing_paper":"/paper/2607.10649"},"observation_digest":"sha256:a978785b34b88f1184117c02303dde3e45acd35a82f459d67fa7b0dd7971f46b","observation_id":"21558ebf-03e7-42d0-98a7-fce55160178c","resolution":{"observed_at":"2026-07-14T10:13:59.462645Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T10:13:59.462645Z","title":"Dynamic task-priority coverage planning for efficient multi-robot collaboration,","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.10649","last_updated":"2026-07-12T08:33:42Z","snapshot_observed_at":"2026-08-14T09:47:44.872181Z","submitted_at":"2026-07-12T08:33:42Z","title":"Coverage Path Planning: Classical Foundations, Recent Advances, and Future Directions","version":1},"reference_index":64,"source":"pdf_text","source_observed_at":"2026-07-14T10:13:59.462645Z"},"links":{"citing_paper":"/paper/2607.10649"},"observation_digest":"sha256:fdd09fc7ee777517effe112588355f779efeb19187b2d394dcbb49568f59ccc6","observation_id":"ad9cf3f9-fdc2-4258-b152-1f496f35fd65","resolution":{"observed_at":"2026-07-14T10:13:59.462645Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T10:13:59.462645Z","title":"Efficient multi-robot coverage of a known environment,","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2607.10649","last_updated":"2026-07-12T08:33:42Z","snapshot_observed_at":"2026-08-14T09:47:44.872181Z","submitted_at":"2026-07-12T08:33:42Z","title":"Coverage Path Planning: Classical Foundations, Recent Advances, and Future Directions","version":1},"reference_index":65,"source":"pdf_text","source_observed_at":"2026-07-14T10:13:59.462645Z"},"links":{"citing_paper":"/paper/2607.10649"},"observation_digest":"sha256:eeaf8e951535c0bf0c071d9a913cdab59473d36e9c047fca9dfd0f7df32ee0ff","observation_id":"44dd44e3-988f-4caf-bdbc-8ee0e0a28d1b","resolution":{"observed_at":"2026-07-14T10:13:59.462645Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T10:13:59.462645Z","title":"Equitable persistent coverage of non-convex environments with graph- based planning,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.10649","last_updated":"2026-07-12T08:33:42Z","snapshot_observed_at":"2026-08-14T09:47:44.872181Z","submitted_at":"2026-07-12T08:33:42Z","title":"Coverage Path Planning: Classical Foundations, Recent Advances, and Future Directions","version":1},"reference_index":66,"source":"pdf_text","source_observed_at":"2026-07-14T10:13:59.462645Z"},"links":{"citing_paper":"/paper/2607.10649"},"observation_digest":"sha256:6f53ffb87bc49e8a43fbd3c6d3a58bb82cd4dae4a7b5f7ff97648ce474ae026b","observation_id":"ef3b3f4d-3923-4c78-92d3-009702688d1d","resolution":{"observed_at":"2026-07-14T10:13:59.462645Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T10:13:59.462645Z","title":"Scalable coverage path planning of multi-robot teams for monitoring non-convex areas,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.10649","last_updated":"2026-07-12T08:33:42Z","snapshot_observed_at":"2026-08-14T09:47:44.872181Z","submitted_at":"2026-07-12T08:33:42Z","title":"Coverage Path Planning: Classical Foundations, Recent Advances, and Future Directions","version":1},"reference_index":67,"source":"pdf_text","source_observed_at":"2026-07-14T10:13:59.462645Z"},"links":{"citing_paper":"/paper/2607.10649"},"observation_digest":"sha256:959ffad4d0d18a2b2da4810d636783a65e3137de6dbbe0262c121634f2f94994","observation_id":"5b39f536-3cb1-4cf9-a84b-3eb544f78275","resolution":{"observed_at":"2026-07-14T10:13:59.462645Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T10:13:59.462645Z","title":"Least squares quantization in pcm,","venue":null,"work_id":null,"year":1982},"citing_paper":{"arxiv_id":"2607.10649","last_updated":"2026-07-12T08:33:42Z","snapshot_observed_at":"2026-08-14T09:47:44.872181Z","submitted_at":"2026-07-12T08:33:42Z","title":"Coverage Path Planning: Classical Foundations, Recent Advances, and Future Directions","version":1},"reference_index":68,"source":"pdf_text","source_observed_at":"2026-07-14T10:13:59.462645Z"},"links":{"citing_paper":"/paper/2607.10649"},"observation_digest":"sha256:83ae70506596f019cc515a87bf4569d88b4f5d7b2f7715430b55353a81ef81db","observation_id":"30ba574f-6047-4eb4-8697-27c518b14e87","resolution":{"observed_at":"2026-07-14T10:13:59.462645Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T10:13:59.462645Z","title":"Optimal multi-robot coverage path planning for agricultural fields using motion dynamics,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.10649","last_updated":"2026-07-12T08:33:42Z","snapshot_observed_at":"2026-08-14T09:47:44.872181Z","submitted_at":"2026-07-12T08:33:42Z","title":"Coverage Path Planning: Classical Foundations, Recent Advances, and Future Directions","version":1},"reference_index":69,"source":"pdf_text","source_observed_at":"2026-07-14T10:13:59.462645Z"},"links":{"citing_paper":"/paper/2607.10649"},"observation_digest":"sha256:2c5ab7349a0cd72930f177fd4cb0cd5668655f5c4de5d042ddcd9171cde24639","observation_id":"2e42f8f4-ee61-4231-ad91-04666b92a494","resolution":{"observed_at":"2026-07-14T10:13:59.462645Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T10:13:59.462645Z","title":"UB-ANC planner: Energy efficient coverage path planning with multiple drones,","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2607.10649","last_updated":"2026-07-12T08:33:42Z","snapshot_observed_at":"2026-08-14T09:47:44.872181Z","submitted_at":"2026-07-12T08:33:42Z","title":"Coverage Path Planning: Classical Foundations, Recent Advances, and Future Directions","version":1},"reference_index":70,"source":"pdf_text","source_observed_at":"2026-07-14T10:13:59.462645Z"},"links":{"citing_paper":"/paper/2607.10649"},"observation_digest":"sha256:c447652b17c819ce1f32337366b5a8950f0b020a65ecf7b9dd4f5d61e7068348","observation_id":"dffc73fc-deab-42ea-92eb-b3f3fdf9bf1a","resolution":{"observed_at":"2026-07-14T10:13:59.462645Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T10:13:59.462645Z","title":"Turn-minimizing multi- robot coverage,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.10649","last_updated":"2026-07-12T08:33:42Z","snapshot_observed_at":"2026-08-14T09:47:44.872181Z","submitted_at":"2026-07-12T08:33:42Z","title":"Coverage Path Planning: Classical Foundations, Recent Advances, and Future Directions","version":1},"reference_index":71,"source":"pdf_text","source_observed_at":"2026-07-14T10:13:59.462645Z"},"links":{"citing_paper":"/paper/2607.10649"},"observation_digest":"sha256:56fd518954eb09a73f835719a09a1d51cc499f9c422cdca504ff5fd6c6b07a19","observation_id":"396d01f6-6eca-41bc-bb83-c4749ce175b9","resolution":{"observed_at":"2026-07-14T10:13:59.462645Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T10:13:59.462645Z","title":"Memetic algorithm based on sequential variable neighborhood descent for the minmax multiple traveling salesman problem,","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2607.10649","last_updated":"2026-07-12T08:33:42Z","snapshot_observed_at":"2026-08-14T09:47:44.872181Z","submitted_at":"2026-07-12T08:33:42Z","title":"Coverage Path Planning: Classical Foundations, Recent Advances, and Future Directions","version":1},"reference_index":72,"source":"pdf_text","source_observed_at":"2026-07-14T10:13:59.462645Z"},"links":{"citing_paper":"/paper/2607.10649"},"observation_digest":"sha256:deb3e6a9b303bb36eb7168c9d7a19c17199740484db050065daa82d0f8812f1e","observation_id":"d36cb5d2-324e-4b7b-a9ef-8bc3ebee912a","resolution":{"observed_at":"2026-07-14T10:13:59.462645Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T10:13:59.462645Z","title":"Line coverage with multiple robots,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.10649","last_updated":"2026-07-12T08:33:42Z","snapshot_observed_at":"2026-08-14T09:47:44.872181Z","submitted_at":"2026-07-12T08:33:42Z","title":"Coverage Path Planning: Classical Foundations, Recent Advances, and Future Directions","version":1},"reference_index":73,"source":"pdf_text","source_observed_at":"2026-07-14T10:13:59.462645Z"},"links":{"citing_paper":"/paper/2607.10649"},"observation_digest":"sha256:d16550d671256d7f0d7fc0157aecf83ad891acbf03d986e5a7d4aa6b9840d99d","observation_id":"2429b8a9-3d98-454b-a894-07b2d6a924c4","resolution":{"observed_at":"2026-07-14T10:13:59.462645Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T10:13:59.462645Z","title":"Energy-aware multi- uav coverage mission planning with optimal speed of flight,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.10649","last_updated":"2026-07-12T08:33:42Z","snapshot_observed_at":"2026-08-14T09:47:44.872181Z","submitted_at":"2026-07-12T08:33:42Z","title":"Coverage Path Planning: Classical Foundations, Recent Advances, and Future Directions","version":1},"reference_index":74,"source":"pdf_text","source_observed_at":"2026-07-14T10:13:59.462645Z"},"links":{"citing_paper":"/paper/2607.10649"},"observation_digest":"sha256:2b797b8e2f9f36874b09192e3c178625ec01af563b36369f9b3a223fcf8fb5e5","observation_id":"d2be3d1a-ab78-4983-9731-69a5623c8176","resolution":{"observed_at":"2026-07-14T10:13:59.462645Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T10:13:59.462645Z","title":"Multiregional coverage path planning for multiple energy constrained UA Vs,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.10649","last_updated":"2026-07-12T08:33:42Z","snapshot_observed_at":"2026-08-14T09:47:44.872181Z","submitted_at":"2026-07-12T08:33:42Z","title":"Coverage Path Planning: Classical Foundations, Recent Advances, and Future Directions","version":1},"reference_index":75,"source":"pdf_text","source_observed_at":"2026-07-14T10:13:59.462645Z"},"links":{"citing_paper":"/paper/2607.10649"},"observation_digest":"sha256:4c7c4d8f27c0edd3f8859e1ca6de7744974ae045b57122fb57eea64358c80267","observation_id":"b6528776-4800-4477-a469-f4f09af9dba3","resolution":{"observed_at":"2026-07-14T10:13:59.462645Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T10:13:59.462645Z","title":"Multi-region joint coverage for environmental monitoring using energy-constrained UA Vs,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.10649","last_updated":"2026-07-12T08:33:42Z","snapshot_observed_at":"2026-08-14T09:47:44.872181Z","submitted_at":"2026-07-12T08:33:42Z","title":"Coverage Path Planning: Classical Foundations, Recent Advances, and Future Directions","version":1},"reference_index":76,"source":"pdf_text","source_observed_at":"2026-07-14T10:13:59.462645Z"},"links":{"citing_paper":"/paper/2607.10649"},"observation_digest":"sha256:9fd5f3da6e7dc8b1faa33a9c51cbe92ed12932aa3d2ac05c9e7aa11edea5ca07","observation_id":"2653867a-4072-4c38-afc4-c606049843f4","resolution":{"observed_at":"2026-07-14T10:13:59.462645Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T10:13:59.462645Z","title":"Real-time path- reconfigurable coverage planning for multi-UA V missions over disjoint areas,","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.10649","last_updated":"2026-07-12T08:33:42Z","snapshot_observed_at":"2026-08-14T09:47:44.872181Z","submitted_at":"2026-07-12T08:33:42Z","title":"Coverage Path Planning: Classical Foundations, Recent Advances, and Future Directions","version":1},"reference_index":77,"source":"pdf_text","source_observed_at":"2026-07-14T10:13:59.462645Z"},"links":{"citing_paper":"/paper/2607.10649"},"observation_digest":"sha256:724e049a222ab6002f4daac318292eb70476a46b26628afb949c276ab4c1974e","observation_id":"7a553883-3d41-49f2-a700-60a3597b5fbc","resolution":{"observed_at":"2026-07-14T10:13:59.462645Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T10:13:59.462645Z","title":"APF-CPP: An artificial potential field based multi-robot online coverage path planning approach,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.10649","last_updated":"2026-07-12T08:33:42Z","snapshot_observed_at":"2026-08-14T09:47:44.872181Z","submitted_at":"2026-07-12T08:33:42Z","title":"Coverage Path Planning: Classical Foundations, Recent Advances, and Future Directions","version":1},"reference_index":78,"source":"pdf_text","source_observed_at":"2026-07-14T10:13:59.462645Z"},"links":{"citing_paper":"/paper/2607.10649"},"observation_digest":"sha256:2eafda1a47e5b6f7fee570183753c7857043bb9e8ab63f6824069b18001fe15c","observation_id":"6a62f30a-0b35-4593-a438-b6b04ec9cb20","resolution":{"observed_at":"2026-07-14T10:13:59.462645Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T10:13:59.462645Z","title":"BoB: an online cov- erage approach for multi-robot systems,","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2607.10649","last_updated":"2026-07-12T08:33:42Z","snapshot_observed_at":"2026-08-14T09:47:44.872181Z","submitted_at":"2026-07-12T08:33:42Z","title":"Coverage Path Planning: Classical Foundations, Recent Advances, and Future Directions","version":1},"reference_index":79,"source":"pdf_text","source_observed_at":"2026-07-14T10:13:59.462645Z"},"links":{"citing_paper":"/paper/2607.10649"},"observation_digest":"sha256:382bd5ceb1ac8c44b82cf71bf4d6a2ce074a6f283e269d441c6e28774f056433","observation_id":"e554bcd6-5870-49e5-915e-61f64da0df45","resolution":{"observed_at":"2026-07-14T10:13:59.462645Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T10:13:59.462645Z","title":"Neural-dynamics- driven complete area coverage navigation through cooperation of multiple mobile robots,","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2607.10649","last_updated":"2026-07-12T08:33:42Z","snapshot_observed_at":"2026-08-14T09:47:44.872181Z","submitted_at":"2026-07-12T08:33:42Z","title":"Coverage Path Planning: Classical Foundations, Recent Advances, and Future Directions","version":1},"reference_index":80,"source":"pdf_text","source_observed_at":"2026-07-14T10:13:59.462645Z"},"links":{"citing_paper":"/paper/2607.10649"},"observation_digest":"sha256:74634203cf048afbc4db5fe0aa158154f0c89aa444127eda8c9add83b956c886","observation_id":"d2bfd91a-f752-41e2-91d6-7a0968dc36f5","resolution":{"observed_at":"2026-07-14T10:13:59.462645Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T10:13:59.462645Z","title":"Dec-PPCPP: A decentralized predator–prey-based approach to adaptive coverage path planning amid moving obstacles,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.10649","last_updated":"2026-07-12T08:33:42Z","snapshot_observed_at":"2026-08-14T09:47:44.872181Z","submitted_at":"2026-07-12T08:33:42Z","title":"Coverage Path Planning: Classical Foundations, Recent Advances, and Future Directions","version":1},"reference_index":81,"source":"pdf_text","source_observed_at":"2026-07-14T10:13:59.462645Z"},"links":{"citing_paper":"/paper/2607.10649"},"observation_digest":"sha256:b9d9962def4b5a66c4e223574b9b328f4fa49c08008d781f07e4e01c43c1731d","observation_id":"213c6cea-103f-467d-879a-7f1639d09664","resolution":{"observed_at":"2026-07-14T10:13:59.462645Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T10:13:59.462645Z","title":"A herd-foraging-based approach to adaptive coverage path planning in dual environments,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.10649","last_updated":"2026-07-12T08:33:42Z","snapshot_observed_at":"2026-08-14T09:47:44.872181Z","submitted_at":"2026-07-12T08:33:42Z","title":"Coverage Path Planning: Classical Foundations, Recent Advances, and Future Directions","version":1},"reference_index":82,"source":"pdf_text","source_observed_at":"2026-07-14T10:13:59.462645Z"},"links":{"citing_paper":"/paper/2607.10649"},"observation_digest":"sha256:9ac53ec2d3d294408d0fecc89e27b7886838ef5946e213f8342da1d03353ff56","observation_id":"5a49ddfe-9c0f-43bb-aff8-816e477d02bf","resolution":{"observed_at":"2026-07-14T10:13:59.462645Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T10:13:59.462645Z","title":"CARE: Cooperative autonomy for resilience and efficiency of robot teams for complete coverage of unknown environments under robot failures,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.10649","last_updated":"2026-07-12T08:33:42Z","snapshot_observed_at":"2026-08-14T09:47:44.872181Z","submitted_at":"2026-07-12T08:33:42Z","title":"Coverage Path Planning: Classical Foundations, Recent Advances, and Future Directions","version":1},"reference_index":83,"source":"pdf_text","source_observed_at":"2026-07-14T10:13:59.462645Z"},"links":{"citing_paper":"/paper/2607.10649"},"observation_digest":"sha256:8aef8db64dcc2614ad84cde3d41250dfa3b6eb53d7c21109a3824cddba61918d","observation_id":"aae00c48-0779-4499-b948-12d392571d4a","resolution":{"observed_at":"2026-07-14T10:13:59.462645Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T10:13:59.462645Z","title":"Online concurrent multi-robot coverage path planning,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.10649","last_updated":"2026-07-12T08:33:42Z","snapshot_observed_at":"2026-08-14T09:47:44.872181Z","submitted_at":"2026-07-12T08:33:42Z","title":"Coverage Path Planning: Classical Foundations, Recent Advances, and Future Directions","version":1},"reference_index":84,"source":"pdf_text","source_observed_at":"2026-07-14T10:13:59.462645Z"},"links":{"citing_paper":"/paper/2607.10649"},"observation_digest":"sha256:aa095ed5d96ecbdcec559790c3bc3199756b24343f24004e0fa7173ddb007beb","observation_id":"6b27ee1b-1f21-4276-88f4-9e5665cb8bba","resolution":{"observed_at":"2026-07-14T10:13:59.462645Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T10:13:59.462645Z","title":"CCIBA*: An improved BA* based collaborative coverage path planning method for multiple unmanned surface mapping vehicles,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.10649","last_updated":"2026-07-12T08:33:42Z","snapshot_observed_at":"2026-08-14T09:47:44.872181Z","submitted_at":"2026-07-12T08:33:42Z","title":"Coverage Path Planning: Classical Foundations, Recent Advances, and Future Directions","version":1},"reference_index":85,"source":"pdf_text","source_observed_at":"2026-07-14T10:13:59.462645Z"},"links":{"citing_paper":"/paper/2607.10649"},"observation_digest":"sha256:e9228121ee94a2d7514ce10e78119b878c3f9003300fd9d3d8f68fdb22de219a","observation_id":"80c7ba45-f0b2-4d5f-9375-998905c68812","resolution":{"observed_at":"2026-07-14T10:13:59.462645Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T10:13:59.462645Z","title":"MAC- Planner: A novel task allocation and path planning framework for multi-robot online coverage processes,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.10649","last_updated":"2026-07-12T08:33:42Z","snapshot_observed_at":"2026-08-14T09:47:44.872181Z","submitted_at":"2026-07-12T08:33:42Z","title":"Coverage Path Planning: Classical Foundations, Recent Advances, and Future Directions","version":1},"reference_index":86,"source":"pdf_text","source_observed_at":"2026-07-14T10:13:59.462645Z"},"links":{"citing_paper":"/paper/2607.10649"},"observation_digest":"sha256:615e7a89b2f78e534bfa774bf95a291be14681c8b338f409c9bb9f92c4fb38a9","observation_id":"7fff3c3c-8602-4156-88fa-836fef015f75","resolution":{"observed_at":"2026-07-14T10:13:59.462645Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T10:13:59.462645Z","title":"Complete coverage search for multiple autonomous underwater vehicles based on neuronal activity reassignment,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.10649","last_updated":"2026-07-12T08:33:42Z","snapshot_observed_at":"2026-08-14T09:47:44.872181Z","submitted_at":"2026-07-12T08:33:42Z","title":"Coverage Path Planning: Classical Foundations, Recent Advances, and Future Directions","version":1},"reference_index":87,"source":"pdf_text","source_observed_at":"2026-07-14T10:13:59.462645Z"},"links":{"citing_paper":"/paper/2607.10649"},"observation_digest":"sha256:18acdc02b8ca6291fe59d32a46e18254f64be33af9ce61d072cc3dc5b71157c0","observation_id":"a4520b87-ad91-4242-ba71-0954af089227","resolution":{"observed_at":"2026-07-14T10:13:59.462645Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T10:13:59.462645Z","title":"Multi-CAP: A multi-robot connectivity-aware hierarchical coverage path planning algorithm for unknown environments,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.10649","last_updated":"2026-07-12T08:33:42Z","snapshot_observed_at":"2026-08-14T09:47:44.872181Z","submitted_at":"2026-07-12T08:33:42Z","title":"Coverage Path Planning: Classical Foundations, Recent Advances, and Future Directions","version":1},"reference_index":88,"source":"pdf_text","source_observed_at":"2026-07-14T10:13:59.462645Z"},"links":{"citing_paper":"/paper/2607.10649"},"observation_digest":"sha256:93b0df1ac4ad02872eb577d2f480dc2c962931d946ba7c5e12caf6d428c02405","observation_id":"27dea4a8-caf8-4a66-9049-bef83d78a532","resolution":{"observed_at":"2026-07-14T10:13:59.462645Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T10:13:59.462645Z","title":"Scalable online coverage path planning for multi- robot systems,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.10649","last_updated":"2026-07-12T08:33:42Z","snapshot_observed_at":"2026-08-14T09:47:44.872181Z","submitted_at":"2026-07-12T08:33:42Z","title":"Coverage Path Planning: Classical Foundations, Recent Advances, and Future Directions","version":1},"reference_index":89,"source":"pdf_text","source_observed_at":"2026-07-14T10:13:59.462645Z"},"links":{"citing_paper":"/paper/2607.10649"},"observation_digest":"sha256:dadf7c2c318476139b819eaf9aa98e75ec9fd132e26f51b4dde616220e19e077","observation_id":"f570a12d-9732-459e-bbe4-cf9cb6b723d6","resolution":{"observed_at":"2026-07-14T10:13:59.462645Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T10:13:59.462645Z","title":"Online on-demand multi-robot coverage path planning,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.10649","last_updated":"2026-07-12T08:33:42Z","snapshot_observed_at":"2026-08-14T09:47:44.872181Z","submitted_at":"2026-07-12T08:33:42Z","title":"Coverage Path Planning: Classical Foundations, Recent Advances, and Future Directions","version":1},"reference_index":90,"source":"pdf_text","source_observed_at":"2026-07-14T10:13:59.462645Z"},"links":{"citing_paper":"/paper/2607.10649"},"observation_digest":"sha256:b3cdfd0015c7ebcc3fe0fd01b5d267366989d511ef4e5afbfe34ea95b1f29740","observation_id":"efff284c-b2dd-40a4-b28d-7b170dff40cb","resolution":{"observed_at":"2026-07-14T10:13:59.462645Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T10:13:59.462645Z","title":"DMT-CPP: A delaunay-graph-based framework for real-time multi-robot online target coverage,","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.10649","last_updated":"2026-07-12T08:33:42Z","snapshot_observed_at":"2026-08-14T09:47:44.872181Z","submitted_at":"2026-07-12T08:33:42Z","title":"Coverage Path Planning: Classical Foundations, Recent Advances, and Future Directions","version":1},"reference_index":91,"source":"pdf_text","source_observed_at":"2026-07-14T10:13:59.462645Z"},"links":{"citing_paper":"/paper/2607.10649"},"observation_digest":"sha256:663ca94167aa146f93e5bcc3b74f58d78feb5be42f75fc72dfd5cd537b7eef55","observation_id":"88d40004-5d82-4505-b775-a528779c62f7","resolution":{"observed_at":"2026-07-14T10:13:59.462645Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T10:13:59.462645Z","title":"Recursive non-uniform coverage of unknown terrains for UA Vs,","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2607.10649","last_updated":"2026-07-12T08:33:42Z","snapshot_observed_at":"2026-08-14T09:47:44.872181Z","submitted_at":"2026-07-12T08:33:42Z","title":"Coverage Path Planning: Classical Foundations, Recent Advances, and Future Directions","version":1},"reference_index":92,"source":"pdf_text","source_observed_at":"2026-07-14T10:13:59.462645Z"},"links":{"citing_paper":"/paper/2607.10649"},"observation_digest":"sha256:04071aaa939725ddbc3bc77cbf333d833de32da35935d202cfd58d36eb28907c","observation_id":"087da6c3-f53a-4d0c-8c7a-17906174ae89","resolution":{"observed_at":"2026-07-14T10:13:59.462645Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T10:13:59.462645Z","title":"Fractal trajectories for online non-uniform aerial coverage,","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2607.10649","last_updated":"2026-07-12T08:33:42Z","snapshot_observed_at":"2026-08-14T09:47:44.872181Z","submitted_at":"2026-07-12T08:33:42Z","title":"Coverage Path Planning: Classical Foundations, Recent Advances, and Future Directions","version":1},"reference_index":93,"source":"pdf_text","source_observed_at":"2026-07-14T10:13:59.462645Z"},"links":{"citing_paper":"/paper/2607.10649"},"observation_digest":"sha256:d43776c4247cc786f01f79443ca88d61f7d1e541dbc28e1fc1bcb3e874f1d8a5","observation_id":"2701b903-5188-4fde-8625-c2298c35ba20","resolution":{"observed_at":"2026-07-14T10:13:59.462645Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T10:13:59.462645Z","title":"Multi-layer coverage path planner for autonomous structural inspection of high-rise structures,","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2607.10649","last_updated":"2026-07-12T08:33:42Z","snapshot_observed_at":"2026-08-14T09:47:44.872181Z","submitted_at":"2026-07-12T08:33:42Z","title":"Coverage Path Planning: Classical Foundations, Recent Advances, and Future Directions","version":1},"reference_index":94,"source":"pdf_text","source_observed_at":"2026-07-14T10:13:59.462645Z"},"links":{"citing_paper":"/paper/2607.10649"},"observation_digest":"sha256:3131521b0e751ba42342eef8bf50075014b7fc391657d5b06bfd368cc9be1e2c","observation_id":"c4afe541-8b75-490a-9498-75e5fdebfea5","resolution":{"observed_at":"2026-07-14T10:13:59.462645Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T10:13:59.462645Z","title":"An autonomous integrated system for 3-D underwater terrain map reconstruction,","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2607.10649","last_updated":"2026-07-12T08:33:42Z","snapshot_observed_at":"2026-08-14T09:47:44.872181Z","submitted_at":"2026-07-12T08:33:42Z","title":"Coverage Path Planning: Classical Foundations, Recent Advances, and Future Directions","version":1},"reference_index":95,"source":"pdf_text","source_observed_at":"2026-07-14T10:13:59.462645Z"},"links":{"citing_paper":"/paper/2607.10649"},"observation_digest":"sha256:5665ebb162d6508497e8ed9571521da588d0530f0f397fc64f8745b930294572","observation_id":"ab904c94-b4cb-4a66-a9b9-eadefa7aee69","resolution":{"observed_at":"2026-07-14T10:13:59.462645Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T10:13:59.462645Z","title":"Autonomous 3-D mapping and safe-path planning for underwater terrain reconstruction using multi-level coverage trees,","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2607.10649","last_updated":"2026-07-12T08:33:42Z","snapshot_observed_at":"2026-08-14T09:47:44.872181Z","submitted_at":"2026-07-12T08:33:42Z","title":"Coverage Path Planning: Classical Foundations, Recent Advances, and Future Directions","version":1},"reference_index":96,"source":"pdf_text","source_observed_at":"2026-07-14T10:13:59.462645Z"},"links":{"citing_paper":"/paper/2607.10649"},"observation_digest":"sha256:4fc62063fa26b467363c25baeea20c12c11d1005fcaf91a887641572bccbcac1","observation_id":"59f01f36-8200-416e-819c-ca454b44eb1d","resolution":{"observed_at":"2026-07-14T10:13:59.462645Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T10:13:59.462645Z","title":"Coverage path planning with real-time replanning and surface reconstruction for inspection of three-dimensional underwater structures using autonomous underwater vehicles,","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2607.10649","last_updated":"2026-07-12T08:33:42Z","snapshot_observed_at":"2026-08-14T09:47:44.872181Z","submitted_at":"2026-07-12T08:33:42Z","title":"Coverage Path Planning: Classical Foundations, Recent Advances, and Future Directions","version":1},"reference_index":97,"source":"pdf_text","source_observed_at":"2026-07-14T10:13:59.462645Z"},"links":{"citing_paper":"/paper/2607.10649"},"observation_digest":"sha256:6bcf0a9e23a552fe4489ee1234c5b2b93dcdde61cd1ed58950f811e996cf8ddb","observation_id":"78b488b7-5342-41ff-acf3-6481ffbb97c8","resolution":{"observed_at":"2026-07-14T10:13:59.462645Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T10:13:59.462645Z","title":"Energy-efficient coverage path planning for general terrain surfaces,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.10649","last_updated":"2026-07-12T08:33:42Z","snapshot_observed_at":"2026-08-14T09:47:44.872181Z","submitted_at":"2026-07-12T08:33:42Z","title":"Coverage Path Planning: Classical Foundations, Recent Advances, and Future Directions","version":1},"reference_index":98,"source":"pdf_text","source_observed_at":"2026-07-14T10:13:59.462645Z"},"links":{"citing_paper":"/paper/2607.10649"},"observation_digest":"sha256:7305162691be5fd8118c15225571f2b7fd48f62ef73ea596c6bbdd2694951998","observation_id":"d9621c44-55cc-4aff-bcdf-8ef39a34f75a","resolution":{"observed_at":"2026-07-14T10:13:59.462645Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T10:13:59.462645Z","title":"Energy-aware UA V coverage planning in mountainous terrain via contour-aligned path generation,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.10649","last_updated":"2026-07-12T08:33:42Z","snapshot_observed_at":"2026-08-14T09:47:44.872181Z","submitted_at":"2026-07-12T08:33:42Z","title":"Coverage Path Planning: Classical Foundations, Recent Advances, and Future Directions","version":1},"reference_index":99,"source":"pdf_text","source_observed_at":"2026-07-14T10:13:59.462645Z"},"links":{"citing_paper":"/paper/2607.10649"},"observation_digest":"sha256:47d0ff2400f71a6e93ee6bf80f71905c7d1104c4bf050503b7a4231a95d439ff","observation_id":"31e337bd-c762-43bb-abdd-1c84cafa49d0","resolution":{"observed_at":"2026-07-14T10:13:59.462645Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T10:13:59.462645Z","title":"Robot coverage path planning for general surfaces using quadratic differentials,","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2607.10649","last_updated":"2026-07-12T08:33:42Z","snapshot_observed_at":"2026-08-14T09:47:44.872181Z","submitted_at":"2026-07-12T08:33:42Z","title":"Coverage Path Planning: Classical Foundations, Recent Advances, and Future Directions","version":1},"reference_index":100,"source":"pdf_text","source_observed_at":"2026-07-14T10:13:59.462645Z"},"links":{"citing_paper":"/paper/2607.10649"},"observation_digest":"sha256:1f78f8d2807697d96723eb7c5136b49cea2768c56fbf3e60161c7ed18b86dcaa","observation_id":"7837759a-b929-4e94-ba29-3f6df0b89959","resolution":{"observed_at":"2026-07-14T10:13:59.462645Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2607.10649","last_updated":"2026-07-12T08:33:42Z","latest_version":1,"primary_category":"cs.RO","snapshot_observed_at":"2026-08-14T09:47:44.872181Z","submitted_at":"2026-07-12T08:33:42Z","title":"Coverage Path Planning: Classical Foundations, Recent Advances, and Future Directions"},"reference_resolution":{"displayed":100,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":100,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":158},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"thesis":"As of 21 August 2026, this Paper Citation Record lists 100 of 158 outbound references and 0 inbound Pith citation observations for arXiv:2607.10649."}