Vehicle Task Scheduling With Cost Matrix Conflict Updates
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing techniques for determining the execution order of tasks and routes for multiple vehicles require recalculating for all vehicles when a new vehicle is added, leading to inefficiencies and increased complexity.
Innovation Solution
A vehicle scheduling apparatus and method that uses a cost matrix to determine the execution order and route for each vehicle, incorporating conflict detection and updates to minimize costs and avoid temporary obstacles, allowing for dynamic scheduling without requiring recalculation of all vehicles' routes.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If the execution order and route are determined for multiple vehicles simultaneously, then the scheduling comprehensiveness is improved, but the system complexity and recalculation burden increase when new vehicles are added
Solution Approach 1:
The patent divides the scheduling system into independent vehicle scheduling units, where each vehicle has its own execution order and route determination. This segmentation allows individual vehicles to be scheduled separately rather than requiring complete recalculation for all vehicles when a new one is added, thus reducing system complexity while maintaining comprehensive scheduling coverage
Solution Approach 2:
The patent implements dynamic scheduling by allowing the system to adaptively adjust execution orders and routes when vehicles are added or removed. The scheduling information can be dynamically updated without requiring complete recalculation, enabling the system to respond flexibly to changes in vehicle fleet composition while maintaining optimal scheduling
2Measurement precision
If all vehicles' routes are recalculated when a new vehicle is added, then the scheduling accuracy is improved, but the time consumption and computational burden increase
Solution Approach 1:
The patent pre-determines execution orders and routes for vehicles based on their individual characteristics and task requirements. By establishing scheduling information in advance for each vehicle type and configuration, the system avoids the need for complete recalculation when vehicles are added, thus reducing recalculation time while maintaining scheduling accuracy through targeted updates
Solution Approach 2:
The patent changes the scheduling approach from fixed comprehensive recalculation to dynamic parameter-based adjustment. When vehicles are added, only the relevant scheduling parameters for those specific vehicles are updated rather than recalculating all vehicles' routes, thereby reducing computational burden and time consumption while preserving scheduling accuracy
3Reliability
If the scheduling system accounts for temporary obstacles and conflicts, then the operational reliability is improved, but the scheduling complexity and computational requirements increase
Solution Approach 1:
The patent implements feedback mechanisms where the scheduling system continuously monitors for conflicts between vehicles and temporary obstacles, and dynamically adjusts execution orders and routes based on detected conflicts. This feedback loop ensures operational reliability by resolving conflicts in real-time while managing scheduling complexity through targeted adjustments rather than comprehensive recalculation
Data Source
AI summary
A vehicle scheduling apparatus acquires a task list information that indicates tasks assigned to a target person to whom a target vehicle is assigned. The vehicle scheduling apparatus determines an execution order of the tasks of the target vehicle using a cost matrix that indicates a minimum cost for each pair of sites, selects a path to travel for each task, generates schedule information, and detects a conflict between the target vehicle and a temporary obstacle. When the conflict is detected, the vehicle scheduling apparatus updates the cost matrix so as to update the minimum cost of the pair of sites, and repeatedly generating the schedule information until no detection is detected.