<?xml version="1.0" encoding="UTF-8"?>
<rdf:RDF xmlns="http://purl.org/rss/1.0/"
 xmlns:dc="http://purl.org/dc/elements/1.1/"
 xmlns:dcterms="http://purl.org/dc/terms/"
 xmlns:cc="http://web.resource.org/cc/"
 xmlns:prism="http://prismstandard.org/namespaces/basic/2.0/"
 xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"
 xmlns:admin="http://webns.net/mvcb/"
 xmlns:content="http://purl.org/rss/1.0/modules/content/">
    <channel rdf:about="https://www.mdpi.com/rss/journal/astronautics">
		<title>Astronautics</title>
		<description>Latest open access articles published in Astronautics at https://www.mdpi.com/journal/astronautics</description>
		<link>https://www.mdpi.com/journal/astronautics</link>
		<admin:generatorAgent rdf:resource="https://www.mdpi.com/journal/astronautics"/>
		<admin:errorReportsTo rdf:resource="mailto:support@mdpi.com"/>
		<dc:publisher>MDPI</dc:publisher>
		<dc:language>en</dc:language>
		<dc:rights>Creative Commons Attribution (CC-BY)</dc:rights>
						<prism:copyright>MDPI</prism:copyright>
		<prism:rightsAgent>support@mdpi.com</prism:rightsAgent>
		<image rdf:resource="https://pub.mdpi-res.com/img/design/mdpi-pub-logo.png?13cf3b5bd783e021?1783907519"/>
				<items>
			<rdf:Seq>
            				<rdf:li rdf:resource="https://www.mdpi.com/3042-7576/1/3/13" />
            				<rdf:li rdf:resource="https://www.mdpi.com/3042-7576/1/3/12" />
            				<rdf:li rdf:resource="https://www.mdpi.com/3042-7576/1/3/11" />
            				<rdf:li rdf:resource="https://www.mdpi.com/3042-7576/1/2/10" />
            				<rdf:li rdf:resource="https://www.mdpi.com/3042-7576/1/2/9" />
            				<rdf:li rdf:resource="https://www.mdpi.com/3042-7576/1/1/8" />
            				<rdf:li rdf:resource="https://www.mdpi.com/3042-7576/1/1/7" />
            				<rdf:li rdf:resource="https://www.mdpi.com/3042-7576/1/1/6" />
            				<rdf:li rdf:resource="https://www.mdpi.com/3042-7576/1/1/5" />
            				<rdf:li rdf:resource="https://www.mdpi.com/3042-7576/1/1/4" />
            				<rdf:li rdf:resource="https://www.mdpi.com/3042-7576/1/1/3" />
            				<rdf:li rdf:resource="https://www.mdpi.com/3042-7576/1/1/2" />
            				<rdf:li rdf:resource="https://www.mdpi.com/3042-7576/1/1/1" />
                    	</rdf:Seq>
		</items>
				<cc:license rdf:resource="https://creativecommons.org/licenses/by/4.0/" />
	</channel>

        <item rdf:about="https://www.mdpi.com/3042-7576/1/3/13">

	<title>Astronautics, Vol. 1, Pages 13: Continuous Low-Thrust Maneuver Parameter Detection of Non-Cooperative Satellites Based on a Diffusion Model</title>
	<link>https://www.mdpi.com/3042-7576/1/3/13</link>
	<description>It is challenging to detect continuous low-thrust maneuver parameters of non-cooperative satellites because the signals are weak over limited observation arcs and are readily masked by measurement noise and orbit-determination errors. This paper proposes a conditional diffusion model for detecting and estimating continuous low-thrust maneuver parameters from relative-orbit observations. The method uses relative-orbit observations of the non-cooperative target to construct conditional inputs that incorporate orbital dynamical priors. Single-step differencing and dimensionless processing are then used to strengthen weak maneuver signatures. The conditional diffusion model learns the evolution of maneuver parameters under noisy conditions and estimates three-axis continuous low-thrust acceleration sequences. Based on simulations considering the Gaussian noise of relative positions and velocities, the proposed method achieved 85.2% maneuver detection accuracy, while that of the batch least-squares benchmark method was 67.8%. The proposed method is simulated and verified based on Sentinel-6A. Results show that the continuous low-thrust maneuver can be robustly identified under low signal-to-noise ratios and the temporal parameter evolution can be recovered. The method provides a practical route for analyzing non-cooperative satellite maneuver and supporting on-orbit space situational awareness.</description>
	<pubDate>2026-07-16</pubDate>

	<content:encoded><![CDATA[
	<p><b>Astronautics, Vol. 1, Pages 13: Continuous Low-Thrust Maneuver Parameter Detection of Non-Cooperative Satellites Based on a Diffusion Model</b></p>
	<p>Astronautics <a href="https://www.mdpi.com/3042-7576/1/3/13">doi: 10.3390/astronautics1030013</a></p>
	<p>Authors:
		Kun Zhang
		Yanping Zhou
		Yunhan He
		Yun Xu
		</p>
	<p>It is challenging to detect continuous low-thrust maneuver parameters of non-cooperative satellites because the signals are weak over limited observation arcs and are readily masked by measurement noise and orbit-determination errors. This paper proposes a conditional diffusion model for detecting and estimating continuous low-thrust maneuver parameters from relative-orbit observations. The method uses relative-orbit observations of the non-cooperative target to construct conditional inputs that incorporate orbital dynamical priors. Single-step differencing and dimensionless processing are then used to strengthen weak maneuver signatures. The conditional diffusion model learns the evolution of maneuver parameters under noisy conditions and estimates three-axis continuous low-thrust acceleration sequences. Based on simulations considering the Gaussian noise of relative positions and velocities, the proposed method achieved 85.2% maneuver detection accuracy, while that of the batch least-squares benchmark method was 67.8%. The proposed method is simulated and verified based on Sentinel-6A. Results show that the continuous low-thrust maneuver can be robustly identified under low signal-to-noise ratios and the temporal parameter evolution can be recovered. The method provides a practical route for analyzing non-cooperative satellite maneuver and supporting on-orbit space situational awareness.</p>
	]]></content:encoded>

	<dc:title>Continuous Low-Thrust Maneuver Parameter Detection of Non-Cooperative Satellites Based on a Diffusion Model</dc:title>
			<dc:creator>Kun Zhang</dc:creator>
			<dc:creator>Yanping Zhou</dc:creator>
			<dc:creator>Yunhan He</dc:creator>
			<dc:creator>Yun Xu</dc:creator>
		<dc:identifier>doi: 10.3390/astronautics1030013</dc:identifier>
	<dc:source>Astronautics</dc:source>
	<dc:date>2026-07-16</dc:date>

	<prism:publicationName>Astronautics</prism:publicationName>
	<prism:publicationDate>2026-07-16</prism:publicationDate>
	<prism:volume>1</prism:volume>
	<prism:number>3</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>13</prism:startingPage>
		<prism:doi>10.3390/astronautics1030013</prism:doi>
	<prism:url>https://www.mdpi.com/3042-7576/1/3/13</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/3042-7576/1/3/12">

	<title>Astronautics, Vol. 1, Pages 12: Spacecraft Reachable Domain and Its Applications in Orbital Games: A Review and Future Perspectives</title>
	<link>https://www.mdpi.com/3042-7576/1/3/12</link>
	<description>The spacecraft reachable domain has become increasingly important for orbital game analysis due to growing on-orbit activities such as servicing, debris removal, and space situational awareness. This paper provides a comprehensive review of reachable domain theory and its applications in orbital games. A unified mathematical framework is established through three complementary classification dimensions: spatial attributes that distinguish absolute from relative reachable domains, temporal attributes that differentiate free-time from fixed-time reachable domains, and informational attributes that contrast deterministic and predictive reachable domains. Solution methods are systematically reviewed according to this taxonomy, covering analytical and semi-analytical methods, numerical optimization approaches, and geometric and sampling methods for spatial-scale reachable domains, as well as linearized ellipsoidal approximation, exact envelope determination, and fast analytical approximation for time-scale reachable domains. Applications are examined through three representative scenarios: one-on-one pursuit-evasion games, multi-agent cooperative games, and threat-avoidance and defense games. Key limitations of existing approaches are identified, including modeling fidelity, computational efficiency, and scalability under uncertainty. Future research directions are outlined to address these challenges.</description>
	<pubDate>2026-07-02</pubDate>

	<content:encoded><![CDATA[
	<p><b>Astronautics, Vol. 1, Pages 12: Spacecraft Reachable Domain and Its Applications in Orbital Games: A Review and Future Perspectives</b></p>
	<p>Astronautics <a href="https://www.mdpi.com/3042-7576/1/3/12">doi: 10.3390/astronautics1030012</a></p>
	<p>Authors:
		Yunxiao Yang
		Feng Yu
		Jiaxin Liu
		</p>
	<p>The spacecraft reachable domain has become increasingly important for orbital game analysis due to growing on-orbit activities such as servicing, debris removal, and space situational awareness. This paper provides a comprehensive review of reachable domain theory and its applications in orbital games. A unified mathematical framework is established through three complementary classification dimensions: spatial attributes that distinguish absolute from relative reachable domains, temporal attributes that differentiate free-time from fixed-time reachable domains, and informational attributes that contrast deterministic and predictive reachable domains. Solution methods are systematically reviewed according to this taxonomy, covering analytical and semi-analytical methods, numerical optimization approaches, and geometric and sampling methods for spatial-scale reachable domains, as well as linearized ellipsoidal approximation, exact envelope determination, and fast analytical approximation for time-scale reachable domains. Applications are examined through three representative scenarios: one-on-one pursuit-evasion games, multi-agent cooperative games, and threat-avoidance and defense games. Key limitations of existing approaches are identified, including modeling fidelity, computational efficiency, and scalability under uncertainty. Future research directions are outlined to address these challenges.</p>
	]]></content:encoded>

	<dc:title>Spacecraft Reachable Domain and Its Applications in Orbital Games: A Review and Future Perspectives</dc:title>
			<dc:creator>Yunxiao Yang</dc:creator>
			<dc:creator>Feng Yu</dc:creator>
			<dc:creator>Jiaxin Liu</dc:creator>
		<dc:identifier>doi: 10.3390/astronautics1030012</dc:identifier>
	<dc:source>Astronautics</dc:source>
	<dc:date>2026-07-02</dc:date>

	<prism:publicationName>Astronautics</prism:publicationName>
	<prism:publicationDate>2026-07-02</prism:publicationDate>
	<prism:volume>1</prism:volume>
	<prism:number>3</prism:number>
	<prism:section>Review</prism:section>
	<prism:startingPage>12</prism:startingPage>
		<prism:doi>10.3390/astronautics1030012</prism:doi>
	<prism:url>https://www.mdpi.com/3042-7576/1/3/12</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/3042-7576/1/3/11">

	<title>Astronautics, Vol. 1, Pages 11: Hybrid Neuromorphic Edge Computing and Quantum Cloud Optimization for Martian Swarm Robot Survival and Map Recovery</title>
	<link>https://www.mdpi.com/3042-7576/1/3/11</link>
	<description>Martian dust storms cut off communication and break standard robot navigation. We built a hybrid system that keeps robot swarms alive during these blackouts and recovers their data quickly. Our rovers use Spiking Neural Networks (SNNs) on their own edge processors to navigate without a signal. Once the storm passes, we use the Quantum Approximate Optimization Algorithm (QAOA) on a cloud platform to merge the fragmented maps the rovers collected while they were offline. We tested this system in a Robot Operating System 2 (ROS 2) and Gazebo environment using a simulated 10-rover Martian deployment. During the simulated blackout, our SNN edge navigation achieved a 92.0% survival rate, outperforming traditional planners like Dynamic Window Approach (DWA) (29.0%) and Timed Elastic Band (TEB) (24.3%). The neuromorphic approach also reduced overall system power consumption by 80.0% compared to a traditional unoptimized Graphics Processing Unit (GPU)-based Simultaneous Localization and Mapping (SLAM) baseline. For the map recovery phase, our simulated QAOA proof-of-concept evaluated the map constraints in just 1.2 ms, compared to 50.0 ms for a classical Generalized Iterative Closest Point (G-ICP) and g2o pose-graph approach. Despite the noisy sensor data collected during the blackout, the final quantum-stitched map achieved an 8.54 cm Root Mean Square Error (RMSE). These results show that combining edge-based neuromorphic processing with quantum cloud computing secures swarm survival and accelerates post-disaster data recovery for deep-space missions.</description>
	<pubDate>2026-06-30</pubDate>

	<content:encoded><![CDATA[
	<p><b>Astronautics, Vol. 1, Pages 11: Hybrid Neuromorphic Edge Computing and Quantum Cloud Optimization for Martian Swarm Robot Survival and Map Recovery</b></p>
	<p>Astronautics <a href="https://www.mdpi.com/3042-7576/1/3/11">doi: 10.3390/astronautics1030011</a></p>
	<p>Authors:
		Chandan Sheikder
		Weimin Zhang
		Xiaopeng Chen
		Shicheng Fan
		Tairan Li
		Haotong He
		</p>
	<p>Martian dust storms cut off communication and break standard robot navigation. We built a hybrid system that keeps robot swarms alive during these blackouts and recovers their data quickly. Our rovers use Spiking Neural Networks (SNNs) on their own edge processors to navigate without a signal. Once the storm passes, we use the Quantum Approximate Optimization Algorithm (QAOA) on a cloud platform to merge the fragmented maps the rovers collected while they were offline. We tested this system in a Robot Operating System 2 (ROS 2) and Gazebo environment using a simulated 10-rover Martian deployment. During the simulated blackout, our SNN edge navigation achieved a 92.0% survival rate, outperforming traditional planners like Dynamic Window Approach (DWA) (29.0%) and Timed Elastic Band (TEB) (24.3%). The neuromorphic approach also reduced overall system power consumption by 80.0% compared to a traditional unoptimized Graphics Processing Unit (GPU)-based Simultaneous Localization and Mapping (SLAM) baseline. For the map recovery phase, our simulated QAOA proof-of-concept evaluated the map constraints in just 1.2 ms, compared to 50.0 ms for a classical Generalized Iterative Closest Point (G-ICP) and g2o pose-graph approach. Despite the noisy sensor data collected during the blackout, the final quantum-stitched map achieved an 8.54 cm Root Mean Square Error (RMSE). These results show that combining edge-based neuromorphic processing with quantum cloud computing secures swarm survival and accelerates post-disaster data recovery for deep-space missions.</p>
	]]></content:encoded>

	<dc:title>Hybrid Neuromorphic Edge Computing and Quantum Cloud Optimization for Martian Swarm Robot Survival and Map Recovery</dc:title>
			<dc:creator>Chandan Sheikder</dc:creator>
			<dc:creator>Weimin Zhang</dc:creator>
			<dc:creator>Xiaopeng Chen</dc:creator>
			<dc:creator>Shicheng Fan</dc:creator>
			<dc:creator>Tairan Li</dc:creator>
			<dc:creator>Haotong He</dc:creator>
		<dc:identifier>doi: 10.3390/astronautics1030011</dc:identifier>
	<dc:source>Astronautics</dc:source>
	<dc:date>2026-06-30</dc:date>

	<prism:publicationName>Astronautics</prism:publicationName>
	<prism:publicationDate>2026-06-30</prism:publicationDate>
	<prism:volume>1</prism:volume>
	<prism:number>3</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>11</prism:startingPage>
		<prism:doi>10.3390/astronautics1030011</prism:doi>
	<prism:url>https://www.mdpi.com/3042-7576/1/3/11</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/3042-7576/1/2/10">

	<title>Astronautics, Vol. 1, Pages 10: A Greedy Algorithm for Rocket TT&amp;amp;C Resource Scheduling in Flight-Style Launch Scenarios</title>
	<link>https://www.mdpi.com/3042-7576/1/2/10</link>
	<description>In commercial aerospace flight-style launch scenarios, multiple parallel missions impose tight constraints, multiple objectives, and highly dynamic conditions on TT&amp;amp;amp;C (Telemetry, Tracking, and Command) resource scheduling. This paper studies coordinated scheduling of TT&amp;amp;amp;C equipment and sites. First, a multi-objective model is formulated that considers equipment&amp;amp;ndash;type matching, time-window constraints, mobile-equipment transfer paths, and coverage requirements. The model enforces coverage thresholds for all mission arc segments, while minimizing (i) the total travel distance of mobile equipment and (ii) the number of mobile units deployed. Second, to obtain high-quality feasible solutions quickly, an improved greedy scheduling algorithm is proposed. The algorithm processes tasks in chronological order and makes locally optimal decisions. It prioritizes fixed equipment and then selects mobile equipment by minimizing transfer distance under time-feasibility constraints. Finally, experiments on simulated scenarios demonstrate the effectiveness of the proposed method. The algorithm produces feasible schedules that satisfy coverage requirements in an extremely short time. It also provides a good initial solution for subsequent refinement, which makes it suitable for dynamic scheduling that requires real-time responsiveness.</description>
	<pubDate>2026-05-08</pubDate>

	<content:encoded><![CDATA[
	<p><b>Astronautics, Vol. 1, Pages 10: A Greedy Algorithm for Rocket TT&amp;amp;C Resource Scheduling in Flight-Style Launch Scenarios</b></p>
	<p>Astronautics <a href="https://www.mdpi.com/3042-7576/1/2/10">doi: 10.3390/astronautics1020010</a></p>
	<p>Authors:
		Lisong Hao
		Taibo Li
		Hongwei Liu
		</p>
	<p>In commercial aerospace flight-style launch scenarios, multiple parallel missions impose tight constraints, multiple objectives, and highly dynamic conditions on TT&amp;amp;amp;C (Telemetry, Tracking, and Command) resource scheduling. This paper studies coordinated scheduling of TT&amp;amp;amp;C equipment and sites. First, a multi-objective model is formulated that considers equipment&amp;amp;ndash;type matching, time-window constraints, mobile-equipment transfer paths, and coverage requirements. The model enforces coverage thresholds for all mission arc segments, while minimizing (i) the total travel distance of mobile equipment and (ii) the number of mobile units deployed. Second, to obtain high-quality feasible solutions quickly, an improved greedy scheduling algorithm is proposed. The algorithm processes tasks in chronological order and makes locally optimal decisions. It prioritizes fixed equipment and then selects mobile equipment by minimizing transfer distance under time-feasibility constraints. Finally, experiments on simulated scenarios demonstrate the effectiveness of the proposed method. The algorithm produces feasible schedules that satisfy coverage requirements in an extremely short time. It also provides a good initial solution for subsequent refinement, which makes it suitable for dynamic scheduling that requires real-time responsiveness.</p>
	]]></content:encoded>

	<dc:title>A Greedy Algorithm for Rocket TT&amp;amp;amp;C Resource Scheduling in Flight-Style Launch Scenarios</dc:title>
			<dc:creator>Lisong Hao</dc:creator>
			<dc:creator>Taibo Li</dc:creator>
			<dc:creator>Hongwei Liu</dc:creator>
		<dc:identifier>doi: 10.3390/astronautics1020010</dc:identifier>
	<dc:source>Astronautics</dc:source>
	<dc:date>2026-05-08</dc:date>

	<prism:publicationName>Astronautics</prism:publicationName>
	<prism:publicationDate>2026-05-08</prism:publicationDate>
	<prism:volume>1</prism:volume>
	<prism:number>2</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>10</prism:startingPage>
		<prism:doi>10.3390/astronautics1020010</prism:doi>
	<prism:url>https://www.mdpi.com/3042-7576/1/2/10</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/3042-7576/1/2/9">

	<title>Astronautics, Vol. 1, Pages 9: Longer Flight, Less Fuel: Strategies for Low-Energy Planetary Trajectory Design and Optimization</title>
	<link>https://www.mdpi.com/3042-7576/1/2/9</link>
	<description>As a crucial initial step in humanity&amp;amp;rsquo;s quest to explore deep space, lunar transfer missions have garnered significant attention. The escalating demand for increased payload capacity and mission flexibility have presented challenges in terms of mission fuel costs. In response, the design of low-energy lunar transfer trajectories, rooted in multibody dynamics, has become paramount for deep space exploration trajectory design. This paper summarizes the design methods for transfer trajectories from the Earth to the Moon and even deeper space that consume low energy at the expense of expanded transfer time. The fundamental design methods include the weak stability boundary method, the chaos control method, and the invariant manifold theory, which are primarily determined by dynamical mechanisms. Additionally, the paper discusses the low-thrust technique, formulating trajectory design as an optimization problem to tailor thrust profiles for minimum fuel consumption. Finally, landmark missions are discussed to demonstrate the practical applications and advantages of low-energy trajectories, spanning lunar missions to exploration within deeper space regions.</description>
	<pubDate>2026-04-07</pubDate>

	<content:encoded><![CDATA[
	<p><b>Astronautics, Vol. 1, Pages 9: Longer Flight, Less Fuel: Strategies for Low-Energy Planetary Trajectory Design and Optimization</b></p>
	<p>Astronautics <a href="https://www.mdpi.com/3042-7576/1/2/9">doi: 10.3390/astronautics1020009</a></p>
	<p>Authors:
		Wenchi Zhao
		Jixin Ding
		Xue Bai
		Jun Jiang
		Tao Nie
		Ming Xu
		</p>
	<p>As a crucial initial step in humanity&amp;amp;rsquo;s quest to explore deep space, lunar transfer missions have garnered significant attention. The escalating demand for increased payload capacity and mission flexibility have presented challenges in terms of mission fuel costs. In response, the design of low-energy lunar transfer trajectories, rooted in multibody dynamics, has become paramount for deep space exploration trajectory design. This paper summarizes the design methods for transfer trajectories from the Earth to the Moon and even deeper space that consume low energy at the expense of expanded transfer time. The fundamental design methods include the weak stability boundary method, the chaos control method, and the invariant manifold theory, which are primarily determined by dynamical mechanisms. Additionally, the paper discusses the low-thrust technique, formulating trajectory design as an optimization problem to tailor thrust profiles for minimum fuel consumption. Finally, landmark missions are discussed to demonstrate the practical applications and advantages of low-energy trajectories, spanning lunar missions to exploration within deeper space regions.</p>
	]]></content:encoded>

	<dc:title>Longer Flight, Less Fuel: Strategies for Low-Energy Planetary Trajectory Design and Optimization</dc:title>
			<dc:creator>Wenchi Zhao</dc:creator>
			<dc:creator>Jixin Ding</dc:creator>
			<dc:creator>Xue Bai</dc:creator>
			<dc:creator>Jun Jiang</dc:creator>
			<dc:creator>Tao Nie</dc:creator>
			<dc:creator>Ming Xu</dc:creator>
		<dc:identifier>doi: 10.3390/astronautics1020009</dc:identifier>
	<dc:source>Astronautics</dc:source>
	<dc:date>2026-04-07</dc:date>

	<prism:publicationName>Astronautics</prism:publicationName>
	<prism:publicationDate>2026-04-07</prism:publicationDate>
	<prism:volume>1</prism:volume>
	<prism:number>2</prism:number>
	<prism:section>Review</prism:section>
	<prism:startingPage>9</prism:startingPage>
		<prism:doi>10.3390/astronautics1020009</prism:doi>
	<prism:url>https://www.mdpi.com/3042-7576/1/2/9</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/3042-7576/1/1/8">

	<title>Astronautics, Vol. 1, Pages 8: Vectorized Sparse Second-Order Forward Automatic Differentiation for Optimal Control Direct Methods</title>
	<link>https://www.mdpi.com/3042-7576/1/1/8</link>
	<description>Direct collocation transcription is a dominant technique for solving complex optimal control problems, converting continuous dynamics into large-scale, sparse nonlinear programming problems. The computational efficiency of this approach is fundamentally limited by the evaluation of first- and second-order derivatives required by modern optimization algorithms. While general-purpose automatic differentiation tools exist, they often fail to fully exploit the repetitive substructure inherent in trajectory discretization. This paper presents a vectorized, sparse, second-order forward automatic differentiation framework specifically tailored for direct collocation methods. By explicitly distinguishing between scalar and vector nodes within the expression graph, the proposed method leverages the independence of mesh point evaluations to enable Single Instruction, Multiple Data (SIMD) execution and optimize memory access patterns. This structure-aware approach ensures linear time complexity with respect to the number of discretization nodes while maintaining the flexibility to handle complex dependencies. The methodology is implemented in the open-source software package pockit and is validated through three distinct engineering case studies: the aggressive stabilization of a nano-quadrotor, the powered descent guidance of a reusable launch vehicle, and a low-thrust heliocentric orbital transfer. These applications demonstrate the framework&amp;amp;rsquo;s capability to deliver high-performance derivative computation for large-scale, nonlinear dynamical systems.</description>
	<pubDate>2026-03-02</pubDate>

	<content:encoded><![CDATA[
	<p><b>Astronautics, Vol. 1, Pages 8: Vectorized Sparse Second-Order Forward Automatic Differentiation for Optimal Control Direct Methods</b></p>
	<p>Astronautics <a href="https://www.mdpi.com/3042-7576/1/1/8">doi: 10.3390/astronautics1010008</a></p>
	<p>Authors:
		Yilin Zou
		Fanghua Jiang
		</p>
	<p>Direct collocation transcription is a dominant technique for solving complex optimal control problems, converting continuous dynamics into large-scale, sparse nonlinear programming problems. The computational efficiency of this approach is fundamentally limited by the evaluation of first- and second-order derivatives required by modern optimization algorithms. While general-purpose automatic differentiation tools exist, they often fail to fully exploit the repetitive substructure inherent in trajectory discretization. This paper presents a vectorized, sparse, second-order forward automatic differentiation framework specifically tailored for direct collocation methods. By explicitly distinguishing between scalar and vector nodes within the expression graph, the proposed method leverages the independence of mesh point evaluations to enable Single Instruction, Multiple Data (SIMD) execution and optimize memory access patterns. This structure-aware approach ensures linear time complexity with respect to the number of discretization nodes while maintaining the flexibility to handle complex dependencies. The methodology is implemented in the open-source software package pockit and is validated through three distinct engineering case studies: the aggressive stabilization of a nano-quadrotor, the powered descent guidance of a reusable launch vehicle, and a low-thrust heliocentric orbital transfer. These applications demonstrate the framework&amp;amp;rsquo;s capability to deliver high-performance derivative computation for large-scale, nonlinear dynamical systems.</p>
	]]></content:encoded>

	<dc:title>Vectorized Sparse Second-Order Forward Automatic Differentiation for Optimal Control Direct Methods</dc:title>
			<dc:creator>Yilin Zou</dc:creator>
			<dc:creator>Fanghua Jiang</dc:creator>
		<dc:identifier>doi: 10.3390/astronautics1010008</dc:identifier>
	<dc:source>Astronautics</dc:source>
	<dc:date>2026-03-02</dc:date>

	<prism:publicationName>Astronautics</prism:publicationName>
	<prism:publicationDate>2026-03-02</prism:publicationDate>
	<prism:volume>1</prism:volume>
	<prism:number>1</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>8</prism:startingPage>
		<prism:doi>10.3390/astronautics1010008</prism:doi>
	<prism:url>https://www.mdpi.com/3042-7576/1/1/8</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/3042-7576/1/1/7">

	<title>Astronautics, Vol. 1, Pages 7: Astronaut Selection: Implications for the New Era of Spaceflight</title>
	<link>https://www.mdpi.com/3042-7576/1/1/7</link>
	<description>The rapid expansion of commercial human spaceflight is forcing a re-examination of how we decide who is &amp;amp;ldquo;fit to fly&amp;amp;rdquo; in space. For more than six decades, astronaut selection has been dominated by government programmes employing stringent medical and psychological criteria designed to minimise risk for small cohorts undertaking long-duration, high-consequence missions. Contemporary standards such as NASA-STD-3001 reflect this paradigm, treating astronauts as highly trained national assets expected to perform reliably under extreme physiological and psychological stress. In contrast, commercial operators aim to fly large numbers of spaceflight participants with highly heterogeneous medical and psychological profiles, within regulatory frameworks that emphasise informed consent and currently impose very limited prescriptive health requirements on passengers. This review examines the evolution and structure of traditional astronaut selection, outlines emerging approaches to screening and certifying commercial spaceflight customers, and explores the conceptual and practical gap between &amp;amp;ldquo;selection&amp;amp;rdquo; and &amp;amp;ldquo;screening&amp;amp;rdquo;. Particular attention is given to the increasing relevance of behavioural and psychological risk in short-duration but high-stress commercial missions, where acute responses, passenger&amp;amp;ndash;crew interaction, and behavioural variability can influence safety, especially in mixed-capability crews. Drawing on agency standards, psychological selection research, and recent proposals for commercial medical guidelines, this paper proposes a risk-informed, mission- and role-specific framework that adapts lessons from government astronaut corps to the needs of commercial spaceflight. We argue that future practice must balance safety, inclusion, and commercial viability through proportionate, evidence-based risk management, supported by systematic data collection across government and commercial flights.</description>
	<pubDate>2026-02-18</pubDate>

	<content:encoded><![CDATA[
	<p><b>Astronautics, Vol. 1, Pages 7: Astronaut Selection: Implications for the New Era of Spaceflight</b></p>
	<p>Astronautics <a href="https://www.mdpi.com/3042-7576/1/1/7">doi: 10.3390/astronautics1010007</a></p>
	<p>Authors:
		Simon Evetts
		Beth Healey
		Tessa Morris-Paterson
		Vladimir Pletser
		</p>
	<p>The rapid expansion of commercial human spaceflight is forcing a re-examination of how we decide who is &amp;amp;ldquo;fit to fly&amp;amp;rdquo; in space. For more than six decades, astronaut selection has been dominated by government programmes employing stringent medical and psychological criteria designed to minimise risk for small cohorts undertaking long-duration, high-consequence missions. Contemporary standards such as NASA-STD-3001 reflect this paradigm, treating astronauts as highly trained national assets expected to perform reliably under extreme physiological and psychological stress. In contrast, commercial operators aim to fly large numbers of spaceflight participants with highly heterogeneous medical and psychological profiles, within regulatory frameworks that emphasise informed consent and currently impose very limited prescriptive health requirements on passengers. This review examines the evolution and structure of traditional astronaut selection, outlines emerging approaches to screening and certifying commercial spaceflight customers, and explores the conceptual and practical gap between &amp;amp;ldquo;selection&amp;amp;rdquo; and &amp;amp;ldquo;screening&amp;amp;rdquo;. Particular attention is given to the increasing relevance of behavioural and psychological risk in short-duration but high-stress commercial missions, where acute responses, passenger&amp;amp;ndash;crew interaction, and behavioural variability can influence safety, especially in mixed-capability crews. Drawing on agency standards, psychological selection research, and recent proposals for commercial medical guidelines, this paper proposes a risk-informed, mission- and role-specific framework that adapts lessons from government astronaut corps to the needs of commercial spaceflight. We argue that future practice must balance safety, inclusion, and commercial viability through proportionate, evidence-based risk management, supported by systematic data collection across government and commercial flights.</p>
	]]></content:encoded>

	<dc:title>Astronaut Selection: Implications for the New Era of Spaceflight</dc:title>
			<dc:creator>Simon Evetts</dc:creator>
			<dc:creator>Beth Healey</dc:creator>
			<dc:creator>Tessa Morris-Paterson</dc:creator>
			<dc:creator>Vladimir Pletser</dc:creator>
		<dc:identifier>doi: 10.3390/astronautics1010007</dc:identifier>
	<dc:source>Astronautics</dc:source>
	<dc:date>2026-02-18</dc:date>

	<prism:publicationName>Astronautics</prism:publicationName>
	<prism:publicationDate>2026-02-18</prism:publicationDate>
	<prism:volume>1</prism:volume>
	<prism:number>1</prism:number>
	<prism:section>Review</prism:section>
	<prism:startingPage>7</prism:startingPage>
		<prism:doi>10.3390/astronautics1010007</prism:doi>
	<prism:url>https://www.mdpi.com/3042-7576/1/1/7</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/3042-7576/1/1/6">

	<title>Astronautics, Vol. 1, Pages 6: Optimal Control and Neural Porkchop Analysis for Low-Thrust Asteroid Rendezvous Mission</title>
	<link>https://www.mdpi.com/3042-7576/1/1/6</link>
	<description>This paper presents a comparative study of the applicability and accuracy of optimal control methods and neural-network-based estimators in the context of porkchop plots for preliminary asteroid rendezvous mission design. The scenario considered involves a deep-space CubeSat equipped with a low-thrust engine, departing from Earth and rendezvousing with a near-Earth asteroid within a three-year launch window. A low-thrust trajectory optimization model is formulated, incorporating variable specific impulse, maximum thrust, and path constraints. The optimal control problem is efficiently solved using Sequential Convex Programming (SCP) combined with a solution continuation strategy. The neural network framework consists of two models: one predicts the minimum fuel consumption (&amp;amp;Delta;v), while the other estimates the minimum flight time (&amp;amp;Delta;t) which is used to assess transfer feasibility. Case results demonstrate that, in simplified scenarios without path constraints, the neural network approach achieves low relative errors across most of the design space and successfully captures the main structural features of the porkchop plots. In cases where the SCP-based continuation method fails due to the presence of multiple local optima, the neural network still provides smooth and globally consistent predictions, significantly improving the efficiency of early-stage asteroid candidate screening. However, the deformation of the feasible region caused by path constraints leads to noticeable discrepancies in certain boundary regions, thereby limiting the applicability of the network in detailed mission design phases. Overall, the integration of neural networks with porkchop plot analysis offers an effective decision-making tool for mission designers and planetary scientists, with significant potential for engineering applications.</description>
	<pubDate>2026-02-03</pubDate>

	<content:encoded><![CDATA[
	<p><b>Astronautics, Vol. 1, Pages 6: Optimal Control and Neural Porkchop Analysis for Low-Thrust Asteroid Rendezvous Mission</b></p>
	<p>Astronautics <a href="https://www.mdpi.com/3042-7576/1/1/6">doi: 10.3390/astronautics1010006</a></p>
	<p>Authors:
		Zhong Zhang
		Niccolò Michelotti
		Gonçalo Oliveira Pinho
		Yilin Zou
		Francesco Topputo
		</p>
	<p>This paper presents a comparative study of the applicability and accuracy of optimal control methods and neural-network-based estimators in the context of porkchop plots for preliminary asteroid rendezvous mission design. The scenario considered involves a deep-space CubeSat equipped with a low-thrust engine, departing from Earth and rendezvousing with a near-Earth asteroid within a three-year launch window. A low-thrust trajectory optimization model is formulated, incorporating variable specific impulse, maximum thrust, and path constraints. The optimal control problem is efficiently solved using Sequential Convex Programming (SCP) combined with a solution continuation strategy. The neural network framework consists of two models: one predicts the minimum fuel consumption (&amp;amp;Delta;v), while the other estimates the minimum flight time (&amp;amp;Delta;t) which is used to assess transfer feasibility. Case results demonstrate that, in simplified scenarios without path constraints, the neural network approach achieves low relative errors across most of the design space and successfully captures the main structural features of the porkchop plots. In cases where the SCP-based continuation method fails due to the presence of multiple local optima, the neural network still provides smooth and globally consistent predictions, significantly improving the efficiency of early-stage asteroid candidate screening. However, the deformation of the feasible region caused by path constraints leads to noticeable discrepancies in certain boundary regions, thereby limiting the applicability of the network in detailed mission design phases. Overall, the integration of neural networks with porkchop plot analysis offers an effective decision-making tool for mission designers and planetary scientists, with significant potential for engineering applications.</p>
	]]></content:encoded>

	<dc:title>Optimal Control and Neural Porkchop Analysis for Low-Thrust Asteroid Rendezvous Mission</dc:title>
			<dc:creator>Zhong Zhang</dc:creator>
			<dc:creator>Niccolò Michelotti</dc:creator>
			<dc:creator>Gonçalo Oliveira Pinho</dc:creator>
			<dc:creator>Yilin Zou</dc:creator>
			<dc:creator>Francesco Topputo</dc:creator>
		<dc:identifier>doi: 10.3390/astronautics1010006</dc:identifier>
	<dc:source>Astronautics</dc:source>
	<dc:date>2026-02-03</dc:date>

	<prism:publicationName>Astronautics</prism:publicationName>
	<prism:publicationDate>2026-02-03</prism:publicationDate>
	<prism:volume>1</prism:volume>
	<prism:number>1</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>6</prism:startingPage>
		<prism:doi>10.3390/astronautics1010006</prism:doi>
	<prism:url>https://www.mdpi.com/3042-7576/1/1/6</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/3042-7576/1/1/5">

	<title>Astronautics, Vol. 1, Pages 5: Frequency-Aware Feature Pyramid Framework for Contextual Representation in Remote Sensing Object Detection</title>
	<link>https://www.mdpi.com/3042-7576/1/1/5</link>
	<description>Remote sensing object detection is a critical task in Earth observation. Despite the remarkable progress made in general object detection, existing detectors struggle with remote sensing scenarios due to the prevalence of numerous small objects with limited discriminative cues. Cutting-edge studies have shown that incorporating contextual information effectively enhances the detection performance for small objects. Meanwhile, recent research has revealed that convolution in the frequency domain is capable of capturing long-range spatial dependencies with high efficiency. Inspired by this, we propose a Frequency-aware Feature Pyramid Framework (FFPF) for remote sensing object detection, which consists of a novel Frequency-aware ResNet (F-ResNet) and a Bilateral Spectral-aware Feature Pyramid Network (BS-FPN). Specifically, the F-ResNet is proposed to extract the spectral context information by plugging the frequency domain convolution into each stage of the backbone, thereby enriching features of small objects. In addition, the BS-FPN employs a bilateral sampling strategy and skipping connection to model the association of object features at different scales, enabling the contextual information extracted by the F-ResNet to be fully leveraged. Extensive experiments are conducted for object detection in the public remote sensing image dataset and natural image dataset. The experimental results demonstrate the excellent performance of the FFPF, achieving 73.8% mAP on the DIOR dataset without using any additional training tricks.</description>
	<pubDate>2026-01-17</pubDate>

	<content:encoded><![CDATA[
	<p><b>Astronautics, Vol. 1, Pages 5: Frequency-Aware Feature Pyramid Framework for Contextual Representation in Remote Sensing Object Detection</b></p>
	<p>Astronautics <a href="https://www.mdpi.com/3042-7576/1/1/5">doi: 10.3390/astronautics1010005</a></p>
	<p>Authors:
		Lingyun Gu
		Qingyun Fang
		Eugene Popov
		Vitalii Pavlov
		Sergey Volvenko
		Sergey Makarov
		Ge Dong
		</p>
	<p>Remote sensing object detection is a critical task in Earth observation. Despite the remarkable progress made in general object detection, existing detectors struggle with remote sensing scenarios due to the prevalence of numerous small objects with limited discriminative cues. Cutting-edge studies have shown that incorporating contextual information effectively enhances the detection performance for small objects. Meanwhile, recent research has revealed that convolution in the frequency domain is capable of capturing long-range spatial dependencies with high efficiency. Inspired by this, we propose a Frequency-aware Feature Pyramid Framework (FFPF) for remote sensing object detection, which consists of a novel Frequency-aware ResNet (F-ResNet) and a Bilateral Spectral-aware Feature Pyramid Network (BS-FPN). Specifically, the F-ResNet is proposed to extract the spectral context information by plugging the frequency domain convolution into each stage of the backbone, thereby enriching features of small objects. In addition, the BS-FPN employs a bilateral sampling strategy and skipping connection to model the association of object features at different scales, enabling the contextual information extracted by the F-ResNet to be fully leveraged. Extensive experiments are conducted for object detection in the public remote sensing image dataset and natural image dataset. The experimental results demonstrate the excellent performance of the FFPF, achieving 73.8% mAP on the DIOR dataset without using any additional training tricks.</p>
	]]></content:encoded>

	<dc:title>Frequency-Aware Feature Pyramid Framework for Contextual Representation in Remote Sensing Object Detection</dc:title>
			<dc:creator>Lingyun Gu</dc:creator>
			<dc:creator>Qingyun Fang</dc:creator>
			<dc:creator>Eugene Popov</dc:creator>
			<dc:creator>Vitalii Pavlov</dc:creator>
			<dc:creator>Sergey Volvenko</dc:creator>
			<dc:creator>Sergey Makarov</dc:creator>
			<dc:creator>Ge Dong</dc:creator>
		<dc:identifier>doi: 10.3390/astronautics1010005</dc:identifier>
	<dc:source>Astronautics</dc:source>
	<dc:date>2026-01-17</dc:date>

	<prism:publicationName>Astronautics</prism:publicationName>
	<prism:publicationDate>2026-01-17</prism:publicationDate>
	<prism:volume>1</prism:volume>
	<prism:number>1</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>5</prism:startingPage>
		<prism:doi>10.3390/astronautics1010005</prism:doi>
	<prism:url>https://www.mdpi.com/3042-7576/1/1/5</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/3042-7576/1/1/4">

	<title>Astronautics, Vol. 1, Pages 4: Low-Thrust Transfer Method for Full Orbital Element Convergence Using J2 Precession</title>
	<link>https://www.mdpi.com/3042-7576/1/1/4</link>
	<description>Low-thrust propulsion systems have become mainstream for Low Earth Orbit (LEO) satellites due to their superior propellant efficiency, yet conventional low-thrust transfer strategies suffer from high computational costs and failure to achieve full orbital element convergence. To address these drawbacks, this paper proposes a novel semi-analytical three-phase low-thrust transfer strategy that leverages J2 gravitational precession to realize convergence of all orbital elements for circular orbits. The core of the method lies in the design of two symmetric thrust arcs and an intermediate coasting period that utilizes J2 precession. By solving the resulting polynomial equation, the strategy achieves simultaneous controlled convergence of the Right Ascension of the Ascending Node (RAAN) and the argument of latitude (AOL). Simulation results demonstrate that the proposed method achieves significant fuel savings compared to direct transfer strategies, while simultaneously achieving superior computational speed. Extensive validation via 100,000 Monte Carlo simulations confirms the method&amp;amp;rsquo;s scope of applicability, and the sufficient conditions for the existence of a solution are provided. It is further found that the proposed method is particularly well-suited for missions involving medium-to-high inclination orbits and large RAAN gaps, such as constellation deployment. In conclusion, this strategy provides a fuel-efficient and computationally fast solution for low-thrust transfer, establishing the basis for the operational management of future large-scale space systems equipped with low-thrust propulsion.</description>
	<pubDate>2026-01-05</pubDate>

	<content:encoded><![CDATA[
	<p><b>Astronautics, Vol. 1, Pages 4: Low-Thrust Transfer Method for Full Orbital Element Convergence Using J2 Precession</b></p>
	<p>Astronautics <a href="https://www.mdpi.com/3042-7576/1/1/4">doi: 10.3390/astronautics1010004</a></p>
	<p>Authors:
		Zhengqing Fang
		Roberto Armellin
		Yingkai Cai
		</p>
	<p>Low-thrust propulsion systems have become mainstream for Low Earth Orbit (LEO) satellites due to their superior propellant efficiency, yet conventional low-thrust transfer strategies suffer from high computational costs and failure to achieve full orbital element convergence. To address these drawbacks, this paper proposes a novel semi-analytical three-phase low-thrust transfer strategy that leverages J2 gravitational precession to realize convergence of all orbital elements for circular orbits. The core of the method lies in the design of two symmetric thrust arcs and an intermediate coasting period that utilizes J2 precession. By solving the resulting polynomial equation, the strategy achieves simultaneous controlled convergence of the Right Ascension of the Ascending Node (RAAN) and the argument of latitude (AOL). Simulation results demonstrate that the proposed method achieves significant fuel savings compared to direct transfer strategies, while simultaneously achieving superior computational speed. Extensive validation via 100,000 Monte Carlo simulations confirms the method&amp;amp;rsquo;s scope of applicability, and the sufficient conditions for the existence of a solution are provided. It is further found that the proposed method is particularly well-suited for missions involving medium-to-high inclination orbits and large RAAN gaps, such as constellation deployment. In conclusion, this strategy provides a fuel-efficient and computationally fast solution for low-thrust transfer, establishing the basis for the operational management of future large-scale space systems equipped with low-thrust propulsion.</p>
	]]></content:encoded>

	<dc:title>Low-Thrust Transfer Method for Full Orbital Element Convergence Using J2 Precession</dc:title>
			<dc:creator>Zhengqing Fang</dc:creator>
			<dc:creator>Roberto Armellin</dc:creator>
			<dc:creator>Yingkai Cai</dc:creator>
		<dc:identifier>doi: 10.3390/astronautics1010004</dc:identifier>
	<dc:source>Astronautics</dc:source>
	<dc:date>2026-01-05</dc:date>

	<prism:publicationName>Astronautics</prism:publicationName>
	<prism:publicationDate>2026-01-05</prism:publicationDate>
	<prism:volume>1</prism:volume>
	<prism:number>1</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>4</prism:startingPage>
		<prism:doi>10.3390/astronautics1010004</prism:doi>
	<prism:url>https://www.mdpi.com/3042-7576/1/1/4</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/3042-7576/1/1/3">

	<title>Astronautics, Vol. 1, Pages 3: Storage of Plant Species with Desiccation-Sensitive Germplasm in a Compact Growth Chamber for Long-Term Space Missions</title>
	<link>https://www.mdpi.com/3042-7576/1/1/3</link>
	<description>Plant species sensitive to desiccation or vegetatively propagation are difficult to store and transport in the germplasm for space travel. Applying plant tissue culture can help to create a Plant Germplasm Bank for this species. For this purpose, the Compact Growth Chamber (CGC) was created to store and transport in vitro explants, maintaining them for long periods in Slow-Grown Storage (SGS). Explants under SGS have reduced growth metabolism to complete space missions. This study aimed to evaluate the CGC efficacy in the long term of in vitro storage of explant of Taioba (Xanthosoma sagittifolium), a tropical species that vegetatively propagates and has high nutritional value. For this, three CGCs were connected, side by side, with different LED light spectra (CGC1: Red spectrum; CGC2: 50% Red + 50% Blue spectra-control; CGC3: Blue spectrum), each one containing nine test tubes with taioba explants (one per test tube), and LED lights intensity adjusted for 30 &amp;amp;micro;mol m&amp;amp;minus;2 s&amp;amp;minus;1. The CGCs were maintained for 120 days in the darkroom, at 25 &amp;amp;plusmn; 2 &amp;amp;deg;C temperature and 50&amp;amp;ndash;60% humidity, and, at the end, the growth and morphological parameters of taioba plantlets were evaluated. These results demonstrate that the explant storage in CGC3 showed lower root numbers and root lengths than in CGC1 and CGC2. In addition, the Blue spectrum in CGC3 reduced the root oxidation and browning, resulting in 100% live explants. This study provides that the CGC fulfilled its proposed function of transporting and storing the in vitro explants for space travel.</description>
	<pubDate>2025-11-27</pubDate>

	<content:encoded><![CDATA[
	<p><b>Astronautics, Vol. 1, Pages 3: Storage of Plant Species with Desiccation-Sensitive Germplasm in a Compact Growth Chamber for Long-Term Space Missions</b></p>
	<p>Astronautics <a href="https://www.mdpi.com/3042-7576/1/1/3">doi: 10.3390/astronautics1010003</a></p>
	<p>Authors:
		Paulo Hercilio Viegas Rodrigues
		Guilherme Bovi Ambrosano
		</p>
	<p>Plant species sensitive to desiccation or vegetatively propagation are difficult to store and transport in the germplasm for space travel. Applying plant tissue culture can help to create a Plant Germplasm Bank for this species. For this purpose, the Compact Growth Chamber (CGC) was created to store and transport in vitro explants, maintaining them for long periods in Slow-Grown Storage (SGS). Explants under SGS have reduced growth metabolism to complete space missions. This study aimed to evaluate the CGC efficacy in the long term of in vitro storage of explant of Taioba (Xanthosoma sagittifolium), a tropical species that vegetatively propagates and has high nutritional value. For this, three CGCs were connected, side by side, with different LED light spectra (CGC1: Red spectrum; CGC2: 50% Red + 50% Blue spectra-control; CGC3: Blue spectrum), each one containing nine test tubes with taioba explants (one per test tube), and LED lights intensity adjusted for 30 &amp;amp;micro;mol m&amp;amp;minus;2 s&amp;amp;minus;1. The CGCs were maintained for 120 days in the darkroom, at 25 &amp;amp;plusmn; 2 &amp;amp;deg;C temperature and 50&amp;amp;ndash;60% humidity, and, at the end, the growth and morphological parameters of taioba plantlets were evaluated. These results demonstrate that the explant storage in CGC3 showed lower root numbers and root lengths than in CGC1 and CGC2. In addition, the Blue spectrum in CGC3 reduced the root oxidation and browning, resulting in 100% live explants. This study provides that the CGC fulfilled its proposed function of transporting and storing the in vitro explants for space travel.</p>
	]]></content:encoded>

	<dc:title>Storage of Plant Species with Desiccation-Sensitive Germplasm in a Compact Growth Chamber for Long-Term Space Missions</dc:title>
			<dc:creator>Paulo Hercilio Viegas Rodrigues</dc:creator>
			<dc:creator>Guilherme Bovi Ambrosano</dc:creator>
		<dc:identifier>doi: 10.3390/astronautics1010003</dc:identifier>
	<dc:source>Astronautics</dc:source>
	<dc:date>2025-11-27</dc:date>

	<prism:publicationName>Astronautics</prism:publicationName>
	<prism:publicationDate>2025-11-27</prism:publicationDate>
	<prism:volume>1</prism:volume>
	<prism:number>1</prism:number>
	<prism:section>Communication</prism:section>
	<prism:startingPage>3</prism:startingPage>
		<prism:doi>10.3390/astronautics1010003</prism:doi>
	<prism:url>https://www.mdpi.com/3042-7576/1/1/3</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/3042-7576/1/1/2">

	<title>Astronautics, Vol. 1, Pages 2: Editorial: Inaugural Issue of Astronautics</title>
	<link>https://www.mdpi.com/3042-7576/1/1/2</link>
	<description>Since the dawn of civilization, humanity has gazed at the stars with wonder and longing [...]</description>
	<pubDate>2025-07-02</pubDate>

	<content:encoded><![CDATA[
	<p><b>Astronautics, Vol. 1, Pages 2: Editorial: Inaugural Issue of Astronautics</b></p>
	<p>Astronautics <a href="https://www.mdpi.com/3042-7576/1/1/2">doi: 10.3390/astronautics1010002</a></p>
	<p>Authors:
		Zhaokui Wang
		</p>
	<p>Since the dawn of civilization, humanity has gazed at the stars with wonder and longing [...]</p>
	]]></content:encoded>

	<dc:title>Editorial: Inaugural Issue of Astronautics</dc:title>
			<dc:creator>Zhaokui Wang</dc:creator>
		<dc:identifier>doi: 10.3390/astronautics1010002</dc:identifier>
	<dc:source>Astronautics</dc:source>
	<dc:date>2025-07-02</dc:date>

	<prism:publicationName>Astronautics</prism:publicationName>
	<prism:publicationDate>2025-07-02</prism:publicationDate>
	<prism:volume>1</prism:volume>
	<prism:number>1</prism:number>
	<prism:section>Editorial</prism:section>
	<prism:startingPage>2</prism:startingPage>
		<prism:doi>10.3390/astronautics1010002</prism:doi>
	<prism:url>https://www.mdpi.com/3042-7576/1/1/2</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/3042-7576/1/1/1">

	<title>Astronautics, Vol. 1, Pages 1: Welcome to Astronautics: A Note from the Editorial Office</title>
	<link>https://www.mdpi.com/3042-7576/1/1/1</link>
	<description>When humanity first broke free from Earth&amp;amp;rsquo;s gravitational bonds, we began the grandest chapter in the history of our civilization [...]</description>
	<pubDate>2025-06-19</pubDate>

	<content:encoded><![CDATA[
	<p><b>Astronautics, Vol. 1, Pages 1: Welcome to Astronautics: A Note from the Editorial Office</b></p>
	<p>Astronautics <a href="https://www.mdpi.com/3042-7576/1/1/1">doi: 10.3390/astronautics1010001</a></p>
	<p>Authors:
		Lin Li
		</p>
	<p>When humanity first broke free from Earth&amp;amp;rsquo;s gravitational bonds, we began the grandest chapter in the history of our civilization [...]</p>
	]]></content:encoded>

	<dc:title>Welcome to Astronautics: A Note from the Editorial Office</dc:title>
			<dc:creator>Lin Li</dc:creator>
		<dc:identifier>doi: 10.3390/astronautics1010001</dc:identifier>
	<dc:source>Astronautics</dc:source>
	<dc:date>2025-06-19</dc:date>

	<prism:publicationName>Astronautics</prism:publicationName>
	<prism:publicationDate>2025-06-19</prism:publicationDate>
	<prism:volume>1</prism:volume>
	<prism:number>1</prism:number>
	<prism:section>Editorial</prism:section>
	<prism:startingPage>1</prism:startingPage>
		<prism:doi>10.3390/astronautics1010001</prism:doi>
	<prism:url>https://www.mdpi.com/3042-7576/1/1/1</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
    
<cc:License rdf:about="https://creativecommons.org/licenses/by/4.0/">
	<cc:permits rdf:resource="https://creativecommons.org/ns#Reproduction" />
	<cc:permits rdf:resource="https://creativecommons.org/ns#Distribution" />
	<cc:permits rdf:resource="https://creativecommons.org/ns#DerivativeWorks" />
</cc:License>

</rdf:RDF>
