Decentralized Multi-Drone Coverage Path Planning with Adaptive Path Deconfliction

preprint OA: closed
Full text JSON View at publisher
Full text 12,842 characters · extracted from preprint-html · click to expand
Decentralized Multi-Drone Coverage Path Planning with Adaptive Path Deconfliction | Research Square window.SnipcartSettings = { analytics: { enabled: false } }; (function() { var accessVector = localStorage.getItem('access_vector') || ''; window.dataLayer = window.dataLayer || []; if (accessVector) { window.dataLayer.push({ user: { profile: { profileInfo: { snid: accessVector } } } }); } })(); (function(w,d,s,l,i){w[l]=w[l]||[];w[l].push({'gtm.start':new Date().getTime(),event:'gtm.js'});var f=d.getElementsByTagName(s)[0],j=d.createElement(s),dl=l!='dataLayer'?'&l='+l:'';j.async=true;j.src='https://www.googletagmanager.com/gtm.js?id='+i+dl;f.parentNode.insertBefore(j,f);})(window,document,'script','dataLayer','GTM-K279D39R'); Browse Preprints In Review Journals COVID-19 Preprints AJE Video Bytes Research Tools Research Promotion AJE Professional Editing AJE Rubriq About Preprint Platform In Review Editorial Policies Our Team Advisory Board Help Center Sign In Submit a Preprint Cite Share Download PDF Research Article Decentralized Multi-Drone Coverage Path Planning with Adaptive Path Deconfliction Lidia Rocha, Kelen Vivaldini, Frederico Gonçalves, Mauricio Schiezaro This is a preprint; it has not been peer reviewed by a journal. https://doi.org/ 10.21203/rs.3.rs-8779568/v1 This work is licensed under a CC BY 4.0 License Status: Under Review Version 1 posted 14 You are reading this latest preprint version Abstract Decentralized multi-UAV coverage approaches often remain inefficient due to weak inter-agent coordination and the lack of mechanisms that promote coherent global organization under limited communication. To address these challenges, we present a fully decentralized coverage framework that integrates frontier-based local exploration with implicit region allocation emerging from decentralized map fusion and repeated frontier competition. This process induces balanced and non-overlapping exploration behavior without explicit partition computation or centralized supervision. A Kalman-based trajectory prediction module is incorporated directly into the planning process to anticipate inter-agent interactions, enabling proactive deconfliction and safer multi-robot navigation using only local information. Experiments in indoor and outdoor environments demonstrate an average reduction of over 27% in unvisited-cell rate, a 91% decrease in path overlap and redundancy in decentralized flights, and 58% faster coverage compared to classical decentralized baselines. Coverage Multi-UAV Planning Full Text Additional Declarations No competing interests reported. Cite Share Download PDF Status: Under Review Version 1 posted Editorial decision: Revision requested 03 Apr, 2026 Reviews received at journal 30 Mar, 2026 Reviews received at journal 21 Mar, 2026 Reviews received at journal 18 Mar, 2026 Reviews received at journal 16 Mar, 2026 Reviewers agreed at journal 20 Feb, 2026 Reviewers agreed at journal 18 Feb, 2026 Reviewers agreed at journal 17 Feb, 2026 Reviewers agreed at journal 17 Feb, 2026 Reviewers agreed at journal 16 Feb, 2026 Reviewers invited by journal 16 Feb, 2026 Editor assigned by journal 05 Feb, 2026 Submission checks completed at journal 05 Feb, 2026 First submitted to journal 03 Feb, 2026 You are reading this latest preprint version Research Square lets you share your work early, gain feedback from the community, and start making changes to your manuscript prior to peer review in a journal. As a division of Research Square Company, we’re committed to making research communication faster, fairer, and more useful. We do this by developing innovative software and high quality services for the global research community. Our growing team is made up of researchers and industry professionals working together to solve the most critical problems facing scientific publishing. Also discoverable on Platform About Our Team In Review Editorial Policies Advisory Board Help Center Resources Author Services Accessibility API Access RSS feed Manage Cookie Preferences © Research Square 2026 | ISSN 2693-5015 (online) Privacy Policy Terms of Service Do Not Sell My Personal Information {"props":{"pageProps":{"initialData":{"identity":"rs-8779568","acceptedTermsAndConditions":true,"allowDirectSubmit":false,"archivedVersions":[],"articleType":"Research Article","associatedPublications":[],"authors":[{"id":593463312,"identity":"aa9b9bd7-b6ac-4b69-90f5-06fc349f5807","order_by":0,"name":"Lidia Rocha","email":"data:image/png;base64,iVBORw0KGgoAAAANSUhEUgAAAZAAAAAyAQMAAABI0h/eAAAABlBMVEX///8AAABVwtN+AAAACXBIWXMAAA7EAAAOxAGVKw4bAAABDklEQVRIie3Qv0sDMRTA8VcO4hKa9UmP/g2Bg4ztv/JKwS43VA7kQJED4SbdPfwnLP0HrgTOJTgrLaVTJ4d0EQcR5YpgMeePTSTfKZD3IeQB+Hx/sHYAsqxPCK3V7h26CftAArk710QA5PsAw5+RvWBSPsGyK67O1sc8XZzKuYkspMte1rlYOUnAxrNzSCJcVGrOzRrlbawQTDLMwhvpJlyWHGhwjaTui1yjNFxBK6ch4EHD97mcPddk9HhYvNQkst8RvX0lVrDJaiLxjfSaCRvrUFKEd3GCttL7hWFHSIaIhZWTCKGnm4eUuuJyNLF0okXbBFNrU+qLTu4k2z5thgAGXwF3/V8Ln8/n+6+9AgxxVvfKI0+tAAAAAElFTkSuQmCC","orcid":"","institution":"Venturus","correspondingAuthor":true,"prefix":"","firstName":"Lidia","middleName":"","lastName":"Rocha","suffix":""},{"id":593463314,"identity":"d84667c5-42e2-4ef0-879f-9bf356c6781f","order_by":1,"name":"Kelen Vivaldini","email":"","orcid":"","institution":"Federal University of São Carlos","correspondingAuthor":false,"prefix":"","firstName":"Kelen","middleName":"","lastName":"Vivaldini","suffix":""},{"id":593463316,"identity":"c40d21bc-3da3-4ff6-9043-57af25172f60","order_by":2,"name":"Frederico Gonçalves","email":"","orcid":"","institution":"Venturus","correspondingAuthor":false,"prefix":"","firstName":"Frederico","middleName":"","lastName":"Gonçalves","suffix":""},{"id":593463318,"identity":"722c33f1-5832-4ddf-a295-d7de0217f140","order_by":3,"name":"Mauricio Schiezaro","email":"","orcid":"","institution":"Venturus","correspondingAuthor":false,"prefix":"","firstName":"Mauricio","middleName":"","lastName":"Schiezaro","suffix":""}],"badges":[],"createdAt":"2026-02-03 19:53:17","currentVersionCode":1,"declarations":"","doi":"10.21203/rs.3.rs-8779568/v1","doiUrl":"https://doi.org/10.21203/rs.3.rs-8779568/v1","draftVersion":[],"editorialEvents":[],"editorialNote":"","failedWorkflow":false,"files":[{"id":103049525,"identity":"a3077741-a5e7-4610-8850-18103c8436f7","added_by":"auto","created_at":"2026-02-20 07:42:09","extension":"pdf","order_by":1,"title":"","display":"","copyAsset":false,"role":"manuscript-pdf","size":3048224,"visible":true,"origin":"","legend":"","description":"","filename":"2026ArticleMulticoverageLidia.pdf","url":"https://assets-eu.researchsquare.com/files/rs-8779568/v1_covered_f0ac0515-0303-4ca8-b51b-73f2acaf3067.pdf"}],"financialInterests":"No competing interests reported.","formattedTitle":"Decentralized Multi-Drone Coverage Path Planning with Adaptive Path Deconfliction","fulltext":[],"fulltextSource":"","fullText":"","funders":[],"hasAdminPriorityOnWorkflow":false,"hasManuscriptDocX":false,"hasOptedInToPreprint":true,"hasPassedJournalQc":"","hasAnyPriority":false,"hideJournal":false,"highlight":"","institution":"","isAcceptedByJournal":false,"isAuthorSuppliedPdf":true,"isDeskRejected":"","isHiddenFromSearch":false,"isInQc":false,"isInWorkflow":false,"isPdf":true,"isPdfUpToDate":true,"isWithdrawnOrRetracted":false,"journal":{"display":true,"email":"[email protected]","identity":"international-journal-of-intelligent-robotics-and-applications","isNatureJournal":false,"hasQc":true,"allowDirectSubmit":false,"externalIdentity":"jira","sideBox":"Learn more about [International Journal of Intelligent Robotics and Applications](https://www.springer.com/journal/41315)","snPcode":"41315","submissionUrl":"https://submission.springernature.com/new-submission/41315/3","title":"International Journal of Intelligent Robotics and Applications","twitterHandle":"","acdcEnabled":true,"dfaEnabled":true,"editorialSystem":"stoa","reportingPortfolio":"Springer Hybrid","inReviewEnabled":true,"inReviewRevisionsEnabled":false},"keywords":"Coverage, Multi-UAV, Planning","lastPublishedDoi":"10.21203/rs.3.rs-8779568/v1","lastPublishedDoiUrl":"https://doi.org/10.21203/rs.3.rs-8779568/v1","license":{"name":"CC BY 4.0","url":"https://creativecommons.org/licenses/by/4.0/"},"manuscriptAbstract":"\u003cp\u003eDecentralized multi-UAV coverage approaches often remain inefficient due to weak inter-agent coordination and the lack of mechanisms that promote coherent global organization under limited communication. To address these challenges, we present a fully decentralized coverage framework that integrates frontier-based local exploration with implicit region allocation emerging from decentralized map fusion and repeated frontier competition. This process induces balanced and non-overlapping exploration behavior without explicit partition computation or centralized supervision. A Kalman-based trajectory prediction module is incorporated directly into the planning process to anticipate inter-agent interactions, enabling proactive deconfliction and safer multi-robot navigation using only local information. Experiments in indoor and outdoor environments demonstrate an average reduction of over 27% in unvisited-cell rate, a 91% decrease in path overlap and redundancy in decentralized flights, and 58% faster coverage compared to classical decentralized baselines.\u003c/p\u003e","manuscriptTitle":"Decentralized Multi-Drone Coverage Path Planning with Adaptive Path Deconfliction","msid":"","msnumber":"","nonDraftVersions":[{"code":1,"date":"2026-02-19 05:46:56","doi":"10.21203/rs.3.rs-8779568/v1","editorialEvents":[{"type":"communityComments","content":0},{"type":"decision","content":"Revision requested","date":"2026-04-03T16:33:21+00:00","index":"","fulltext":""},{"type":"editorInvitedReview","content":"","date":"2026-03-30T06:32:54+00:00","index":"hide","fulltext":""},{"type":"editorInvitedReview","content":"","date":"2026-03-21T16:08:16+00:00","index":"hide","fulltext":""},{"type":"editorInvitedReview","content":"","date":"2026-03-19T01:00:49+00:00","index":"hide","fulltext":""},{"type":"editorInvitedReview","content":"","date":"2026-03-16T16:15:33+00:00","index":"hide","fulltext":""},{"type":"reviewerAgreed","content":"95821921225718491529431296906839556754","date":"2026-02-21T00:53:55+00:00","index":"hide","fulltext":""},{"type":"reviewerAgreed","content":"275692786207602021300347577183078586596","date":"2026-02-18T16:57:31+00:00","index":"hide","fulltext":""},{"type":"reviewerAgreed","content":"228385423720314471642051175377787336178","date":"2026-02-17T15:24:17+00:00","index":"hide","fulltext":""},{"type":"reviewerAgreed","content":"275536604524502941937514284066934511587","date":"2026-02-17T07:47:18+00:00","index":"hide","fulltext":""},{"type":"reviewerAgreed","content":"112011265595178755636523565217375519762","date":"2026-02-16T15:13:15+00:00","index":"hide","fulltext":""},{"type":"reviewersInvited","content":"","date":"2026-02-16T12:45:18+00:00","index":"","fulltext":""},{"type":"editorAssigned","content":"","date":"2026-02-05T07:31:14+00:00","index":"","fulltext":""},{"type":"checksComplete","content":"","date":"2026-02-05T07:25:51+00:00","index":"","fulltext":""},{"type":"submitted","content":"International Journal of Intelligent Robotics and Applications","date":"2026-02-03T19:37:46+00:00","index":"","fulltext":""}],"status":"published","journal":{"display":true,"email":"[email protected]","identity":"international-journal-of-intelligent-robotics-and-applications","isNatureJournal":false,"hasQc":true,"allowDirectSubmit":false,"externalIdentity":"jira","sideBox":"Learn more about [International Journal of Intelligent Robotics and Applications](https://www.springer.com/journal/41315)","snPcode":"41315","submissionUrl":"https://submission.springernature.com/new-submission/41315/3","title":"International Journal of Intelligent Robotics and Applications","twitterHandle":"","acdcEnabled":true,"dfaEnabled":true,"editorialSystem":"stoa","reportingPortfolio":"Springer Hybrid","inReviewEnabled":true,"inReviewRevisionsEnabled":false}}],"origin":"","ownerIdentity":"3f08089d-b589-403d-9368-f6cca37a74e6","owner":[],"postedDate":"February 19th, 2026","published":true,"recentEditorialEvents":[],"rejectedJournal":[],"revision":"","amendment":"","status":"under-review","subjectAreas":[],"tags":[],"updatedAt":"2026-05-14T23:24:29+00:00","versionOfRecord":[],"versionCreatedAt":"2026-02-19 05:46:56","video":"","vorDoi":"","vorDoiUrl":"","workflowStages":[]},"version":"v1","identity":"rs-8779568","journalConfig":"researchsquare"},"__N_SSP":true},"page":"/article/[identity]/[[...version]]","query":{"redirect":"/article/rs-8779568","identity":"rs-8779568","version":["v1"]},"buildId":"XKTyCvWXoU3ODBz1xrDgd","isFallback":false,"isExperimentalCompile":false,"dynamicIds":[84888],"gssp":true,"scriptLoader":[]}

Text is read by the "Ask this paper" AI Q&A widget below. Extraction quality varies by source — PMC NXML preserves structure cleanly, OA-HTML may include some navigation residue, and OA-PDF can have broken hyphenation. The publisher copy (via DOI) is the canonical version.

My notes (saved in your browser only)

Ask this paper AI returns verbatim quotes from the full text · source: preprint-html

Answers must be backed by verbatim quotes from this paper's full text. Hallucinated quotes are dropped automatically; if no verbatim passage answers the question, we say so. How this works

Citation neighborhood (no data yet)

We don't have any in-corpus citations linked to this paper yet. This is a recent paper (2026) — citers typically take a year or two to land, and the OpenAlex reference graph may still be filling in.

Source provenance

europepmc
last seen: 2026-05-20T01:45:00.602351+00:00