Development of Lunar Rover Steering Systems based on Synthetic Computer Vision and Reinforcement Learning
Notice bibliographique
Résumé
As humanity prepares to return to the Moon and establish long-term presence, the demand for autonomous systems capable of navigating unstructured, GPS-denied environments becomes critical. Lunar rovers, tasked with exploration, science, and logistics, must traverse challenging terrains where human teleoperation is limited by communication latency and environmental unpredictability. This thesis investigates two complementary machine learning approaches for autonomous lunar rover navigation and obstacle avoidance: supervised learning via computer vision-based behavioral cloning, and reinforcement learning (RL) using LiDAR data in a simulated environment. The first approach focuses on a CNN-LSTM architecture trained via behavioral cloning. The system learns to imitate human driving behavior by mapping sequences of images and rover state information to steering commands. A multi-branch convolutional neural network processes three visual perspectives (front, left, right), which are then concatenated with state inputs and passed to a Long Short-Term Memory (LSTM) module to capture temporal dependencies. The model was trained using a combination of real-world data from the Canadian Space Agency (CSA) and synthetic data generated in ESA’s VORTEX simulation framework using Unreal Engine. Domain randomization and data augmentation were used to enhance generalization. Experiments revealed that combining synthetic and real data improves prediction accuracy and robustness, while the temporal modeling of the LSTM reduces erratic steering behaviors. The second approach applies Deep Q-Networks (DQN) for end-to-end obstacle avoidance, using LiDAR readings as state input and discrete steering actions as outputs. Implemented in simulation environments like Gazebo, the agent learns optimal navigation strategies by interacting with its environment, receiving positive rewards for safe progress and penalties for collisions. Unlike behavioral cloning, this RL-based method does not rely on human demonstrations and can adapt to new environments through trial and error. Although slower to converge and requiring careful reward shaping, the reinforcement learning policy exhibited strong generalization in unseen scenarios after sufficient training. By exploring both paradigms—supervised imitation learning and reinforcement learning—this thesis offers a comparative analysis of their strengths, limitations, and suitability for lunar robotics. Behavioral cloning benefits from data efficiency and rapid deployment when human demonstrations are available, but struggles in out-of-distribution settings. In contrast, reinforcement learning shows promise in adaptive decision-making and long-term planning but faces challenges in training stability and sample efficiency. This work also emphasizes the importance of sim-to-real transfer, simulation fidelity, and multi-modal perception in the development of autonomous systems for planetary exploration. The integration of computer vision, spatiotemporal reasoning, and sensor-based learning highlights the need for hybrid systems that combine the robustness of learned perception with the adaptability of reinforcement-based control.
Récupéré en direct depuis OpenAlex et désinversé. Les résumés ne sont pas conservés dans cette base de données : les index inversés représentent 8,6 Go des 9,3 Go de texte de la base, et le serveur dispose de 13 Go libres.
Comment cette classification a été obtenuedéplier
Prédiction distillée sur la base complète
Imitation des enseignantsNi prévalence calibrée, ni vérité terrain. Validation humaine à venir. Apprise à partir de 10 348 étiquettes directes de Codex et de 10 348 étiquettes directes de Gemma. Le mode candidate est l'union des têtes enseignantes seuillées; le consensus est leur intersection. Ces sorties portent le statut machine_predicted_unvalidated et ne sont ni des étiquettes humaines ni des étiquettes directes de modèles de pointe.
Scores Codex et Gemma par catégorie
| Catégorie | Codex | Gemma |
|---|---|---|
| Métarecherche | 0,000 | 0,000 |
| Méta-épidémiologie (sens strict) | 0,000 | 0,000 |
| Méta-épidémiologie (sens large) | 0,000 | 0,000 |
| Bibliométrie | 0,000 | 0,000 |
| Études des sciences et des technologies | 0,000 | 0,000 |
| Communication savante | 0,000 | 0,000 |
| Science ouverte | 0,000 | 0,000 |
| Intégrité de la recherche | 0,000 | 0,000 |
| Charge utile insuffisante (le modèle a refusé de juger) | 0,000 | 0,000 |
Scores machine (provisoires)
Les deux têtes enseignantes du modèle étudiant, lues sur ce travail. Un score ordonne la base pour la relecture; il n'affirme jamais une catégorie, et le statut de validation accompagne chaque rangée tel quel.
Scores de référence d'un modèle non mature (critères de maturité non atteints, 7 itérations). Un score ordonne; il n'affirme jamais une catégorie.
score_only:v0-immature-baseline · tel quel depuis la passe de notation : score_only signifie que le nombre peut ordonner les travaux, et qu'aucune étiquette de catégorie n'en découleClassification
machine, non validéePrédiction automatique; un appel candidat d’une seule tête enseignante, pas un consensus.
Le détail, modèle par modèle et score par score, se trouve en fin de page sous « Comment cette classification a été obtenue ».