Skip to content
naulon
Not checkedNot checked for notices yet.

Digital Twin Driven Four-Dimensional Path Planning of Collaborative Robots for Assembly Tasks in Industry 5.0

Ilias Chouridis, Gabriel Mansour, Asterios Chouridis and 3 more

Robotics · 2025

doi:10.3390/robotics14070097 (opens in a new tab)

We email you when a new notice or a question about this paper appears.

Abstract

Collaborative robots are vital in Industry 5.0 operations. They are utilized to perform tasks in collaboration with humans or other robots to increase overall production efficiency and execute complex tasks. Aiming at a comprehensive approach to assembly processes and highlighting new applications of collaborative robots, this paper presents the development of a digital twin (DT) for the design, monitoring, optimization and simulation of robots’ deployment in assembly cells. The DT integrates information from both the physical and virtual worlds to design the trajectory of collaborative robots. The physical information about the industrial environment is replicated within the DT in a computationally efficient way that aligns with the requirements of the path planning algorithm and the DT’s objectives. An enhanced artificial fish swarm algorithm (AFSA) is utilized for the 4D path planning optimization, taking into account dynamic and static obstacles. Finally, the proposed framework is utilized for the examination of a case in which four industrial robotic arms are collaborating for the assembly of an industrial component.

Abstract licence: CC BY

References59

    40 more references, whose wording the paper’s licence keeps private.

    All 59 references

    Reads

    Read by people on this page

    None yet.

    Checked or read by AI through naulon

    None yet.

    A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.

    Are you an author?

    Is this your paper?

    Claim it to add your note and be paid when agents cite it. Free.