Abstract
Through this study, we introduce the idea of applying scheduling techniques to allocate spatial resources that are shared among multiple robots moving in a static environment and having temporal constraints on the arrival time to destinations. To illustrate this idea, we present an exemplified algorithm that plans and assigns a motion path to each robot. The considered problem is particularly challenging because: (i) the robots share the same environment and thus the planner must take into account overlapping paths which cannot happen at the same time; (ii) there are time deadlines thus the planner must deal with temporal constraints; (iii) new requests arrive without a priori knowledge thus the planner must be able to add new paths online and adjust old plans; (iv) the robot motion is subject to noise thus the planner must be reactive to adapt to online changes. We showcase the functioning of the proposed algorithm through a set of agent-based simulations.
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
Notes
- 1.
The term “acceptance test” or “schedulability test” is also used in traditional real-time systems to refer to the decision process of accepting or rejecting a task based on the ability of scheduling it under the given time constraints.
- 2.
EDF is a preemptive optimal scheduling algorithm for dynamic priorities. The tasks’ priorities are updated during the execution of the tasks based on the current conditions.
References
Bennewitz, M., Burgard, W., Thrun, S.: Finding and optimizing solvable priority schemes for decoupled path planning techniques for teams of mobile robots. Robot. Auton. Syst. 41(2), 89–99 (2002)
Buttazzo, G.: Hard Real-time Computing Systems: Predictable Scheduling Algorithms and Applications, Real-Time Systems Series, vol. 24. Springer, Heidelberg (2011)
Choset, H.M.: Principles of Robot Motion: Theory, Algorithms, and Implementation. MIT Press, Cambridge (2005)
Dorfman, M., Medanic, J.: Scheduling trains on a railway network using a discrete event model of railway traffic. Transp. Res. B-Methodol. 38(1), 81–98 (2004)
Khaluf, Y., Birattari, M., Rammig, F.: Probabilistic analysis of long-term swarm performance under spatial interferences. In: Dediu, A.-H., Martín-Vide, C., Truthe, B., Vega-Rodríguez, M.A. (eds.) TPNC 2013. LNCS, vol. 8273, pp. 121–132. Springer, Heidelberg (2013). doi:10.1007/978-3-642-45008-2_10
Khaluf, Y., Rammig, F.: Task allocation strategy for time-constrained tasks in robot swarms. Adv. Artif. Life (ECAL) 12, 737–744 (2013)
LaValle, S.M.: Planning Algorithms. Cambridge University Press, Cambridge (2006)
Mailler, R., Lesser, V., Horling, B.: Cooperative negotiation for soft real-time distributed resource allocation. In: Proceedings of AAMAS 2003, pp. 576–583. ACM (2003)
Manolache, S., Eles, P., Peng, Z.: Task mapping and priority assignment for soft real-time applications under deadline miss ratio constraints. ACM Trans. Embed. Comput. Syst. (TECS) 7(2), 19 (2008)
Mills, A., Anderson, J.: A stochastic framework for multiprocessor soft real-time scheduling. In: the 16th IEEE Real-Time and Embedded Technology and Applications Symposium, pp. 311–320. IEEE Press (2010)
Quottrup, M.M., Bak, T., Zamanabadi, R.I.: Multi-robot planning: A timed automata approach. In: Proceedings of ICRA 2004, vol. 5, pp. 4417–4422 (2004)
Smith, R., Self, M., Cheeseman, P.: Estimating uncertain spatial relationships in robotics. In: Cox, I.J., Wilfong, G.T. (eds.) Autonomous Robot Vehicles, pp. 167–193. Springer, New York (1990)
Toklu, N.E., Gambardella, L.M., Montemanni, R.: A multiple ant colony system for a vehicle routing problem with time windows and uncertain travel times. J. Traffic Logistics Eng. 2(1), 52–58 (2014)
Törnquist, J., Persson, J.A.: N-tracked railway traffic re-scheduling during disturbances. Transp. Res. B-Methodol. 41(3), 342–362 (2007)
Van Den Berg, J., Overmars, M.: Prioritized motion planning for multiple robots. In: Proceedings of IROS 2005, pp. 430–435. IEEE Press (2005)
Wagner, G., Choset, H.: M*: A complete multirobot path planning algorithm with performance bounds. In: Proceedings of IROS 2011, pp. 3260–3267 (2011)
Wang, C., Savkin, A.V., Clout, R., Nguyen, H.T.: An intelligent robotic hospital bed for safe transportation of critical neurosurgery patients along crowded hospital corridors. IEEE Trans. Neural Syst. Rehabil. Eng. 23(5), 744–754 (2015)
Yin, Z., Tambe, M.: Continuous time planning for multiagent teams with temporal constraints. In: Proceedings of IJCAI 2011, vol. 22, p. 465 (2011)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer International Publishing AG
About this paper
Cite this paper
Khaluf, Y., Markarian, C., Simoens, P., Reina, A. (2017). Scheduling Access to Shared Space in Multi-robot Systems. In: Demazeau, Y., Davidsson, P., Bajo, J., Vale, Z. (eds) Advances in Practical Applications of Cyber-Physical Multi-Agent Systems: The PAAMS Collection. PAAMS 2017. Lecture Notes in Computer Science(), vol 10349. Springer, Cham. https://doi.org/10.1007/978-3-319-59930-4_12
Download citation
DOI: https://doi.org/10.1007/978-3-319-59930-4_12
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-59929-8
Online ISBN: 978-3-319-59930-4
eBook Packages: Computer ScienceComputer Science (R0)