Where You Park the Robot Matters: New Study Crowns the Best Algorithm for Base Placement

When a factory installs an industrial robot, engineers spend enormous effort selecting the right arm, gripper, and motion programs. Yet one of the most consequential decisions is often made with a tape measure and a rule of thumb: where, exactly, should the robot stand? A new study from the Technical University of Munich shows that this overlooked choice can dramatically change how fast a robot works, and it provides the first rigorous head-to-head comparison of the algorithms that can answer the question automatically. The results, published in Frontiers in Manufacturing Technology, reveal a surprising winner drawn from the world of deep learning.

The research, conducted by Matthias Mayer and Matthias Althoff of the TUM School of Computation, Information and Technology, tackles what roboticists call base-pose optimization. A robot’s base pose is its position and orientation on the factory floor, and it determines which points in the workspace the arm can comfortably reach, how contorted its joints must become to hit each target, and how long every cycle of the production process takes. Moving the base by even a few tens of centimeters can shave seconds off a cycle time, and over millions of cycles those seconds translate into substantial money. Crucially, unlike buying a faster robot, repositioning the one you already have costs essentially nothing.

Despite decades of interest, the field had never established which optimization algorithm actually performs best. Previous studies each championed their own method on their own tasks, with no common benchmark to arbitrate between them. Mayer and Althoff set out to close this gap by implementing four families of optimizers on identical footing: exhaustive search approximated by uniform random sampling, genetic algorithms, Bayesian optimization, and, for the first time in this domain, stochastic gradient descent. They adapted Adam, the optimizer that underpins much of modern neural network training, to the robot placement problem, requiring only that the robot’s forward kinematics be well defined rather than any special wrist geometry assumed by earlier gradient-based work.

The technical setup is a two-level optimization. At the outer level, the chosen algorithm proposes candidate base poses within an allowed region, roughly a cubic meter around a nominal position with either fixed or unrestricted orientation. At the inner level, a task solver evaluates each proposal. Fast filters first reject poses farther from any goal than the robot’s maximum reach, a check that takes milliseconds, then reject poses lacking collision-free inverse kinematic solutions, which takes about a tenth of a second. Surviving candidates go to the RRT-Connect path planner and a time-optimal trajectory generator, which produce an executable motion through all required goal poses. The cycle time of that motion becomes the cost. For gradient descent, the researchers used automatic differentiation in PyTorch to compute how the cost changes with the base parameters, then applied Adam steps, restarting from random initial guesses to escape local minima.

The benchmark tasks came from CoBRA, a composable benchmark suite for robotics applications. The team built a set of 100 simple synthetic tasks with three cubic obstacles and three goal poses, then tested generalization on harder variants with five goals and obstacles, on tasks derived from 3D scans of real factories where robots feed CNC machines amid irregular geometry, and on deliberately perverse edge cases where all goals sit tightly against obstacles. Hyperparameters for the three tunable methods were optimized with Optuna using a tree-structured Parzen estimator, trained on the first 70 percent of the simple tasks and evaluated on the remainder plus the unseen sets. Every algorithm received an identical budget of 20 minutes per task, and results were aggregated over five random seeds with 95 percent confidence intervals and Wilcoxon signed-rank tests.

The headline finding is that stochastic gradient descent wins on reliability. Across all tasks, SGD achieved a significantly higher success rate than every competing method, and on the real-world, 3D-scanned factory tasks it solved more than 90 percent of them, beating random sampling, genetic algorithms, and Bayesian optimization alike. On the difficult synthetic set with five goals and five obstacles, SGD found valid placements in roughly 57 percent of position-plus-orientation runs, compared with about 44.8 percent for random sampling and 39.4 percent for Bayesian optimization. The advantage appeared most strongly exactly where deployments are hardest: cluttered environments and tasks demanding many distinct reach targets.

Genetic algorithms, by contrast, claimed the prize for quality. Among the tasks each method managed to solve, GA delivered the lowest final cycle times on average, significantly undercutting both random sampling and Bayesian optimization across the full task suite. This edge was most pronounced in the edge-case set, where feasible base placements are squeezed into narrow zones; there, GA achieved an average best cycle time of about 14.3 seconds versus more than 17.5 seconds for Bayesian optimization. Bayesian optimization, often a darling of expensive black-box problems, fared worst overall, showing the lowest success rate on the constrained edge tasks when orientation was fixed, around 5.4 percent, and significantly higher costs than all other methods across the board.

The study also yielded practical lessons about the search space itself. Allowing the optimizer to choose the robot’s orientation as well as its position, rather than fixing the base facing, increased success rates on the hardest edge tasks for every algorithm, sometimes spectacularly: random sampling jumped from about 14.6 percent to 54.4 percent, and Bayesian optimization from 5.4 percent to 25 percent. The authors note this suggests that the extra mounting effort of a freely oriented base pays off for complex tasks. Generalization, however, came at a cost for everyone. Success rates dropped when methods tuned on simple tasks faced harder distributions, yet all algorithms still exceeded 80 percent success on the realistic factory scans, with SGD leading at better than 90 percent.

The contrast with the baseline is stark: a dummy optimizer that simply kept the nominal task pose solved only 47 percent of simple tasks, 18 percent of hard tasks, and not a single task from the real or edge sets. In other words, naively placing a robot where the task description happens to put it is frequently a recipe for failure or slow cycles, while even modest optimization effort pays for itself within a 20-minute compute budget. Because cycle time correlates positively with other costs such as energy consumption, faster cycles likely mean greener ones too.

Perhaps most importantly for the field, the entire comparison is now open. All benchmarks, implemented methods, tuned hyperparameters, and generated solutions are publicly available through the CoBRA platform and the team’s code repository, giving future researchers a standardized baseline against which novel placement algorithms can be measured. As robots grow lighter and more modular, requiring less sturdy foundations and inviting more frequent relocation, the ability to compute an optimal parking spot in minutes rather than engineer one by hand could become a standard step in every deployment. This study turns an intuitive art into a benchmarked science, and it suggests the smartest placement algorithms may be the same ones that taught machines to see and speak.

Subject of Research: Comparison of optimization algorithms for industrial robot base-pose placement

Article Title: Smart placement, faster robots—a comparison of algorithms for robot base-pose optimization

Article References: Mayer, M., & Althoff, M. (2026). Smart placement, faster robots—a comparison of algorithms for robot base-pose optimization. Frontiers in Manufacturing Technology, 5, Article 1642524. https://doi.org/10.3389/fmtec.2025.1642524

Image Credits: AI Generated

DOI: 10.3389/fmtec.2025.1642524

Keywords: industrial robots, base-pose optimization, robot placement, stochastic gradient descent, Adam optimizer, genetic algorithms, Bayesian optimization, benchmarking, manufacturing automation, inverse kinematics, cycle time, CoBRA