Presented By,Dhanunjaya09F51A0515Intellectual Institute of Technology, (IIT-ATP).Anantapur.Architecture, Challenges and Advantages
» We propose a newarchitecture for thenetworked robots toincrease the efficiencyof the robots.• We discuss thechallenges issuesrelated to Technical,Communication,Security.• We also discuss theRobotic Advantages
Elastic computing models for cloud robotics1. Peer-Based Model: Every robot in networkcommunicates with every Robot in the cloud2. Proxy Based Model:A particular Robot acts as the Leader andcontrols the communication between cloud and other robots.3. Clone Based Model:Each robot in the network is associatedwith its corresponding system level clone in the cloud.A task can be executed in the robot or in its clone.
Peer Based Model:-Here two or more machine is connected with the cloud.
Proxy Based Model:-Here a machine is connected with the cloud, which is called as the “Leader”, It would bethe interface between cloud and machines.
Clone Based Model:-Each machine is associated with its correspondentclones in the cloud.
εr* ~ L(L/T), Stand alone execution by robot.εc* ~ L(L/T)(n–1). Cloud execution.L=no of bits to transmitT=delay dead lineN=no of robotsWe assure the security through1. Trust Establishment Algorithms.2. Trust Measurement Algorithms.3. Reputation-Based Trust approaches.
Future Robotic Applications will be interms of Could Robotics. Ability to offload computation intensivetask to cloud.Access to shared knowledge and newskills.Access to vast amount of data .
The whole is grater than its parts.Cloud Robotics> Cloudcomputing + Robotics.
REFERENCES:  B. Sicilian and O. Khatib, Eds., Springer Handbook of Robotics, Springer, 2008.  IEEE Society of Robotics and Automation’s Technical Committee on Networked Robots, available: http://www-users.cs.umn.edu/~isler/tc/  P. Jacquet et al., “Optimized Link State Routing Protocol for Ad Hoc Networks,”Multi Topic Conf. 2001, IEEE INMIC 2001, Technology for the 21st Century, Proc.IEEE Int’l., 2001, pp. 62–68.  C. Perkins et al., “Performance Comparison of Two On-Demand RoutingProtocols for Ad Hoc Networks,” IEEE Personal Commun., vol. 8, no. 1, Feb. 2001, pp. 16–28.