UAV Resource Allocation Planning System for Hostile Environments

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Scheduling and tasking of unmanned mobile resources, such as UAVs, in a hostile environment with multiple operational capabilities is complex due to the need for coordinated control and optimization of information collection, which often results in inefficient resource utilization and poor system performance.

Innovation Solution

An improved planning system using a hybrid branch and bound approach with local and global planning, employing heuristics to determine the optimal allocation and movement paths of resources, and calculating upper bounds to prioritize tasks and minimize the search space, ensuring effective resource management even in adversarial conditions.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Adaptability or versatility

If traditional scheduling methods are used for multiple UAVs with multiple operational capabilities, then the system can handle complex environments, but the computational complexity increases significantly and solution time extends

Engineering Contradiction:
Improvehandling complex environments with multiple capabilitiesVSAvoidcomputational complexity
Core Design Contradiction:
Adaptability or versatilityVSDevice complexity

Solution Approach 1:

The patent segments the resource allocation problem into separate sub-problems for each functional mode (reconnaissance, attack, electronic warfare). By solving each mode independently and then selecting the best combination, the computational complexity is reduced from exponential to polynomial time while maintaining the ability to handle multiple operational capabilities.

Inventive Principle:
Principle #1Segmentation

Solution Approach 2:

The patent introduces an upper bound calculation as an intermediary step that provides a theoretical maximum value for each functional mode. This upper bound serves as a pruning criterion in the branch and bound algorithm, allowing the system to eliminate suboptimal paths without exhaustive search, thus reducing computational complexity while preserving solution quality.

Inventive Principle:
Principle #24Intermediary (Mediator)

2Reliability

If exhaustive search methods are used to find optimal resource allocation, then the solution is deterministic and optimal, but the computational cost increases exponentially

Engineering Contradiction:
Improvedeterministic solutionVSAvoidcomputational efficiency
Core Design Contradiction:
ReliabilityVSProductivity

Solution Approach 1:

The patent performs preliminary calculations of upper bounds for each functional mode before executing the main branch and bound algorithm. These pre-computed upper bounds are used to prune the search space early in the optimization process, eliminating suboptimal branches before they consume computational resources, thus maintaining deterministic optimality while improving efficiency.

Inventive Principle:
Principle #10Preliminary action

Solution Approach 2:

The patent changes the parameter representation from individual resource assignments to functional mode selections. By first determining the optimal functional mode for each resource type and then allocating resources within those modes, the search space dimension is reduced, enabling deterministic solutions with polynomial computational complexity.

Inventive Principle:
Principle #35Parameter changes

3Speed

If real-time optimization is implemented for resource allocation, then the system responds quickly to dynamic environments, but the computational requirements increase

Engineering Contradiction:
Improveresponse timeVSAvoidcomputational power
Core Design Contradiction:
SpeedVSPower

Solution Approach 1:

The patent segments the optimization problem into independent functional mode decisions and resource allocation decisions. This segmentation allows the system to compute upper bounds for each mode separately and use them as pruning criteria, reducing the computational power needed for real-time optimization while maintaining fast response times to dynamic environmental changes.

Inventive Principle:
Principle #1Segmentation

Data Source

PatentUS8396730B2System and method for resource allocation and management
Publication Date: 2013.03.12 RAYTHEON CO
  • US8396730B2 patent drawing
  • US8396730B2 patent drawing
  • US8396730B2 patent drawing

AI summary

To improve the scheduling and tasking of resources, the present disclosure describes an improved planning system and method for the allocation and management of resources. The planning system uses a branch and bound approach of tasking resources using a heuristic to expedite arrival at a deterministic solution. For each possible functional mode of the resources, an upper bound is determined. The upper bounds are employed in an objective function for the branch and bound process to determine the functional mode in which to place the resources and to determine movement paths for the resources, all in an environment where a hostile force may attempt to destroy the resources.