Optimization-Based Path Planning for Industrial Manipulators: Experimental Validation in Additive Manufacturing

arXiv:2611.13983 · cs.RO, math.OC · Submitted 2026-11-10 · Read on arXiv

Listen

Radio episode about this paper

Transcript

Introduction to the show: ident: Robotics Radio. Generated commentary on the latest robotics and control papers.

Rosa: We're looking at the paper: "Optimization-Based Path Planning for Industrial Manipulators".

Paper summary: Rosa: We saw that the paper, "Optimization-Based Path Planning for Industrial Manipulators: Experimental Validation in Additive Manufacturing," is focused on using offline optimization to plan paths for industrial robots in additive manufacturing. The authors are Shiva Ganesh Murali, Valentin Bhend, Deepak Ingole, Gabriele Fadini, and Alisa Rupenyan <ref:2611.13983#pg1>.

Dev: The title itself suggests they're focusing on the path planning aspect for these robotic manipulators, and the validation part confirms they tested this in carbon-fiber winding and three dee printing <ref:2611.13983#pg5>.

Rosa: It’s about reconciling robot feasibility with process-specific geometry, which is a big hurdle in these kinds of applications <ref:2611.13983#pg5>. They developed an offline planner that uses joint-path regularity and self-collision penalties along with process costs and constraints to find the path <ref:2611.13983#pg5>.

Taro: It shows that this integrated approach can work for specific tasks like winding and three dee printing on a UR10e, without extrusion for printing, with joint-level tracking recorded during execution <ref:2611.13983#pg1>.

Conclusion: Rosa: So we're wrapping up our look at this paper about optimization for industrial robots in additive manufacturing. The title is quite long, isn't it, "Optimization-Based Path Planning for Industrial Manipulators: Experimental Validation in Additive Manufacturing."

Dev: Yeah, it sounds really technical. It’s about using optimization to figure out the best movement paths for robots that are actually building stuff <ref:2611.13983#pg5>.

Rosa: Exactly. The authors, Murali and Bhend and Ingole and Fadini and Rupenyan, they took a complex problem—getting a robot to move through a space while following strict manufacturing rules—and they used this optimization thing to solve it offline <ref:2611.13983#pg5>.

Dev: It sounds like the core idea is finding those joint paths that balance two things: how well the robot can actually move, and how well the final manufactured object turns out <ref:2611.13983#pg6>.

Rosa: Right. They’re looking at making sure these planned paths meet all the geometric tolerances needed for things like carbon-fiber winding or three dee printing <ref:2611.13983#pg5>.

Taro: So, if you only listen to this, what does it mean? It means that instead of just guessing a path and hoping it works, you can use math to build a path that already knows how tight the tolerances are <ref:2611.13983#pg5>.

Dev: The results they showed suggest that when they set up the cost terms correctly—balancing things like robot movement penalties against process costs—the plans actually work in practice <ref:2611.13983#pg6>.

Rosa: They tuned these weights iteratively, based on how far their performance was from their target key performance indicators, and it worked for both winding and three dee printing <ref:2611.13983#pg6>.

Taro: That’s interesting because the authors mentioned that this method handles differences between neighboring joint configurations, which is usually where things get messy in real manufacturing <ref:2611.13983#pg2>.

Dev: So what does this mean for someone running a factory floor robot? It means you can pre-calculate a path that respects the physics of the machine and the geometry of the part before you even start printing or winding <ref:2611.13983#pg6>.

Rosa: Exactly. It moves the heavy lifting from real-time control during manufacturing to an offline planning phase, which is much faster and more reliable for those critical tolerances <ref:2611.13983#pg5>.

Taro: But they also flagged that this whole setup is dependent on how well you define all those constraints—the robot limits and the process requirements—so if your input data is bad, the optimized path won't help <ref:2611.13983#pg2>.

Dev: That’s a fair point. It's not a magic bullet; it depends on building a really solid model of both the hardware and the manufacturing process first <ref:2611.13983#pg2>.

Rosa: So, it’s about setting up that initial plan smartly so you don't waste time in real-time fixing errors later when you’re trying to meet those tight tolerances <ref:2611.13983#pg5>.

Taro: And for future work, they touched on how this could be extended to handle more complex dynamic environments where things move around while the robot is working <ref:2611.13983#pg2>.

Shiva Ganesh Murali, Valentin Bhend, Deepak Ingole, Gabriele Fadini, Alisa Rupenyan

ZHAW Centre for Artificial Intelligence, University of Applied Sciences, Winterthur

cs.RO, math.OC

Submitted: 2026-11-10

Updated: 2026-11-10

Comments: Submitted for the review in ECC 2027

License: http://creativecommons.org/licenses/by-nc-nd/4.0/

Importance score: 90/100

The gist: Robotic additive manufacturing requires joint paths that reconcile robot feasibility with process-specific geometry <ref:2611.13983#pg5> The planner selects joint configurations along the ordered…

Key concepts

Joint Path Selection
This is the core task where an offline planner determines a complete sequence of joint movements for a robot. It involves selecting configurations along an ordered process reference path by balancing various costs and constraints to ensure the resulting trajectory is physically achievable by the robot.
Cost Function Minimization
The optimization problem seeks to minimize a total cost function. This function combines penalties related to differences between adjacent joint configurations, ensuring smooth transitions, with terms that penalize poor link clearance or violations of geometric constraints during the path execution.
Process Reference
This is the desired sequence of states or geometry that the robot must follow during manufacturing. The planner uses this reference as a guide to select feasible joint paths, making sure the planned movements align with the specific requirements of tasks like carbon-fiber winding or 3D printing.
Constraints and KPIs
The optimization includes various constraints and Key Performance Indicators (KPIs) that must be met. These include ensuring geometric tolerances are respected and achieving specific performance targets, such as meeting all required specifications for the manufacturing process.

Terminology

Summary

Robotic additive manufacturing requires joint paths that reconcile robot feasibility with process-specific geometry <ref:2611. p. 0

Where the paper says it

Optimization-Based Path Planning for Industrial Manipulators: Experimental Validation in Additive Manufacturing Shiva Ganesh Murali, Valentin Bhend, Deepak Ingole, Gabriele Fadini, Alisa Rupenyan Abstract— Robotic additive manufacturing requires joint paths that reconcile robot feasibility with process-specific geometry. We develop an offline optimization-based path planner that combines joint-path regularity and self-collision penalties with process costs and constraints, so that a new process enters through its own reference, residuals, and tolerances.

13983#pg5> The planner selects joint configurations along the ordered process reference using robot and process costs and constraints <ref:2611. p. 0
Where the paper says it

We address the offline path-planning problem highlighted in Fig. The planner selects joint configurations along the ordered process reference using robot and process costs and constraints.

13983#pg6> In carbon-fiber winding and robotic 3D printing, the planned paths meet the geometric tolerances and all KPI targets <ref:2611. p. 0
Where the paper says it

Iterative Weight Tuning (IWT) determines the cost weights from the gaps between Key Performance Indicators (KPIs) and their targets. In carbon-fiber winding and robotic 3D printing, the planned paths meet the geometric tolerances and all KPI targets, and both paths are executed on a UR10e, without extrusion for printing, with joint-level tracking recorded during execution.

13983#pg6>

Optimization Formulation

The offline planner selects a complete joint path in (1) so that the cost can account for differences between neighboring configurations <ref:2611.13983#pg6> The general optimization problem is formulated as minimizing robot costs and process costs subject to various constraints <ref:2611. p. 2

Where the paper says it

| {z } robot costs +Jproc(Q¯ ;W ,P) | {z } process cost (4a) subject to Qmin ≤ Qi ≤ Qmax ∀i = 1,. ,N robot inequality constraints (4b) Q˙ i = Qi −Qi−1 ∀i = 2,.

13983#pg6> This involves balancing reference agreement, joint-path regularity, and self-clearance through the objective function <ref:2611. p. 1
Where the paper says it

Configurations must satisfy joint bounds and any hard process constraints. The objective balances reference agreement, joint-path regularity, and self-clearance.

13983#pg6> The cost terms include joint-path differences and link clearance penalties <ref:2611. p. 3
Where the paper says it

The robot terms in (4a) evaluate joint-path differences and link clearance. Joint bounds and specified alignment inequalities are posed as hard constraints, whereas self-clearance and fiber–robot clearance are soft penalties.

Green — the paper says it, and the page is printed. Red — no passage carries it, so treat that sentence as unverified. The same check runs on your own text: check a summary against its source, $5.

Improvements for AI systems

  1. Process-aware joint-path formulation allows for coupling winding fiber alignment or printing nozzle poses with joint regularity, self-clearance, and joint bounds, enabling a single optimization framework for different manufacturing processes.

  2. Iterative Weight Tuning (IWT) dynamically selects robot and process cost weights by determining them from the gaps between the evaluated metrics and their tolerances, allowing the system to adapt its optimization priorities based on performance targets like fiber-direction alignment or position- and orientation-tracking KPIs.

  3. A two-stage winding planner converts geometry into a sequence of contact points and fiber directions in a core frame, where the robot stage plans motion using this fixed sequence while enforcing an angular tolerance at groove endpoints.

  4. The printing implementation limits active configurations per optimization by using Fixed neighboring configurations and joint-difference penalties couple adjacent chunks, which propagates boundary updates via alternating forward and reverse sweeps for long pose references.

  5. The system can achieve nominal winding path agreement with a maximum error of 1.90 degrees and meet printing pose tolerances with errors below 1 mm in position and 1 degree in orientation after three IWT repetitions.

Abstract

Robotic additive manufacturing requires joint paths that reconcile robot feasibility with process-specific geometry. We develop an offline optimization-based path planner that combines joint-path regularity and self-collision penalties with process costs and constraints, so that a new process enters through its own reference, residuals, and tolerances. Full-path and boundary-coupled chunked optimization handle references of different lengths. Iterative Weight Tuning (IWT) determines the cost weights from the gaps between Key Performance Indicators (KPIs) and their targets. In carbon-fiber winding and robotic 3D printing, the planned paths meet the geometric tolerances and all KPI targets, and both paths are executed on a UR10e, without extrusion for printing, with joint-level tracking recorded during execution.

Sources

Related papers