OCP Robotics Kernel

Simulate. Optimize. Deploy.

In modern robotics, every millisecond and every degree of freedom count. The Robotics Simulation Kernel is a high-performance, industrial-grade simulation and planning platform that doesn’t just model native robot motions - it optimizes and makes them executable. Designed for engineers, integrators, and software developers who demand uncompromising accuracy, scalability, and compatibility.

Why Our Kernel Transforms Your Robotics Projects

1. Kinematics - Precise and Manufacturer-Agnostic

• Forward and inverse kinematics for all major robot brands (ABB, KUKA, FANUC, UR, Staubli, Yaskawa, and more).
• Base and tool transformations for flexible workspace definitions.
• External axes (rotary/tilt tables, linear axes) seamlessly integrated - just like in your real cell.

‍

2. Realistic Motion Simulation - Including Blending

• True linear, circular, and PTP movements with physically accurate path interpolation.
• Blending behavior as on real controllers - validate cycle times early in simulation.

‍

3. Highly Parallelized Performance - Scalable to 128 Cores

• Unlimited multithreading for simulation, collision detection, and path planning.
• Real-time computations even in complex multi-robot scenarios with external axes.

‍

4. Path Planning That Runs on Your Controller

• Generates executable robot commands (Lin/PTP including blending) - not just joint trajectories, but native controller instructions.
• Reduce manual post-processing with pre-optimized paths that run directly on the OEM controller.
  (Note: Simulation is not a 1:1 replica of reality—but it delivers executable, optimized motion sequences that you can fine-tune.)

‍

5. Constrained Path Planning - Optimize Paths with Degrees of Freedom

• Automatic singularity and collision resolution by intelligently leveraging process degrees of freedom (tool, external axes).
• Process-safe trajectories that respect robot limits - no manual trial and error.

‍

6. Cycle Time Optimization via GTSPN Sequencing

• Algorithms for motion sequence optimization (Generalized Traveling Salesman Problem with Neighbors).
• Minimize idle times by smartly utilizing tool and axis degrees of freedom.

‍