Cited by 3Spacecraft Dynamics and ControlRobotic Path Planning AlgorithmsPlanetary Science and Exploration

Lunar Lander Landing Site Decision in Low-Fuel Case

Open access
Seo, Min-Guk, Hong, Seong-Min, Tahk, Min-Jea·2016·MATEC Web of Conferences

Abstract

This paper deals with lunar landing site decision algorithms for the case when the lunar lander is not able to reach the original landing site. A new landing site which minimizes the fuel consumption of the lunar rover is determined from landing site candidates located within the maximum reachable downrange of the lunar lander. A path planning algorithm is introduced to determine the new landing site which has the shortest path to the original landing site among the candidates. Numerical simulations are conducted to verify the performance of the proposed algorithm.

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1051/matecconf/20165409003

Cites

12 of 12 references verified0 citation errors · 0 not checkable

Statistics

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

  • Seo et al. used the minimum energy consumption as an optimization objective and realized the path planning of the lunar rover from the actual landing site to the expected landing site using the D* algorithm.

    “Seo et al. used the minimum energy consumption as an optimization objective and realized the path planning of the lunar rover from the actual landing site to the expected landing site using the D * algorithm. 227”

    From Energy system and resource utilization in space: A state-of-the-art review (2024) · cites this paper as [227]

    Sections 1 and 5 describe planning a rover path from a new landing site to the original site, selecting the shortest path to minimize rover energy consumption. But Section 5 explicitly says the shortest path is derived using Dijkstra’s algorithm, not D*; the paper also optimizes path length rather than directly optimizing energy consumption. (LLM, conf=0.90)

    Experimental — accuracy not yet measured

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Cites

Flagged first, then by citations

Research works printed but not linked: 13

  1. R. R. Sostaric, J. R. Rea, AIAA Guidance, Navigation, and Control Conference, (2005)
  2. F. Najson and K. D. Mease, AIAA Guidance, Navigation, and Control Conference, (2005)
  3. B. Aç kmeşe, S. R. Ploen, Journal of Guidance, Control, and Dynamics, 30, 5, (2007)
  4. L. Blackmore, B. Açıkmeşe, D. P. Scharf, Journal of Guidance, Control, and Dynamics, 33, 4, (2010)
  5. B. Siciliano, L. Sciavicco, L. Villani, G. Oriolo, Robotics: Modeling, Planning and Control, (Springer Science & Business Media, 2009)
  6. V. J. Lumelsky, A. A. Stepanov, IEEE Transactions on Automatic Control, AC-31, 11, (1986)
  7. E. Gat, M. G. Slack, D. P. Miller, R. J. Firsby, IEEE International Conference on Robotics and Automation, (1990)
  8. M. Gerke, Proceedings of the American Control Conference, 4, (1999)
  9. N. A. Melchior, R. Simmons, IEEE International Conference on Robotics and Automation, (2007)
  10. B. J. Jeon, B. G. Park, M. J. Tahk, 2013 Asia-Pacific International Symposium on Aerospace Technology, (2013)
  11. F. Junhua, C. Pingyuan, C. Hutao, Systems and Control in Aeronautics and Astronautics (ISSCAA), 2010 3rd International Symposium on, (2010).
  12. K. S. Kim, G. H. Moon, J. W. Kim, J. W. Jeong, H. L. Choi, H. C. Shim, M. J. Tahk, The 2nd International Conference on Robot Intelligence Technology and Application, (2013)
  13. G. H. Moon, Master's Thesis, Korea Advanced Institute of Science and Technology, Daejeon, Republic of Korea (2014)

Cited by

Sorted by citations

Authors
Seo, M.-G., Hong, S.-M., & Tahk, M.-J.
Affiliations
Korea Advanced Institute of Science and Technology (KR)
Venue
MATEC Web of Conferences
Publisher
EDP Sciences
Published
2016
Volume
54
Pages
09003
ISSN
2261-236X (ISSN-L)
OpenAlex
W2339319703
Cited by
3
References
12
Citations by year
2024: 1 · 2022: 1 · 2021: 1
FWCI
0.00
Type
conference paper
Language
en
Open access
Licence
cc-by
Locations
  • MATEC Web of Conferences (publishedVersion, cc-by)
  • Springer Link (Chiba Institute of Technology) (submittedVersion)
  • DOAJ (DOAJ: Directory of Open Access Journals) (submittedVersion, cc-by-sa)
Funders
  • National Research Foundation
  • Ministry of Science, ICT and Future Planning
  • National Research Foundation of Korea (2014M1A3A3A03034589)
Topics
  • Physical Sciences › Engineering › Aerospace Engineering › Spacecraft Dynamics and Control
  • Physical Sciences › Computer Science › Computer Vision and Pattern Recognition › Robotic Path Planning Algorithms
  • Physical Sciences › Physics and Astronomy › Astronomy and Astrophysics › Planetary Science and Exploration
Keywords
lunar landing site selection, lunar lander, lunar rover, fuel consumption reduction, path planning, shortest path

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review