Presentation on theme: "Example of Multilevel representation of ammunition D Mott v2."— Presentation transcript:
Example of Multilevel representation of ammunition D Mott v2
Some types of multilevel representation Adding constraints –need a flight -> need a helicopter -> need a helicopter with a capacity of X -> need helicopter 26 A Type is Instantiated –We need a Helicopter of type T, we will allocate H123 Aggregation –a request is bundled up into larger requests, eg logistics More complex mappings –High level wants a hammer, low level only has a brick, needs a functional mapping –…
Logistics Organisations HQ Log –responsible for logistics for all BNs in the Division BN1 Log –responsible for logistics for all tasks undertaken by BN1 BN2 Log –responsible for logistics for all tasks undertaken by BN2
Basic Concepts Tasks (eg SECURE Enemy Bank) require field artillery –different types for different tasks –may be geographically dispersed Field Artillery fires rounds of ammunition –different types for different FAs –number required depends on the task? Ammunition comes in a crate: –contains a fixed number of rounds of a certain type –has a weight and a 3D dimension Crates may be aggregated into containers –has a maximum weight capacity –has spatial dimensions Logistics organisations deliver ammunition –as crates –as containers
Aggregation Logic … … … N rounds per crate, where N is fixed per type of round & crate. set of mixed crates according to: up to maximum weight (easy) OR spatial packing constraints (complex)
BN Log planning Aggregate all requests from BN and send to HQ Log Unpack container from HQ Log into crates for Tasks Take to BNx DropOff … … Task 1 Task 2 To HQ Log Consolidated Request Follow packing constraints (max wt, round up to complete crate) Use packing heuristics to minimise no of crates
HQ Log Planning Aggregate all BN requests into container(s) Get from Suppliers Deliver to Division DropOff Consolidated Request from BN1 Consolidated Request from BN2 Follow packing constraints (max wt, or spatial dimensions) Use packing heuristics to minimise no of containers, distance travelled etc
Views of the ammunition 1.Task is supported by Field Artillery –needs N rounds –VIEW as rounds 2.BN Log must supply all of its tasks –needs N crates of type X, … M crates of type Y –VIEW as consolidated sets of crates 3.HQ Log must supply all of the battalions –needs N containers, each containing a mixed set of crates –VIEW as containers
Levels of aggregation of an entity This reflects the containment of resource requests inside each other: –request for round is satisfied by request for crate –request for create is satisfied by consolidated request –consolidated request is satisfied by container request crate [BNx Log] consolidated request [BNx Log] container [HQ Log] round [Task]
Rationale We must retain the containment links between the resource requests at various levels The rationale for the containment must also be recorded: –resource request X is present because: resource request Y… packing constraints packing heuristics
Some logical constraints the crate must hold things of the correct type –call this the content type of the crate there must be no more than a maximum number of items in the crate –call this the maximum content of the crate
Correct type - logic version 1 pick any thing from the crate and it will be of the correct content type if ( the crate C holds the thing S ) and ( the crate C has the value A as content type ) then ( the thing S has the value A as type ).
Visualisation New StructureExisting Structure IFTHEN ADD
Correct type - logic version 2 it cannot be that there is something in the crate of the wrong type if ( the crate C holds the thing S ) and ( the thing S has the value ST as type ) and ( the crate C has the value A as content type ) and ( the value ST # the value A ) then ( there is an inconsistency ).
Maximum number in a crate - 1 if you count the number of items in a crate then that count will be less than the maximum content if ( the thing C is a crate ) and ( the set S includes every thing T where ( the crate C holds the thing T ) ) and ( the set S has N members ) and ( the crate C has the value Max as maximum content ) then ( the value N <= the value Max ). Sets not yet available in CE
Maximum number in a crate - 2 it cannot be that there are more than the maximum number of items in a crate if ( the thing C is a crate ) and ( the set S includes every thing T where ( the crate C holds the thing T ) ) and ( the set S has N members ) and ( the crate C has the value Max as maximum content ) and ( the value N > the value Max ) then ( there is an inconsistency ).