---
publication_id: "OT-2026-000002476"
title: "Robot Path Planning"
published_at: "2026-09-15T19:13:19.843594Z"
canonical_url: "https://opentechnical.org/p/OT-2026-000002476"
categories:
  - "robotics-automation/robot-architectures"
keywords:
  - "b25j9/1664"
  - "g05d1/644"
  - "g05d1/644"
  - "b25j5/00"
  - "b25j5/00"
  - "b25j5/00"
---

# Robot Path Planning

## Abstract

A method for planning a robot path of a robot arrangement having at least one robot includes providing an objective group of at least two objective functions to be optimized simultaneously by a robot path, each objective function mapping a robot path to a numeric value; determining first values of the objective functions; providing a first criterion for choosing a robot path from a path group of at least two robot paths which are pareto optimal with respect to the objective group so that for each of the robot paths none of the objective functions can be improved in value without degrading at least one of the other objective function values. The method further includes determining a first robot path based on the first values of the objective functions and the first criterion, and at least one cycle of the following steps: updating the criterion and/or the values of the objective functions, and determining an updated robot path based on the current values of the objective functions and the current criterion using decision making mitigating a rank reversal between robot paths of the path group.