Conceptio › Archive › arXiv (All)
arXiv (All) open access

Robust sensor coverage in the presence of spatial obstacles and exclusion zones

Datta, Vanshika et al. · arxiv_all
arXiv (All) · Papers
Open Source ↗Direct PDF ↓
optimization-and-control
Conceptio Open Archive

Analyze & explore related research in Conceptio

Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.

[2607.11449] Robust sensor coverage in the presence of spatial obstacles and exclusion zones Skip to main content Search Submit Donate Log in Mathematics > Optimization and Control arXiv:2607.11449 (math) [Submitted on 13 Jul 2026 ( v1 ), last revised 28 Aug 2026 (this version, v3)] Title: Robust sensor coverage in the presence of spatial obstacles and exclusion zones Authors: Vanshika Datta , C. Nahak View PDF HTML (experimental) Abstract: In this article, we develop a robust optimization framework for obstacle-aware aerial directional sensor networks operating under positional uncertainty using a sector-based sensing model. The monitoring area is discretized into grid points and a unified geometric formulation is developed to model directional sensing while explicitly accounting for obstacle-induced visibility loss and exclusion regions. To enhance sensing performance under uncertainty, three progressive optimization strategies, namely robust aerial grid coverage (RAGC), robust aerial target coverage (RATC) and robust aerial target scheduling (RATS), are proposed. The framework employs robust orientation optimization based on the radius of robust feasibility to maximize effective grid and target coverage under sensor perturbations, followed by a target-aware sleep scheduling mechanism that minimizes the number of active sensors without compromising target monitoring. Extensive simulations under varying target distributions, obstacle configurations, uncertainty levels and sensor failure scenarios demonstrate that the proposed framework achieves robust and energy-efficient sensing while consistently outperforming representative approaches from the literature in terms of coverage quality, target monitoring and sensor utilization. Subjects: Optimization and Control (math.OC) Cite as: arXiv:2607.11449 [math.OC] (or arXiv:2607.11449v3 [math.OC] for this version) https://doi.org/10.48550/arXiv.2607.11449 Focus to learn more arXiv-issued DOI via DataCite Submission history From: Vanshika Datta [ view email ] [v1] Mon, 13 Jul 2026 11:59:54 UTC (3,126 KB) [v2] Tue, 14 Jul 2026 12:16:24 UTC (3,126 KB) [v3] Fri, 28 Aug 2026 10:26:37 UTC (2,985 KB) Full-text links: Access Paper: View PDF HTML (experimental) TeX Source view license Current browse context: math.OC < prev | next > new | recent | 2026-07 Change to browse by: math References & Citations SciX Google Scholar Semantic Scholar export BibTeX citation Bookmark Bibliographic Tools Bibliographic and Citation Tools Bibliographic Explorer Toggle Bibliographic Explorer ( What is the Explorer? ) Connected Papers Toggle Connected Papers ( What is Connected Papers? ) Litmaps Toggle Litmaps ( What is Litmaps? ) scite.ai Toggle scite Smart Citations ( What are Smart Citations? ) Code, Data, Media Code, Data and Media Associated with this Article alphaXiv Toggle alphaXiv ( What is alphaXiv? ) Links to Code Toggle CatalyzeX Code Finder for Papers ( What is CatalyzeX? ) DagsHub Toggle DagsHub ( What is DagsHub? ) GotitPub Toggle Gotit.pub ( What is GotitPub? ) Huggingface Toggle Hugging Face ( What is Huggingface? ) ScienceCast Toggle ScienceCast ( What is ScienceCast? ) Demos Demos Replicate Toggle Replicate ( What is Replicate? ) Spaces Toggle Hugging Face Spaces ( What is Spaces? ) Spaces Toggle TXYZ.AI ( What is TXYZ.AI? ) Related Papers Recommenders and Search Tools Link to Influence Flower Influence Flower ( What are Influence Flowers? ) Core recommender toggle CORE Recommender ( What is CORE? ) Author Venue Institution Topic About arXivLabs arXivLabs: experimental projects with community collaborators arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website. Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them. Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs . Which authors of this paper are endorsers? | Disable MathJax ( What is MathJax? ) We gratefully acknowledge support from our major funders , member institutions , and all contributors. About · Help · Contact · Subscribe · Copyright · Privacy · Accessibility · Operational Status (opens in new tab)

Related documents

Record · ID 684532 · SHA-256 7f75ebc39bd25506
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive