Abstract
Network robots can provide a variety of services to users of network. Existing service robots not only have been developed for specific purpose with constraint capabilities, but have only focused on how to perform their service efficiently. In order to improve the usefulness of the networked service robot, however, it is necessary to provide services considering the user’s needs and service context change. This paper proposes a dynamic service scheduling scheme to provide effective services to multiple users for network robots. The proposed scheme is adaptable to dynamic changes of service type, environment and users by customizing the scheduling policy with both system-centric and user-centric properties in real time. The experimental results show that the proposed scheme enhances the user satisfaction and performance of the robot service compared to other scheduling schemes.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Young, G.O.: A faster algorithm for 2-cyclic robotic scheduling with a fixed robot routeand interval processing times. European Journal of Operational Research 209, 51–56 (2011)
Dang, Q.V., Nielsen, I.E., Steger-Jensen, K.: Scheduling a Single Mobile Robot for Feeding Tasks in a Manufacturing Cell. In: Proceedings of the International Conference Advances in Production Management Systems, Value Networks: Innovation, Technologies and Management (APMS), Stavanger, Norway (2011)
Gerkey, B.P., Mataric, M.J.: A formal analysis and taxonomy of task allocation in multi-robot systems. The International Journal of Robotics Research 23, 939–954 (2004)
Labella, T.H., Dorigo, M., Deneubourg, J.-L.: Division of labour in a group of robots inspired by ants’ foraging behaviour. Journal ACM Transactions on Autonomous and Adaptive Systems (TAAS) 1, 402 (2006)
Alcaide, D., Chu, C., Kats, V., Levner, E., Sierksma, G.: Cyclic multiple-robot scheduling with time-window constraints using a critical path approach. European Journal of Operational Research 177, 147–162 (2007)
Jackson, J.J.: Microsoft robotics studio: A technical introduction. IEEE Robotics & Automation Magazine 14, 82–87 (2007)
Bansal, N., Harchol-Balter, M.: Analysis of SRPT scheduling: investigating unfairness. In: Proc. ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems, pp. 279–290 (2001)
Oh, S.H., Yang, S.M.: A modified least-laxity-first scheduling algorithm for real-time tasks. In: Proc. 5th Real-Time Computing Systems and Applications, October 27-29, pp. 31–36 (1998)
Andrew, M.: Probabilistic end-to-end delay bounds for earliest deadline first scheduling. This paper appears in Proceedings of the INFOCOM 2000. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies, vol. 2, pp. 603–612. IEEE (2000)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lee, JH., Park, JM. (2013). Dynamic Scheduling for Usable Service in Network Robot. In: Pathan, M., Wei, G., Fortino, G. (eds) Internet and Distributed Computing Systems. IDCS 2013. Lecture Notes in Computer Science, vol 8223. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-41428-2_20
Download citation
DOI: https://doi.org/10.1007/978-3-642-41428-2_20
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-41427-5
Online ISBN: 978-3-642-41428-2
eBook Packages: Computer ScienceComputer Science (R0)