Logo des Repositoriums

Auflistung nach Schlagwort "Planetary exploration"

1 - 2 von 2
  • Zeitschriftenartikel
    DLR SpaceBot Cup 2013: A Space Robotics Competition
    (KI - Künstliche Intelligenz: Vol. 28, No. 2, 2014) Kaupisch, Thilo; Noelke, Daniel
    In November 2013, the German Aerospace Center (DLR) in Bonn hosted the SpaceBot Cup, Germany’s first of its kind space robotics competition. The scenario is set in a planetary exploration environment with some manipulation tasks. Ten entrants had eight month to define, develop, and build robotic systems and the according ground station setup to conduct a remote testbed mission. Then, the robotic element(s) were deployed onto a sparsely known planetary surface and had to conduct exploration of the environment, find and collect two artificial objects, and mount them to a third object. Communication between ground control station and planetary surface was limited and impaired by delay, making autonomous functionality crucial for the success of the mission. In this report, the motivation, scenario, tasks, and final competition event of the DLR SpaceBot Cup 2013 are presented.
  • Zeitschriftenartikel
    Statistic Methods for Path-Planning Algorithms Comparison
    (KI - Künstliche Intelligenz: Vol. 27, No. 3, 2013) Muñoz, Pablo; Barrero, David F.; R-Moreno, María D.
    The path-planning problem for autonomous mobile robots has been addressed by classical search techniques such as A* or, more recently, Theta* or S-Theta*. However, research usually focuses on reducing the length of the path or the processing time. The common practice in the literature is to report the run-time/length of the algorithm with means and, sometimes, some dispersion measure. However, this practice has several drawbacks, mainly due to the loose of valuable information that this reporting practice involves such as asymmetries in the run-time, or the shape of its distribution. Run-time analysis is a type of empirical tool that studies the time consumed by running an algorithm. This paper is an attempt to bring this tool to the path-planning community. To this end the paper reports an analysis of the run-time of the path-planning algorithms with a variety of problems of different degrees of complexity, indoors, outdoors and Mars surfaces. We conclude that the time required by these algorithms follows a lognormal distribution.