Multi-Objective Trajectory and Power Optimization for UAV Relay Systems: A Pareto-Driven Approach Using Metaheuristics

preprint OA: closed
Full text JSON View at publisher
Full text 12,046 characters · extracted from preprint-html · click to expand
Multi-Objective Trajectory and Power Optimization for UAV Relay Systems: A Pareto-Driven Approach Using Metaheuristics | 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 Multi-Objective Trajectory and Power Optimization for UAV Relay Systems: A Pareto-Driven Approach Using Metaheuristics Trang Pham, Hang Duong, Duong Dinh Trieu, Vu Trinh Anh This is a preprint; it has not been peer reviewed by a journal. https://doi.org/ 10.21203/rs.3.rs-9300384/v1 This work is licensed under a CC BY 4.0 License Status: Under Review Version 1 posted 8 You are reading this latest preprint version Abstract This paper addresses the joint trajectory and power optimization problem for UAV-assisted amplify-and-forward (AF) relay systems under probabilis-tic LoS/NLoS channels. A max–min throughput formulation is adopted to ensure fairness among multiple ground users while capturing the trade-off between system efficiency and quality-of-service (QoS). To solve the resulting high-dimensional non-convex problem, we propose an efficient metaheuristic framework based on the Chernobyl Disaster Optimizer (CDO), which avoids complex convex approximations required by conventional methods. Simulation results show that the proposed approach consistently outperforms benchmark algorithms, including PSO, BA, and SCA, while maintaining a stable and high minimum rate as user density increases. Furthermore, Pareto-front and statistical analyses confirm the robustness and reliability of the proposed method in realistic urban deployment scenarios. UAV max–min fairness throughput metaheuristic optimization trajectory Full Text Additional Declarations No competing interests reported. Cite Share Download PDF Status: Under Review Version 1 posted Reviews received at journal 17 May, 2026 Reviews received at journal 11 May, 2026 Reviewers agreed at journal 05 May, 2026 Reviewers agreed at journal 05 May, 2026 Reviewers invited by journal 05 May, 2026 Editor assigned by journal 30 Apr, 2026 Submission checks completed at journal 03 Apr, 2026 First submitted to journal 02 Apr, 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-9300384","acceptedTermsAndConditions":true,"allowDirectSubmit":false,"archivedVersions":[],"articleType":"Research Article","associatedPublications":[],"authors":[{"id":638013731,"identity":"a67e2b9a-23cb-4d7d-a884-b87d18484d67","order_by":0,"name":"Trang Pham","email":"","orcid":"","institution":"Hanoi University of Industry","correspondingAuthor":false,"prefix":"","firstName":"Trang","middleName":"","lastName":"Pham","suffix":""},{"id":638013732,"identity":"762437f9-4bbf-471c-82c0-c7713c05a066","order_by":1,"name":"Hang Duong","email":"","orcid":"","institution":"Electric Power University","correspondingAuthor":false,"prefix":"","firstName":"Hang","middleName":"","lastName":"Duong","suffix":""},{"id":638013734,"identity":"01ae31cc-a909-43f6-b72b-71bfb98bff64","order_by":2,"name":"Duong Dinh Trieu","email":"data:image/png;base64,iVBORw0KGgoAAAANSUhEUgAAAZAAAAAyAQMAAABI0h/eAAAABlBMVEX///8AAABVwtN+AAAACXBIWXMAAA7EAAAOxAGVKw4bAAAAx0lEQVRIiWNgGAWjYDCCAyCCjUEOwmMjXouBMelaEhuI1sJ3I/nYwy9lf9I33O4xYPhQdpjB4HYDfi2SN9LSjWXOGeRuuHPGgHHGOaCWOwfwazG4kWMmLdlmkDtzRo4BM2/bYQbJGQnEaUmXBGn5S6wWyY9tBgn8EkAtjEAt/BIEtEieeZYmzXDO2LBfIq3gYM+5dB6CWviOJx+T/FEmJ88mkbzxwY8yazk2QlpAgJkHyjgAxDx4FCIA4w+ilI2CUTAKRsGIBQAGOEDdj8b81QAAAABJRU5ErkJggg==","orcid":"","institution":"Vietnam National University, Hanoi","correspondingAuthor":true,"prefix":"","firstName":"Duong","middleName":"Dinh","lastName":"Trieu","suffix":""},{"id":638013736,"identity":"a2b1da78-e6f0-4009-921a-159403ae96b5","order_by":3,"name":"Vu Trinh Anh","email":"","orcid":"","institution":"Vietnam National University, Hanoi","correspondingAuthor":false,"prefix":"","firstName":"Vu","middleName":"Trinh","lastName":"Anh","suffix":""}],"badges":[],"createdAt":"2026-04-02 08:38:59","currentVersionCode":1,"declarations":"","doi":"10.21203/rs.3.rs-9300384/v1","doiUrl":"https://doi.org/10.21203/rs.3.rs-9300384/v1","draftVersion":[],"editorialEvents":[],"editorialNote":"","failedWorkflow":false,"files":[{"id":109174471,"identity":"409721cd-76e6-4f6e-b4a9-f4ec74fcd614","added_by":"auto","created_at":"2026-05-13 09:16:53","extension":"pdf","order_by":1,"title":"","display":"","copyAsset":false,"role":"manuscript-pdf","size":614306,"visible":true,"origin":"","legend":"","description":"","filename":"MultiObjectiveTrajectoryandPower.pdf","url":"https://assets-eu.researchsquare.com/files/rs-9300384/v1_covered_3e308354-86d5-45a9-a02c-bd7452345dbe.pdf"}],"financialInterests":"No competing interests reported.","formattedTitle":"Multi-Objective Trajectory and Power Optimization for UAV Relay Systems: A Pareto-Driven Approach Using Metaheuristics","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":"wireless-networks","isNatureJournal":false,"hasQc":true,"allowDirectSubmit":false,"externalIdentity":"wine","sideBox":"Learn more about [Wireless Networks](http://link.springer.com/journal/11276)","snPcode":"11276","submissionUrl":"https://submission.nature.com/new-submission/11276/3","title":"Wireless Networks","twitterHandle":"","acdcEnabled":true,"dfaEnabled":true,"editorialSystem":"stoa","reportingPortfolio":"Springer Hybrid","inReviewEnabled":true,"inReviewRevisionsEnabled":false},"keywords":"UAV, max–min fairness, throughput, metaheuristic optimization, trajectory","lastPublishedDoi":"10.21203/rs.3.rs-9300384/v1","lastPublishedDoiUrl":"https://doi.org/10.21203/rs.3.rs-9300384/v1","license":{"name":"CC BY 4.0","url":"https://creativecommons.org/licenses/by/4.0/"},"manuscriptAbstract":"This paper addresses the joint trajectory and power optimization problem for UAV-assisted amplify-and-forward (AF) relay systems under probabilis-tic LoS/NLoS channels. A max–min throughput formulation is adopted to ensure fairness among multiple ground users while capturing the trade-off between system efficiency and quality-of-service (QoS). To solve the resulting high-dimensional non-convex problem, we propose an efficient metaheuristic framework based on the Chernobyl Disaster Optimizer (CDO), which avoids complex convex approximations required by conventional methods. Simulation results show that the proposed approach consistently outperforms benchmark algorithms, including PSO, BA, and SCA, while maintaining a stable and high minimum rate as user density increases. Furthermore, Pareto-front and statistical analyses confirm the robustness and reliability of the proposed method in realistic urban deployment scenarios.","manuscriptTitle":"Multi-Objective Trajectory and Power Optimization for UAV Relay Systems: A Pareto-Driven Approach Using Metaheuristics","msid":"","msnumber":"","nonDraftVersions":[{"code":1,"date":"2026-05-13 09:14:53","doi":"10.21203/rs.3.rs-9300384/v1","editorialEvents":[{"type":"communityComments","content":0},{"type":"editorInvitedReview","content":"","date":"2026-05-17T11:34:34+00:00","index":"hide","fulltext":""},{"type":"editorInvitedReview","content":"","date":"2026-05-11T07:29:31+00:00","index":"hide","fulltext":""},{"type":"reviewerAgreed","content":"65339822665855040391404195267534324465","date":"2026-05-06T02:41:19+00:00","index":"hide","fulltext":""},{"type":"reviewerAgreed","content":"268064289112223785118527972453913041538","date":"2026-05-06T02:11:51+00:00","index":"hide","fulltext":""},{"type":"reviewersInvited","content":"","date":"2026-05-06T00:58:12+00:00","index":"","fulltext":""},{"type":"editorAssigned","content":"","date":"2026-04-30T12:58:35+00:00","index":"","fulltext":""},{"type":"checksComplete","content":"","date":"2026-04-03T12:43:51+00:00","index":"","fulltext":""},{"type":"submitted","content":"Wireless Networks","date":"2026-04-02T08:36:30+00:00","index":"","fulltext":""}],"status":"published","journal":{"display":true,"email":"[email protected]","identity":"wireless-networks","isNatureJournal":false,"hasQc":true,"allowDirectSubmit":false,"externalIdentity":"wine","sideBox":"Learn more about [Wireless Networks](http://link.springer.com/journal/11276)","snPcode":"11276","submissionUrl":"https://submission.nature.com/new-submission/11276/3","title":"Wireless Networks","twitterHandle":"","acdcEnabled":true,"dfaEnabled":true,"editorialSystem":"stoa","reportingPortfolio":"Springer Hybrid","inReviewEnabled":true,"inReviewRevisionsEnabled":false}}],"origin":"","ownerIdentity":"65282932-78ba-4b15-9e4a-31a3d0946c3f","owner":[],"postedDate":"May 13th, 2026","published":true,"recentEditorialEvents":[{"type":"editorInvitedReview","content":"","date":"2026-05-17T11:34:34+00:00","index":10,"fulltext":""},{"type":"editorInvitedReview","content":"","date":"2026-05-11T07:29:31+00:00","index":9,"fulltext":""},{"type":"reviewerAgreed","content":"65339822665855040391404195267534324465","date":"2026-05-06T02:41:19+00:00","index":8,"fulltext":""},{"type":"reviewerAgreed","content":"268064289112223785118527972453913041538","date":"2026-05-06T02:11:51+00:00","index":7,"fulltext":""},{"type":"reviewersInvited","content":"3","date":"2026-05-06T00:58:12+00:00","index":"","fulltext":""},{"type":"editorAssigned","content":"","date":"2026-04-30T12:58:35+00:00","index":"","fulltext":""}],"rejectedJournal":[],"revision":"","amendment":"","status":"under-review","subjectAreas":[],"tags":[],"updatedAt":"2026-05-13T09:14:53+00:00","versionOfRecord":[],"versionCreatedAt":"2026-05-13 09:14:53","video":"","vorDoi":"","vorDoiUrl":"","workflowStages":[]},"version":"v1","identity":"rs-9300384","journalConfig":"researchsquare"},"__N_SSP":true},"page":"/article/[identity]/[[...version]]","query":{"redirect":"/article/rs-9300384","identity":"rs-9300384","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