Abstract Purpose of Review Task allocation using a team or coalition robots is one the most important problems in robotics, computer science, operational research, and artificial intelligence. We present survey multi-robot task covering many problem variants solution approaches, both centralized decentralized. Recent Findings In recent work, research has focused on handling complex objectives f...

Automatically assigning tasks to people is challenging because human performance can vary across for many reasons. This challenge further compounded in real-life settings which no oracle exists assess the quality of decisions and task assignments made. Instead, we find ourselves a “closed” decision-making loop same fallible rely on practice must also be used guide allocation. How imperfect pote...

Recently there has been a lot of interest in problems at the intersection of Game Theory, Economics, and Computer Science. For example, there are interesting developments concerning algorithms for equilibria and cost sharing, algorithmic mechanism design, and the efficiency of systems with selfish users [17]. In this note, I will focus on the last area and in particular on the price of anarchy ...

In this paper, we consider configurable capacity tunnels. Static bandwidth allocation (SBA) assigns the network capacity to the tunnels according to the busy hours of their traffic aggregates. At secondary times, their capacity is underutilized and can not be used to accommodate excess traffic of other tunnels. The contribution of this paper is twofold. Firstly, we propose two mechanisms for ad...

The current study explored effects of continuous hand motion on the allocation of visual attention. A concurrent paradigm was used to combine visually concealed continuous hand movements with an attentionally demanding letter discrimination task. The letter probe appeared contingent upon the moving right hand passing through one of six positions. Discrimination responses were then collected via...

Bounty hunting has been shown to solve the multiagent task allocation problem robustly in noisy and dynamic scenarios with multiple other agents of unknown quality. This bounty hunting model does not require task exclusivity, but does require task commitment. We examine eliminating this second requirement, thus allowing bounty hunters to commit to tasks but abandon them later (to jump ship) for...

The localization problem is important in mobile robots and wireless sensor network and has been studied for many years. Among many localization methods, the hop-count based approach is simple and scalable; however, the localization accuracy is not satisfactory if the node density is low. To solve this problem, in this paper a multi-robot approach is proposed to utilize the cooperation and mobil...

Internet centers host services for e-banks, e-auctions and other clients. Hosting centers then must allocate servers among clients to maximize revenue. The limited number of servers, costs of reallocat-ing servers, and unpredictability of requests make server allocation optimization difficult. Based on the many similarities between server and honey bee colony forager allocation, we propose a ne...

Task Scheduling [1] is the allocation of resources over time to perform a collection of tasks. Real -time systems make use of scheduling algorithms to maximize the number of real -time tasks that can be processed without violating timing constraints. A scheduling algorithm provides a schedule for a task set that assigns tasks to processors and provides an ordered list of tasks. The schedule is ...