Marcus G. Müller
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Research Interests
Marcus G. Müller has a total of 27 co-authors. Here are the top co-authors by number of shared publications:
Alejandro Fontan Villacampa
Department of Perception and Cognition, Institute of Robotics and Mechatronics German Aerospace Center (DLR) Wessling Germany
1 shared publication- Armin Wedler
Robotic Institut, DLR - German Aerospace Center, Wessling Germany 82234
1 shared publication Bernhard Rebele
Analysis and Control of Advanced Robotic Systems, Institute of Robotics and Mechatronics German Aerospace Center (DLR) Wessling Germany
1 shared publicationC. Fehn
1 shared publicationC. Herpel
1 shared publication- Craig Wheeler
University of Newcastle
1 shared publication
Latest Publications
- 9 December 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Robotics and Automation Letters
- Vol. 10 (2) , 1776-1783
Traversing Mars: Cooperative Informative Path Planning to Efficiently Navigate Unknown Scenes
The ability to traverse an unknown environment is crucial for autonomous robot operations. However, due to the limited sensing capabilities and system constraints, approaching this problem with a single robot agent can be slow, costly, and unsafe. For example, in planetary exploration missions, the wear on the wheels of a rover from abrasive terrain should be minimized at all costs as reparations are infeasible. On the other hand, utilizing a scouting robot such as a micro aerial vehicle (MAV) has the potential to reduce wear and time costs and increase safety of a follower robot. This work proposes a novel cooperative informative path planning (IPP) framework that allows a scout (e.g., an MAV) to efficiently explore the minimum-cost-path for a follower (e.g., a rover) to reach the goal. We derive theoretical guarantees for our algorithm, and prove that the algorithm always terminates, always finds the optimal path if it exists, and terminates early when the found path is shown to be optimal or infeasible. We show in thorough experimental evaluation that the guarantees hold in practice, and that our algorithm is 22.5% quicker to find the optimal path and 15% quicker to terminate compared to existing methods.
- 9 December 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Robotics and Automation Letters
- Vol. 10 (2) , 1776-1783
Traversing Mars: Cooperative Informative Path Planning to Efficiently Navigate Unknown Scenes
The ability to traverse an unknown environment is crucial for autonomous robot operations. However, due to the limited sensing capabilities and system constraints, approaching this problem with a single robot agent can be slow, costly, and unsafe. For example, in planetary exploration missions, the wear on the wheels of a rover from abrasive terrain should be minimized at all costs as reparations are infeasible. On the other hand, utilizing a scouting robot such as a micro aerial vehicle (MAV) has the potential to reduce wear and time costs and increase safety of a follower robot. This work proposes a novel cooperative informative path planning (IPP) framework that allows a scout (e.g., an MAV) to efficiently explore the minimum-cost-path for a follower (e.g., a rover) to reach the goal. We derive theoretical guarantees for our algorithm, and prove that the algorithm always terminates, always finds the optimal path if it exists, and terminates early when the found path is shown to be optimal or infeasible. We show in thorough experimental evaluation that the guarantees hold in practice, and that our algorithm is 22.5% quicker to find the optimal path and 15% quicker to terminate compared to existing methods.
- 31 January 2022
- Published by Elsevier in European Journal of Operational Research
- Vol. 302 (3) , 874-891
An algorithm selection approach for the flexible job shop scheduling problem: Choosing constraint programming solvers through machine learning
- 31 January 2022
- Published by Elsevier in European Journal of Operational Research
- Vol. 302 (3) , 874-891
An algorithm selection approach for the flexible job shop scheduling problem: Choosing constraint programming solvers through machine learning
- Open Access
- 19 March 2021
- Published by Wiley in Journal of Field Robotics
- Vol. 38 (6) , 833-853
The MADMAX data set for visual‐inertial rover navigation on Mars
Planetary rovers increasingly rely on vision‐based components for autonomous navigation and mapping. Developing and testing these components requires representative optical conditions, which can be achieved by either field testing at planetary analog sites on Earth or using prerecorded data sets from such locations. However, the availability of representative data is scarce and field testing in planetary analog sites requires a substantial financial investment and logistical overhead, and it entails the risk of damaging complex robotic systems. To address these issues, we use our compact human‐portable DLR Sensor Unit for Planetary Exploration Rovers (SUPER) in the Moroccan desert to show resource‐efficient field testing and make the resulting Morocco‐Acquired data set of Mars‐Analog eXploration (MADMAX) publicly accessible. The data set consists of 36 different navigation experiments, captured at eight Mars analog sites of widely varying environmental conditions. Its longest trajectory covers 1.5 km and the combined trajectory length is 9.2 km. The data set contains time‐stamped recordings from monochrome stereo cameras, a color camera, omnidirectional cameras in stereo configuration, and from an inertial measurement unit. Additionally, we provide the ground truth in position and orientation together with the associated uncertainties, obtained by a real‐time kinematic‐based algorithm that fuses the global navigation satellite system data of two body antennas. Finally, we run two state‐of‐the‐art navigation algorithms, ORB‐SLAM2 and VINS‐mono, on our data to evaluate their accuracy and to provide a baseline, which can be used as a performance reference of accuracy and robustness for other navigation algorithms. The data set can be accessed at https://rmc.dlr.de/morocco2018.
- 19 March 2021
- Published by Wiley in Journal of Field Robotics
- Vol. 38 (6) , 833-853
Open AccessThe MADMAX data set for visual‐inertial rover navigation on Mars
Planetary rovers increasingly rely on vision‐based components for autonomous navigation and mapping. Developing and testing these components requires representative optical conditions, which can be achieved by either field testing at planetary analog sites on Earth or using prerecorded data sets from such locations. However, the availability of representative data is scarce and field testing in planetary analog sites requires a substantial financial investment and logistical overhead, and it entails the risk of damaging complex robotic systems. To address these issues, we use our compact human‐portable DLR Sensor Unit for Planetary Exploration Rovers (SUPER) in the Moroccan desert to show resource‐efficient field testing and make the resulting Morocco‐Acquired data set of Mars‐Analog eXploration (MADMAX) publicly accessible. The data set consists of 36 different navigation experiments, captured at eight Mars analog sites of widely varying environmental conditions. Its longest trajectory covers 1.5 km and the combined trajectory length is 9.2 km. The data set contains time‐stamped recordings from monochrome stereo cameras, a color camera, omnidirectional cameras in stereo configuration, and from an inertial measurement unit. Additionally, we provide the ground truth in position and orientation together with the associated uncertainties, obtained by a real‐time kinematic‐based algorithm that fuses the global navigation satellite system data of two body antennas. Finally, we run two state‐of‐the‐art navigation algorithms, ORB‐SLAM2 and VINS‐mono, on our data to evaluate their accuracy and to provide a baseline, which can be used as a performance reference of accuracy and robustness for other navigation algorithms. The data set can be accessed at https://rmc.dlr.de/morocco2018.
- 5 May 2019
- Published by Taylor & Francis in Australian Journal of Earth Sciences
- Vol. 66 (7) , 1063-1073
An automatic HyLoggerTM mineral mapping method using a machine-learning-based computer vision technique
HyLogger profile scanning is commonly utilised for drill-core logging but the limited scanning area may not detect all important geological features. The study presented in this paper aims to develop a mineral mapping solution for this core-logging process by leveraging the colour image captured during the scanning process. A machine-learning-based computer vision program was developed by implementing a k-means clustering and a global colour profiling algorithm. A suite of drill-core images was used to validate the developed program. Results indicate that there is a direct correlation between the mineral assemblage of a rock type and its colour specifications. The identified mineral type and relative abundance were comparable with HyLogger scan results.
- 5 May 2019
- Published by Taylor & Francis in Australian Journal of Earth Sciences
- Vol. 66 (7) , 1063-1073
An automatic HyLoggerTM mineral mapping method using a machine-learning-based computer vision technique
HyLogger profile scanning is commonly utilised for drill-core logging but the limited scanning area may not detect all important geological features. The study presented in this paper aims to develop a mineral mapping solution for this core-logging process by leveraging the colour image captured during the scanning process. A machine-learning-based computer vision program was developed by implementing a k-means clustering and a global colour profiling algorithm. A suite of drill-core images was used to validate the developed program. Results indicate that there is a direct correlation between the mineral assemblage of a rock type and its colour specifications. The identified mineral type and relative abundance were comparable with HyLogger scan results.
- 1 May 2007
- Published by Society of Motion Picture and Television Engineers (SMPTE) in SMPTE Motion Imaging Journal
- Vol. 116 (5-6) , 206-212
Trinocular Depth Acquisition
This contribution presents a new concept for depth acquisition in post-production and visual effects (vfx) creation. The main idea is to mount two satellite cameras to the left and the right of an electronic D-cinema camera such that the whole rig forms a trinocular camera setup. Based on this system, depth is estimated by robust stereo matching and the trifocal constraint is exploited to determine the accuracy of the depth values. The information is calculated almost in realtime and can be directly previewed at the set. This paper explains the concept in more detail and describes the basic image processing algorithms. Finally, the theoretically achievable depth accuracy is discussed and results of the first experiments based on computer simulations are presented.
- 1 May 2007
- Published by Society of Motion Picture and Television Engineers (SMPTE) in SMPTE Motion Imaging Journal
- Vol. 116 (5-6) , 206-212
Trinocular Depth Acquisition
This contribution presents a new concept for depth acquisition in post-production and visual effects (vfx) creation. The main idea is to mount two satellite cameras to the left and the right of an electronic D-cinema camera such that the whole rig forms a trinocular camera setup. Based on this system, depth is estimated by robust stereo matching and the trifocal constraint is exploited to determine the accuracy of the depth values. The information is calculated almost in realtime and can be directly previewed at the set. This paper explains the concept in more detail and describes the basic image processing algorithms. Finally, the theoretically achievable depth accuracy is discussed and results of the first experiments based on computer simulations are presented.