Answers are grounded in this paper and cite their sources.
Computational study demonstrates efficient illumination mapping and path planning for lunar rovers, indicating reduced computational overhead in polar exploration.
The lunar south polar region’s extreme illumination conditions impose strict energy constraints for solar-powered rover operations. Traditional Sun-synchronous path planning relies on dynamic time-dependent illumination evaluation, leading to high computational costs. We present CIRsE-Net, a spatiotemporal deep learning model that generates 72 h continuous illumination maps from hourly sequential illumination data. The model integrates a lightweight SST-VGG encoder (a customized 14-layer CNN for spatial feature extraction), BiGRU temporal modelling (a bidirectional recurrent network for capturing forward and backward temporal dependencies), and a consistency-aware spatiotemporal attention mechanism. On three different lunar illumination datasets (20 m/pixel, 5 m/pixel, and 20 m/pixel with a 2 m panel height), the model achieves Dice scores up to 0.983 and accuracy up to 0.985. When integrated with an enhanced 3ST-A* planner, the framework converts dynamic path planning into a static search task, reducing computational overhead while preserving path optimality and satisfying slope and illumination constraints. This work provides a validated methodological framework for Chang’E-7 mission planning and future lunar polar exploration missions by transforming dynamic path planning into a static search task.
No takes yet. Share an insight, caveat, or question.
Chen et al. (2026) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: