92 #define DEBUG_COND (isSelected())
94 #define DEBUG_COND2(obj) ((obj != 0 && (obj)->isSelected()))
138 for (
auto p : persons) {
167 if (nextIsMyVehicles()) {
168 if (myI1 != myI1End) {
170 }
else if (myI3 != myI3End) {
184 if (nextIsMyVehicles()) {
185 if (myI1 != myI1End) {
186 return myLane->myVehicles[myI1];
187 }
else if (myI3 != myI3End) {
188 return myLane->myTmpVehicles[myI3];
190 assert(myI2 == myI2End);
194 return myLane->myPartialVehicles[myI2];
201 #ifdef DEBUG_ITERATOR
202 if (
DEBUG_COND2(myLane)) std::cout <<
SIMTIME <<
" AnyVehicleIterator::nextIsMyVehicles lane=" << myLane->getID()
204 <<
" myI1End=" << myI1End
206 <<
" myI2End=" << myI2End
208 <<
" myI3End=" << myI3End
211 if (myI1 == myI1End && myI3 == myI3End) {
212 if (myI2 != myI2End) {
218 if (myI2 == myI2End) {
221 MSVehicle* cand = myI1 == myI1End ? myLane->myTmpVehicles[myI3] : myLane->myVehicles[myI1];
222 #ifdef DEBUG_ITERATOR
224 <<
" veh1=" << cand->
getID()
225 <<
" isTmp=" << (myI1 == myI1End)
226 <<
" veh2=" << myLane->myPartialVehicles[myI2]->getID()
228 <<
" pos2=" << myLane->myPartialVehicles[myI2]->getPositionOnLane(myLane)
231 if (cand->
getPositionOnLane() < myLane->myPartialVehicles[myI2]->getPositionOnLane(myLane)) {
234 return !myDownstream;
248 int index,
bool isRampAccel,
249 const std::string& type,
280 mySimulationTask(*this, 0),
285 assert(
myRNGs.size() > 0);
287 if (outlineShape.size() > 0) {
351 veh->addReminder(rem);
361 #ifdef DEBUG_PARTIALS
363 std::cout <<
SIMTIME <<
" setPartialOccupation. lane=" <<
getID() <<
" veh=" << v->
getID() <<
"\n";
381 #ifdef DEBUG_PARTIALS
383 std::cout <<
SIMTIME <<
" resetPartialOccupation. lane=" <<
getID() <<
" veh=" << v->
getID() <<
"\n";
403 std::cout <<
SIMTIME <<
" setManeuverReservation. lane=" <<
getID() <<
" veh=" << v->
getID() <<
"\n";
414 std::cout <<
SIMTIME <<
" resetManeuverReservation(): lane=" <<
getID() <<
" veh=" << v->
getID() <<
"\n";
459 if (leader ==
nullptr) {
464 leader = leaderInfo.first;
470 if (leader ==
nullptr) {
476 if (leaderBack >= frontGapNeeded) {
477 pos =
MIN2(pos, leaderBack - frontGapNeeded);
499 if (missingRearGap > 0) {
500 if (minPos + missingRearGap <=
myLength) {
507 return isInsertionSuccess(&veh, mspeed, minPos + missingRearGap, posLat,
true, notification);
518 const double speed = leader->
getSpeed();
520 if (leaderPos >= frontGapNeeded) {
530 MSLane::VehCont::iterator predIt =
myVehicles.begin();
541 double speed = mspeed;
542 if (leader !=
nullptr) {
548 if (leader !=
nullptr) {
551 frontMax = leaderRearPos - frontGapNeeded;
559 if (frontMax > minPos && backMin + POSITION_EPS < frontMax) {
561 if (
isInsertionSuccess(&veh, speed, backMin + POSITION_EPS, posLat,
true, notification)) {
602 if (last !=
nullptr) {
654 bool patchSpeed =
true;
671 for (
int i = 0; i < 10; i++) {
726 for (
int i = 0; i < 10; i++) {
753 #ifdef DEBUG_EXTRAPOLATE_DEPARTPOS
762 double dist = speed *
STEPS2TIME(relevantDelay);
764 if (leaderInfo.first !=
nullptr) {
768 dist =
MIN2(dist, leaderInfo.second - frontGapNeeded);
780 if (nspeed < speed) {
782 speed =
MIN2(nspeed, speed);
784 }
else if (speed > 0) {
791 if (emergencyBrakeGap <= dist) {
799 if (errorMsg !=
"") {
800 WRITE_ERRORF(
TL(
"Vehicle '%' will not be able to depart using the given velocity (%)!"), aVehicle->
getID(), errorMsg);
812 double speed,
double pos,
double posLat,
bool patchSpeed,
816 WRITE_WARNINGF(
TL(
"Invalid departPos % given for vehicle '%'. Inserting at lane end instead."),
817 pos, aVehicle->
getID());
821 #ifdef DEBUG_INSERTION
823 std::cout <<
"\nIS_INSERTION_SUCCESS\n"
825 <<
" veh '" << aVehicle->
getID()
828 <<
" speed=" << speed
829 <<
" patchSpeed=" << patchSpeed
838 std::vector<MSLane*>::const_iterator ri = bestLaneConts.begin();
845 #ifdef DEBUG_INSERTION
847 std::cout <<
" bidi-lane occupied\n";
853 MSLink* firstRailSignal =
nullptr;
854 double firstRailSignalDist = -1;
860 if (nextStop.
lane ==
this) {
861 std::stringstream msg;
862 msg <<
"scheduled stop on lane '" <<
myID <<
"' too close";
863 const double distToStop = nextStop.
pars.
endPos - pos;
864 if (
checkFailure(aVehicle, speed, dist,
MAX2(0.0, cfModel.
stopSpeed(aVehicle, speed, distToStop, MSCFModel::CalcReason::FUTURE)),
875 MSLane* currentLane =
this;
878 while ((seen < dist || (isRail && firstRailSignal ==
nullptr)) && ri != bestLaneConts.end()) {
880 std::vector<MSLink*>::const_iterator link =
succLinkSec(*aVehicle, nRouteSuccs, *currentLane, bestLaneConts);
903 if (isRail && firstRailSignal ==
nullptr) {
904 std::string constraintInfo;
905 bool isInsertionOrder;
907 setParameter((isInsertionOrder ?
"insertionOrder" :
"insertionConstraint:")
908 + aVehicle->
getID(), constraintInfo);
909 #ifdef DEBUG_INSERTION
911 std::cout <<
" insertion constraint at link " << (*link)->getDescription() <<
" not cleared \n";
919 if (firstRailSignal ==
nullptr && (*link)->
getTLLogic() !=
nullptr) {
920 firstRailSignal = *link;
921 firstRailSignalDist = seen;
927 bool brakeBeforeSignal = patchSpeed || speed <= vSafe;
929 #ifdef DEBUG_INSERTION
931 std::cout <<
" oncoming rail traffic at link " << (*link)->getDescription() <<
"\n";
939 if (brakeBeforeSignal) {
940 speed =
MIN2(speed, vSafe);
944 cfModel.
getMaxDecel(), 0, posLat,
nullptr,
false, aVehicle)
945 || !(*link)->havePriority()) {
947 std::string errorMsg =
"";
948 const LinkState state = (*link)->getState();
954 errorMsg =
"unpriorised junction too close";
955 }
else if ((*link)->getTLLogic() !=
nullptr && !(*link)->getTLLogic()->getsMajorGreen((*link)->getTLIndex())) {
957 errorMsg =
"tlLogic '" + (*link)->getTLLogic()->getID() +
"' link " +
toString((*link)->getTLIndex()) +
" never switches to 'G'";
969 #ifdef DEBUG_INSERTION
971 std::cout <<
SIMTIME <<
" isInsertionSuccess lane=" <<
getID()
972 <<
" veh=" << aVehicle->
getID()
973 <<
" patchSpeed=" << patchSpeed
974 <<
" speed=" << speed
975 <<
" remaining=" << remaining
979 <<
" failed (@926)!\n";
984 #ifdef DEBUG_INSERTION
986 std::cout <<
"trying insertion before minor link: "
987 <<
"insertion speed = " << speed <<
" dist=" << dist
994 nextLane = (*link)->getViaLaneOrLane();
996 if (nextLane !=
nullptr) {
1009 if (nextStop.
lane == nextLane) {
1010 std::stringstream msg;
1011 msg <<
"scheduled stop on lane '" << nextStop.
lane->
getID() <<
"' too close";
1012 const double distToStop = seen + nextStop.
pars.
endPos;
1025 #ifdef DEBUG_INSERTION
1027 std::cout <<
SIMTIME <<
" leader on lane '" << nextLane->
getID() <<
"': " << leaders.
toString() <<
" nspeed=" << nspeed <<
"\n";
1032 #ifdef DEBUG_INSERTION
1034 std::cout <<
" isInsertionSuccess lane=" <<
getID()
1035 <<
" veh=" << aVehicle->
getID()
1037 <<
" posLat=" << posLat
1038 <<
" patchSpeed=" << patchSpeed
1039 <<
" speed=" << speed
1040 <<
" nspeed=" << nspeed
1041 <<
" nextLane=" << nextLane->
getID()
1043 <<
" failed (@641)!\n";
1053 const double nspeed = cfModel.
freeSpeed(aVehicle, speed, seen, nextLane->
getVehicleMaxSpeed(aVehicle),
true, MSCFModel::CalcReason::FUTURE);
1054 if (nspeed < speed) {
1061 WRITE_WARNINGF(
TL(
"Vehicle '%' is inserted too fast and will violate the speed limit on a lane '%'."),
1065 WRITE_ERRORF(
TL(
"Vehicle '%' will not be able to depart using the given velocity (slow lane ahead)!"), aVehicle->
getID());
1076 if ((*link)->hasApproachingFoe(arrivalTime, leaveTime, speed, cfModel.
getMaxDecel())) {
1084 currentLane = nextLane;
1085 if ((*link)->getViaLane() ==
nullptr) {
1099 #ifdef DEBUG_INSERTION
1101 std::cout <<
SIMTIME <<
" isInsertionSuccess lane=" <<
getID()
1102 <<
" veh=" << aVehicle->
getID()
1104 <<
" posLat=" << posLat
1105 <<
" patchSpeed=" << patchSpeed
1106 <<
" speed=" << speed
1107 <<
" nspeed=" << nspeed
1108 <<
" nextLane=" << nextLane->
getID()
1109 <<
" leaders=" << leaders.
toString()
1110 <<
" failed (@700)!\n";
1115 #ifdef DEBUG_INSERTION
1117 std::cout <<
SIMTIME <<
" speed = " << speed <<
" nspeed = " << nspeed << std::endl;
1122 for (
int i = 0; i < followers.
numSublanes(); ++i) {
1123 const MSVehicle* follower = followers[i].first;
1124 if (follower !=
nullptr) {
1126 if (followers[i].second < backGapNeeded
1130 #ifdef DEBUG_INSERTION
1132 std::cout <<
SIMTIME <<
" isInsertionSuccess lane=" <<
getID()
1133 <<
" veh=" << aVehicle->
getID()
1135 <<
" posLat=" << posLat
1136 <<
" speed=" << speed
1137 <<
" nspeed=" << nspeed
1138 <<
" follower=" << follower->
getID()
1139 <<
" backGapNeeded=" << backGapNeeded
1140 <<
" gap=" << followers[i].second
1141 <<
" failure (@719)!\n";
1154 #ifdef DEBUG_INSERTION
1159 if (shadowLane !=
nullptr) {
1161 for (
int i = 0; i < shadowFollowers.
numSublanes(); ++i) {
1162 const MSVehicle* follower = shadowFollowers[i].first;
1163 if (follower !=
nullptr) {
1165 if (shadowFollowers[i].second < backGapNeeded
1169 #ifdef DEBUG_INSERTION
1172 <<
" isInsertionSuccess shadowlane=" << shadowLane->
getID()
1173 <<
" veh=" << aVehicle->
getID()
1175 <<
" posLat=" << posLat
1176 <<
" speed=" << speed
1177 <<
" nspeed=" << nspeed
1178 <<
" follower=" << follower->
getID()
1179 <<
" backGapNeeded=" << backGapNeeded
1180 <<
" gap=" << shadowFollowers[i].second
1181 <<
" failure (@812)!\n";
1191 if (veh !=
nullptr) {
1198 #ifdef DEBUG_INSERTION
1201 <<
" isInsertionSuccess shadowlane=" << shadowLane->
getID()
1202 <<
" veh=" << aVehicle->
getID()
1204 <<
" posLat=" << posLat
1205 <<
" speed=" << speed
1206 <<
" nspeed=" << nspeed
1207 <<
" leader=" << veh->
getID()
1208 <<
" gapNeeded=" << gapNeeded
1210 <<
" failure (@842)!\n";
1222 if (missingRearGap > 0
1225 #ifdef DEBUG_INSERTION
1228 <<
" isInsertionSuccess lane=" <<
getID()
1229 <<
" veh=" << aVehicle->
getID()
1231 <<
" posLat=" << posLat
1232 <<
" speed=" << speed
1233 <<
" nspeed=" << nspeed
1234 <<
" missingRearGap=" << missingRearGap
1235 <<
" failure (@728)!\n";
1242 speed =
MAX2(0.0, speed);
1246 #ifdef DEBUG_INSERTION
1249 <<
" isInsertionSuccess lane=" <<
getID()
1250 <<
" veh=" << aVehicle->
getID()
1252 <<
" posLat=" << posLat
1253 <<
" speed=" << speed
1254 <<
" nspeed=" << nspeed
1255 <<
" failed (@733)!\n";
1262 if (extraReservation > 0) {
1263 std::stringstream msg;
1264 msg <<
"too many lane changes required on lane '" <<
myID <<
"'";
1267 double stopSpeed = cfModel.
stopSpeed(aVehicle, speed, distToStop, MSCFModel::CalcReason::FUTURE);
1268 #ifdef DEBUG_INSERTION
1270 std::cout <<
"\nIS_INSERTION_SUCCESS\n"
1271 <<
SIMTIME <<
" veh=" << aVehicle->
getID() <<
" bestLaneOffset=" << bestLaneOffset <<
" bestLaneDist=" << aVehicle->
getBestLaneDist() <<
" extraReservation=" << extraReservation
1272 <<
" distToStop=" << distToStop <<
" v=" << speed <<
" v2=" << stopSpeed <<
"\n";
1283 return v->getPositionOnLane() >= pos;
1285 #ifdef DEBUG_INSERTION
1288 <<
" isInsertionSuccess lane=" <<
getID()
1289 <<
" veh=" << aVehicle->
getID()
1291 <<
" posLat=" << posLat
1292 <<
" speed=" << speed
1293 <<
" nspeed=" << nspeed
1297 <<
"\n leaders=" << leaders.
toString()
1321 return v->getPositionOnLane() >= pos;
1328 double nspeed = speed;
1329 #ifdef DEBUG_INSERTION
1331 std::cout <<
SIMTIME <<
" safeInsertionSpeed veh=" << veh->
getID() <<
" speed=" << speed <<
"\n";
1336 if (leader !=
nullptr) {
1343 #ifdef DEBUG_INSERTION
1354 nspeed =
MIN2(nspeed,
1356 #ifdef DEBUG_INSERTION
1358 std::cout <<
" leader=" << leader->
getID() <<
" bPos=" << leader->
getBackPositionOnLane(
this) <<
" gap=" << gap <<
" nspeed=" << nspeed <<
"\n";
1373 int freeSublanes = 1;
1378 while (freeSublanes > 0 && veh !=
nullptr) {
1379 #ifdef DEBUG_PLAN_MOVE
1382 std::cout <<
" getLastVehicleInformation lane=" <<
getID() <<
" minPos=" << minPos <<
" veh=" << veh->
getID() <<
" pos=" << veh->
getPositionOnLane(
this) <<
"\n";
1387 freeSublanes = leaderTmp.
addLeader(veh,
true, vehLatOffset);
1388 #ifdef DEBUG_PLAN_MOVE
1390 std::cout <<
" latOffset=" << vehLatOffset <<
" newLeaders=" << leaderTmp.
toString() <<
"\n";
1396 if (ego ==
nullptr && minPos == 0) {
1404 #ifdef DEBUG_PLAN_MOVE
1433 int freeSublanes = 1;
1435 while (freeSublanes > 0 && veh !=
nullptr) {
1436 #ifdef DEBUG_PLAN_MOVE
1438 std::cout <<
" veh=" << veh->
getID() <<
" pos=" << veh->
getPositionOnLane(
this) <<
" maxPos=" << maxPos <<
"\n";
1445 #ifdef DEBUG_PLAN_MOVE
1447 std::cout <<
" veh=" << veh->
getID() <<
" latOffset=" << vehLatOffset <<
"\n";
1450 freeSublanes = followerTmp.
addLeader(veh,
true, vehLatOffset);
1454 if (ego ==
nullptr && maxPos == std::numeric_limits<double>::max()) {
1459 #ifdef DEBUG_PLAN_MOVE
1482 double cumulatedVehLength = 0.;
1486 VehCont::reverse_iterator veh =
myVehicles.rbegin();
1489 #ifdef DEBUG_PLAN_MOVE
1493 <<
" planMovements() lane=" <<
getID()
1501 #ifdef DEBUG_PLAN_MOVE
1503 std::cout <<
" plan move for: " << (*veh)->getID();
1507 #ifdef DEBUG_PLAN_MOVE
1509 std::cout <<
" leaders=" << leaders.
toString() <<
"\n";
1512 (*veh)->planMove(t, leaders, cumulatedVehLength);
1513 cumulatedVehLength += (*veh)->getVehicleType().getLengthWithGap();
1522 veh->setApproachingForAllLinks(t);
1531 bool nextToConsiderIsPartial;
1534 while (moreReservationsAhead || morePartialVehsAhead) {
1535 if ((!moreReservationsAhead || (*vehRes)->getPositionOnLane(
this) <= veh->
getPositionOnLane())
1536 && (!morePartialVehsAhead || (*vehPart)->getPositionOnLane(
this) <= veh->
getPositionOnLane())) {
1542 if (moreReservationsAhead && !morePartialVehsAhead) {
1543 nextToConsiderIsPartial =
false;
1544 }
else if (morePartialVehsAhead && !moreReservationsAhead) {
1545 nextToConsiderIsPartial =
true;
1547 assert(morePartialVehsAhead && moreReservationsAhead);
1549 nextToConsiderIsPartial = (*vehPart)->getPositionOnLane(
this) > (*vehRes)->getPositionOnLane(
this);
1552 if (nextToConsiderIsPartial) {
1553 const double latOffset = (*vehPart)->getLatOffset(
this);
1554 #ifdef DEBUG_PLAN_MOVE
1556 std::cout <<
" partial ahead: " << (*vehPart)->getID() <<
" latOffset=" << latOffset <<
"\n";
1560 && !(*vehPart)->getLaneChangeModel().isChangingLanes())) {
1561 ahead.
addLeader(*vehPart,
false, latOffset);
1566 const double latOffset = (*vehRes)->getLatOffset(
this);
1567 #ifdef DEBUG_PLAN_MOVE
1569 std::cout <<
" reservation ahead: " << (*vehRes)->getID() <<
" latOffset=" << latOffset <<
"\n";
1572 ahead.
addLeader(*vehRes,
false, latOffset);
1583 #ifdef DEBUG_COLLISIONS
1585 std::vector<const MSVehicle*> all;
1587 all.push_back(*last);
1589 std::cout <<
SIMTIME <<
" detectCollisions stage=" << stage <<
" lane=" <<
getID() <<
":\n"
1592 <<
" all=" <<
toString(all) <<
"\n"
1601 std::set<const MSVehicle*, ComparatorNumericalIdLess> toRemove;
1602 std::set<const MSVehicle*, ComparatorNumericalIdLess> toTeleport;
1605 #ifdef DEBUG_JUNCTION_COLLISIONS
1607 std::cout <<
SIMTIME <<
" detect junction Collisions stage=" << stage <<
" lane=" <<
getID() <<
":\n"
1614 const std::vector<const MSLane*>& foeLanes =
myLinks.front()->getFoeLanes();
1621 for (
const MSLane*
const foeLane : foeLanes) {
1622 #ifdef DEBUG_JUNCTION_COLLISIONS
1624 std::cout <<
" foeLane " << foeLane->getID()
1625 <<
" foeVehs=" <<
toString(foeLane->myVehicles)
1626 <<
" foePart=" <<
toString(foeLane->myPartialVehicles) <<
"\n";
1631 const MSVehicle*
const victim = *it_veh;
1632 if (victim == collider) {
1636 #ifdef DEBUG_JUNCTION_COLLISIONS
1639 <<
" bound=" << colliderBoundary <<
" foeBound=" << victim->
getBoundingBox()
1654 foeLane->handleCollisionBetween(timestep, stage, victim, collider, -1, 0, toRemove, toTeleport);
1663 if (
myLinks.front()->getWalkingAreaFoe() !=
nullptr) {
1666 if (
myLinks.front()->getWalkingAreaFoeExit() !=
nullptr) {
1674 #ifdef DEBUG_PEDESTRIAN_COLLISIONS
1676 std::cout <<
SIMTIME <<
" detect pedestrian collisions stage=" << stage <<
" lane=" <<
getID() <<
"\n";
1690 #ifdef DEBUG_PEDESTRIAN_COLLISIONS
1693 <<
" dist=" << leader.second <<
" jammed=" << leader.first->isJammed() <<
"\n";
1696 if (leader.first != 0 && leader.second < length && !leader.first->isJammed()) {
1701 const double gap = leader.second - length;
1712 VehCont::reverse_iterator lastVeh =
myVehicles.rend() - 1;
1713 for (VehCont::reverse_iterator pred =
myVehicles.rbegin(); pred != lastVeh; ++pred) {
1714 VehCont::reverse_iterator veh = pred + 1;
1725 double high = (*veh)->getPositionOnLane(
this);
1726 double low = (*veh)->getBackPositionOnLane(
this);
1734 if (*veh == *veh2 && !
isRailway((*veh)->getVClass())) {
1737 if ((*veh)->getLane() == (*veh2)->getLane() ||
1738 (*veh)->getLane() == (*veh2)->getBackLane() ||
1739 (*veh)->getBackLane() == (*veh2)->getLane()) {
1743 double low2 =
myLength - (*veh2)->getPositionOnLane(bidiLane);
1744 double high2 =
myLength - (*veh2)->getBackPositionOnLane(bidiLane);
1750 if (!(high < low2 || high2 < low)) {
1751 #ifdef DEBUG_COLLISIONS
1753 std::cout <<
SIMTIME <<
" bidi-collision veh=" << (*veh)->getID() <<
" bidiVeh=" << (*veh2)->getID()
1754 <<
" vehFurther=" <<
toString((*veh)->getFurtherLanes())
1755 <<
" high=" << high <<
" low=" << low <<
" high2=" << high2 <<
" low2=" << low2 <<
"\n";
1784 if (lead == follow) {
1799 for (std::set<const MSVehicle*, ComparatorNumericalIdLess>::iterator it = toRemove.begin(); it != toRemove.end(); ++it) {
1803 if (toTeleport.count(veh) > 0) {
1815 SUMOTime timestep,
const std::string& stage,
1816 std::set<const MSVehicle*, ComparatorNumericalIdLess>& toRemove,
1817 std::set<const MSVehicle*, ComparatorNumericalIdLess>& toTeleport) {
1819 #ifdef DEBUG_PEDESTRIAN_COLLISIONS
1821 std::cout <<
SIMTIME <<
" detect pedestrian junction collisions stage=" << stage <<
" lane=" <<
getID() <<
" foeLane=" << foeLane->
getID() <<
"\n";
1825 for (std::vector<MSTransportable*>::const_iterator it_p = persons.begin(); it_p != persons.end(); ++it_p) {
1826 #ifdef DEBUG_PEDESTRIAN_COLLISIONS
1828 std::cout <<
" collider=" << collider->
getID()
1829 <<
" ped=" << (*it_p)->getID()
1830 <<
" jammed=" << (*it_p)->isJammed()
1831 <<
" colliderBoundary=" << colliderBoundary
1832 <<
" pedBoundary=" << (*it_p)->getBoundingBox()
1836 if ((*it_p)->isJammed()) {
1839 if (colliderBoundary.
overlapsWith((*it_p)->getBoundingBox())
1841 std::string collisionType =
"junctionPedestrian";
1843 collisionType =
"crossing";
1845 collisionType =
"walkingarea";
1856 std::set<const MSVehicle*, ComparatorNumericalIdLess>& toRemove,
1857 std::set<const MSVehicle*, ComparatorNumericalIdLess>& toTeleport)
const {
1864 if (collider == victim) {
1870 const bool bothOpposite = victimOpposite && colliderOpposite;
1886 }
else if (colliderOpposite) {
1890 #ifdef DEBUG_COLLISIONS
1893 <<
" thisLane=" <<
getID()
1894 <<
" collider=" << collider->
getID()
1895 <<
" victim=" << victim->
getID()
1896 <<
" colOpposite=" << colliderOpposite
1897 <<
" vicOpposite=" << victimOpposite
1900 <<
" colPos=" << colliderPos
1901 <<
" vicBack=" << victimBack
1905 <<
" minGapFactor=" << minGapFactor
1914 if (gap < -NUMERICAL_EPS) {
1919 if (latGap + NUMERICAL_EPS > 0) {
1925 double gapDelta = 0;
1926 const MSVehicle* otherLaneVeh = collider->
getLane() ==
this ? victim : collider;
1931 if (&cand->getEdge() == &
getEdge()) {
1932 gapDelta =
getLength() - cand->getLength();
1937 if (gap + gapDelta >= 0) {
1945 && victim->
getLane() !=
this) {
1949 #ifdef DEBUG_COLLISIONS
1951 std::cout <<
SIMTIME <<
" detectedCollision gap=" << gap <<
" latGap=" << latGap <<
"\n";
1963 double gap,
double latGap, std::set<const MSVehicle*, ComparatorNumericalIdLess>& toRemove,
1964 std::set<const MSVehicle*, ComparatorNumericalIdLess>& toTeleport)
const {
1970 ?
"frontal collision"
1971 : (
isInternal() ?
"junction collision" :
"collision"));
1976 std::string prefix =
"Vehicle '" + collider->
getID() +
"'; " + collisionType +
" with vehicle '" + victim->
getID() ;
1981 std::string dummyError;
1987 double victimSpeed = victim->
getSpeed();
1988 double colliderSpeed = collider->
getSpeed();
1991 if (collisionAngle < 45) {
1993 colliderSpeed =
MIN2(colliderSpeed, victimSpeed);
1994 }
else if (collisionAngle < 135) {
2033 prefix =
"Teleporting vehicle '" + collider->
getID() +
"'; " + collisionType +
" with vehicle '" + victim->
getID() ;
2034 toRemove.insert(collider);
2035 toTeleport.insert(collider);
2038 prefix =
"Removing " + collisionType +
" participants: vehicle '" + collider->
getID() +
"', vehicle '" + victim->
getID();
2039 bool removeCollider =
true;
2040 bool removeVictim =
true;
2044 toRemove.insert(victim);
2046 if (removeCollider) {
2047 toRemove.insert(collider);
2049 if (!removeVictim) {
2050 if (!removeCollider) {
2051 prefix =
"Keeping remote-controlled " + collisionType +
" participants: vehicle '" + collider->
getID() +
"', vehicle '" + victim->
getID();
2053 prefix =
"Removing " + collisionType +
" participant: vehicle '" + collider->
getID() +
"', keeping remote-controlled vehicle '" + victim->
getID();
2055 }
else if (!removeCollider) {
2056 prefix =
"Keeping remote-controlled " + collisionType +
" participant: vehicle '" + collider->
getID() +
"', removing vehicle '" + victim->
getID();
2064 if (collisionType ==
"frontal collision") {
2065 collisionType =
"frontal";
2066 }
else if (collisionType ==
"junction collision") {
2067 collisionType =
"junction";
2072 +
"', lane='" +
getID()
2076 +
" stage=" + stage +
".");
2081 #ifdef DEBUG_COLLISIONS
2083 toRemove.erase(collider);
2084 toTeleport.erase(collider);
2087 toRemove.erase(victim);
2088 toTeleport.erase(victim);
2096 double gap,
const std::string& collisionType,
2097 std::set<const MSVehicle*, ComparatorNumericalIdLess>& toRemove,
2098 std::set<const MSVehicle*, ComparatorNumericalIdLess>& toTeleport)
const {
2102 std::string prefix =
TLF(
"Vehicle '%'", collider->
getID());
2107 std::string dummyError;
2112 double colliderSpeed = collider->
getSpeed();
2113 const double victimStopPos = victim->
getEdgePos();
2131 prefix =
TLF(
"Teleporting vehicle '%' after", collider->
getID());
2132 toRemove.insert(collider);
2133 toTeleport.insert(collider);
2136 prefix =
TLF(
"Removing vehicle '%' after", collider->
getID());
2137 bool removeCollider =
true;
2139 if (!removeCollider) {
2140 prefix =
TLF(
"Keeping remote-controlled vehicle '%' after", collider->
getID());
2142 toRemove.insert(collider);
2153 WRITE_WARNING(prefix +
TLF(
" collision with person '%', lane='%', gap=%, time=%, stage=%.",
2156 WRITE_WARNING(prefix +
TLF(
" collision with person '%', lane='%', time=%, stage=%.",
2162 #ifdef DEBUG_COLLISIONS
2164 toRemove.erase(collider);
2165 toTeleport.erase(collider);
2190 #ifdef DEBUG_EXEC_MOVE
2192 std::cout <<
SIMTIME <<
" veh " << veh->
getID() <<
" has arrived." << std::endl;
2197 }
else if (target !=
nullptr && moved) {
2222 WRITE_WARNINGF(
TL(
"Teleporting vehicle '%'; beyond end of lane, target lane='%', time=%."),
2229 WRITE_WARNINGF(
TL(
"Removing vehicle '%' after earlier collision, lane='%', time=%."),
2234 WRITE_WARNINGF(
TL(
"Teleporting vehicle '%' after earlier collision, lane='%', time=%."),
2238 if (firstNotStopped ==
nullptr && !(*i)->
isStopped() && (*i)->getLane() ==
this) {
2239 firstNotStopped = *i;
2245 if (firstNotStopped ==
nullptr && !(*i)->
isStopped() && (*i)->getLane() ==
this) {
2246 firstNotStopped = *i;
2254 i = VehCont::reverse_iterator(
myVehicles.erase(i.base()));
2256 if (firstNotStopped !=
nullptr) {
2260 const bool wrongLane = !
appropriate(firstNotStopped);
2261 const bool r1 = ttt > 0 && firstNotStopped->
getWaitingTime() > ttt;
2266 && firstNotStopped->
succEdge(1) !=
nullptr
2268 const bool r4 = !r1 && !r2 && !r3 && tttb > 0
2270 if (r1 || r2 || r3 || r4) {
2272 const bool minorLink = !wrongLane && (link !=
myLinks.end()) && !((*link)->havePriority());
2273 std::string reason = (wrongLane ?
" (wrong lane" : (minorLink ?
" (yield" :
" (jam"));
2280 reason =
" (blocked";
2282 WRITE_WARNINGF(
"Teleporting vehicle '%'; waited too long" + reason
2283 + (r2 ?
", highway" :
"")
2284 + (r3 ?
", disconnected" :
"")
2285 + (r4 ?
", bidi" :
"")
2289 }
else if (minorLink) {
2342 const MSLane* firstInternal =
this;
2344 while (pred !=
nullptr && pred->
isInternal()) {
2345 firstInternal = pred;
2349 return firstInternal;
2356 const DictType::iterator it =
myDict.lower_bound(
id);
2357 if (it ==
myDict.end() || it->first !=
id) {
2359 myDict.emplace_hint(it,
id, ptr);
2368 const DictType::iterator it =
myDict.find(
id);
2369 if (it ==
myDict.end()) {
2379 for (DictType::iterator i =
myDict.begin(); i !=
myDict.end(); ++i) {
2388 for (DictType::iterator i =
myDict.begin(); i !=
myDict.end(); ++i) {
2389 into.push_back((*i).first);
2394 template<
class RTREE>
void
2396 for (DictType::iterator i =
myDict.begin(); i !=
myDict.end(); ++i) {
2400 const float cmin[2] = {(float) b.
xmin(), (float) b.
ymin()};
2401 const float cmax[2] = {(float) b.
xmax(), (float) b.
ymax()};
2402 into.Insert(cmin, cmax, l);
2406 template void MSLane::fill<NamedRTree>(
NamedRTree& into);
2427 return (link !=
myLinks.end());
2437 assert(veh->getLane() ==
this);
2451 #ifdef DEBUG_VEHICLE_CONTAINER
2469 #ifdef DEBUG_CONTEXT
2471 std::cout <<
"sortManeuverReservations on lane " <<
getID()
2476 #ifdef DEBUG_CONTEXT
2559 std::vector<MSLink*>::const_iterator
2561 const MSLane& succLinkSource,
const std::vector<MSLane*>& conts) {
2564 if (nRouteEdge ==
nullptr) {
2566 return succLinkSource.
myLinks.end();
2570 assert(succLinkSource.
myLinks.size() == 1);
2573 return succLinkSource.
myLinks.begin();
2584 if (nRouteSuccs < (
int)conts.size()) {
2586 for (std::vector<MSLink*>::const_iterator link = succLinkSource.
myLinks.begin(); link != succLinkSource.
myLinks.end(); ++link) {
2587 if ((*link)->getLane() !=
nullptr && (*link)->getLane()->myEdge == nRouteEdge && (*link)->getLane()->allowsVehicleClass(veh.
getVehicleType().
getVehicleClass())) {
2589 if ((*link)->getLane() == conts[nRouteSuccs]) {
2596 return succLinkSource.
myLinks.end();
2599 #ifdef DEBUG_NO_CONNECTION
2601 WRITE_WARNING(
"Could not find connection between lane " + succLinkSource.
getID() +
" and lane " + conts[nRouteSuccs]->getID() +
2604 return succLinkSource.
myLinks.end();
2612 if ((
internal && l->getViaLane() == target) || (!
internal && l->getLane() == target)) {
2623 if (l->getLane() == target) {
2624 return l->getViaLane();
2636 const MSLane*
internal =
this;
2638 assert(lane !=
nullptr);
2642 assert(lane !=
nullptr);
2656 while (first !=
nullptr) {
2697 assert(remVehicle->
getLane() ==
this);
2699 if (remVehicle == *it) {
2734 }
else if (!approachingEdge->
isInternal() && warnMultiCon) {
2737 WRITE_WARNINGF(
TL(
"Lane '%' is approached multiple times from edge '%'. This may cause collisions."),
2746 std::map<MSEdge*, std::vector<MSLane*> >::const_iterator i =
myApproachingLanes.find(edge);
2750 const std::vector<MSLane*>& lanes = (*i).second;
2751 return std::find(lanes.begin(), lanes.end(), lane) != lanes.end();
2762 const MSVehicle* v = followerInfo.first;
2777 return MIN2(maxSpeed * maxSpeed * 0.5 / minDecel,
2782 std::pair<MSVehicle* const, double>
2783 MSLane::getLeader(
const MSVehicle* veh,
const double vehPos,
const std::vector<MSLane*>& bestLaneConts,
double dist,
bool checkTmpVehicles)
const {
2786 #ifdef DEBUG_CONTEXT
2791 if (checkTmpVehicles) {
2798 #ifdef DEBUG_CONTEXT
2800 std::cout << std::setprecision(
gPrecision) <<
" getLeader lane=" <<
getID() <<
" ego=" << veh->
getID() <<
" egoPos=" << vehPos <<
" pred=" << pred->
getID() <<
" predPos=" << pred->
getPositionOnLane() <<
"\n";
2814 #ifdef DEBUG_CONTEXT
2816 std::cout <<
" getLeader lane=" <<
getID() <<
" ego=" << veh->
getID() <<
" egoPos=" << vehPos
2833 if (bestLaneConts.size() > 0) {
2839 #ifdef DEBUG_CONTEXT
2841 std::cout <<
" getLeader lane=" <<
getID() <<
" seen=" << seen <<
" dist=" << dist <<
"\n";
2845 return std::pair<MSVehicle* const, double>(
static_cast<MSVehicle*
>(
nullptr), -1);
2849 return std::make_pair(
static_cast<MSVehicle*
>(
nullptr), -1);
2854 std::pair<MSVehicle* const, double>
2856 const std::vector<MSLane*>& bestLaneConts)
const {
2857 #ifdef DEBUG_CONTEXT
2859 std::cout <<
" getLeaderOnConsecutive lane=" <<
getID() <<
" ego=" << veh.
getID() <<
" seen=" << seen <<
" dist=" << dist <<
" conts=" <<
toString(bestLaneConts) <<
"\n";
2863 return std::make_pair(
static_cast<MSVehicle*
>(
nullptr), -1);
2871 #ifdef DEBUG_CONTEXT
2878 return std::pair<MSVehicle* const, double>(pred, gap);
2881 #ifdef DEBUG_CONTEXT
2886 const MSLane* nextLane =
this;
2890 std::vector<MSLink*>::const_iterator link =
succLinkSec(veh, view, *nextLane, bestLaneConts);
2892 #ifdef DEBUG_CONTEXT
2894 std::cout <<
" cannot continue after nextLane=" << nextLane->
getID() <<
"\n";
2901 const bool laneChanging = veh.
getLane() !=
this;
2904 if (linkLeaders.size() > 0) {
2905 std::pair<MSVehicle*, double> result;
2906 double shortestGap = std::numeric_limits<double>::max();
2907 for (
auto ll : linkLeaders) {
2908 double gap = ll.vehAndGap.second;
2910 if (lVeh !=
nullptr) {
2914 #ifdef DEBUG_CONTEXT
2917 <<
" isLeader=" << veh.
isLeader(*link, lVeh, gap)
2918 <<
" gap=" << ll.vehAndGap.second
2919 <<
" gap+brakeing=" << gap
2924 if (lVeh !=
nullptr && !laneChanging && !veh.
isLeader(*link, lVeh, ll.vehAndGap.second)) {
2927 if (gap < shortestGap) {
2932 ll.vehAndGap.second =
MAX2(seen - nextLane->
getLength(), ll.distToCrossing);
2934 result = ll.vehAndGap;
2937 if (shortestGap != std::numeric_limits<double>::max()) {
2938 #ifdef DEBUG_CONTEXT
2940 std::cout <<
" found linkLeader after nextLane=" << nextLane->
getID() <<
"\n";
2947 bool nextInternal = (*link)->getViaLane() !=
nullptr;
2948 nextLane = (*link)->getViaLaneOrLane();
2949 if (nextLane ==
nullptr) {
2954 if (leader !=
nullptr) {
2955 #ifdef DEBUG_CONTEXT
2957 std::cout <<
" found leader " << leader->
getID() <<
" on nextLane=" << nextLane->
getID() <<
"\n";
2962 return std::make_pair(leader, leaderDist);
2969 if (!nextInternal) {
2972 }
while (seen <= dist || nextLane->
isInternal());
2973 #ifdef DEBUG_CONTEXT
2976 return std::make_pair(
static_cast<MSVehicle*
>(
nullptr), -1);
2980 std::pair<MSVehicle* const, double>
2982 #ifdef DEBUG_CONTEXT
2984 std::cout <<
SIMTIME <<
" getCriticalLeader. lane=" <<
getID() <<
" veh=" << veh.
getID() <<
"\n";
2988 std::pair<MSVehicle*, double> result = std::make_pair(
static_cast<MSVehicle*
>(
nullptr), -1);
2989 double safeSpeed = std::numeric_limits<double>::max();
2994 const MSLane* nextLane =
this;
2998 std::vector<MSLink*>::const_iterator link =
succLinkSec(veh, view, *nextLane, bestLaneConts);
3004 #ifdef DEBUG_CONTEXT
3010 #ifdef DEBUG_CONTEXT
3015 for (MSLink::LinkLeaders::const_iterator it = linkLeaders.begin(); it != linkLeaders.end(); ++it) {
3016 const MSVehicle* leader = (*it).vehAndGap.first;
3017 if (leader !=
nullptr && leader != result.first) {
3021 double tmpSpeed = safeSpeed;
3022 veh.
adaptToJunctionLeader((*it).vehAndGap, seen,
nullptr, nextLane, tmpSpeed, tmpSpeed, (*it).distToCrossing);
3023 #ifdef DEBUG_CONTEXT
3025 std::cout <<
" linkLeader=" << leader->
getID() <<
" gap=" << result.second <<
" tmpSpeed=" << tmpSpeed <<
" safeSpeed=" << safeSpeed <<
"\n";
3028 if (tmpSpeed < safeSpeed) {
3029 safeSpeed = tmpSpeed;
3030 result = (*it).vehAndGap;
3034 bool nextInternal = (*link)->getViaLane() !=
nullptr;
3035 nextLane = (*link)->getViaLaneOrLane();
3036 if (nextLane ==
nullptr) {
3040 if (leader !=
nullptr && leader != result.first) {
3043 if (tmpSpeed < safeSpeed) {
3044 safeSpeed = tmpSpeed;
3045 result = std::make_pair(leader, gap);
3056 if (!nextInternal) {
3059 }
while (seen <= dist || nextLane->
isInternal());
3069 for (MSEdgeVector::iterator i = pred.begin(); i != pred.end();) {
3078 if (pred.size() != 0) {
3080 MSEdge* best = *pred.begin();
3112 if (&(cand.lane->getEdge()) == &fromEdge) {
3137 #ifdef DEBUG_LANE_SORTER
3153 std::vector<MSLink*> candidateLinks =
myLinks;
3156 MSLane* best = (*candidateLinks.begin())->getViaLaneOrLane();
3157 #ifdef DEBUG_LANE_SORTER
3158 std::cout <<
"\nBest successor lane for lane '" <<
myID <<
"': '" << best->
getID() <<
"'" << std::endl;
3168 if (pred ==
nullptr) {
3176 const std::vector<std::pair<const MSLane*, const MSEdge*> >
3178 std::vector<std::pair<const MSLane*, const MSEdge*> > result;
3180 assert(link->getLane() !=
nullptr);
3181 result.push_back(std::make_pair(link->getLane(), link->getViaLane() ==
nullptr ?
nullptr : &link->getViaLane()->getEdge()));
3186 std::vector<const MSLane*>
3188 std::vector<const MSLane*> result = {};
3190 for (std::vector<MSLane*>::const_iterator it_lane = (*it).second.begin(); it_lane != (*it).second.end(); ++it_lane) {
3191 if (!((*it_lane)->isInternal())) {
3192 result.push_back(*it_lane);
3216 for (std::vector<MSLink*>::const_iterator i =
myLinks.begin(); i !=
myLinks.end(); ++i) {
3217 if ((*i)->getLane()->getEdge().isCrossing()) {
3218 return (
int)(i -
myLinks.begin());
3234 if (cand->getLane() == bidi) {
3235 sum += (brutto ? cand->getVehicleType().getLengthWithGap() : cand->getVehicleType().getLength());
3237 sum +=
myLength - cand->getBackPositionOnLane(
this);
3281 wtime += (*i)->getWaitingSeconds();
3296 v += veh->getSpeed();
3318 v += veh->getSpeed();
3337 if (vehs.size() == 0) {
3341 for (MSLane::VehCont::const_iterator i = vehs.begin(); i != vehs.end(); ++i) {
3342 double sv = (*i)->getHarmonoise_NoiseEmissions();
3343 ret += (double) pow(10., (sv / 10.));
3376 myLaneDir(e->getLanes()[0]->
getShape().angleAt2D(0)) {
3387 if (ae1 !=
nullptr && ae1->size() != 0) {
3397 if (ae2 !=
nullptr && ae2->size() != 0) {
3417 myLaneDir(targetLane->
getShape().angleAt2D(0)) {}
3435 #ifdef DEBUG_LANE_SORTER
3436 std::cout <<
"\nincoming_lane_priority sorter()\n"
3437 <<
"noninternal predecessor for lane '" << laneInfo1.
lane->
getID()
3438 <<
"': '" << noninternal1->
getID() <<
"'\n"
3439 <<
"noninternal predecessor for lane '" << laneInfo2.
lane->
getID()
3440 <<
"': '" << noninternal2->
getID() <<
"'\n";
3448 bool priorized1 =
true;
3449 bool priorized2 =
true;
3451 #ifdef DEBUG_LANE_SORTER
3452 std::cout <<
"FoeLinks of '" << noninternal1->
getID() <<
"'" << std::endl;
3455 #ifdef DEBUG_LANE_SORTER
3456 std::cout << foeLink->getLaneBefore()->getID() << std::endl;
3458 if (foeLink == link2) {
3464 #ifdef DEBUG_LANE_SORTER
3465 std::cout <<
"FoeLinks of '" << noninternal2->
getID() <<
"'" << std::endl;
3468 #ifdef DEBUG_LANE_SORTER
3469 std::cout << foeLink->getLaneBefore()->getID() << std::endl;
3472 if (foeLink == link1) {
3480 if (priorized1 != priorized2) {
3494 myLaneDir(sourceLane->
getShape().angleAt2D(0)) {}
3500 if (target2 ==
nullptr) {
3503 if (target1 ==
nullptr) {
3507 #ifdef DEBUG_LANE_SORTER
3508 std::cout <<
"\noutgoing_lane_priority sorter()\n"
3509 <<
"noninternal successors for lane '" << myLane->
getID()
3510 <<
"': '" << target1->
getID() <<
"' and "
3511 <<
"'" << target2->
getID() <<
"'\n";
3518 if (priority1 != priority2) {
3519 return priority1 > priority2;
3545 if (link->getApproaching().size() > 0) {
3554 const bool toRailJunction =
myLinks.size() > 0 && (
3557 const bool hasVehicles =
myVehicles.size() > 0;
3566 if (toRailJunction) {
3568 if (link->getApproaching().size() > 0) {
3571 for (
auto item : link->getApproaching()) {
3581 if (item.second.latOffset != 0) {
3613 for (
const std::string&
id : vehIds) {
3656 bool allSublanes,
double searchDist,
MinorLinkMode mLinkMode)
const {
3663 #ifdef DEBUG_CONTEXT
3665 std::cout <<
SIMTIME <<
" getFollowers lane=" <<
getID() <<
" ego=" << ego->
getID()
3666 <<
" backOffset=" << backOffset <<
" pos=" << egoPos
3667 <<
" allSub=" << allSublanes <<
" searchDist=" << searchDist <<
" ignoreMinor=" << mLinkMode
3668 <<
" egoLatDist=" << egoLatDist
3669 <<
" getOppositeLeaders=" << getOppositeLeaders
3683 #ifdef DEBUG_CONTEXT
3685 std::cout <<
SIMTIME <<
" getFollowers lane=" <<
getID() <<
" ego=" << ego->
getID()
3696 #ifdef DEBUG_CONTEXT
3709 #ifdef DEBUG_CONTEXT
3711 std::cout <<
" (1) added veh=" << veh->
getID() <<
" latOffset=" << latOffset <<
" result=" << result.
toString() <<
"\n";
3716 #ifdef DEBUG_CONTEXT
3718 std::cout <<
" result.numFreeSublanes=" << result.
numFreeSublanes() <<
"\n";
3726 if (searchDist == -1) {
3728 #ifdef DEBUG_CONTEXT
3730 std::cout <<
" computed searchDist=" << searchDist <<
"\n";
3734 std::set<const MSEdge*> egoFurther;
3736 egoFurther.insert(&further->getEdge());
3749 std::vector<MSLane::IncomingLaneInfo> newFound;
3751 while (toExamine.size() != 0) {
3752 for (std::vector<MSLane::IncomingLaneInfo>::iterator it = toExamine.begin(); it != toExamine.end(); ++it) {
3753 MSLane* next = (*it).lane;
3757 #ifdef DEBUG_CONTEXT
3759 std::cout <<
" next=" << next->
getID() <<
" seen=" << (*it).length <<
" first=" << first.
toString() <<
" firstFront=" << firstFront.
toString() <<
" backOffset=" << backOffset <<
"\n";
3763 if (backOffset + (*it).length - next->
getLength() < 0
3764 && egoFurther.count(&next->
getEdge()) != 0
3770 for (
const auto& ll : linkLeaders) {
3771 if (ll.vehAndGap.first !=
nullptr) {
3772 const bool bidiFoe = (*it).viaLink->getLane() == ll.vehAndGap.first->getLane()->getNormalPredecessorLane()->getBidiLane();
3773 const bool egoIsLeader = !bidiFoe && ll.vehAndGap.first->isLeader((*it).viaLink, ego, ll.vehAndGap.second);
3776 const double gap = (egoIsLeader
3777 ? -ll.vehAndGap.second - ll.vehAndGap.first->getVehicleType().getLengthWithGap() - ego->
getVehicleType().
getMinGap()
3780 #ifdef DEBUG_CONTEXT
3782 std::cout <<
SIMTIME <<
" ego=" << ego->
getID() <<
" link=" << (*it).viaLink->getViaLaneOrLane()->getID()
3784 <<
" gap=" << ll.vehAndGap.second <<
" dtC=" << ll.distToCrossing
3785 <<
" bidiFoe=" << bidiFoe
3786 <<
" egoIsLeader=" << egoIsLeader <<
" gap2=" << gap
3793 #ifdef DEBUG_CONTEXT
3800 const MSVehicle* v = first[i] == ego ? firstFront[i] : first[i];
3803 if (v !=
nullptr && v != ego) {
3810 agap = (*it).length - next->
getLength() + backOffset
3813 #ifdef DEBUG_CONTEXT
3815 std::cout <<
" agap1=" << agap <<
"\n";
3821 if (!getOppositeLeaders) {
3826 if (v !=
nullptr && v != ego) {
3839 if (!(*it).viaLink->havePriority() && !ego->
onFurtherEdge(&(*it).lane->getEdge())
3845 agap =
MAX2(agap, 0.0);
3849 #ifdef DEBUG_CONTEXT
3856 if ((*it).length < searchDist) {
3857 const std::vector<MSLane::IncomingLaneInfo>& followers = next->
getIncomingLanes();
3858 for (std::vector<MSLane::IncomingLaneInfo>::const_iterator j = followers.begin(); j != followers.end(); ++j) {
3859 if (visited.find((*j).lane) == visited.end() && (((*j).viaLink->havePriority() && !(*j).viaLink->isTurnaround())
3860 || mLinkMode == MinorLinkMode::FOLLOW_ALWAYS
3861 || (mLinkMode == MinorLinkMode::FOLLOW_ONCOMING && (*j).viaLink->getDirection() ==
LinkDirection::STRAIGHT))) {
3862 visited.insert((*j).lane);
3864 ili.
lane = (*j).lane;
3865 ili.
length = (*j).length + (*it).length;
3867 newFound.push_back(ili);
3873 swap(newFound, toExamine);
3885 bool oppositeDirection)
const {
3899 #ifdef DEBUG_CONTEXT
3904 const MSLane* nextLane =
this;
3909 bool nextInternal =
false;
3910 if (oppositeDirection) {
3911 if (view >= (
int)bestLaneConts.size()) {
3914 nextLane = bestLaneConts[view];
3916 std::vector<MSLink*>::const_iterator link =
succLinkSec(*ego, view, *nextLane, bestLaneConts);
3922 if (linkLeaders.size() > 0) {
3930 #ifdef DEBUG_CONTEXT
3932 std::cout <<
" linkleader=" << veh->
getID() <<
" gap=" << ll.
vehAndGap.second <<
" leaderOffset=" << ll.
latOffset <<
" flags=" << ll.
llFlags <<
"\n";
3943 #ifdef DEBUG_CONTEXT
3949 nextInternal = (*link)->getViaLane() !=
nullptr;
3950 nextLane = (*link)->getViaLaneOrLane();
3951 if (nextLane ==
nullptr) {
3957 #ifdef DEBUG_CONTEXT
3959 std::cout <<
SIMTIME <<
" getLeadersOnConsecutive lane=" <<
getID() <<
" nextLane=" << nextLane->
getID() <<
" leaders=" << leaders.
toString() <<
"\n";
3964 for (
int i = 0; i < iMax; ++i) {
3966 if (veh !=
nullptr) {
3967 #ifdef DEBUG_CONTEXT
3983 if (!nextInternal) {
3987 #ifdef DEBUG_CONTEXT
3997 #ifdef DEBUG_SURROUNDING
3999 std::cout <<
" addLeaders lane=" <<
getID() <<
" veh=" << vehicle->
getID() <<
" vehPos=" << vehPos <<
" opposite=" << opposite <<
"\n";
4003 for (
int i = 0; i < aheadSamePos.
numSublanes(); ++i) {
4005 if (veh !=
nullptr && veh != vehicle) {
4007 #ifdef DEBUG_SURROUNDING
4018 double speed = vehicle->
getSpeed();
4026 #ifdef DEBUG_SURROUNDING
4028 std::cout <<
" aborting forward search. dist=" << dist <<
" seen=" << seen <<
"\n";
4033 #ifdef DEBUG_SURROUNDING
4035 std::cout <<
" add consecutive before=" << result.
toString() <<
" seen=" << seen <<
" dist=" << dist;
4040 #ifdef DEBUG_SURROUNDING
4042 std::cout <<
" upstreamOpposite=" <<
toString(bestLaneConts);
4050 #ifdef DEBUG_SURROUNDING
4052 std::cout <<
" after=" << result.
toString() <<
"\n";
4066 #ifdef DEBUG_CONTEXT
4068 std::cout <<
SIMTIME <<
" getPartialBehind lane=" <<
getID() <<
" ego=" << ego->
getID() <<
" found=" << veh->
getID() <<
"\n";
4074 #ifdef DEBUG_CONTEXT
4097 std::set<MSVehicle*>
4099 assert(checkedLanes !=
nullptr);
4100 if (checkedLanes->find(
this) != checkedLanes->end()) {
4101 #ifdef DEBUG_SURROUNDING
4102 std::cout <<
"Skipping previously scanned lane: " <<
getID() << std::endl;
4104 return std::set<MSVehicle*>();
4107 (*checkedLanes)[
this] = std::make_pair(
MAX2(0.0, startPos - upstreamDist),
MIN2(startPos + downstreamDist,
getLength()));
4109 #ifdef DEBUG_SURROUNDING
4110 std::cout <<
"Scanning on lane " <<
myID <<
"(downstr. " << downstreamDist <<
", upstr. " << upstreamDist <<
", startPos " << startPos <<
"): " << std::endl;
4113 if (startPos < upstreamDist) {
4116 MSLane* incoming = incomingInfo.lane;
4117 #ifdef DEBUG_SURROUNDING
4118 std::cout <<
"Checking on incoming: " << incoming->
getID() << std::endl;
4119 if (checkedLanes->find(incoming) != checkedLanes->end()) {
4120 std::cout <<
"Skipping previous: " << incoming->
getID() << std::endl;
4124 foundVehicles.insert(newVehs.begin(), newVehs.end());
4128 if (
getLength() < startPos + downstreamDist) {
4132 #ifdef DEBUG_SURROUNDING
4133 std::cout <<
"Checking on outgoing: " << l->getViaLaneOrLane()->getID() << std::endl;
4135 std::set<MSVehicle*> newVehs = l->getViaLaneOrLane()->getSurroundingVehicles(0.0, downstreamDist - (
myLength - startPos), upstreamDist, checkedLanes);
4136 foundVehicles.insert(newVehs.begin(), newVehs.end());
4139 #ifdef DEBUG_SURROUNDING
4140 std::cout <<
"On lane (2) " <<
myID <<
": \nFound vehicles: " << std::endl;
4142 std::cout << v->getID() <<
" pos = " << v->getPositionOnLane() << std::endl;
4145 return foundVehicles;
4149 std::set<MSVehicle*>
4151 std::set<MSVehicle*> res;
4154 if (!vehs.empty()) {
4156 if (veh->getPositionOnLane() >= a) {
4157 if (veh->getBackPositionOnLane() > b) {
4169 std::vector<const MSJunction*>
4172 std::vector<const MSJunction*> junctions;
4174 junctions.insert(junctions.end(), l->getJunction());
4180 std::vector<const MSLink*>
4182 #ifdef DEBUG_SURROUNDING
4183 std::cout <<
"getUpcoming links on lane '" <<
getID() <<
"' with pos=" << pos
4184 <<
" range=" << range << std::endl;
4187 std::vector<const MSLink*> links;
4190 const MSLane* lane =
this;
4193 std::vector<MSLane*>::const_iterator contLanesIt = contLanes.begin();
4197 const MSLink* link =
nullptr;
4199 assert(*contLanesIt ==
nullptr);
4201 links.insert(links.end(), link);
4206 assert(*(contLanesIt + 1) == lane);
4208 while (++contLanesIt != contLanes.end()) {
4212 #ifdef DEBUG_SURROUNDING
4213 std::cout <<
"Distance until end of lane '" << lane->
getID() <<
"' is " << dist <<
"." << std::endl;
4219 if (link !=
nullptr) {
4220 links.insert(links.end(), link);
4222 lane = *contLanesIt;
4245 std::pair<MSVehicle* const, double>
4250 #ifdef DEBUG_CONTEXT
4252 std::cout <<
" getFollower lane=" <<
getID() <<
" egoPos=" << egoPos <<
" pred=" << pred->
getID() <<
" predPos=" << pred->
getPositionOnLane(
this) <<
"\n";
4260 if (dist > 0 && backOffset > dist) {
4261 return std::make_pair(
nullptr, -1);
4265 return std::make_pair(
const_cast<MSVehicle*
>(result.first), result.second);
4268 std::pair<MSVehicle* const, double>
4270 #ifdef DEBUG_OPPOSITE
4272 <<
" ego=" << ego->
getID()
4276 <<
" oppositeDir=" << oppositeDir
4284 std::pair<MSVehicle* const, double> result =
getFollower(ego, egoPos + egoLength, dist, mLinkMode);
4285 if (result.first !=
nullptr) {
4287 if (result.first->getLaneChangeModel().isOpposite()) {
4288 result.second -= result.first->getVehicleType().getLength();
4296 std::pair<MSVehicle* const, double>
4298 #ifdef DEBUG_OPPOSITE
4300 <<
" ego=" << ego->
getID()
4310 std::pair<MSVehicle*, double> result =
getLeader(ego, vehPos, std::vector<MSLane*>());
4313 while (result.first ==
nullptr && dist > 0) {
4318 if (next ==
nullptr) {
4322 result = next->
getLeader(ego, vehPos, std::vector<MSLane*>());
4324 if (result.first !=
nullptr) {
4325 if (result.first->getLaneChangeModel().isOpposite()) {
4326 result.second -= result.first->getVehicleType().getLength();
4328 if (result.second > POSITION_EPS) {
4330 return std::make_pair(
static_cast<MSVehicle*
>(
nullptr), -1);
4340 const std::string action = oc.
getString(option);
4341 if (action ==
"none") {
4343 }
else if (action ==
"warn") {
4345 }
else if (action ==
"teleport") {
4347 }
else if (action ==
"remove") {
4428 #ifdef DEBUG_INSERTION
4430 std::cout <<
SIMTIME <<
" check for pedestrians on lane=" <<
getID() <<
" pos=" << pos <<
"\n";
4435 if (leader.first != 0) {
4441 #ifdef DEBUG_INSERTION
4443 <<
" isInsertionSuccess lane=" <<
getID()
4444 <<
" veh=" << aVehicle->
getID()
4447 <<
" patchSpeed=" << patchSpeed
4448 <<
" speed=" << speed
4449 <<
" stopSpeed=" << stopSpeed
4450 <<
" pedestrianLeader=" << leader.first->getID()
4451 <<
" failed (@796)!\n";
4464 const int numRNGs = oc.
getInt(
"thread-rngs");
4465 const bool random = oc.
getBool(
"random");
4466 int seed = oc.
getInt(
"seed");
4468 for (
int i = 0; i < numRNGs; i++) {
4502 myLinks.front()->getFoeLanes().size() > 0
4503 ||
myLinks.front()->getWalkingAreaFoe() !=
nullptr
4504 ||
myLinks.front()->getWalkingAreaFoeExit() !=
nullptr);
4517 foundStopped =
true;
4518 const double lastBrakeGap = last->getCarFollowModel().brakeGap(last->getSpeed());
4519 const double ret = last->getBackPositionOnLane() + lastBrakeGap - lengths;
4523 lengths += last->getVehicleType().getLengthWithGap() * (last->getVehicleType().getWidth() + last->getVehicleType().getMinGapLat()) /
getWidth();
4525 lengths += last->getVehicleType().getLengthWithGap();
std::vector< MSEdge * > MSEdgeVector
std::pair< const MSVehicle *, double > CLeaderDist
std::pair< const MSPerson *, double > PersonDist
ConstMSEdgeVector::const_iterator MSRouteIterator
#define WRITE_WARNINGF(...)
#define WRITE_ERRORF(...)
#define WRITE_WARNING(msg)
SUMOTime string2time(const std::string &r)
convert string to SUMOTime
std::string time2string(SUMOTime t, bool humanReadable)
convert SUMOTime to string (independently of global format setting)
const SVCPermissions SVCAll
all VClasses are allowed
bool isRailway(SVCPermissions permissions)
Returns whether an edge with the given permission is a railway edge.
long long int SVCPermissions
bitset where each bit declares whether a certain SVC may use this edge/lane
@ AIRCRAFT
render as aircraft
SUMOVehicleClass
Definition of vehicle classes to differ between different lane usage and authority types.
@ SVC_SHIP
is an arbitrary ship
@ SVC_RAIL_CLASSES
classes which drive on tracks
@ SVC_BICYCLE
vehicle is a bicycle
const int STOP_DURATION_SET
@ GIVEN
The speed is given.
@ RANDOM
The lateral position is chosen randomly.
@ RIGHT
At the rightmost side of the lane.
@ GIVEN
The position is given.
@ DEFAULT
No information given; use default.
@ LEFT
At the leftmost side of the lane.
@ FREE
A free lateral position is chosen.
@ CENTER
At the center of the lane.
@ RANDOM_FREE
If a fixed number of random choices fails, a free lateral position is chosen.
@ RANDOM
A random position is chosen.
@ GIVEN
The position is given.
@ DEFAULT
No information given; use default.
@ STOP
depart position is endPos of first stop
@ FREE
A free position is chosen.
@ SPLIT_FRONT
depart position for a split vehicle is in front of the continuing vehicle
@ BASE
Back-at-zero position.
@ LAST
Insert behind the last vehicle as close as possible to still allow the specified departSpeed....
@ RANDOM_FREE
If a fixed number of random choices fails, a free position is chosen.
@ RANDOM
The speed is chosen randomly.
@ MAX
The maximum safe speed is used.
@ GIVEN
The speed is given.
@ LIMIT
The maximum lane speed is used (speedLimit)
@ DEFAULT
No information given; use default.
@ DESIRED
The maximum lane speed is used (speedLimit * speedFactor)
@ LAST
The speed of the last vehicle. Fallback to DepartSpeedDefinition::DESIRED if there is no vehicle on t...
@ AVG
The average speed on the lane. Fallback to DepartSpeedDefinition::DESIRED if there is no vehicle on t...
@ SPLIT
The departure is triggered by a train split.
InsertionCheck
different checking levels for vehicle insertion
@ SUMO_TAG_LINK
Link information for state-saving.
@ SUMO_TAG_APPROACHING
Link-approaching vehicle information for state-saving.
@ SUMO_TAG_VIEWSETTINGS_VEHICLES
@ SUMO_TAG_LANE
begin/end of the description of a single lane
@ STRAIGHT
The link is a straight direction.
LinkState
The right-of-way state of a link between two lanes used when constructing a NBTrafficLightLogic,...
@ LINKSTATE_ALLWAY_STOP
This is an uncontrolled, all-way stop link.
@ LINKSTATE_STOP
This is an uncontrolled, minor link, has to stop.
@ LINKSTATE_EQUAL
This is an uncontrolled, right-before-left link.
@ LINKSTATE_DEADEND
This is a dead end link.
@ LINKSTATE_MINOR
This is an uncontrolled, minor link, has to brake.
@ SUMO_ATTR_ARRIVALSPEEDBRAKING
@ SUMO_ATTR_STATE
The state of a link.
int gPrecision
the precision for floating point outputs
double roundDecimal(double x, int precision)
round to the given number of decimal digits
bool gDebugFlag1
global utility flags for debugging
const double SUMO_const_haltingSpeed
the speed threshold at which vehicles are considered as halting
std::string toString(const T &t, std::streamsize accuracy=gPrecision)
A class that stores a 2D geometrical boundary.
double ymin() const
Returns minimum y-coordinate.
double xmin() const
Returns minimum x-coordinate.
Boundary & grow(double by)
extends the boundary by the given amount
double ymax() const
Returns maximum y-coordinate.
double xmax() const
Returns maximum x-coordinate.
static double angleDiff(const double angle1, const double angle2)
Returns the difference of the second angle to the first angle in radiants.
static double sum(double val)
Computes the resulting noise.
MESegment * getSegmentForEdge(const MSEdge &e, double pos=0)
Get the segment for a given edge at a given position.
A single mesoscopic segment (cell)
MESegment * getNextSegment() const
Returns the following segment on the same edge (0 if it is the last).
void setSpeed(double newSpeed, SUMOTime currentTime, double jamThresh=DO_NOT_PATCH_JAM_THRESHOLD, int qIdx=-1)
reset mySpeed and patch the speed of all vehicles in it. Also set/recompute myJamThreshold
Container & getContainer()
bool hasBlueLight() const
MSLane * getShadowLane() const
Returns the lane the vehicle's shadow is on during continuous/sublane lane change.
virtual double getExtraReservation(int) const
reserve extra space for unseen blockers when more tnan one lane change is required
bool isChangingLanes() const
return true if the vehicle currently performs a lane change maneuver
The base class for microscopic and mesoscopic vehicles.
double getImpatience() const
Returns this vehicles impatience.
const MSEdge * succEdge(int nSuccs) const
Returns the nSuccs'th successor of edge the vehicle is currently at.
virtual double getArrivalPos() const
Returns this vehicle's desired arrivalPos for its current route (may change on reroute)
const SUMOVehicleParameter & getParameter() const
Returns the vehicle's parameter (including departure definition)
double getChosenSpeedFactor() const
Returns the precomputed factor by which the driver wants to be faster than the speed limit.
const SUMOVehicleParameter::Stop * getNextStopParameter() const
return parameters for the next stop (SUMOVehicle Interface)
bool isJumping() const
Returns whether the vehicle is perform a jump.
double getLength() const
Returns the vehicle's length.
bool isParking() const
Returns whether the vehicle is parking.
const MSEdge * getEdge() const
Returns the edge the vehicle is currently at.
bool hasDeparted() const
Returns whether this vehicle has already departed.
double basePos(const MSEdge *edge) const
departure position where the vehicle fits fully onto the edge (if possible)
const MSVehicleType & getVehicleType() const
Returns the vehicle's type definition.
bool hasStops() const
Returns whether the vehicle has to stop somewhere.
SUMOVehicleClass getVClass() const
Returns the vehicle's access class.
NumericalID getNumericalID() const
return the numerical ID which is only for internal usage
SUMOTime getDepartDelay() const
Returns the depart delay.
const MSRoute & getRoute() const
Returns the current route.
bool isStopped() const
Returns whether the vehicle is at a stop.
The car-following model abstraction.
double getCollisionMinGapFactor() const
Get the factor of minGap that must be maintained to avoid a collision event.
double getEmergencyDecel() const
Get the vehicle type's maximal phisically possible deceleration [m/s^2].
virtual double freeSpeed(const MSVehicle *const veh, double speed, double seen, double maxSpeed, const bool onInsertion=false, const CalcReason usage=CalcReason::CURRENT) const
Computes the vehicle's safe speed without a leader.
virtual double insertionFollowSpeed(const MSVehicle *const veh, double speed, double gap2pred, double predSpeed, double predMaxDecel, const MSVehicle *const pred=0) const
Computes the vehicle's safe speed (no dawdling) This method is used during the insertion stage....
virtual double getSecureGap(const MSVehicle *const veh, const MSVehicle *const, const double speed, const double leaderSpeed, const double leaderMaxDecel) const
Returns the minimum gap to reserve if the leader is braking at maximum (>=0)
double brakeGap(const double speed) const
Returns the distance the vehicle needs to halt including driver's reaction time tau (i....
double getMaxDecel() const
Get the vehicle type's maximal comfortable deceleration [m/s^2].
double stopSpeed(const MSVehicle *const veh, const double speed, double gap, const CalcReason usage=CalcReason::CURRENT) const
Computes the vehicle's safe speed for approaching a non-moving obstacle (no dawdling)
virtual double insertionStopSpeed(const MSVehicle *const veh, double speed, double gap) const
Computes the vehicle's safe speed for approaching an obstacle at insertion without constraints due to...
std::string toString() const
print a debugging representation
int addFollower(const MSVehicle *veh, const MSVehicle *ego, double gap, double latOffset=0, int sublane=-1)
void gotActive(MSLane *l)
Informs the control that the given lane got active.
void checkCollisionForInactive(MSLane *l)
trigger collision checking for inactive lane
void needsVehicleIntegration(MSLane *const l)
A road/street connecting two junctions.
void changeLanes(SUMOTime t) const
Performs lane changing on this edge.
bool isCrossing() const
return whether this edge is a pedestrian crossing
int getPriority() const
Returns the priority of the edge.
const MSEdgeVector & getPredecessors() const
bool isWalkingArea() const
return whether this edge is walking area
const MSEdge * getNormalSuccessor() const
if this edge is an internal edge, return its first normal successor, otherwise the edge itself
const std::vector< MSLane * > * allowedLanes(const MSEdge &destination, SUMOVehicleClass vclass=SVC_IGNORING, bool ignoreTransientPermissions=false) const
Get the allowed lanes to reach the destination-edge.
const std::set< MSTransportable *, ComparatorNumericalIdLess > & getPersons() const
Returns this edge's persons set.
bool isNormal() const
return whether this edge is an internal edge
std::vector< MSTransportable * > getSortedPersons(SUMOTime timestep, bool includeRiding=false) const
Returns this edge's persons sorted by pos.
const std::vector< MSLane * > & getLanes() const
Returns this edge's lanes.
void recalcCache()
Recalculates the cached values.
bool hasLaneChanger() const
bool isInternal() const
return whether this edge is an internal edge
bool isVaporizing() const
Returns whether vehicles on this edge shall be vaporized.
MSLane * parallelLane(const MSLane *const lane, int offset, bool includeOpposite=true) const
Returns the lane with the given offset parallel to the given lane one or 0 if it does not exist.
const std::string & getEdgeType() const
Returns the type of the edge.
const MSJunction * getToJunction() const
const MSEdge * getBidiEdge() const
return opposite superposable/congruent edge, if it exist and 0 else
static SUMOTime gTimeToTeleportDisconnected
static SUMOTime gTimeToGridlockHighways
static double gGridlockHighwaysSpeed
static bool gRemoveGridlocked
static SUMOTime gTimeToTeleportBidi
static MELoop * gMesoNet
mesoscopic simulation infrastructure
static double gLateralResolution
static bool gClearState
whether the simulation is in the process of clearing state (MSNet::clearState)
static bool gComputeLC
whether the simulationLoop is in the lane changing phase
static bool gEmergencyInsert
static int gNumSimThreads
how many threads to use for simulation
static bool gSublane
whether sublane simulation is enabled (sublane model or continuous lanechanging)
static SUMOTime gLaneChangeDuration
static bool gUnitTests
whether unit tests are being run
static bool gUsingInternalLanes
Information whether the simulation regards internal lanes.
static SUMOTime gTimeToGridlock
void retractDescheduleDeparture(const SUMOVehicle *veh)
reverts a previous call to descheduleDeparture (only needed for departPos="random_free")
void descheduleDeparture(const SUMOVehicle *veh)
stops trying to emit the given vehicle (and delete it)
SumoXMLNodeType getType() const
return the type of this Junction
AnyVehicleIterator is a structure, which manages the iteration through all vehicles on the lane,...
bool nextIsMyVehicles() const
AnyVehicleIterator & operator++()
const MSVehicle * operator*()
void add(const MSLane *const l) const
Adds the given object to the container.
std::set< const Named * > & myObjects
The container.
const PositionVector & myShape
Sorts edges by their angle relative to the given edge (straight comes first)
by_connections_to_sorter(const MSEdge *const e)
constructor
int operator()(const MSEdge *const e1, const MSEdge *const e2) const
comparing operator
Sorts lanes (IncomingLaneInfos) by their priority or, if this doesn't apply, wrt. the angle differenc...
incoming_lane_priority_sorter(const MSLane *targetLane)
constructor
int operator()(const IncomingLaneInfo &lane1, const IncomingLaneInfo &lane2) const
comparing operator
Sorts lanes (their origin link) by the priority of their noninternal target edges or,...
outgoing_lane_priority_sorter(const MSLane *sourceLane)
constructor
int operator()(const MSLink *link1, const MSLink *link2) const
comparing operator
int operator()(MSVehicle *v1, MSVehicle *v2) const
Comparing operator.
Sorts vehicles by their position (descending)
int operator()(MSVehicle *v1, MSVehicle *v2) const
Comparing operator.
Representation of a lane in the micro simulation.
void addApproachingLane(MSLane *lane, bool warnMultiCon)
bool detectCollisionBetween(SUMOTime timestep, const std::string &stage, MSVehicle *collider, MSVehicle *victim, std::set< const MSVehicle *, ComparatorNumericalIdLess > &toRemove, std::set< const MSVehicle *, ComparatorNumericalIdLess > &toTeleport) const
detect whether there is a collision between the two vehicles
static SUMOTime myIntermodalCollisionStopTime
MFXSynchQue< MSVehicle *, std::vector< MSVehicle * > > myVehBuffer
Buffer for vehicles that moved from their previous lane onto this one. Integrated after all vehicles ...
SVCPermissions myPermissions
The vClass permissions for this lane.
MSLane * myLogicalPredecessorLane
static void initCollisionAction(const OptionsCont &oc, const std::string &option, CollisionAction &myAction)
virtual void setJunctionApproaches(const SUMOTime t) const
Register junction approaches for all vehicles after velocities have been planned.
std::set< const MSBaseVehicle * > myParkingVehicles
const std::vector< MSLink * > & getLinkCont() const
returns the container with all links !!!
bool checkForPedestrians(const MSVehicle *aVehicle, double &speed, double &dist, double pos, bool patchSpeed) const
check whether pedestrians on this lane interfere with vehicle insertion
std::pair< MSVehicle *const, double > getFollower(const MSVehicle *ego, double egoPos, double dist, MinorLinkMode mLinkMode) const
Find follower vehicle for the given ego vehicle (which may be on the opposite direction lane)
std::pair< const MSPerson *, double > nextBlocking(double minPos, double minRight, double maxLeft, double stopTime=0, bool bidi=false) const
This is just a wrapper around MSPModel::nextBlocking. You should always check using hasPedestrians be...
MSLane * getParallelLane(int offset, bool includeOpposite=true) const
Returns the lane with the given offset parallel to this one or 0 if it does not exist.
double myRightSideOnEdge
the combined width of all lanes with lower index on myEdge
const StopOffset & getLaneStopOffsets() const
Returns vehicle class specific stopOffsets.
virtual void removeParking(MSBaseVehicle *veh)
remove parking vehicle. This must be syncrhonized when running with GUI
virtual ~MSLane()
Destructor.
bool insertVehicle(MSVehicle &v)
Tries to insert the given vehicle.
const MSLeaderInfo getFirstVehicleInformation(const MSVehicle *ego, double latOffset, bool onlyFrontOnLane, double maxPos=std::numeric_limits< double >::max(), bool allowCached=true) const
analogue to getLastVehicleInformation but in the upstream direction
virtual void integrateNewVehicles()
Insert buffered vehicle into the real lane.
double myLength
Lane length [m].
bool isApproachedFrom(MSEdge *const edge)
double getNettoOccupancy() const
Returns the netto (excluding minGaps) occupancy of this lane during the last step (including minGaps)
virtual MSVehicle * removeVehicle(MSVehicle *remVehicle, MSMoveReminder::Notification notification, bool notify=true)
int getCrossingIndex() const
return the index of the link to the next crossing if this is walkingArea, else -1
PositionVector myShape
The shape of the lane.
PositionVector * myOutlineShape
the outline of the lane (optional)
std::map< long long, SVCPermissions > myPermissionChanges
const std::map< SUMOVehicleClass, double > * myRestrictions
The vClass speed restrictions for this lane.
virtual void incorporateVehicle(MSVehicle *veh, double pos, double speed, double posLat, const MSLane::VehCont::iterator &at, MSMoveReminder::Notification notification=MSMoveReminder::NOTIFICATION_DEPARTED)
Inserts the vehicle into this lane, and informs it about entering the network.
void initRestrictions()
initialized vClass-specific speed limits
std::vector< MSMoveReminder * > myMoveReminders
This lane's move reminder.
bool hasApproaching() const
void addParking(MSBaseVehicle *veh)
add parking vehicle. This should only used during state loading
VehCont myTmpVehicles
Container for lane-changing vehicles. After completion of lane-change- process, the containers will b...
MSLane(const std::string &id, double maxSpeed, double friction, double length, MSEdge *const edge, int numericalID, const PositionVector &shape, double width, SVCPermissions permissions, SVCPermissions changeLeft, SVCPermissions changeRight, int index, bool isRampAccel, const std::string &type, const PositionVector &outlineShape)
Constructor.
double getDepartSpeed(const MSVehicle &veh, bool &patchSpeed)
MSLeaderInfo myFollowerInfo
followers on all sublanes as seen by vehicles on consecutive lanes (cached)
const MSLane * getNormalSuccessorLane() const
get normal lane following this internal lane, for normal lanes, the lane itself is returned
int getVehicleNumber() const
Returns the number of vehicles on this lane (for which this lane is responsible)
static SUMOTime myCollisionStopTime
static CollisionAction myCollisionAction
the action to take on collisions
MSLane * myCanonicalSuccessorLane
Main successor lane,.
SVCPermissions myChangeLeft
The vClass permissions for changing from this lane.
void getLeadersOnConsecutive(double dist, double seen, double speed, const MSVehicle *ego, const std::vector< MSLane * > &bestLaneConts, MSLeaderDistanceInfo &result, bool oppositeDirection=false) const
Returns the immediate leaders and the distance to them (as getLeaderOnConsecutive but for the sublane...
std::vector< IncomingLaneInfo > myIncomingLanes
All direct predecessor lanes.
AnyVehicleIterator anyVehiclesEnd() const
end iterator for iterating over all vehicles touching this lane in downstream direction
static void insertIDs(std::vector< std::string > &into)
Adds the ids of all stored lanes into the given vector.
bool hadPermissionChanges() const
void sortPartialVehicles()
sorts myPartialVehicles
double myFrictionCoefficient
Lane-wide friction coefficient [0..1].
MSVehicle * getFirstAnyVehicle() const
returns the first vehicle that is fully or partially on this lane
const MSLink * getEntryLink() const
Returns the entry link if this is an internal lane, else nullptr.
int getVehicleNumberWithPartials() const
Returns the number of vehicles on this lane (including partial occupators)
static bool myCheckJunctionCollisions
static void clear()
Clears the dictionary.
virtual void resetManeuverReservation(MSVehicle *v)
Unregisters a vehicle, which previously registered for maneuvering into this lane.
SVCPermissions myOriginalPermissions
The original vClass permissions for this lane (before temporary modifications)
MSEdge *const myEdge
The lane's edge, for routing only.
double myNettoVehicleLengthSum
The current length of all vehicles on this lane, excluding their minGaps.
static std::vector< MSLink * >::const_iterator succLinkSec(const SUMOVehicle &veh, int nRouteSuccs, const MSLane &succLinkSource, const std::vector< MSLane * > &conts)
void detectPedestrianJunctionCollision(const MSVehicle *collider, const PositionVector &colliderBoundary, const MSLane *foeLane, SUMOTime timestep, const std::string &stage, std::set< const MSVehicle *, ComparatorNumericalIdLess > &toRemove, std::set< const MSVehicle *, ComparatorNumericalIdLess > &toTeleport)
detect whether a vehicle collids with pedestrians on the junction
double getMissingRearGap(const MSVehicle *leader, double backOffset, double leaderSpeed) const
return by how much further the leader must be inserted to avoid rear end collisions
double myMaxSpeed
Lane-wide speed limit [m/s].
void saveState(OutputDevice &out)
Saves the state of this lane into the given stream.
virtual const VehCont & getVehiclesSecure() const
Returns the vehicles container; locks it for microsimulation.
const MSLink * getLinkTo(const MSLane *const) const
returns the link to the given lane or nullptr, if it is not connected
int myRightmostSublane
the index of the rightmost sublane of this lane on myEdge
void setChangeRight(SVCPermissions permissions)
Sets the permissions for changing to the right neighbour lane.
const bool myIsRampAccel
whether this lane is an acceleration lane
virtual void planMovements(const SUMOTime t)
Compute safe velocities for all vehicles based on positions and speeds from the last time step....
static void saveRNGStates(OutputDevice &out)
save random number generator states to the given output device
SUMOTime myFollowerInfoTime
time step for which myFollowerInfo was last updated
MSLeaderInfo myLeaderInfo
leaders on all sublanes as seen by approaching vehicles (cached)
bool isInsertionSuccess(MSVehicle *vehicle, double speed, double pos, double posLat, bool recheckNextLanes, MSMoveReminder::Notification notification)
Tries to insert the given vehicle with the given state (speed and pos)
void forceVehicleInsertion(MSVehicle *veh, double pos, MSMoveReminder::Notification notification, double posLat=0)
Inserts the given vehicle at the given position.
double getVehicleStopOffset(const MSVehicle *veh) const
Returns vehicle class specific stopOffset for the vehicle.
static void initCollisionOptions(const OptionsCont &oc)
int myNumericalID
Unique numerical ID (set on reading by netload)
VehCont myVehicles
The lane's vehicles. This container holds all vehicles that have their front (longitudinally) and the...
double getSpeedLimit() const
Returns the lane's maximum allowed speed.
MSLeaderInfo getPartialBeyond() const
get all vehicles that are inlapping from consecutive edges
std::vector< MSVehicle * > VehCont
Container for vehicles.
bool checkFailure(const MSVehicle *aVehicle, double &speed, double &dist, const double nspeed, const bool patchSpeed, const std::string errorMsg, InsertionCheck check) const
static DictType myDict
Static dictionary to associate string-ids with objects.
static void fill(RTREE &into)
Fills the given RTree with lane instances.
double safeInsertionSpeed(const MSVehicle *veh, double seen, const MSLeaderInfo &leaders, double speed)
return the maximum safe speed for insertion behind leaders (a negative value indicates that safe inse...
std::vector< const MSJunction * > getUpcomingJunctions(double pos, double range, const std::vector< MSLane * > &contLanes) const
Returns all upcoming junctions within given range along the given (non-internal) continuation lanes m...
void addIncomingLane(MSLane *lane, MSLink *viaLink)
bool isWalkingArea() const
const MSEdge * getNextNormal() const
Returns the lane's follower if it is an internal lane, the edge of the lane otherwise.
void addLink(MSLink *link)
Delayed initialization.
std::set< MSVehicle * > getVehiclesInRange(const double a, const double b) const
Returns all vehicles on the lane overlapping with the interval [a,b].
void enteredByLaneChange(MSVehicle *v)
double getDepartPosLat(const MSVehicle &veh)
std::pair< MSVehicle *const, double > getOppositeLeader(const MSVehicle *ego, double dist, bool oppositeDir, MinorLinkMode mLinkMode=MinorLinkMode::FOLLOW_NEVER) const
SVCPermissions getPermissions() const
Returns the vehicle class permissions for this lane.
LinkState getIncomingLinkState() const
get the state of the link from the logical predecessor to this lane
void updateLengthSum()
updated current vehicle length sum (delayed to avoid lane-order-dependency)
static const long CHANGE_PERMISSIONS_PERMANENT
MSLane * getCanonicalPredecessorLane() const
void resetPermissions(long long transientID)
MSVehicle * getLastFullVehicle() const
returns the last vehicle for which this lane is responsible or 0
static void loadRNGState(int index, const std::string &state)
load random number generator state for the given rng index
const std::string myLaneType
the type of this lane
const std::set< const MSBaseVehicle * > & getParkingVehicles() const
retrieve the parking vehicles (see GUIParkingArea)
VehCont myManeuverReservations
The vehicles which registered maneuvering into the lane within their current action step....
void addLeaders(const MSVehicle *vehicle, double vehPos, MSLeaderDistanceInfo &result, bool oppositeDirection=false)
get leaders for ego on the given lane
static double myCheckJunctionCollisionMinGap
double getLength() const
Returns the lane's length.
double myBruttoVehicleLengthSum
The current length of all vehicles on this lane, including their minGaps.
void setChangeLeft(SVCPermissions permissions)
Sets the permissions for changing to the left neighbour lane.
std::vector< const MSLink * > getUpcomingLinks(double pos, double range, const std::vector< MSLane * > &contLanes) const
Returns all upcoming links within given range along the given (non-internal) continuation lanes measu...
const MSLane * getFirstInternalInConnection(double &offset) const
Returns 0 if the lane is not internal. Otherwise the first part of the connection (sequence of intern...
static int getNumRNGs()
return the number of RNGs
void handleCollisionBetween(SUMOTime timestep, const std::string &stage, const MSVehicle *collider, const MSVehicle *victim, double gap, double latGap, std::set< const MSVehicle *, ComparatorNumericalIdLess > &toRemove, std::set< const MSVehicle *, ComparatorNumericalIdLess > &toTeleport) const
take action upon collision
double getMaximumBrakeDist() const
compute maximum braking distance on this lane
static CollisionAction myIntermodalCollisionAction
const MSLane * getInternalFollowingLane(const MSLane *const) const
returns the internal lane leading to the given lane or nullptr, if there is none
static std::vector< SumoRNG > myRNGs
virtual void swapAfterLaneChange(SUMOTime t)
moves myTmpVehicles int myVehicles after a lane change procedure
std::pair< MSVehicle *const, double > getCriticalLeader(double dist, double seen, double speed, const MSVehicle &veh) const
Returns the most dangerous leader and the distance to him.
StopOffset myLaneStopOffset
const MSLeaderInfo getLastVehicleInformation(const MSVehicle *ego, double latOffset, double minPos=0, bool allowCached=true) const
Returns the last vehicles on the lane.
static void initRNGs(const OptionsCont &oc)
initialize rngs
std::set< MSVehicle * > getSurroundingVehicles(double startPos, double downstreamDist, double upstreamDist, std::shared_ptr< LaneCoverageInfo > checkedLanes) const
Returns all vehicles closer than downstreamDist along the road network starting on the given position...
void clearState()
Remove all vehicles before quick-loading state.
MSLane * myCanonicalPredecessorLane
Similar to LogicalPredecessorLane,.
bool myNeedsCollisionCheck
whether a collision check is currently needed
bool isLinkEnd(std::vector< MSLink * >::const_iterator &i) const
bool allowsVehicleClass(SUMOVehicleClass vclass) const
virtual double setPartialOccupation(MSVehicle *v)
Sets the information about a vehicle lapping into this lane.
double getVehicleMaxSpeed(const SUMOTrafficObject *const veh) const
Returns the lane's maximum speed, given a vehicle's speed limit adaptation.
void setBidiLane(MSLane *bidyLane)
Adds the (overlapping) reverse direction lane to this lane.
double getRightSideOnEdge() const
std::pair< MSVehicle *const, double > getOppositeFollower(const MSVehicle *ego) const
bool mySpeedByTraCI
Whether the current speed limit has been set through TraCI.
bool hasPedestrians() const
whether the lane has pedestrians on it
const std::vector< std::pair< const MSLane *, const MSEdge * > > getOutgoingViaLanes() const
get the list of outgoing lanes
MSVehicle * getPartialBehind(const MSVehicle *ego) const
void setLaneStopOffset(const StopOffset &stopOffset)
Set vehicle class specific stopOffsets.
double myBruttoVehicleLengthSumToRemove
The length of all vehicles that have left this lane in the current step (this lane,...
void leftByLaneChange(MSVehicle *v)
MSLane * getCanonicalSuccessorLane() const
const std::vector< IncomingLaneInfo > & getIncomingLanes() const
std::vector< StopWatch< std::chrono::nanoseconds > > myStopWatch
void setPermissions(SVCPermissions permissions, long long transientID)
Sets the permissions to the given value. If a transientID is given, the permissions are recored as te...
const double myWidth
Lane width [m].
bool lastInsertion(MSVehicle &veh, double mspeed, double posLat, bool patchSpeed)
inserts vehicle as close as possible to the last vehicle on this lane (or at the end of the lane if t...
void changeLanes(const SUMOTime time)
double getOppositePos(double pos) const
return the corresponding position on the opposite lane
SVCPermissions myChangeRight
const double myLengthGeometryFactor
precomputed myShape.length / myLength
virtual void executeMovements(const SUMOTime t)
Executes planned vehicle movements with regards to right-of-way.
MSLane * getLogicalPredecessorLane() const
get the most likely precedecessor lane (sorted using by_connections_to_sorter). The result is cached ...
double getBruttoOccupancy() const
Returns the brutto (including minGaps) occupancy of this lane during the last step.
AnyVehicleIterator anyVehiclesUpstreamEnd() const
end iterator for iterating over all vehicles touching this lane in upstream direction
int myIndex
The lane index.
double getMeanSpeedBike() const
get the mean speed of all bicycles on this lane
void updateLeaderInfo(const MSVehicle *veh, VehCont::reverse_iterator &vehPart, VehCont::reverse_iterator &vehRes, MSLeaderInfo &ahead) const
This updates the MSLeaderInfo argument with respect to the given MSVehicle. All leader-vehicles on th...
double getWaitingSeconds() const
Returns the overall waiting time on this lane.
static bool dictionary(const std::string &id, MSLane *lane)
Static (sic!) container methods {.
virtual void detectCollisions(SUMOTime timestep, const std::string &stage)
Check if vehicles are too close.
std::vector< MSLink * > myLinks
MSVehicle * getLastAnyVehicle() const
returns the last vehicle that is fully or partially on this lane
VehCont myPartialVehicles
The lane's partial vehicles. This container holds all vehicles that are partially on this lane but wh...
void sortManeuverReservations()
sorts myManeuverReservations
MSEdge & getEdge() const
Returns the lane's edge.
MinorLinkMode
determine whether/how getFollowers looks upstream beyond minor links
const PositionVector & getShape() const
Returns this lane's shape.
AnyVehicleIterator anyVehiclesUpstreamBegin() const
begin iterator for iterating over all vehicles touching this lane in upstream direction
std::vector< const MSLane * > getNormalIncomingLanes() const
get the list of all direct (disregarding internal predecessors) non-internal predecessor lanes of thi...
bool mySpeedByVSS
Whether the current speed limit is set by a variable speed sign (VSS)
virtual void resetPartialOccupation(MSVehicle *v)
Removes the information about a vehicle lapping into this lane.
void setOpposite(MSLane *oppositeLane)
Adds a neighbor to this lane.
AnyVehicleIterator anyVehiclesBegin() const
begin iterator for iterating over all vehicles touching this lane in downstream direction
double getHarmonoise_NoiseEmissions() const
Returns the sum of last step noise emissions.
std::pair< MSVehicle *const, double > getLeader(const MSVehicle *veh, const double vehPos, const std::vector< MSLane * > &bestLaneConts, double dist=-1, bool checkTmpVehicles=false) const
Returns the immediate leader of veh and the distance to veh starting on this lane.
void handleIntermodalCollisionBetween(SUMOTime timestep, const std::string &stage, const MSVehicle *collider, const MSTransportable *victim, double gap, const std::string &collisionType, std::set< const MSVehicle *, ComparatorNumericalIdLess > &toRemove, std::set< const MSVehicle *, ComparatorNumericalIdLess > &toTeleport) const
static bool myExtrapolateSubstepDepart
MSLane * getOpposite() const
return the neighboring opposite direction lane for lane changing or nullptr
void setLength(double val)
Sets a new length for the lane (used by TraCI only)
std::map< MSEdge *, std::vector< MSLane * > > myApproachingLanes
All direct internal and direct (disregarding internal predecessors) non-internal predecessor lanes of...
virtual void releaseVehicles() const
Allows to use the container for microsimulation again.
bool mustCheckJunctionCollisions() const
whether this lane must check for junction collisions
virtual void setManeuverReservation(MSVehicle *v)
Registers the lane change intentions (towards this lane) for the given vehicle.
MSLane * getBidiLane() const
retrieve bidirectional lane or nullptr
static double myCollisionMinGapFactor
std::pair< MSVehicle *const, double > getLeaderOnConsecutive(double dist, double seen, double speed, const MSVehicle &veh, const std::vector< MSLane * > &bestLaneConts) const
Returns the immediate leader and the distance to him.
SUMOTime myLeaderInfoTime
time step for which myLeaderInfo was last updated
@ COLLISION_ACTION_TELEPORT
@ COLLISION_ACTION_REMOVE
MSLane * getParallelOpposite() const
return the opposite direction lane of this lanes edge or nullptr
std::map< std::string, MSLane * > DictType
definition of the static dictionary type
double getFractionalVehicleLength(bool brutto) const
return length of fractional vehicles on this lane
double getSpaceTillLastStanding(const MSVehicle *ego, bool &foundStopped) const
return the empty space up to the last standing vehicle or the empty space on the whole lane if no veh...
const MSLane * getNormalPredecessorLane() const
get normal lane leading to this internal lane, for normal lanes, the lane itself is returned
virtual bool appropriate(const MSVehicle *veh) const
MSLeaderDistanceInfo getFollowersOnConsecutive(const MSVehicle *ego, double backOffset, bool allSublanes, double searchDist=-1, MinorLinkMode mLinkMode=FOLLOW_ALWAYS) const
return the sublane followers with the largest missing rear gap among all predecessor lanes (within di...
double getWidth() const
Returns the lane's width.
bool freeInsertion(MSVehicle &veh, double speed, double posLat, MSMoveReminder::Notification notification=MSMoveReminder::NOTIFICATION_DEPARTED)
Tries to insert the given vehicle on any place.
void setMaxSpeed(double val, bool byVSS=false, bool byTraCI=false, double jamThreshold=-1)
Sets a new maximum speed for the lane (used by TraCI and MSCalibrator)
virtual void addMoveReminder(MSMoveReminder *rem)
Add a move-reminder to move-reminder container.
MSVehicle * getFirstFullVehicle() const
returns the first vehicle for which this lane is responsible or 0
double getMeanSpeed() const
Returns the mean speed on this lane.
double myNettoVehicleLengthSumToRemove
The length of all vehicles that have left this lane in the current step (this lane,...
void loadState(const std::vector< std::string > &vehIDs, MSVehicleControl &vc)
Loads the state of this segment with the given parameters.
void setFrictionCoefficient(double val)
Sets a new friction coefficient for the lane [to be later (used by TraCI and MSCalibrator)].
virtual const PositionVector & getShape(bool) const
static CollisionAction getCollisionAction()
saves leader/follower vehicles and their distances relative to an ego vehicle
virtual std::string toString() const
print a debugging representation
CLeaderDist getClosest() const
return vehicle with the smalles gap
virtual int addLeader(const MSVehicle *veh, double gap, double latOffset=0, int sublane=-1)
void setSublaneOffset(int offset)
set number of sublanes by which to shift positions
int numFreeSublanes() const
virtual int addLeader(const MSVehicle *veh, bool beyond, double latOffset=0.)
virtual std::string toString() const
print a debugging representation
int getSublaneOffset() const
LinkState getState() const
Returns the current state of the link.
MSLane * getLane() const
Returns the connected lane.
std::vector< LinkLeader > LinkLeaders
double getInternalLengthsAfter() const
Returns the cumulative length of all internal lanes after this link.
const std::vector< MSLink * > & getFoeLinks() const
const MSTrafficLightLogic * getTLLogic() const
Returns the TLS index.
MSJunction * getJunction() const
Something on a lane to be noticed about vehicle movement.
Notification
Definition of a vehicle state.
@ NOTIFICATION_ARRIVED
The vehicle arrived at its destination (is deleted)
@ NOTIFICATION_TELEPORT_ARRIVED
The vehicle was teleported out of the net.
@ NOTIFICATION_DEPARTED
The vehicle has departed (was inserted into the network)
@ NOTIFICATION_VAPORIZED_VAPORIZER
The vehicle got vaporized with a vaporizer.
@ NOTIFICATION_VAPORIZED_COLLISION
The vehicle got removed by a collision.
@ NOTIFICATION_LOAD_STATE
The vehicle has been loaded from a state file.
@ NOTIFICATION_TELEPORT
The vehicle is being teleported.
The simulated network and simulation perfomer.
@ COLLISION
The vehicle is involved in a collision.
static MSNet * getInstance()
Returns the pointer to the unique instance of MSNet (singleton).
static const std::string STAGE_MOVEMENTS
MSVehicleControl & getVehicleControl()
Returns the vehicle control.
SUMOTime getCurrentTimeStep() const
Returns the current simulation step.
const std::map< SUMOVehicleClass, double > * getRestrictions(const std::string &id) const
Returns the restrictions for an edge type If no restrictions are present, 0 is returned.
MSEdgeControl & getEdgeControl()
Returns the edge control.
MSInsertionControl & getInsertionControl()
Returns the insertion control.
void informVehicleStateListener(const SUMOVehicle *const vehicle, VehicleState to, const std::string &info="")
Informs all added listeners about a vehicle's state change.
bool hasPersons() const
Returns whether persons are simulated.
virtual MSTransportableControl & getPersonControl()
Returns the person control.
bool registerCollision(const SUMOTrafficObject *collider, const SUMOTrafficObject *victim, const std::string &collisionType, const MSLane *lane, double pos)
register collision and return whether it was the first one involving these vehicles
virtual PersonDist nextBlocking(const MSLane *lane, double minPos, double minRight, double maxLeft, double stopTime=0, bool bidi=false)
returns the next pedestrian beyond minPos that is laterally between minRight and maxLeft or 0
virtual bool hasPedestrians(const MSLane *lane)
whether the given lane has pedestrians on it
static bool hasOncomingRailTraffic(MSLink *link, const MSVehicle *ego, bool &brakeBeforeSignal)
static bool hasInsertionConstraint(MSLink *link, const MSVehicle *veh, std::string &info, bool &isInsertionOrder)
const MSEdge * getLastEdge() const
returns the destination edge
MSRouteIterator begin() const
Returns the begin of the list of edges to pass.
const MSLane * lane
The lane to stop at (microsim only)
double getEndPos(const SUMOVehicle &veh) const
return halting position for upcoming stop;
const SUMOVehicleParameter::Stop pars
The stop parameter.
MSPModel * getMovementModel()
Returns the default movement model for this kind of transportables.
virtual double getEdgePos() const
Return the position on the edge.
const MSVehicleType & getVehicleType() const
Returns the object's "vehicle" type.
bool isRemoteAffected(SUMOTime t) const
The class responsible for building and deletion of vehicles.
void registerTeleportYield()
register one non-collision-related teleport
double getMinDeceleration() const
return the minimum deceleration capability for all road vehicles that ever entered the network
SUMOVehicle * getVehicle(const std::string &id) const
Returns the vehicle with the given id.
void registerTeleportJam()
register one non-collision-related teleport
double getMaxSpeedFactor() const
return the maximum speed factor for all vehicles that ever entered the network
double getMinDecelerationRail() const
return the minimum deceleration capability for all ral vehicles that ever entered the network
void scheduleVehicleRemoval(SUMOVehicle *veh, bool checkDuplicate=false)
Removes a vehicle after it has ended.
void registerTeleportWrongLane()
register one non-collision-related teleport
void registerCollision(bool teleport)
registers one collision-related teleport
Representation of a vehicle in the micro simulation.
double getRightSideOnEdge(const MSLane *lane=0) const
Get the vehicle's lateral position on the edge of the given lane (or its current edge if lane == 0)
void updateBestLanes(bool forceRebuild=false, const MSLane *startLane=0)
computes the best lanes to use in order to continue the route
bool isOnRoad() const
Returns the information whether the vehicle is on a road (is simulated)
SUMOTime getLastActionTime() const
Returns the time of the vehicle's last action point.
PositionVector getBoundingPoly(double offset=0) const
get bounding polygon
void setTentativeLaneAndPosition(MSLane *lane, double pos, double posLat=0)
set tentative lane and position during insertion to ensure that all cfmodels work (some of them requi...
const std::vector< MSLane * > & getFurtherLanes() const
void registerInsertionApproach(MSLink *link, double dist)
register approach on insertion
void enterLaneAtInsertion(MSLane *enteredLane, double pos, double speed, double posLat, MSMoveReminder::Notification notification)
Update when the vehicle enters a new lane in the emit step.
SUMOTime getWaitingTime(const bool accumulated=false) const
Returns the SUMOTime waited (speed was lesser than 0.1m/s)
bool isFrontOnLane(const MSLane *lane) const
Returns the information whether the front of the vehicle is on the given lane.
MSAbstractLaneChangeModel & getLaneChangeModel()
double getLeftSideOnLane() const
Get the lateral position of the vehicles left side on the lane:
MSLane * getMutableLane() const
Returns the lane the vehicle is on Non const version indicates that something volatile is going on.
double getActionStepLengthSecs() const
Returns the vehicle's action step length in secs, i.e. the interval between two action points.
const std::vector< MSLane * > getUpstreamOppositeLanes() const
Returns the sequence of opposite lanes corresponding to past lanes.
PositionVector getBoundingBox(double offset=0) const
get bounding rectangle
Position getPosition(const double offset=0) const
Return current position (x/y, cartesian)
const std::vector< MSLane * > & getBestLanesContinuation() const
Returns the best sequence of lanes to continue the route starting at myLane.
bool ignoreCollision() const
whether this vehicle is except from collision checks
void onRemovalFromNet(const MSMoveReminder::Notification reason)
Called when the vehicle is removed from the network.
bool resumeFromStopping()
int getBestLaneOffset() const
void adaptToJunctionLeader(const std::pair< const MSVehicle *, double > leaderInfo, const double seen, DriveProcessItem *const lastLink, const MSLane *const lane, double &v, double &vLinkPass, double distToCrossing=-1) const
double getBackPositionOnLane(const MSLane *lane) const
Get the vehicle's position relative to the given lane.
void resetActionOffset(const SUMOTime timeUntilNextAction=0)
Resets the action offset for the vehicle.
void leaveLane(const MSMoveReminder::Notification reason, const MSLane *approachedLane=0)
Update of members if vehicle leaves a new lane in the lane change step or at arrival.
double getLatOffset(const MSLane *lane) const
Get the offset that that must be added to interpret myState.myPosLat for the given lane.
bool hasArrived() const
Returns whether this vehicle has already arived (reached the arrivalPosition on its final edge)
SUMOTime collisionStopTime() const
Returns the remaining time a vehicle needs to stop due to a collision. A negative value indicates tha...
double getBestLaneDist() const
returns the distance that can be driven without lane change
bool executeMove()
Executes planned vehicle movements with regards to right-of-way.
bool isLeader(const MSLink *link, const MSVehicle *veh, const double gap) const
whether the given vehicle must be followed at the given junction
Influencer & getInfluencer()
bool isBidiOn(const MSLane *lane) const
whether this vehicle is driving against lane
double getRightSideOnLane() const
Get the lateral position of the vehicles right side on the lane:
double getLateralPositionOnLane() const
Get the vehicle's lateral position on the lane.
double getSpeed() const
Returns the vehicle's current speed.
const std::vector< LaneQ > & getBestLanes() const
Returns the description of best lanes to use in order to continue the route.
double processNextStop(double currentVelocity)
Processes stops, returns the velocity needed to reach the stop.
double getPositionOnLane() const
Get the vehicle's position along the lane.
const MSLane * getLane() const
Returns the lane the vehicle is on.
const MSCFModel & getCarFollowModel() const
Returns the vehicle's car following model definition.
bool onFurtherEdge(const MSEdge *edge) const
whether this vehicle has its back (and no its front) on the given edge
double getLateralOverlap() const
return the amount by which the vehicle extends laterally outside it's primary lane
double getAngle() const
Returns the vehicle's direction in radians.
bool hasInfluencer() const
whether the vehicle is individually influenced (via TraCI or special parameters)
double getBrakeGap(bool delayed=false) const
get distance for coming to a stop (used for rerouting checks)
void executeFractionalMove(double dist)
move vehicle forward by the given distance during insertion
double getCenterOnEdge(const MSLane *lane=0) const
Get the vehicle's lateral position on the edge of the given lane (or its current edge if lane == 0)
static MSVehicleTransfer * getInstance()
Returns the instance of this object.
void add(const SUMOTime t, MSVehicle *veh)
Adds a vehicle to this transfer object.
double getLengthWithGap() const
Get vehicle's length including the minimum gap [m].
double getWidth() const
Get the width which vehicles of this class shall have when being drawn.
SUMOVehicleClass getVehicleClass() const
Get this vehicle type's vehicle class.
double getMinGap() const
Get the free space in front of vehicles of this class.
double getLength() const
Get vehicle's length [m].
SUMOVehicleShape getGuiShape() const
Get this vehicle type's shape.
const SUMOVTypeParameter & getParameter() const
Base class for objects which have an id.
std::string myID
The name of the object.
static std::string getIDSecure(const T *obj, const std::string &fallBack="NULL")
get an identifier for Named-like object which may be Null
const std::string & getID() const
Returns the id.
A RT-tree for efficient storing of SUMO's Named objects.
A storage for options typed value containers)
double getFloat(const std::string &name) const
Returns the double-value of the named option (only for Option_Float)
int getInt(const std::string &name) const
Returns the int-value of the named option (only for Option_Integer)
std::string getString(const std::string &name) const
Returns the string-value of the named option (only for Option_String)
bool getBool(const std::string &name) const
Returns the boolean-value of the named option (only for Option_Bool)
Static storage of an output device and its base (abstract) implementation.
OutputDevice & openTag(const std::string &xmlElement)
Opens an XML tag.
OutputDevice & writeAttr(const SumoXMLAttr attr, const T &val)
writes a named attribute
bool closeTag(const std::string &comment="")
Closes the most recently opened tag and optionally adds a comment.
void unsetParameter(const std::string &key)
Removes a parameter.
virtual void setParameter(const std::string &key, const std::string &value)
Sets a parameter.
double distanceTo2D(const Position &p2) const
returns the euclidean distance in the x-y-plane
bool overlapsWith(const AbstractPoly &poly, double offset=0) const
Returns the information whether the given polygon overlaps with this.
double distance2D(const Position &p, bool perpendicular=false) const
closest 2D-distance to point p (or -1 if perpendicular is true and the point is beyond this vector)
Boundary getBoxBoundary() const
Returns a boundary enclosing this list of lines.
double angleAt2D(int pos) const
get angle in certain position of position vector (in radians between -M_PI and M_PI)
static void loadState(const std::string &state, SumoRNG *rng=nullptr)
load rng state from string
static void initRand(SumoRNG *which=nullptr, const bool random=false, const int seed=23423)
Initialises the random number generator with hardware randomness or seed.
static double rand(SumoRNG *rng=nullptr)
Returns a random real number in [0, 1)
static std::string saveState(SumoRNG *rng=nullptr)
save rng state to string
virtual const MSVehicleType & getVehicleType() const =0
Returns the object's "vehicle" type.
SUMOTime getTimeToTeleport(SUMOTime defaultValue) const
return time-to-teleport (either custom or default)
SUMOTime getTimeToTeleportBidi(SUMOTime defaultValue) const
return time-to-teleport.bidi (either custom or default)
Representation of a vehicle.
virtual const MSEdge * succEdge(int nSuccs) const =0
Returns the nSuccs'th successor of edge the vehicle is currently at.
Definition of vehicle stop (position and duration)
std::string lane
The lane to stop at.
std::string split
the id of the vehicle (train portion) that splits of upon reaching this stop
double startPos
The stopping position start.
int parametersSet
Information for the output which parameter were set.
double endPos
The stopping position end.
bool collision
Whether this stop was triggered by a collision.
SUMOTime duration
The stopping duration.
Structure representing possible vehicle parameter.
double departPosLat
(optional) The lateral position the vehicle shall depart from
ArrivalSpeedDefinition arrivalSpeedProcedure
Information how the vehicle's end speed shall be chosen.
double departSpeed
(optional) The initial speed of the vehicle
DepartPosLatDefinition departPosLatProcedure
Information how the vehicle shall choose the lateral departure position.
double departPos
(optional) The position the vehicle shall depart from
DepartSpeedDefinition departSpeedProcedure
Information how the vehicle's initial speed shall be chosen.
double arrivalSpeed
(optional) The final speed of the vehicle (not used yet)
DepartDefinition departProcedure
Information how the vehicle shall choose the depart time.
int insertionChecks
bitset of InsertionCheck
DepartPosDefinition departPosProcedure
Information how the vehicle shall choose the departure position.
A scoped lock which only triggers on condition.
bool isDefined() const
check if stopOffset was defined
SVCPermissions getPermissions() const
get permissions
double getOffset() const
get offset
TRACI_CONST int CMD_GET_VEHICLE_VARIABLE
TRACI_CONST int CMD_GET_EDGE_VARIABLE
TRACI_CONST int CMD_GET_PERSON_VARIABLE
TRACI_CONST int CMD_GET_LANE_VARIABLE
TRACI_CONST int ROUTING_MODE_IGNORE_TRANSIENT_PERMISSIONS
NLOHMANN_BASIC_JSON_TPL_DECLARATION void swap(nlohmann::NLOHMANN_BASIC_JSON_TPL &j1, nlohmann::NLOHMANN_BASIC_JSON_TPL &j2) noexcept(//NOLINT(readability-inconsistent-declaration-parameter-name) is_nothrow_move_constructible< nlohmann::NLOHMANN_BASIC_JSON_TPL >::value &&//NOLINT(misc-redundant-expression) is_nothrow_move_assignable< nlohmann::NLOHMANN_BASIC_JSON_TPL >::value)
exchanges the values of two JSON objects
std::pair< MSVehicle *, double > vehAndGap