What is it about?
This paper introduces a new problem incorporating precedence constraints for planetary surface exploration. We extend the traditional vehicle routing problem (VRP) in operational research to include these precedence constraints for planetary surface exploration missions.
Featured Image
Photo by NASA on Unsplash
Why is it important?
Precedence constraints can model situations where one exploration site must be visited before another, such as delivering in-situ resources on the lunar surface. Consequently, the optimal solution for the vehicle routing problem with these precedence constraints will differ from that of the original problem.
Perspectives
The suggested new problem can handle pure precedence constraints without complex constraints like time-window constraints. The application of this problem can be used for future lunar or Martian surface exploration routing optimization.
Euihyeon Choi
Korea Advanced Institute of Science and Technology
Read the Original
This page is a summary of: Optimal Routing Problem with Precedence Constraints for Surface Exploration, January 2024, American Institute of Aeronautics and Astronautics (AIAA),
DOI: 10.2514/6.2024-2719.
You can read the full text:
Contributors
The following have contributed to this page
