Orchestrating Networked Robotic Applications

In this letter, we formulate the orchestration problem for networked robotic applications considering contextual information. Any solution to the proposed formulation provides adequate routing updates, migration, and radio handover decisions as the robot moves. We prove the NP-hard nature of the problem, and solve it for a remote driving robotic application with or without some contextual information, as in state-of-the-art. Results show that without contextual information it is impossible to meet the latency requirements of a remote-driving robotic application.