Enumeration RoutingAlgorithm
Algorithm for path selection/calculation between two positions across roads. To be used for distance calculations in road/lane coordinates during runtime.
- Used in:
-
DistanceCondition ,
RelativeDistanceCondition ,
TimeHeadwayCondition ,
TimeToCollisionCondition
| Enumeration Literals |
| |
Name |
Applied Stereotypes |
Description |
| |
assignedRoute |
|
Use the route which has already been assigned to the entity at the start position at the point in time when the distance shall be calculated. |
| |
fastest |
|
Calculate the route with the shortest travelling time between start and target position. |
| |
leastIntersections |
|
Calculate the route with as few junctions as possible between start and target position. |
| |
shortest |
|
Calculate the route with the shortest path between start and target position. |
| |
undefined |
|
It is up to the simulator how to calculate the route between the start and target positions. |
|
| XSD 1.2 Representation |
<xsd:simpleType name="RoutingAlgorithm">
<xsd:union>
<xsd:simpleType>
<xsd:restriction base="xsd:string">
<xsd:enumeration value="assignedRoute"/>
<xsd:enumeration value="fastest"/>
<xsd:enumeration value="leastIntersections"/>
<xsd:enumeration value="shortest"/>
<xsd:enumeration value="undefined"/>
</xsd:restriction>
</xsd:simpleType>
<xsd:simpleType>
<xsd:restriction base="parameter"/>
</xsd:simpleType>
</xsd:union>
</xsd:simpleType>
|
|
| Change log from version 1.1 |
|
|
To XSD
