Ball Striking Algorithm for a 3 DOF Ping-Pong Playing Robot Based on Particle Swarm Optimization

TL;DR

This paper presents a particle swarm optimization-based algorithm enabling a 3 DOF ping-pong robot to determine optimal hitting strategies, demonstrating effectiveness through simulation for targeted ball placement.

Contribution

The paper introduces a novel particle swarm optimization algorithm for real-time ball hitting in a 3 DOF ping-pong robot, adaptable to various strategies.

Findings

Effective ball hitting position calculation demonstrated in simulations

Algorithm adaptable to different hitting strategies

Potential for real-time application in robotic ping-pong

Abstract

This paper illustrates how a 3 degrees of freedom, Cartesian robot can be given the task of playing ping pong against a human player. We present an algorithm based on particle swarm optimization for the robot to calculate when and how to hit an approaching ball. Simulation results are shown to depict the effectiveness of our approach. Although emphasis is placed on sending the ball to a desired point on the ping pong table, it is shown that our method may be adjusted to meet the requirements of a variety of ball hitting strategies.