On-Orbit Servicing Networks in Cislunar Space: A Framework for Orbit Selection, Transfer Design, and Scheduling

preprint OA: closed
Full text JSON View at publisher

Abstract

Abstract This investigation introduces a comprehensive framework for designing and optimizing on-orbit servicing networks in cislunar space, integrating innovative approaches to orbit selection, transfer design, and initial scheduling. Within the context of this investigation, scheduling refers to the selection of the servicer-customer satellite pairings and the order in which each of the customer hubs are processed. A genetic algorithm serves as a basis for initial orbit selection, as well as search space reduction by adhering to beneficial criteria such as deployment costs, station-keeping requirements, and Lunar south pole coverage. The Genetic Algorithm is also leveraged to identify high-performing orbit families while supporting the extension to additional mission objectives. A phasing-informed transfer design pipeline is introduced, employing manifold arc trajectories and phasing penalties to estimate transfer costs efficiently for long-range rendezvous. This approach enhances the understanding of the underlying dynamics that is critical for trajectory design and schedule development. Two initial scheduling solutions are proposed: an Auction Algorithm with a low computational cost and a computationally intensive Genetic Algorithm. These strategies facilitate the creation of scalable servicing plans across diverse orbital configurations and a varying numbers of satellites. Trade space analysis further identifies optimal orbit configurations that align with mission requirements. This versatile and adaptable methodology offers critical insights into orbit selection, transfer trajectory design, and servicer scheduling options, delivering a robust foundation for designing servicing networks tailored to meet diverse mission objectives.
Full text 11,596 characters · extracted from preprint-html · click to expand
On-Orbit Servicing Networks in Cislunar Space: A Framework for Orbit Selection, Transfer Design, and Scheduling | 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 On-Orbit Servicing Networks in Cislunar Space: A Framework for Orbit Selection, Transfer Design, and Scheduling Cody Waldecker, Kathleen Howell This is a preprint; it has not been peer reviewed by a journal. https://doi.org/ 10.21203/rs.3.rs-7021291/v1 This work is licensed under a CC BY 4.0 License Status: Published Journal Publication published 25 Nov, 2025 Read the published version in The Journal of the Astronautical Sciences → Version 1 posted You are reading this latest preprint version Abstract This investigation introduces a comprehensive framework for designing and optimizing on-orbit servicing networks in cislunar space, integrating innovative approaches to orbit selection, transfer design, and initial scheduling. Within the context of this investigation, scheduling refers to the selection of the servicer-customer satellite pairings and the order in which each of the customer hubs are processed. A genetic algorithm serves as a basis for initial orbit selection, as well as search space reduction by adhering to beneficial criteria such as deployment costs, station-keeping requirements, and Lunar south pole coverage. The Genetic Algorithm is also leveraged to identify high-performing orbit families while supporting the extension to additional mission objectives. A phasing-informed transfer design pipeline is introduced, employing manifold arc trajectories and phasing penalties to estimate transfer costs efficiently for long-range rendezvous. This approach enhances the understanding of the underlying dynamics that is critical for trajectory design and schedule development. Two initial scheduling solutions are proposed: an Auction Algorithm with a low computational cost and a computationally intensive Genetic Algorithm. These strategies facilitate the creation of scalable servicing plans across diverse orbital configurations and a varying numbers of satellites. Trade space analysis further identifies optimal orbit configurations that align with mission requirements. This versatile and adaptable methodology offers critical insights into orbit selection, transfer trajectory design, and servicer scheduling options, delivering a robust foundation for designing servicing networks tailored to meet diverse mission objectives. On-Orbit Servicing Trajectory Design Three-body problem Full Text Additional Declarations No competing interests reported. Cite Share Download PDF Status: Published Journal Publication published 25 Nov, 2025 Read the published version in The Journal of the Astronautical Sciences → Version 1 posted 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-7021291","acceptedTermsAndConditions":true,"allowDirectSubmit":true,"archivedVersions":[],"articleType":"Research Article","associatedPublications":[],"authors":[{"id":480074641,"identity":"e8c06d50-9a2a-4229-9502-45dbd3110771","order_by":0,"name":"Cody Waldecker","email":"data:image/png;base64,iVBORw0KGgoAAAANSUhEUgAAAZAAAAAyAQMAAABI0h/eAAAABlBMVEX///8AAABVwtN+AAAACXBIWXMAAA7EAAAOxAGVKw4bAAAA2klEQVRIiWNgGAWjYHACxgM8DAwG/CAmD1gggbAesBbJBpK1GBwgVgv/jOQHB95U2Bkb3+4x+/C2zYaBnz3HAK8WiRtpBgfnnEk2M7tzxnjm3LY0BsmeN/i1GEgnGBzmbTtgY3Yjx5iZt+0wg8ENArYYSKd/OMz774CN8Qywlv8M9oS15ABtaThgZiAB1nKAAcgg4Jf7bwoOzjmWbCxx51gx45xzyTwSZ54V4NXC33N844M3NXaG/bObNzO8KbOT429P3oBXC5J9EIqHSOVIWkbBKBgFo2AUYAAASPNHC3x/DtsAAAAASUVORK5CYII=","orcid":"","institution":"Purdue University West Lafayette","correspondingAuthor":true,"prefix":"","firstName":"Cody","middleName":"","lastName":"Waldecker","suffix":""},{"id":480074642,"identity":"ca2f330d-157b-4125-b69c-07d950b1e9d0","order_by":1,"name":"Kathleen Howell","email":"","orcid":"","institution":"Purdue University West Lafayette","correspondingAuthor":false,"prefix":"","firstName":"Kathleen","middleName":"","lastName":"Howell","suffix":""}],"badges":[],"createdAt":"2025-07-01 14:23:19","currentVersionCode":1,"declarations":"","doi":"10.21203/rs.3.rs-7021291/v1","doiUrl":"https://doi.org/10.21203/rs.3.rs-7021291/v1","draftVersion":[],"editorialEvents":[{"content":"https://doi.org/10.1007/s40295-025-00551-1","type":"published","date":"2025-11-25T15:58:41+00:00"}],"editorialNote":"","failedWorkflow":false,"files":[{"id":97179494,"identity":"092f0b93-69da-446f-96e2-0cc37b0e9e04","added_by":"auto","created_at":"2025-12-01 16:15:57","extension":"pdf","order_by":1,"title":"","display":"","copyAsset":false,"role":"manuscript-pdf","size":4274182,"visible":true,"origin":"","legend":"","description":"","filename":"JASPaperFormat.pdf","url":"https://assets-eu.researchsquare.com/files/rs-7021291/v1_covered_600662f0-5a1d-4a3f-a50a-c7f9b95e0196.pdf"}],"financialInterests":"No competing interests reported.","formattedTitle":"\u003cp\u003eOn-Orbit Servicing Networks in Cislunar Space: A Framework for Orbit Selection, Transfer Design, and Scheduling\u003c/p\u003e","fulltext":[],"fulltextSource":"","fullText":"","funders":[],"hasAdminPriorityOnWorkflow":false,"hasManuscriptDocX":false,"hasOptedInToPreprint":true,"hasPassedJournalQc":"","hasAnyPriority":false,"hideJournal":true,"highlight":"","institution":"","isAcceptedByJournal":true,"isAuthorSuppliedPdf":true,"isDeskRejected":"","isHiddenFromSearch":false,"isInQc":false,"isInWorkflow":false,"isPdf":true,"isPdfUpToDate":true,"isWithdrawnOrRetracted":false,"journal":{"display":true,"email":"[email protected]","identity":"researchsquare","isNatureJournal":false,"hasQc":true,"allowDirectSubmit":true,"externalIdentity":"","sideBox":"","snPcode":"","submissionUrl":"/submission","title":"Research Square","twitterHandle":"researchsquare","acdcEnabled":true,"dfaEnabled":false,"editorialSystem":"","reportingPortfolio":"","inReviewEnabled":false,"inReviewRevisionsEnabled":true},"keywords":"On-Orbit Servicing, Trajectory Design, Three-body problem","lastPublishedDoi":"10.21203/rs.3.rs-7021291/v1","lastPublishedDoiUrl":"https://doi.org/10.21203/rs.3.rs-7021291/v1","license":{"name":"CC BY 4.0","url":"https://creativecommons.org/licenses/by/4.0/"},"manuscriptAbstract":"This investigation introduces a comprehensive framework for designing and optimizing on-orbit servicing networks in cislunar space, integrating innovative approaches to orbit selection, transfer design, and initial scheduling. Within the context of this investigation, scheduling refers to the selection of the servicer-customer satellite pairings and the order in which each of the customer hubs are processed. A genetic algorithm serves as a basis for initial orbit selection, as well as search space reduction by adhering to beneficial criteria such as deployment costs, station-keeping requirements, and Lunar south pole coverage. The Genetic Algorithm is also leveraged to identify high-performing orbit families while supporting the extension to additional mission objectives. A phasing-informed transfer design pipeline is introduced, employing manifold arc trajectories and phasing penalties to estimate transfer costs efficiently for long-range rendezvous. This approach enhances the understanding of the underlying dynamics that is critical for trajectory design and schedule development. Two initial scheduling solutions are proposed: an Auction Algorithm with a low computational cost and a computationally intensive Genetic Algorithm. These strategies facilitate the creation of scalable servicing plans across diverse orbital configurations and a varying numbers of satellites. Trade space analysis further identifies optimal orbit configurations that align with mission requirements. This versatile and adaptable methodology offers critical insights into orbit selection, transfer trajectory design, and servicer scheduling options, delivering a robust foundation for designing servicing networks tailored to meet diverse mission objectives.","manuscriptTitle":"On-Orbit Servicing Networks in Cislunar Space: A Framework for Orbit Selection, Transfer Design, and Scheduling","msid":"","msnumber":"","nonDraftVersions":[{"code":1,"date":"2025-07-04 14:36:17","doi":"10.21203/rs.3.rs-7021291/v1","editorialEvents":[{"type":"communityComments","content":0}],"status":"published","journal":{"display":true,"email":"[email protected]","identity":"researchsquare","isNatureJournal":false,"hasQc":true,"allowDirectSubmit":true,"externalIdentity":"","sideBox":"","snPcode":"","submissionUrl":"/submission","title":"Research Square","twitterHandle":"researchsquare","acdcEnabled":true,"dfaEnabled":false,"editorialSystem":"","reportingPortfolio":"","inReviewEnabled":false,"inReviewRevisionsEnabled":true}}],"origin":"","ownerIdentity":"53f6235e-d264-405b-b7ed-7726c61e2ce0","owner":[],"postedDate":"July 4th, 2025","published":true,"recentEditorialEvents":[],"rejectedJournal":[],"revision":"","amendment":"","status":"posted","subjectAreas":[],"tags":[],"updatedAt":"2025-12-01T16:12:12+00:00","versionOfRecord":{"articleIdentity":"rs-7021291","link":"https://doi.org/10.1007/s40295-025-00551-1","journal":{"identity":"the-journal-of-the-astronautical-sciences","isVorOnly":false,"title":"The Journal of the Astronautical Sciences"},"publishedOn":"2025-11-25 15:58:41","publishedOnDateReadable":"November 25th, 2025"},"versionCreatedAt":"2025-07-04 14:36:17","video":"","vorDoi":"10.1007/s40295-025-00551-1","vorDoiUrl":"https://doi.org/10.1007/s40295-025-00551-1","workflowStages":[]},"version":"v1","identity":"rs-7021291","journalConfig":"researchsquare"},"__N_SSP":true},"page":"/article/[identity]/[[...version]]","query":{"redirect":"/article/rs-7021291","identity":"rs-7021291","version":["v1"]},"buildId":"8U1c8b4HqxoKbykW_rLl7","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 (2025) — 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