Negotiating and Executing Composite Tasks for QoS-Aware Teams of Robots
The problem of allocating tasks to a team of robots composing a complex activity with global performance constraints to be met, is NP-hard. Automated negotiation was proposed as a viable heuristic approach allowing for the dynamic adjustment of the performance levels provided by the single robots in the case of robots with limited resources. This approach leads to an improved exploitation of robots capabilities in terms of the number of composite activities that can be successfully allocated to the team. In the present work, the proposed approach is extended to include the possibility for the robots to negotiate for task allocation, and to execute the tasks in an interleaved way, so that the capabilities of the entire team can be better exploited, reducing the time the robots are inactive.
KeywordsMulti-robot systems Multi-robot task allocation Market-based task allocation
Unable to display preview. Download preview PDF.
- 2.Bellifemine, F.L., Caire, G., Greenwood, D.: Developing multi-agent systems with JADE, vol. 7. John Wiley & Sons (2007)Google Scholar
- 4.Cui, R., Guo, J., Gao, B.: Game theory-based negotiation for multiple robots task allocation. Robotica 31, 923–934 (2013)Google Scholar
- 5.Di Napoli, C., Pisa, P., Rossi, S.: Towards a dynamic negotiation mechanism for qos-aware service markets. In: Trends in Practical Applications of Agents and Multiagent Systems, vol. 221, pp. 9–16. Springer (2013)Google Scholar
- 7.Giordani, S., Lujak, M., Martinelli, F.: A distributed algorithm for the multi-robot task allocation problem. In: Proceedings of the 23rd International Conference on Industrial Engineering and Other Applications of Applied Intelligent Systems - Volume Part I. pp. 721–730. Springer (2010)Google Scholar
- 9.Khamis, A., Hussein, A., Elmogy, A.: Multi-robot Task Allocation: A Review of the State-of-the-Art. In: Cooperative Robots and Sensor Networks 2015, pp. 31–51. Springer International Publishing (2015)Google Scholar
- 10.Liu, L., Shell, D.: Multi-level partitioning and distribution of the assignment problem for large-scale multi-robot task allocation. In: Proceedings of Robotics: Science and Systems, Los Angeles, CA, USA (2011)Google Scholar
- 12.Rossi, S., Di Nocera, D., Di Napoli, C.: Normal distributions and multi-issue negotiation for service composition. Advances in Soft Computing 293, 1–8 (2014)Google Scholar
- 13.Schneider, J.G., Apfelbaum, D., Bagnell, D., Simmons, R.G.: Learning opportunity costs in multi-robot market based planners. In: ICRA, pp. 1151–1156. IEEE (2005)Google Scholar
- 14.Viguria, A., Maza, I., Ollero, A.: SET: an algorithm for distributed multirobot task allocation with dynamic negotiation based on task subsets. In: IEEE International Conference on Robotics and Automation, ICRA, pp. 3339–3344 (2007)Google Scholar
- 15.Zlot, R.M., Stentz, A.T.: Market-based multirobot coordination for complex tasks. International Journal of Robotics Research, Special Issue on the 4th International Conference on Field and Service Robotics 25(1), 73–101 (2006)Google Scholar