Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 5 of 5 for “"Decentralized Task Allocation"”.

  1. Decentralized task allocation for dynamic environments

    … of the design process for creating greedy decentralized task allocation algorithms and outlines the main decisions that progressed the algorithm through three different forms. The first form was called the Sequential Greedy Algorithm (SGA). This algorithm, although fast, relied on a large …

    mit Repository record for Decentralized task allocation for dynamic environments (opens in a new tab)

  2. Decentralized task allocation in communication contested environments

    This thesis explores the topic of decentralized task allocation. Specific emphasis is placed on how and when decentralized task allocation should be applied as a decision making tool for autonomous multi-agent missions. Even though the focus is on the decentralized aspect of task allocation, care …

    mit Repository record for Decentralized task allocation in communication contested environments (opens in a new tab)

  3. Decentralized task allocation for dynamic, time-sensitive tasks

    … and objectives. In the case of dynamic task allocation, a team of agents are presented with a new, unknown task that must be allocated with their original allocations. This is exacerbated further in decentralized settings where agents are limited to utilizing local information during the …

    mit Repository record for Decentralized task allocation for dynamic, time-sensitive tasks (opens in a new tab)

  4. Learning communication policies for decentralized task allocation under communication constraints

    … communication policy for agents performing decentralized task allocation using consensus based bundle algorithm (CBBA) by accounting for these communication issues. In our approach, agents learn to use features, such as local communication graph density and value of their own messages, to …

    mit Repository record for Learning communication policies for decentralized task allocation under communication constraints (opens in a new tab)

  5. Fair allocation of operations and makespan minimization for multiple robotic agents

    … the Operation Trading Algorithm that generates allocations satisfying the DEQx (Duplicated Equitability up to any operation) fairness criterion while also guaranteeing an upper bound of 2 on the makespan for identical agents. The algorithm also guarantees an upper bound of 1.618 for 2 uniformly …

    uiuc Repository record for Fair allocation of operations and makespan minimization for multiple robotic agents (opens in a new tab)