Multi-type Fair Resource Allocation for Distributed Multi-Robot Systems

Fair resource allocation is essential to ensure that all resource requesters acquire adequate resources and accomplish tasks. We propose solutions to the fairness problem in multi-type resource allocation for multi-robot systems that have multiple resource requesters. We apply the dominant resource fairness (DRF) principle in our solutions to two different systems: single-tasking robots with multi-robot tasks (STR-MRT) and multi-tasking robots with single-robot tasks (MTR-SRT). In STR-MRT, each robot can perform only one task at a time, tasks are divisible, and accomplishing each task requires one or more robots. In MTR-SRT, each robot can perform multiple tasks at a time, tasks are not divisible, and accomplishing each task requires only one robot. We present centralized solutions to the fairness problem in STR-MRT. Meanwhile, we model the decentralized resource allocation in STR-MRT as a coordination game between the robots. Each robot subgroup is formed by robots that strategically select the same resource requester. For a requester associated with a specific subgroup, a consensus-based team formation algorithm further chooses the minimal set of robots to accomplish the task. We leverage the Deep Q-learning Network (DQN) to support requester selection. The results suggest that the DQN outperforms the commonly used Q-learning. Finally, we propose two decentralized solutions to promote fair resource allocation in MTR-SRT, as a centralized solution already exists. We first propose a task-forwarding solution in which the robots need to negotiate the placement of each task. In our second solution, each robot first selects resource requesters and then independently allocates resources to tasks that arrive from the selected requesters. The resource-requester selection phase of the latter solution models a coordination game that is solved by reinforcement learning. The experimental results suggest that both approaches outperform their baselines

Coalition Formation and Execution in Multi-robot Tasks

In this research, I explore several related problems in distributed robot systems that must be addressed in order to achieve multi-robot tasks, in which individual robots may not possess all the required capabilities. While most previous research work on multi-robot cooperation mainly concentrates on loosely-coupled multi-robot tasks, a more challenging problem is to also address tightly-coupled multi- robot tasks involving close robot interactions, which often require capability sharing. Three related topics towards addressing these tasks are discussed, as follows: Forming coalitions, which determines how robots should form into subgroups (i.e., coalitions) to address individual tasks. To achieve system autonomy, the ability to identify the feasibility of potential solutions is critical for forming coalitions. A general IQ-ASyMTRe architecture, which is formally proven to be sound and complete in this research, is introduced to incorporate this capability based on the ASyMTRe architecture. Executing coalitions, which coordinates different robots within the same coalition during physical execution to accomplish individual tasks. For executing coalitions, the IQ-ASyMTRe+ approach is presented. An information quality measure is introduced to control the robots to maintain the required constraints for task execution in dynamic environment. Redundancies at sensory and computational levels are utilized to enable execution that is robust to internal and external influences. Task allocation, which optimizes the overall performance of the system when multiple tasks need to be addressed. In this research, this problem is analyzed and the formulation is extended. A new greedy heuristic is introduced, which considers inter-task resource constraints to approximate the influence between different assignments in task allocation. Through combining the above approaches, a framework that achieves system autonomy can be created for addressing multi-robot tasks

Multi-robot task planning problem with uncertainty in game theoretic framework

The final publication is available at Springer via http://dx.doi.org/10.1007/978-3-642-31665-4_6An efficiency of an multi-robot systems depends on proper coordinating tasks of all robots. This paper presents a game theoretic approach to modelling and solving the pick-up and collection problem. The classical form of this problem is modified in order to introduce the aspect of an uncertainty related to an information about the workspace inside of which robots are intended to perform the task. The process of modelling the problem in game theoretic framework, as well as cooperative solution to the problem is discussed in these paper. Results of exemplary simulations are presented to prove the suitability of the approach presented.Skrzypczyk, K.; Mellado Arteche, M. (2013). Multi-robot task planning problem with uncertainty in game theoretic framework. En Advanced Technologies for Intelligent Systems of National Border Security. Springer. 69-80. doi:10.1007/978-3-642-31665-4_6S6980Alami, R., et al.: Toward human-aware robot task planning. In: Proc. of AAAI Spring Symposium, Stanford (USA), pp. 39–46 (2006)Baioletti, M., Marcugini, S., Milani, A.: Task Planning and Partial Order Planning: A Domain Transformation Approach. In: Steel, S. (ed.) ECP 1997. LNCS, vol. 1348. Springer, Heidelberg (1997)Desouky, S.F., Schwartz, H.M.: Self-learning Fuzzy logic controllers for pursuit-evasion differential games. Robotics and Autonomous Systems (2010), doi:10.1016/j.robot.2010.09.006Harmati, I., Skrzypczyk, K.: Robot team coordination for target tracking using fuzzy logic controller in game theoretic framework. Robotics and Autonomous Systems 57(1) (2009)Kaminka, G.A., Erusalimchik, D., Kraus, S.: Adaptive Multi-Robot Coordination: A Game-Theoretic Perspective. In: Proc. of IEEE International Conference on Robotics and Automation, Anchorage, Alaska, USA (2002)Kok, J.R., Spaan, M.T.J., Vlassis, N.: Non-communicative multi-robot coordination in dynamic environments. Robotics and Autonomous Systems 50(2-3), 99–114 (2005)Klusch, M., Gerber, A.: Dynamic coalition formation among rational agents. IEEE Intelligent Systems 17(3), 42–47 (2002)Kraus, S., Winkfeld, J., Zlotkin, G.: Multiagent negotiation under time constraints. Artificial Intelligence 75, 297–345 (1995)Kraus, S.: Negotiation and cooperation in multiagent environments. Artificial Intelligence 94(1-2), 79–98 (1997)Mataric, M., Sukhatme, G., Ostergaard, E.: Multi-Robot Task Allocation in Uncertain Environments. Autonomous Robots (14), 255–263 (2003)Meng, Y.: Multi-Robot Searching using Game-Theory Based Approach. International Journal of Advanced Robotic Systems 5(4) (2008)Jones, C., Mataric, M.: Adaptive Division of Labor in Large-Scale Minimalist Multi-Robot Systems. In: Proc. of IEEE/RSJ International Conference on Intelligent Robots and Systems, Las Vegas, USA, pp. 1969–1974 (2003)Sariel, S., Balch, T., Erdogan, N.: Incremental Multi-Robot Task Selection for Resource Constrained and Interrelated Tasks. In: Proc. of 2007 IEEE/RSJ International Conference on Intelligent Robots and Systems, San Diego, CA, USA (2007)Schneider-Fontan, M., Mataric, M.J.: Territorial Multi-Robot Task Division. IEEE Transactions on Robotics and Automation 14(5), 815–822 (1998)Song, M., Gu, G., Zhang, R., Wang, X.: A method of multi-robot formation with the least total cost. International Journal of Information and System Science 1(3-4), 364–371 (2005)Cheng, X., Shen, J., Liu, H., Gu, G.-c.: Multi-robot Cooperation Based on Hierarchical Reinforcement Learning. In: Shi, Y., van Albada, G.D., Dongarra, J., Sloot, P.M.A. (eds.) ICCS 2007. LNCS, vol. 4489, pp. 90–97. Springer, Heidelberg (2007

Human-Machine Collaborative Optimization via Apprenticeship Scheduling

Coordinating agents to complete a set of tasks with intercoupled temporal and resource constraints is computationally challenging, yet human domain experts can solve these difficult scheduling problems using paradigms learned through years of apprenticeship. A process for manually codifying this domain knowledge within a computational framework is necessary to scale beyond the ``single-expert, single-trainee" apprenticeship model. However, human domain experts often have difficulty describing their decision-making processes, causing the codification of this knowledge to become laborious. We propose a new approach for capturing domain-expert heuristics through a pairwise ranking formulation. Our approach is model-free and does not require enumerating or iterating through a large state space. We empirically demonstrate that this approach accurately learns multifaceted heuristics on a synthetic data set incorporating job-shop scheduling and vehicle routing problems, as well as on two real-world data sets consisting of demonstrations of experts solving a weapon-to-target assignment problem and a hospital resource allocation problem. We also demonstrate that policies learned from human scheduling demonstration via apprenticeship learning can substantially improve the efficiency of a branch-and-bound search for an optimal schedule. We employ this human-machine collaborative optimization technique on a variant of the weapon-to-target assignment problem. We demonstrate that this technique generates solutions substantially superior to those produced by human domain experts at a rate up to 9.5 times faster than an optimization approach and can be applied to optimally solve problems twice as complex as those solved by a human demonstrator.Comment: Portions of this paper were published in the Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI) in 2016 and in the Proceedings of Robotics: Science and Systems (RSS) in 2016. The paper consists of 50 pages with 11 figures and 4 table

Managing a Fleet of Autonomous Mobile Robots (AMR) using Cloud Robotics Platform

In this paper, we provide details of implementing a system for managing a fleet of autonomous mobile robots (AMR) operating in a factory or a warehouse premise. While the robots are themselves autonomous in its motion and obstacle avoidance capability, the target destination for each robot is provided by a global planner. The global planner and the ground vehicles (robots) constitute a multi agent system (MAS) which communicate with each other over a wireless network. Three different approaches are explored for implementation. The first two approaches make use of the distributed computing based Networked Robotics architecture and communication framework of Robot Operating System (ROS) itself while the third approach uses Rapyuta Cloud Robotics framework for this implementation. The comparative performance of these approaches are analyzed through simulation as well as real world experiment with actual robots. These analyses provide an in-depth understanding of the inner working of the Cloud Robotics Platform in contrast to the usual ROS framework. The insight gained through this exercise will be valuable for students as well as practicing engineers interested in implementing similar systems else where. In the process, we also identify few critical limitations of the current Rapyuta platform and provide suggestions to overcome them.Comment: 14 pages, 15 figures, journal pape

Artificial Intelligence and Systems Theory: Applied to Cooperative Robots

This paper describes an approach to the design of a population of cooperative robots based on concepts borrowed from Systems Theory and Artificial Intelligence. The research has been developed under the SocRob project, carried out by the Intelligent Systems Laboratory at the Institute for Systems and Robotics - Instituto Superior Tecnico (ISR/IST) in Lisbon. The acronym of the project stands both for "Society of Robots" and "Soccer Robots", the case study where we are testing our population of robots. Designing soccer robots is a very challenging problem, where the robots must act not only to shoot a ball towards the goal, but also to detect and avoid static (walls, stopped robots) and dynamic (moving robots) obstacles. Furthermore, they must cooperate to defeat an opposing team. Our past and current research in soccer robotics includes cooperative sensor fusion for world modeling, object recognition and tracking, robot navigation, multi-robot distributed task planning and coordination, including cooperative reinforcement learning in cooperative and adversarial environments, and behavior-based architectures for real time task execution of cooperating robot teams