Generous Agent Algorithm for Multi-Agent Schedule Deconfliction

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

In environments with limited communication, existing scheduling algorithms for autonomous agents struggle to coordinate schedules without perfect communication, leading to conflicts and inefficiencies, especially in heterogeneous teams where agents need to adjust schedules autonomously while adhering to original constraints.

Innovation Solution

The Generous Agent Algorithm (GAA) allows agents to deconflict schedules by proposing modified schedules through short-range communication, where agents can vacate or take on tasks without increasing their team's makespan, enabling conflict resolution without relying on perfect communication or centralized knowledge.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Adaptability or versatility

If agents operate in limited communication environments, then autonomy and flexibility are improved, but schedule coordination and conflict resolution become more difficult

Engineering Contradiction:
ImproveautonomyVSAvoidschedule coordination
Core Design Contradiction:
Adaptability or versatilityVSDevice complexity

Solution Approach 1:

The system segments the multi-agent system into independent teams that each maintain their own schedules autonomously. Each team operates as a separate entity with its own scheduling logic, reducing the need for complex inter-team communication while maintaining overall system functionality through localized decision-making.

Inventive Principle:
Principle #1Segmentation

Solution Approach 2:

Agents are equipped with self-service capabilities to detect and resolve their own schedule conflicts without external intervention. The conflict detection and resolution mechanisms are embedded within each agent, allowing them to autonomously adjust their schedules when conflicts are detected, reducing dependency on centralized coordination.

Inventive Principle:
Principle #25Self-service

2Device complexity

If centralized scheduling algorithms are used, then schedule coordination is improved, but communication requirements and system complexity increase

Engineering Contradiction:
Improveschedule coordinationVSAvoidcommunication requirements
Core Design Contradiction:
Device complexityVSLoss of information

Solution Approach 1:

The scheduling and conflict resolution functionality is extracted from centralized algorithms and embedded directly within each agent. This distributed approach eliminates the need for constant centralized communication while maintaining effective schedule coordination through local decision-making capabilities.

Inventive Principle:
Principle #2Taking out (Extraction)

Solution Approach 2:

Agents perform preliminary conflict detection and resolution actions before conflicts actually occur. By continuously monitoring their own schedules and preemptively adjusting for potential conflicts, agents reduce the need for reactive communication and coordination with centralized systems.

Inventive Principle:
Principle #10Preliminary action

3Adaptability or versatility

If agents autonomously adjust schedules, then flexibility is improved, but maintaining original constraints and global makespan becomes more difficult

Engineering Contradiction:
ImproveflexibilityVSAvoidconstraint adherence
Core Design Contradiction:
Adaptability or versatilityVSReliability

Solution Approach 1:

The system implements feedback mechanisms where agents continuously monitor their schedule adjustments against original constraints and global makespan requirements. When autonomous adjustments threaten to violate constraints, the feedback loop triggers corrective actions to realign with the original scheduling objectives, ensuring reliability is maintained despite autonomous flexibility.

Inventive Principle:
Principle #23Feedback

Data Source

PatentUS11269683B1Agent conflict resolution
Publication Date: 2022.03.08 USA AS REPRESENTED BY THE SECRETARY OF THE NAVY
  • US11269683B1 patent drawing
  • US11269683B1 patent drawing

AI summary

Methods and systems are provided for schedule deconfliction to enhance cooperation among heterogeneous teams of autonomous agents in situations where communication is severely limited. A dynamic scheduling framework, referred to herein as the Generous Agent Algorithm (GAA), organically deconflicts redundant service tasks as agents from distinct teams come into conflict and discover one another. Individual agents within a localized area can communicate their schedules to one another. Using the GAA, the agents propose modified schedules, vacating their most costly task from their schedules, while simultaneously augmenting their schedules with another agent's vacated task. The action taken by an agent does not increase an agent's makespan beyond the time set by that agent's team. Thus, the methods and systems, ensure that schedule alterations are done without degrading a team's global makespan.