|
|
|
|
|
|
|
|
Systems lack analytical methods to estimate negotiation
difficulty and adapt their behavior accordingly: |
|
Can negotiations find any solution in the time
available? ®
Convergence |
|
Can negotiations find solutions with the desired
quality and time constraints? ® Closure |
|
Can external changes destabilize the system? ® Stability |
|
|
|
|
|
|
|
|
|
|
|
|
|
During a run |
|
N(t): Number of filled missions at time at which
a new mission is filled |
|
At the end of each trial run |
|
Total number of generated missions |
|
Resource availability |
|
Fraction filled |
|
Execution time |
|
Over several runs |
|
Averages of N(t) over several runs |
|
|
|
|
|
|
|
|
Experimental procedure: |
|
The number of Pilots, Ranges and Aircrafts was
kept fixed and their percentage availability throughout the Planning
Horizon was varied randomly (to meet the input availability density) by
blocking time intervals of their available time |
|
The size of the problem was controlled by
randomly varying the total number of planned missions during the planning
horizon (for FRAGS) |
|
The planning horizon was kept fixed at 1 week |
|
The execution time was measured in batch mode
without any GUI cycles taken into account |
|
FRAGS only and FRAGS/Training Mix |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Run in batch mode with a bash shell script file |
|
|
|
|
|
|
Coding listeners one can implement actions at
the sending (or receiving) time of a message |
|
Downcast a message to determine an action based
on the message type |
|
Starfields and scaling measurements are
implemented using this mechanism |
|
Problem Generator |
|
|
|
|
|
|
Generate FRAGS only or FRAGS/Training mix
missions |
|
Generates Pilots, Aircrafts and Ranges |
|
Their availability is sufficient to fill all
generated missions |
|
|
|
|
|
|
|
|
|
Notes