Different Approaches to Solve the MRTA Problem
The multi-robot task allocation problem is a fundamental problem in robotics research area. The problem roughly consists of finding an optimal allocation of tasks among several robots to reduce the mission cost to a minimum. As mentioned in Chap. 6, extensive research has been conducted in the area for answering the following question: Which robot should execute which task? In this chapter, we design different solutions to solve the MRTA problem. We propose four different approaches: an improved distributed market-based approach (IDMB), a clustering market-based approach (CM-MTSP), a fuzzy logic-based approach (FL-MTSP), and Move-and-Improve approach. These approaches must define how tasks are assigned to the robots. The IDBM, CM-MTSP, and Move-and-Improve approaches are based on the use of an auction process where bids are used to evaluate the assignment. The FL-MTSP is based on the use of the fuzzy logic algebra to combine objectives to be optimized.
- 1.Trigui, Sahar, Anis Koubaa, Omar Cheikhrouhou, Habib Youssef, Hachemi Bennaceur, Mohamed-Foued Sriti, and Yasir Javed. 2014. A distributed market-based algorithm for the multi-robot assignment problem. Procedia Computer Science, 32(Supplement C): 1108–1114. The 5th International Conference on Ambient Systems, Networks and Technologies (ANT-2014), the 4th International Conference on Sustainable Energy Information Technology (SEIT-2014).Google Scholar
- 2.Trigui, Sahar, Anis Koubâa, Omar Cheikhrouhou, Basit Qureshi, and Habib Youssef. 2016. A clustering market-based approach for multi-robot emergency response applications. In 2016 international conference on autonomous robot systems and competitions (ICARSC), 137–143. IEEE.Google Scholar
- 3.Trigui, Sahar, Omar Cheikhrouhou, Anis Koubaa, Uthman Baroudi, and Habib Youssef. 2016. Fl-mtsp: A fuzzy logic approach to solve the multi-objective multiple traveling salesman problem for multi-robot systems. Soft Computing: 1–12.Google Scholar
- 4.Kuhn, W., and Harold. 1955. The hungarian method for the assignment problem. Naval Research Logistics (NRL) 2 (1–2): 83–97.Google Scholar
- 5.Bernardine Dias, M., Robert Zlot, Nidhi Kalra, and Anthony Stentz. 2006. Market-based multirobot coordination: A survey and analysis. Proceedings of the IEEE 94 (7): 1257–1270.Google Scholar
- 6.Golmie, Nada, Yves Saintillan, and David H Su. 1999. A review of contention resolution algorithms for IEEE 802.14 networks. IEEE Communications Surveys 2 (1):2–12.Google Scholar
- 10.Kirk, Joseph. 2011. Traveling-salesman-problem-genetic-algorithm. http://www.mathworks.com/matlabcentral/fileexchange/13680-traveling-salesman-problem-genetic-algorithm.
- 13.Webots simulation scenarios. 2014. http://www.iroboapp.org/index.php?title=Videos.
- 15.Braun, Heinrich. 1991. On solving travelling salesman problems by genetic algorithms. In Parallel problem solving from nature, 129–133. Berlin: Springer.Google Scholar