93 #define DEBUG_COND (isSelected())
95 #define DEBUG_COND2(obj) ((obj != 0 && (obj)->isSelected()))
139 for (
auto p : persons) {
168 if (nextIsMyVehicles()) {
169 if (myI1 != myI1End) {
171 }
else if (myI3 != myI3End) {
185 if (nextIsMyVehicles()) {
186 if (myI1 != myI1End) {
187 return myLane->myVehicles[myI1];
188 }
else if (myI3 != myI3End) {
189 return myLane->myTmpVehicles[myI3];
191 assert(myI2 == myI2End);
195 return myLane->myPartialVehicles[myI2];
202 #ifdef DEBUG_ITERATOR
203 if (
DEBUG_COND2(myLane)) std::cout <<
SIMTIME <<
" AnyVehicleIterator::nextIsMyVehicles lane=" << myLane->getID()
205 <<
" myI1End=" << myI1End
207 <<
" myI2End=" << myI2End
209 <<
" myI3End=" << myI3End
212 if (myI1 == myI1End && myI3 == myI3End) {
213 if (myI2 != myI2End) {
219 if (myI2 == myI2End) {
222 MSVehicle* cand = myI1 == myI1End ? myLane->myTmpVehicles[myI3] : myLane->myVehicles[myI1];
223 #ifdef DEBUG_ITERATOR
225 <<
" veh1=" << cand->
getID()
226 <<
" isTmp=" << (myI1 == myI1End)
227 <<
" veh2=" << myLane->myPartialVehicles[myI2]->getID()
229 <<
" pos2=" << myLane->myPartialVehicles[myI2]->getPositionOnLane(myLane)
232 if (cand->
getPositionOnLane() < myLane->myPartialVehicles[myI2]->getPositionOnLane(myLane)) {
235 return !myDownstream;
249 int index,
bool isRampAccel,
250 const std::string& type,
282 mySimulationTask(*this, 0),
287 assert(
myRNGs.size() > 0);
289 if (outlineShape.size() > 0) {
353 veh->addReminder(rem);
363 #ifdef DEBUG_PARTIALS
365 std::cout <<
SIMTIME <<
" setPartialOccupation. lane=" <<
getID() <<
" veh=" << v->
getID() <<
"\n";
383 #ifdef DEBUG_PARTIALS
385 std::cout <<
SIMTIME <<
" resetPartialOccupation. lane=" <<
getID() <<
" veh=" << v->
getID() <<
"\n";
405 std::cout <<
SIMTIME <<
" setManeuverReservation. lane=" <<
getID() <<
" veh=" << v->
getID() <<
"\n";
416 std::cout <<
SIMTIME <<
" resetManeuverReservation(): lane=" <<
getID() <<
" veh=" << v->
getID() <<
"\n";
461 if (leader ==
nullptr) {
466 leader = leaderInfo.first;
472 if (leader ==
nullptr) {
478 if (leaderBack >= frontGapNeeded) {
479 pos =
MIN2(pos, leaderBack - frontGapNeeded);
501 if (missingRearGap > 0) {
502 if (minPos + missingRearGap <=
myLength) {
509 return isInsertionSuccess(&veh, mspeed, minPos + missingRearGap, posLat,
true, notification);
520 const double speed = leader->
getSpeed();
522 if (leaderPos >= frontGapNeeded) {
532 MSLane::VehCont::iterator predIt =
myVehicles.begin();
543 double speed = mspeed;
544 if (leader !=
nullptr) {
550 if (leader !=
nullptr) {
553 frontMax = leaderRearPos - frontGapNeeded;
561 if (frontMax > minPos && backMin + POSITION_EPS < frontMax) {
563 if (
isInsertionSuccess(&veh, speed, backMin + POSITION_EPS, posLat,
true, notification)) {
604 if (last !=
nullptr) {
656 bool patchSpeed =
true;
673 for (
int i = 0; i < 10; i++) {
728 for (
int i = 0; i < 10; i++) {
755 #ifdef DEBUG_EXTRAPOLATE_DEPARTPOS
764 double dist = speed *
STEPS2TIME(relevantDelay);
766 if (leaderInfo.first !=
nullptr) {
770 dist =
MIN2(dist, leaderInfo.second - frontGapNeeded);
782 if (nspeed < speed) {
784 speed =
MIN2(nspeed, speed);
786 }
else if (speed > 0) {
793 if (emergencyBrakeGap <= dist) {
801 if (errorMsg !=
"") {
802 WRITE_ERRORF(
TL(
"Vehicle '%' will not be able to depart using the given velocity (%)!"), aVehicle->
getID(), errorMsg);
814 double speed,
double pos,
double posLat,
bool patchSpeed,
818 WRITE_WARNINGF(
TL(
"Invalid departPos % given for vehicle '%'. Inserting at lane end instead."),
819 pos, aVehicle->
getID());
823 #ifdef DEBUG_INSERTION
825 std::cout <<
"\nIS_INSERTION_SUCCESS\n"
827 <<
" veh '" << aVehicle->
getID()
830 <<
" speed=" << speed
831 <<
" patchSpeed=" << patchSpeed
840 std::vector<MSLane*>::const_iterator ri = bestLaneConts.begin();
847 #ifdef DEBUG_INSERTION
849 std::cout <<
" bidi-lane occupied\n";
855 MSLink* firstRailSignal =
nullptr;
856 double firstRailSignalDist = -1;
862 if (nextStop.
lane ==
this) {
863 std::stringstream msg;
864 double distToStop, safeSpeed;
866 msg <<
"scheduled waypoint on lane '" <<
myID <<
"' too close";
868 safeSpeed = cfModel.
freeSpeed(aVehicle, speed, distToStop, nextStop.
pars.
speed,
true, MSCFModel::CalcReason::FUTURE);
870 msg <<
"scheduled stop on lane '" <<
myID <<
"' too close";
872 safeSpeed = cfModel.
stopSpeed(aVehicle, speed, distToStop, MSCFModel::CalcReason::FUTURE);
884 MSLane* currentLane =
this;
887 while ((seen < dist || (isRail && firstRailSignal ==
nullptr)) && ri != bestLaneConts.end()) {
889 std::vector<MSLink*>::const_iterator link =
succLinkSec(*aVehicle, nRouteSuccs, *currentLane, bestLaneConts);
912 if (isRail && firstRailSignal ==
nullptr) {
913 std::string constraintInfo;
914 bool isInsertionOrder;
916 setParameter((isInsertionOrder ?
"insertionOrder" :
"insertionConstraint:")
917 + aVehicle->
getID(), constraintInfo);
918 #ifdef DEBUG_INSERTION
920 std::cout <<
" insertion constraint at link " << (*link)->getDescription() <<
" not cleared \n";
928 if (firstRailSignal ==
nullptr && (*link)->
getTLLogic() !=
nullptr) {
929 firstRailSignal = *link;
930 firstRailSignalDist = seen;
936 bool brakeBeforeSignal = patchSpeed || speed <= vSafe;
938 #ifdef DEBUG_INSERTION
940 std::cout <<
" oncoming rail traffic at link " << (*link)->getDescription() <<
"\n";
948 if (brakeBeforeSignal) {
949 speed =
MIN2(speed, vSafe);
953 cfModel.
getMaxDecel(), 0, posLat,
nullptr,
false, aVehicle)
954 || !(*link)->havePriority()) {
956 std::string errorMsg =
"";
957 const LinkState state = (*link)->getState();
963 errorMsg =
"unpriorised junction too close";
964 }
else if ((*link)->getTLLogic() !=
nullptr && !(*link)->getTLLogic()->getsMajorGreen((*link)->getTLIndex())) {
966 errorMsg =
"tlLogic '" + (*link)->getTLLogic()->getID() +
"' link " +
toString((*link)->getTLIndex()) +
" never switches to 'G'";
970 const double remaining = seen - laneStopOffset;
980 #ifdef DEBUG_INSERTION
982 std::cout <<
SIMTIME <<
" isInsertionSuccess lane=" <<
getID()
983 <<
" veh=" << aVehicle->
getID()
984 <<
" patchSpeed=" << patchSpeed
985 <<
" speed=" << speed
986 <<
" remaining=" << remaining
990 <<
" failed (@926)!\n";
995 #ifdef DEBUG_INSERTION
997 std::cout <<
"trying insertion before minor link: "
998 <<
"insertion speed = " << speed <<
" dist=" << dist
1005 bool dummyReq =
true;
1006 #ifdef DEBUG_INSERTION
1008 std::cout <<
"checking linkLeader for lane '" << nextLane->
getID() <<
"'\n";
1012 aVehicle->
checkLinkLeader(*link, nextLane, seen,
nullptr, speed, tmp, tmp, dummyReq);
1013 #ifdef DEBUG_INSERTION
1018 nextLane = (*link)->getViaLaneOrLane();
1020 if (nextLane !=
nullptr) {
1033 if (nextStop.
lane == nextLane) {
1034 std::stringstream msg;
1035 msg <<
"scheduled stop on lane '" << nextStop.
lane->
getID() <<
"' too close";
1036 const double distToStop = seen + nextStop.
pars.
endPos;
1049 #ifdef DEBUG_INSERTION
1051 std::cout <<
SIMTIME <<
" leader on lane '" << nextLane->
getID() <<
"': " << leaders.
toString() <<
" nspeed=" << nspeed <<
"\n";
1056 #ifdef DEBUG_INSERTION
1058 std::cout <<
" isInsertionSuccess lane=" <<
getID()
1059 <<
" veh=" << aVehicle->
getID()
1061 <<
" posLat=" << posLat
1062 <<
" patchSpeed=" << patchSpeed
1063 <<
" speed=" << speed
1064 <<
" nspeed=" << nspeed
1065 <<
" nextLane=" << nextLane->
getID()
1067 <<
" failed (@641)!\n";
1077 const double nspeed = cfModel.
freeSpeed(aVehicle, speed, seen, nextLane->
getVehicleMaxSpeed(aVehicle),
true, MSCFModel::CalcReason::FUTURE);
1078 if (nspeed < speed) {
1085 WRITE_WARNINGF(
TL(
"Vehicle '%' is inserted too fast and will violate the speed limit on a lane '%'."),
1089 WRITE_ERRORF(
TL(
"Vehicle '%' will not be able to depart using the given velocity (slow lane ahead)!"), aVehicle->
getID());
1100 if ((*link)->hasApproachingFoe(arrivalTime, leaveTime, speed, cfModel.
getMaxDecel())) {
1108 currentLane = nextLane;
1109 if ((*link)->getViaLane() ==
nullptr) {
1123 #ifdef DEBUG_INSERTION
1125 std::cout <<
SIMTIME <<
" isInsertionSuccess lane=" <<
getID()
1126 <<
" veh=" << aVehicle->
getID()
1128 <<
" posLat=" << posLat
1129 <<
" patchSpeed=" << patchSpeed
1130 <<
" speed=" << speed
1131 <<
" nspeed=" << nspeed
1132 <<
" nextLane=" << nextLane->
getID()
1133 <<
" leaders=" << leaders.
toString()
1134 <<
" failed (@700)!\n";
1139 #ifdef DEBUG_INSERTION
1141 std::cout <<
SIMTIME <<
" speed = " << speed <<
" nspeed = " << nspeed << std::endl;
1146 for (
int i = 0; i < followers.
numSublanes(); ++i) {
1147 const MSVehicle* follower = followers[i].first;
1148 if (follower !=
nullptr) {
1150 if (followers[i].second < backGapNeeded
1154 #ifdef DEBUG_INSERTION
1156 std::cout <<
SIMTIME <<
" isInsertionSuccess lane=" <<
getID()
1157 <<
" veh=" << aVehicle->
getID()
1159 <<
" posLat=" << posLat
1160 <<
" speed=" << speed
1161 <<
" nspeed=" << nspeed
1162 <<
" follower=" << follower->
getID()
1163 <<
" backGapNeeded=" << backGapNeeded
1164 <<
" gap=" << followers[i].second
1165 <<
" failure (@719)!\n";
1178 #ifdef DEBUG_INSERTION
1183 if (shadowLane !=
nullptr) {
1185 for (
int i = 0; i < shadowFollowers.
numSublanes(); ++i) {
1186 const MSVehicle* follower = shadowFollowers[i].first;
1187 if (follower !=
nullptr) {
1189 if (shadowFollowers[i].second < backGapNeeded
1193 #ifdef DEBUG_INSERTION
1196 <<
" isInsertionSuccess shadowlane=" << shadowLane->
getID()
1197 <<
" veh=" << aVehicle->
getID()
1199 <<
" posLat=" << posLat
1200 <<
" speed=" << speed
1201 <<
" nspeed=" << nspeed
1202 <<
" follower=" << follower->
getID()
1203 <<
" backGapNeeded=" << backGapNeeded
1204 <<
" gap=" << shadowFollowers[i].second
1205 <<
" failure (@812)!\n";
1215 if (veh !=
nullptr) {
1222 #ifdef DEBUG_INSERTION
1225 <<
" isInsertionSuccess shadowlane=" << shadowLane->
getID()
1226 <<
" veh=" << aVehicle->
getID()
1228 <<
" posLat=" << posLat
1229 <<
" speed=" << speed
1230 <<
" nspeed=" << nspeed
1231 <<
" leader=" << veh->
getID()
1232 <<
" gapNeeded=" << gapNeeded
1234 <<
" failure (@842)!\n";
1246 if (missingRearGap > 0
1249 #ifdef DEBUG_INSERTION
1252 <<
" isInsertionSuccess lane=" <<
getID()
1253 <<
" veh=" << aVehicle->
getID()
1255 <<
" posLat=" << posLat
1256 <<
" speed=" << speed
1257 <<
" nspeed=" << nspeed
1258 <<
" missingRearGap=" << missingRearGap
1259 <<
" failure (@728)!\n";
1266 speed =
MAX2(0.0, speed);
1270 #ifdef DEBUG_INSERTION
1273 <<
" isInsertionSuccess lane=" <<
getID()
1274 <<
" veh=" << aVehicle->
getID()
1276 <<
" posLat=" << posLat
1277 <<
" speed=" << speed
1278 <<
" nspeed=" << nspeed
1279 <<
" failed (@733)!\n";
1286 if (extraReservation > 0) {
1287 std::stringstream msg;
1288 msg <<
"too many lane changes required on lane '" <<
myID <<
"'";
1291 double stopSpeed = cfModel.
stopSpeed(aVehicle, speed, distToStop, MSCFModel::CalcReason::FUTURE);
1292 #ifdef DEBUG_INSERTION
1294 std::cout <<
"\nIS_INSERTION_SUCCESS\n"
1295 <<
SIMTIME <<
" veh=" << aVehicle->
getID() <<
" bestLaneOffset=" << bestLaneOffset <<
" bestLaneDist=" << aVehicle->
getBestLaneDist() <<
" extraReservation=" << extraReservation
1296 <<
" distToStop=" << distToStop <<
" v=" << speed <<
" v2=" << stopSpeed <<
"\n";
1307 return v->getPositionOnLane() >= pos;
1309 #ifdef DEBUG_INSERTION
1312 <<
" isInsertionSuccess lane=" <<
getID()
1313 <<
" veh=" << aVehicle->
getID()
1315 <<
" posLat=" << posLat
1316 <<
" speed=" << speed
1317 <<
" nspeed=" << nspeed
1321 <<
"\n leaders=" << leaders.
toString()
1345 return v->getPositionOnLane() >= pos;
1352 double nspeed = speed;
1353 #ifdef DEBUG_INSERTION
1355 std::cout <<
SIMTIME <<
" safeInsertionSpeed veh=" << veh->
getID() <<
" speed=" << speed <<
"\n";
1360 if (leader !=
nullptr) {
1367 #ifdef DEBUG_INSERTION
1378 nspeed =
MIN2(nspeed,
1380 #ifdef DEBUG_INSERTION
1382 std::cout <<
" leader=" << leader->
getID() <<
" bPos=" << leader->
getBackPositionOnLane(
this) <<
" gap=" << gap <<
" nspeed=" << nspeed <<
"\n";
1397 int freeSublanes = 1;
1402 while (freeSublanes > 0 && veh !=
nullptr) {
1403 #ifdef DEBUG_PLAN_MOVE
1406 std::cout <<
" getLastVehicleInformation lane=" <<
getID() <<
" minPos=" << minPos <<
" veh=" << veh->
getID() <<
" pos=" << veh->
getPositionOnLane(
this) <<
"\n";
1411 freeSublanes = leaderTmp.
addLeader(veh,
true, vehLatOffset);
1412 #ifdef DEBUG_PLAN_MOVE
1414 std::cout <<
" latOffset=" << vehLatOffset <<
" newLeaders=" << leaderTmp.
toString() <<
"\n";
1420 if (ego ==
nullptr && minPos == 0) {
1428 #ifdef DEBUG_PLAN_MOVE
1457 int freeSublanes = 1;
1459 while (freeSublanes > 0 && veh !=
nullptr) {
1460 #ifdef DEBUG_PLAN_MOVE
1462 std::cout <<
" veh=" << veh->
getID() <<
" pos=" << veh->
getPositionOnLane(
this) <<
" maxPos=" << maxPos <<
"\n";
1469 #ifdef DEBUG_PLAN_MOVE
1471 std::cout <<
" veh=" << veh->
getID() <<
" latOffset=" << vehLatOffset <<
"\n";
1474 freeSublanes = followerTmp.
addLeader(veh,
true, vehLatOffset);
1478 if (ego ==
nullptr && maxPos == std::numeric_limits<double>::max()) {
1483 #ifdef DEBUG_PLAN_MOVE
1506 double cumulatedVehLength = 0.;
1510 VehCont::reverse_iterator veh =
myVehicles.rbegin();
1513 #ifdef DEBUG_PLAN_MOVE
1517 <<
" planMovements() lane=" <<
getID()
1525 #ifdef DEBUG_PLAN_MOVE
1527 std::cout <<
" plan move for: " << (*veh)->getID();
1531 #ifdef DEBUG_PLAN_MOVE
1533 std::cout <<
" leaders=" << leaders.
toString() <<
"\n";
1536 (*veh)->planMove(t, leaders, cumulatedVehLength);
1537 cumulatedVehLength += (*veh)->getVehicleType().getLengthWithGap();
1546 veh->setApproachingForAllLinks(t);
1555 bool nextToConsiderIsPartial;
1558 while (moreReservationsAhead || morePartialVehsAhead) {
1559 if ((!moreReservationsAhead || (*vehRes)->getPositionOnLane(
this) <= veh->
getPositionOnLane())
1560 && (!morePartialVehsAhead || (*vehPart)->getPositionOnLane(
this) <= veh->
getPositionOnLane())) {
1566 if (moreReservationsAhead && !morePartialVehsAhead) {
1567 nextToConsiderIsPartial =
false;
1568 }
else if (morePartialVehsAhead && !moreReservationsAhead) {
1569 nextToConsiderIsPartial =
true;
1571 assert(morePartialVehsAhead && moreReservationsAhead);
1573 nextToConsiderIsPartial = (*vehPart)->getPositionOnLane(
this) > (*vehRes)->getPositionOnLane(
this);
1576 if (nextToConsiderIsPartial) {
1577 const double latOffset = (*vehPart)->getLatOffset(
this);
1578 #ifdef DEBUG_PLAN_MOVE
1580 std::cout <<
" partial ahead: " << (*vehPart)->getID() <<
" latOffset=" << latOffset <<
"\n";
1584 && !(*vehPart)->getLaneChangeModel().isChangingLanes())) {
1585 ahead.
addLeader(*vehPart,
false, latOffset);
1590 const double latOffset = (*vehRes)->getLatOffset(
this);
1591 #ifdef DEBUG_PLAN_MOVE
1593 std::cout <<
" reservation ahead: " << (*vehRes)->getID() <<
" latOffset=" << latOffset <<
"\n";
1596 ahead.
addLeader(*vehRes,
false, latOffset);
1607 #ifdef DEBUG_COLLISIONS
1609 std::vector<const MSVehicle*> all;
1611 all.push_back(*last);
1613 std::cout <<
SIMTIME <<
" detectCollisions stage=" << stage <<
" lane=" <<
getID() <<
":\n"
1616 <<
" all=" <<
toString(all) <<
"\n"
1625 std::set<const MSVehicle*, ComparatorNumericalIdLess> toRemove;
1626 std::set<const MSVehicle*, ComparatorNumericalIdLess> toTeleport;
1629 #ifdef DEBUG_JUNCTION_COLLISIONS
1631 std::cout <<
SIMTIME <<
" detect junction Collisions stage=" << stage <<
" lane=" <<
getID() <<
":\n"
1638 const std::vector<const MSLane*>& foeLanes =
myLinks.front()->getFoeLanes();
1645 for (
const MSLane*
const foeLane : foeLanes) {
1646 #ifdef DEBUG_JUNCTION_COLLISIONS
1648 std::cout <<
" foeLane " << foeLane->getID()
1649 <<
" foeVehs=" <<
toString(foeLane->myVehicles)
1650 <<
" foePart=" <<
toString(foeLane->myPartialVehicles) <<
"\n";
1655 const MSVehicle*
const victim = *it_veh;
1656 if (victim == collider) {
1660 #ifdef DEBUG_JUNCTION_COLLISIONS
1663 <<
" bound=" << colliderBoundary <<
" foeBound=" << victim->
getBoundingBox()
1678 foeLane->handleCollisionBetween(timestep, stage, victim, collider, -1, 0, toRemove, toTeleport);
1687 if (
myLinks.front()->getWalkingAreaFoe() !=
nullptr) {
1690 if (
myLinks.front()->getWalkingAreaFoeExit() !=
nullptr) {
1698 #ifdef DEBUG_PEDESTRIAN_COLLISIONS
1700 std::cout <<
SIMTIME <<
" detect pedestrian collisions stage=" << stage <<
" lane=" <<
getID() <<
"\n";
1714 #ifdef DEBUG_PEDESTRIAN_COLLISIONS
1717 <<
" dist=" << leader.second <<
" jammed=" << leader.first->isJammed() <<
"\n";
1720 if (leader.first != 0 && leader.second < length && !leader.first->isJammed()) {
1725 const double gap = leader.second - length;
1736 VehCont::reverse_iterator lastVeh =
myVehicles.rend() - 1;
1737 for (VehCont::reverse_iterator pred =
myVehicles.rbegin(); pred != lastVeh; ++pred) {
1738 VehCont::reverse_iterator veh = pred + 1;
1749 double high = (*veh)->getPositionOnLane(
this);
1750 double low = (*veh)->getBackPositionOnLane(
this);
1758 if (*veh == *veh2 && !
isRailway((*veh)->getVClass())) {
1761 if ((*veh)->getLane() == (*veh2)->getLane() ||
1762 (*veh)->getLane() == (*veh2)->getBackLane() ||
1763 (*veh)->getBackLane() == (*veh2)->getLane()) {
1767 double low2 =
myLength - (*veh2)->getPositionOnLane(bidiLane);
1768 double high2 =
myLength - (*veh2)->getBackPositionOnLane(bidiLane);
1774 if (!(high < low2 || high2 < low)) {
1775 #ifdef DEBUG_COLLISIONS
1777 std::cout <<
SIMTIME <<
" bidi-collision veh=" << (*veh)->getID() <<
" bidiVeh=" << (*veh2)->getID()
1778 <<
" vehFurther=" <<
toString((*veh)->getFurtherLanes())
1779 <<
" high=" << high <<
" low=" << low <<
" high2=" << high2 <<
" low2=" << low2 <<
"\n";
1808 if (lead == follow) {
1823 for (std::set<const MSVehicle*, ComparatorNumericalIdLess>::iterator it = toRemove.begin(); it != toRemove.end(); ++it) {
1827 if (toTeleport.count(veh) > 0) {
1839 SUMOTime timestep,
const std::string& stage,
1840 std::set<const MSVehicle*, ComparatorNumericalIdLess>& toRemove,
1841 std::set<const MSVehicle*, ComparatorNumericalIdLess>& toTeleport) {
1843 #ifdef DEBUG_PEDESTRIAN_COLLISIONS
1845 std::cout <<
SIMTIME <<
" detect pedestrian junction collisions stage=" << stage <<
" lane=" <<
getID() <<
" foeLane=" << foeLane->
getID() <<
"\n";
1849 for (std::vector<MSTransportable*>::const_iterator it_p = persons.begin(); it_p != persons.end(); ++it_p) {
1850 #ifdef DEBUG_PEDESTRIAN_COLLISIONS
1852 std::cout <<
" collider=" << collider->
getID()
1853 <<
" ped=" << (*it_p)->getID()
1854 <<
" jammed=" << (*it_p)->isJammed()
1855 <<
" colliderBoundary=" << colliderBoundary
1856 <<
" pedBoundary=" << (*it_p)->getBoundingBox()
1860 if ((*it_p)->isJammed()) {
1863 if (colliderBoundary.
overlapsWith((*it_p)->getBoundingBox())
1865 std::string collisionType =
"junctionPedestrian";
1867 collisionType =
"crossing";
1869 collisionType =
"walkingarea";
1880 std::set<const MSVehicle*, ComparatorNumericalIdLess>& toRemove,
1881 std::set<const MSVehicle*, ComparatorNumericalIdLess>& toTeleport)
const {
1888 if (collider == victim) {
1894 const bool bothOpposite = victimOpposite && colliderOpposite;
1910 }
else if (colliderOpposite) {
1914 #ifdef DEBUG_COLLISIONS
1917 <<
" thisLane=" <<
getID()
1918 <<
" collider=" << collider->
getID()
1919 <<
" victim=" << victim->
getID()
1920 <<
" colOpposite=" << colliderOpposite
1921 <<
" vicOpposite=" << victimOpposite
1924 <<
" colPos=" << colliderPos
1925 <<
" vicBack=" << victimBack
1929 <<
" minGapFactor=" << minGapFactor
1938 if (gap < -NUMERICAL_EPS) {
1943 if (latGap + NUMERICAL_EPS > 0) {
1949 double gapDelta = 0;
1950 const MSVehicle* otherLaneVeh = collider->
getLane() ==
this ? victim : collider;
1955 if (&cand->getEdge() == &
getEdge()) {
1956 gapDelta =
getLength() - cand->getLength();
1961 if (gap + gapDelta >= 0) {
1969 && victim->
getLane() !=
this) {
1973 #ifdef DEBUG_COLLISIONS
1975 std::cout <<
SIMTIME <<
" detectedCollision gap=" << gap <<
" latGap=" << latGap <<
"\n";
1987 double gap,
double latGap, std::set<const MSVehicle*, ComparatorNumericalIdLess>& toRemove,
1988 std::set<const MSVehicle*, ComparatorNumericalIdLess>& toTeleport)
const {
1994 ?
"frontal" : (
isInternal() ?
"junction" :
"collision"));
1995 const std::string collisionText = collisionType ==
"frontal" ?
TL(
"frontal collision") :
1996 (collisionType ==
"junction" ?
TL(
"junction collision") :
TL(
"collision"));
2002 std::string prefix =
TLF(
"Vehicle '%'; % with vehicle '%", collider->
getID(), collisionText, victim->
getID());
2007 std::string dummyError;
2013 double victimSpeed = victim->
getSpeed();
2014 double colliderSpeed = collider->
getSpeed();
2017 if (collisionAngle < 45) {
2019 colliderSpeed =
MIN2(colliderSpeed, victimSpeed);
2020 }
else if (collisionAngle < 135) {
2059 prefix =
TLF(
"Teleporting vehicle '%'; % with vehicle '%", collider->
getID(), collisionText, victim->
getID());
2060 toRemove.insert(collider);
2061 toTeleport.insert(collider);
2064 prefix =
TLF(
"Removing % participants: vehicle '%', vehicle '%", collisionText, collider->
getID(), victim->
getID());
2065 bool removeCollider =
true;
2066 bool removeVictim =
true;
2070 toRemove.insert(victim);
2072 if (removeCollider) {
2073 toRemove.insert(collider);
2075 if (!removeVictim) {
2076 if (!removeCollider) {
2077 prefix =
TLF(
"Keeping remote-controlled % participants: vehicle '%', vehicle '%", collisionText, collider->
getID(), victim->
getID());
2079 prefix =
TLF(
"Removing % participant: vehicle '%', keeping remote-controlled vehicle '%", collisionText, collider->
getID(), victim->
getID());
2081 }
else if (!removeCollider) {
2082 prefix =
TLF(
"Keeping remote-controlled % participant: vehicle '%', removing vehicle '%", collisionText, collider->
getID(), victim->
getID());
2099 #ifdef DEBUG_COLLISIONS
2101 toRemove.erase(collider);
2102 toTeleport.erase(collider);
2105 toRemove.erase(victim);
2106 toTeleport.erase(victim);
2114 double gap,
const std::string& collisionType,
2115 std::set<const MSVehicle*, ComparatorNumericalIdLess>& toRemove,
2116 std::set<const MSVehicle*, ComparatorNumericalIdLess>& toTeleport)
const {
2120 std::string prefix =
TLF(
"Vehicle '%'", collider->
getID());
2125 std::string dummyError;
2130 double colliderSpeed = collider->
getSpeed();
2131 const double victimStopPos = victim->
getEdgePos();
2149 prefix =
TLF(
"Teleporting vehicle '%' after", collider->
getID());
2150 toRemove.insert(collider);
2151 toTeleport.insert(collider);
2154 prefix =
TLF(
"Removing vehicle '%' after", collider->
getID());
2155 bool removeCollider =
true;
2157 if (!removeCollider) {
2158 prefix =
TLF(
"Keeping remote-controlled vehicle '%' after", collider->
getID());
2160 toRemove.insert(collider);
2171 WRITE_WARNING(prefix +
TLF(
" collision with person '%', lane='%', gap=%, time=%, stage=%.",
2174 WRITE_WARNING(prefix +
TLF(
" collision with person '%', lane='%', time=%, stage=%.",
2180 #ifdef DEBUG_COLLISIONS
2182 toRemove.erase(collider);
2183 toTeleport.erase(collider);
2208 #ifdef DEBUG_EXEC_MOVE
2210 std::cout <<
SIMTIME <<
" veh " << veh->
getID() <<
" has arrived." << std::endl;
2215 }
else if (target !=
nullptr && moved) {
2235 WRITE_WARNINGF(
TL(
"Removing vehicle '%' after breaking down, lane='%', time=%."),
2246 WRITE_WARNINGF(
TL(
"Teleporting vehicle '%'; beyond end of lane, target lane='%', time=%."),
2254 WRITE_WARNINGF(
TL(
"Removing vehicle '%' after earlier collision, lane='%', time=%."),
2259 WRITE_WARNINGF(
TL(
"Teleporting vehicle '%' after earlier collision, lane='%', time=%."),
2263 if (firstNotStopped ==
nullptr && !(*i)->
isStopped() && (*i)->getLane() ==
this) {
2264 firstNotStopped = *i;
2270 if (firstNotStopped ==
nullptr && !(*i)->
isStopped() && (*i)->getLane() ==
this) {
2271 firstNotStopped = *i;
2279 i = VehCont::reverse_iterator(
myVehicles.erase(i.base()));
2281 if (firstNotStopped !=
nullptr) {
2285 const bool wrongLane = !
appropriate(firstNotStopped);
2287 && firstNotStopped->
succEdge(1) !=
nullptr
2290 const bool r1 = ttt > 0 && firstNotStopped->
getWaitingTime() > ttt && !disconnected;
2296 const bool r4 = !r1 && !r2 && !r3 && tttb > 0
2298 if (r1 || r2 || r3 || r4) {
2300 const bool minorLink = !wrongLane && (link !=
myLinks.end()) && !((*link)->havePriority());
2301 std::string reason = (wrongLane ?
" (wrong lane" : (minorLink ?
" (yield" :
" (jam"));
2308 reason =
" (blocked";
2310 WRITE_WARNINGF(
"Teleporting vehicle '%'; waited too long" + reason
2311 + (r2 ?
", highway" :
"")
2312 + (r3 ?
", disconnected" :
"")
2313 + (r4 ?
", bidi" :
"")
2317 }
else if (minorLink) {
2382 const MSLane* firstInternal =
this;
2384 while (pred !=
nullptr && pred->
isInternal()) {
2385 firstInternal = pred;
2389 return firstInternal;
2396 const DictType::iterator it =
myDict.lower_bound(
id);
2397 if (it ==
myDict.end() || it->first !=
id) {
2399 myDict.emplace_hint(it,
id, ptr);
2408 const DictType::iterator it =
myDict.find(
id);
2409 if (it ==
myDict.end()) {
2419 for (DictType::iterator i =
myDict.begin(); i !=
myDict.end(); ++i) {
2428 for (DictType::iterator i =
myDict.begin(); i !=
myDict.end(); ++i) {
2429 into.push_back((*i).first);
2434 template<
class RTREE>
void
2436 for (DictType::iterator i =
myDict.begin(); i !=
myDict.end(); ++i) {
2440 const float cmin[2] = {(float) b.
xmin(), (float) b.
ymin()};
2441 const float cmax[2] = {(float) b.
xmax(), (float) b.
ymax()};
2442 into.Insert(cmin, cmax, l);
2446 template void MSLane::fill<NamedRTree>(
NamedRTree& into);
2467 return (link !=
myLinks.end());
2477 assert(veh->getLane() ==
this);
2491 #ifdef DEBUG_VEHICLE_CONTAINER
2509 #ifdef DEBUG_CONTEXT
2511 std::cout <<
"sortManeuverReservations on lane " <<
getID()
2516 #ifdef DEBUG_CONTEXT
2599 std::vector<MSLink*>::const_iterator
2601 const MSLane& succLinkSource,
const std::vector<MSLane*>& conts) {
2604 if (nRouteEdge ==
nullptr) {
2606 return succLinkSource.
myLinks.end();
2610 assert(succLinkSource.
myLinks.size() == 1);
2613 return succLinkSource.
myLinks.begin();
2624 if (nRouteSuccs < (
int)conts.size()) {
2626 for (std::vector<MSLink*>::const_iterator link = succLinkSource.
myLinks.begin(); link != succLinkSource.
myLinks.end(); ++link) {
2627 if ((*link)->getLane() !=
nullptr && (*link)->getLane()->myEdge == nRouteEdge && (*link)->getLane()->allowsVehicleClass(veh.
getVehicleType().
getVehicleClass())) {
2629 if ((*link)->getLane() == conts[nRouteSuccs]) {
2636 return succLinkSource.
myLinks.end();
2639 #ifdef DEBUG_NO_CONNECTION
2641 WRITE_WARNING(
"Could not find connection between lane " + succLinkSource.
getID() +
" and lane " + conts[nRouteSuccs]->getID() +
2644 return succLinkSource.
myLinks.end();
2652 if ((
internal && l->getViaLane() == target) || (!
internal && l->getLane() == target)) {
2663 if (l->getLane() == target) {
2664 return l->getViaLane();
2676 const MSLane*
internal =
this;
2678 assert(lane !=
nullptr);
2682 assert(lane !=
nullptr);
2696 while (first !=
nullptr) {
2737 assert(remVehicle->
getLane() ==
this);
2739 if (remVehicle == *it) {
2774 }
else if (!approachingEdge->
isInternal() && warnMultiCon) {
2777 WRITE_WARNINGF(
TL(
"Lane '%' is approached multiple times from edge '%'. This may cause collisions."),
2786 std::map<MSEdge*, std::vector<MSLane*> >::const_iterator i =
myApproachingLanes.find(edge);
2790 const std::vector<MSLane*>& lanes = (*i).second;
2791 return std::find(lanes.begin(), lanes.end(), lane) != lanes.end();
2802 const MSVehicle* v = followerInfo.first;
2817 return MIN2(maxSpeed * maxSpeed * 0.5 / minDecel,
2822 std::pair<MSVehicle* const, double>
2823 MSLane::getLeader(
const MSVehicle* veh,
const double vehPos,
const std::vector<MSLane*>& bestLaneConts,
double dist,
bool checkTmpVehicles)
const {
2826 #ifdef DEBUG_CONTEXT
2831 if (checkTmpVehicles) {
2838 #ifdef DEBUG_CONTEXT
2840 std::cout << std::setprecision(
gPrecision) <<
" getLeader lane=" <<
getID() <<
" ego=" << veh->
getID() <<
" egoPos=" << vehPos <<
" pred=" << pred->
getID() <<
" predPos=" << pred->
getPositionOnLane() <<
"\n";
2854 #ifdef DEBUG_CONTEXT
2856 std::cout <<
" getLeader lane=" <<
getID() <<
" ego=" << veh->
getID() <<
" egoPos=" << vehPos
2873 if (bestLaneConts.size() > 0) {
2879 #ifdef DEBUG_CONTEXT
2881 std::cout <<
" getLeader lane=" <<
getID() <<
" seen=" << seen <<
" dist=" << dist <<
"\n";
2885 return std::pair<MSVehicle* const, double>(
static_cast<MSVehicle*
>(
nullptr), -1);
2889 return std::make_pair(
static_cast<MSVehicle*
>(
nullptr), -1);
2894 std::pair<MSVehicle* const, double>
2896 const std::vector<MSLane*>& bestLaneConts)
const {
2897 #ifdef DEBUG_CONTEXT
2899 std::cout <<
" getLeaderOnConsecutive lane=" <<
getID() <<
" ego=" << veh.
getID() <<
" seen=" << seen <<
" dist=" << dist <<
" conts=" <<
toString(bestLaneConts) <<
"\n";
2903 return std::make_pair(
static_cast<MSVehicle*
>(
nullptr), -1);
2911 #ifdef DEBUG_CONTEXT
2918 return std::pair<MSVehicle* const, double>(pred, gap);
2921 #ifdef DEBUG_CONTEXT
2926 const MSLane* nextLane =
this;
2930 std::vector<MSLink*>::const_iterator link =
succLinkSec(veh, view, *nextLane, bestLaneConts);
2936 if ((*link)->getLane() == nextEdge->
getLanes().front()) {
2943 #ifdef DEBUG_CONTEXT
2945 std::cout <<
" cannot continue after nextLane=" << nextLane->
getID() <<
"\n";
2952 const bool laneChanging = veh.
getLane() !=
this;
2955 if (linkLeaders.size() > 0) {
2956 std::pair<MSVehicle*, double> result;
2957 double shortestGap = std::numeric_limits<double>::max();
2958 for (
auto ll : linkLeaders) {
2959 double gap = ll.vehAndGap.second;
2961 if (lVeh !=
nullptr) {
2965 #ifdef DEBUG_CONTEXT
2968 <<
" isLeader=" << veh.
isLeader(*link, lVeh, gap)
2969 <<
" gap=" << ll.vehAndGap.second
2970 <<
" gap+brakeing=" << gap
2975 if (lVeh !=
nullptr && !laneChanging && !veh.
isLeader(*link, lVeh, ll.vehAndGap.second)) {
2978 if (gap < shortestGap) {
2983 ll.vehAndGap.second =
MAX2(seen - nextLane->
getLength(), ll.distToCrossing);
2985 result = ll.vehAndGap;
2988 if (shortestGap != std::numeric_limits<double>::max()) {
2989 #ifdef DEBUG_CONTEXT
2991 std::cout <<
" found linkLeader after nextLane=" << nextLane->
getID() <<
"\n";
2998 bool nextInternal = (*link)->getViaLane() !=
nullptr;
2999 nextLane = (*link)->getViaLaneOrLane();
3000 if (nextLane ==
nullptr) {
3005 if (leader !=
nullptr) {
3006 #ifdef DEBUG_CONTEXT
3008 std::cout <<
" found leader " << leader->
getID() <<
" on nextLane=" << nextLane->
getID() <<
"\n";
3013 return std::make_pair(leader, leaderDist);
3020 if (!nextInternal) {
3023 }
while (seen <= dist || nextLane->
isInternal());
3024 #ifdef DEBUG_CONTEXT
3027 return std::make_pair(
static_cast<MSVehicle*
>(
nullptr), -1);
3031 std::pair<MSVehicle* const, double>
3033 #ifdef DEBUG_CONTEXT
3035 std::cout <<
SIMTIME <<
" getCriticalLeader. lane=" <<
getID() <<
" veh=" << veh.
getID() <<
"\n";
3039 std::pair<MSVehicle*, double> result = std::make_pair(
static_cast<MSVehicle*
>(
nullptr), -1);
3040 double safeSpeed = std::numeric_limits<double>::max();
3045 const MSLane* nextLane =
this;
3049 std::vector<MSLink*>::const_iterator link =
succLinkSec(veh, view, *nextLane, bestLaneConts);
3055 #ifdef DEBUG_CONTEXT
3061 #ifdef DEBUG_CONTEXT
3066 for (MSLink::LinkLeaders::const_iterator it = linkLeaders.begin(); it != linkLeaders.end(); ++it) {
3067 const MSVehicle* leader = (*it).vehAndGap.first;
3068 if (leader !=
nullptr && leader != result.first) {
3072 double tmpSpeed = safeSpeed;
3073 veh.
adaptToJunctionLeader((*it).vehAndGap, seen,
nullptr, nextLane, tmpSpeed, tmpSpeed, (*it).distToCrossing);
3074 #ifdef DEBUG_CONTEXT
3076 std::cout <<
" linkLeader=" << leader->
getID() <<
" gap=" << result.second <<
" tmpSpeed=" << tmpSpeed <<
" safeSpeed=" << safeSpeed <<
"\n";
3079 if (tmpSpeed < safeSpeed) {
3080 safeSpeed = tmpSpeed;
3081 result = (*it).vehAndGap;
3085 bool nextInternal = (*link)->getViaLane() !=
nullptr;
3086 nextLane = (*link)->getViaLaneOrLane();
3087 if (nextLane ==
nullptr) {
3091 if (leader !=
nullptr && leader != result.first) {
3094 if (tmpSpeed < safeSpeed) {
3095 safeSpeed = tmpSpeed;
3096 result = std::make_pair(leader, gap);
3107 if (!nextInternal) {
3110 }
while (seen <= dist || nextLane->
isInternal());
3120 for (MSEdgeVector::iterator i = pred.begin(); i != pred.end();) {
3129 if (pred.size() != 0) {
3131 MSEdge* best = *pred.begin();
3163 if (&(cand.lane->getEdge()) == &fromEdge) {
3188 #ifdef DEBUG_LANE_SORTER
3204 std::vector<MSLink*> candidateLinks =
myLinks;
3207 MSLane* best = (*candidateLinks.begin())->getViaLaneOrLane();
3208 #ifdef DEBUG_LANE_SORTER
3209 std::cout <<
"\nBest successor lane for lane '" <<
myID <<
"': '" << best->
getID() <<
"'" << std::endl;
3219 if (pred ==
nullptr) {
3227 const std::vector<std::pair<const MSLane*, const MSEdge*> >
3229 std::vector<std::pair<const MSLane*, const MSEdge*> > result;
3231 assert(link->getLane() !=
nullptr);
3232 result.push_back(std::make_pair(link->getLane(), link->getViaLane() ==
nullptr ?
nullptr : &link->getViaLane()->getEdge()));
3237 std::vector<const MSLane*>
3239 std::vector<const MSLane*> result = {};
3241 for (std::vector<MSLane*>::const_iterator it_lane = (*it).second.begin(); it_lane != (*it).second.end(); ++it_lane) {
3242 if (!((*it_lane)->isInternal())) {
3243 result.push_back(*it_lane);
3267 for (std::vector<MSLink*>::const_iterator i =
myLinks.begin(); i !=
myLinks.end(); ++i) {
3268 if ((*i)->getLane()->getEdge().isCrossing()) {
3269 return (
int)(i -
myLinks.begin());
3285 if (cand->getLane() == bidi) {
3286 sum += (brutto ? cand->getVehicleType().getLengthWithGap() : cand->getVehicleType().getLength());
3288 sum +=
myLength - cand->getBackPositionOnLane(
this);
3332 wtime += (*i)->getWaitingSeconds();
3347 v += veh->getSpeed();
3369 v += veh->getSpeed();
3388 if (vehs.size() == 0) {
3392 for (MSLane::VehCont::const_iterator i = vehs.begin(); i != vehs.end(); ++i) {
3393 double sv = (*i)->getHarmonoise_NoiseEmissions();
3394 ret += (double) pow(10., (sv / 10.));
3427 myLaneDir(e->getLanes()[0]->
getShape().angleAt2D(0)) {
3438 if (ae1 !=
nullptr && ae1->size() != 0) {
3448 if (ae2 !=
nullptr && ae2->size() != 0) {
3468 myLaneDir(targetLane->
getShape().angleAt2D(0)) {}
3486 #ifdef DEBUG_LANE_SORTER
3487 std::cout <<
"\nincoming_lane_priority sorter()\n"
3488 <<
"noninternal predecessor for lane '" << laneInfo1.
lane->
getID()
3489 <<
"': '" << noninternal1->
getID() <<
"'\n"
3490 <<
"noninternal predecessor for lane '" << laneInfo2.
lane->
getID()
3491 <<
"': '" << noninternal2->
getID() <<
"'\n";
3499 bool priorized1 =
true;
3500 bool priorized2 =
true;
3502 #ifdef DEBUG_LANE_SORTER
3503 std::cout <<
"FoeLinks of '" << noninternal1->
getID() <<
"'" << std::endl;
3506 #ifdef DEBUG_LANE_SORTER
3507 std::cout << foeLink->getLaneBefore()->getID() << std::endl;
3509 if (foeLink == link2) {
3515 #ifdef DEBUG_LANE_SORTER
3516 std::cout <<
"FoeLinks of '" << noninternal2->
getID() <<
"'" << std::endl;
3519 #ifdef DEBUG_LANE_SORTER
3520 std::cout << foeLink->getLaneBefore()->getID() << std::endl;
3523 if (foeLink == link1) {
3531 if (priorized1 != priorized2) {
3545 myLaneDir(sourceLane->
getShape().angleAt2D(0)) {}
3551 if (target2 ==
nullptr) {
3554 if (target1 ==
nullptr) {
3558 #ifdef DEBUG_LANE_SORTER
3559 std::cout <<
"\noutgoing_lane_priority sorter()\n"
3560 <<
"noninternal successors for lane '" << myLane->
getID()
3561 <<
"': '" << target1->
getID() <<
"' and "
3562 <<
"'" << target2->
getID() <<
"'\n";
3569 if (priority1 != priority2) {
3570 return priority1 > priority2;
3596 if (link->getApproaching().size() > 0) {
3605 const bool toRailJunction =
myLinks.size() > 0 && (
3608 const bool hasVehicles =
myVehicles.size() > 0;
3617 if (toRailJunction) {
3619 if (link->getApproaching().size() > 0) {
3622 for (
auto item : link->getApproaching()) {
3632 if (item.second.latOffset != 0) {
3664 for (
const std::string&
id : vehIds) {
3707 bool allSublanes,
double searchDist,
MinorLinkMode mLinkMode)
const {
3714 #ifdef DEBUG_CONTEXT
3716 std::cout <<
SIMTIME <<
" getFollowers lane=" <<
getID() <<
" ego=" << ego->
getID()
3717 <<
" backOffset=" << backOffset <<
" pos=" << egoPos
3718 <<
" allSub=" << allSublanes <<
" searchDist=" << searchDist <<
" ignoreMinor=" << mLinkMode
3719 <<
" egoLatDist=" << egoLatDist
3720 <<
" getOppositeLeaders=" << getOppositeLeaders
3734 #ifdef DEBUG_CONTEXT
3736 std::cout <<
SIMTIME <<
" getFollowers lane=" <<
getID() <<
" ego=" << ego->
getID()
3747 #ifdef DEBUG_CONTEXT
3760 #ifdef DEBUG_CONTEXT
3762 std::cout <<
" (1) added veh=" << veh->
getID() <<
" latOffset=" << latOffset <<
" result=" << result.
toString() <<
"\n";
3767 #ifdef DEBUG_CONTEXT
3769 std::cout <<
" result.numFreeSublanes=" << result.
numFreeSublanes() <<
"\n";
3777 if (searchDist == -1) {
3779 #ifdef DEBUG_CONTEXT
3781 std::cout <<
" computed searchDist=" << searchDist <<
"\n";
3785 std::set<const MSEdge*> egoFurther;
3787 egoFurther.insert(&further->getEdge());
3800 std::vector<MSLane::IncomingLaneInfo> newFound;
3802 while (toExamine.size() != 0) {
3803 for (std::vector<MSLane::IncomingLaneInfo>::iterator it = toExamine.begin(); it != toExamine.end(); ++it) {
3804 MSLane* next = (*it).lane;
3808 #ifdef DEBUG_CONTEXT
3810 std::cout <<
" next=" << next->
getID() <<
" seen=" << (*it).length <<
" first=" << first.
toString() <<
" firstFront=" << firstFront.
toString() <<
" backOffset=" << backOffset <<
"\n";
3814 if (backOffset + (*it).length - next->
getLength() < 0
3815 && egoFurther.count(&next->
getEdge()) != 0
3821 for (
const auto& ll : linkLeaders) {
3822 if (ll.vehAndGap.first !=
nullptr) {
3823 const bool bidiFoe = (*it).viaLink->getLane() == ll.vehAndGap.first->getLane()->getNormalPredecessorLane()->getBidiLane();
3824 const bool egoIsLeader = !bidiFoe && ll.vehAndGap.first->isLeader((*it).viaLink, ego, ll.vehAndGap.second);
3827 const double gap = (egoIsLeader
3828 ? -ll.vehAndGap.second - ll.vehAndGap.first->getVehicleType().getLengthWithGap() - ego->
getVehicleType().
getMinGap()
3831 #ifdef DEBUG_CONTEXT
3833 std::cout <<
SIMTIME <<
" ego=" << ego->
getID() <<
" link=" << (*it).viaLink->getViaLaneOrLane()->getID()
3835 <<
" gap=" << ll.vehAndGap.second <<
" dtC=" << ll.distToCrossing
3836 <<
" bidiFoe=" << bidiFoe
3837 <<
" egoIsLeader=" << egoIsLeader <<
" gap2=" << gap
3844 #ifdef DEBUG_CONTEXT
3851 const MSVehicle* v = first[i] == ego ? firstFront[i] : first[i];
3854 if (v !=
nullptr && v != ego) {
3861 agap = (*it).length - next->
getLength() + backOffset
3864 #ifdef DEBUG_CONTEXT
3866 std::cout <<
" agap1=" << agap <<
"\n";
3872 if (!getOppositeLeaders) {
3877 if (v !=
nullptr && v != ego) {
3890 if (!(*it).viaLink->havePriority() && !ego->
onFurtherEdge(&(*it).lane->getEdge())
3896 agap =
MAX2(agap, 0.0);
3900 #ifdef DEBUG_CONTEXT
3907 if ((*it).length < searchDist) {
3908 const std::vector<MSLane::IncomingLaneInfo>& followers = next->
getIncomingLanes();
3909 for (std::vector<MSLane::IncomingLaneInfo>::const_iterator j = followers.begin(); j != followers.end(); ++j) {
3910 if (visited.find((*j).lane) == visited.end() && (((*j).viaLink->havePriority() && !(*j).viaLink->isTurnaround())
3911 || mLinkMode == MinorLinkMode::FOLLOW_ALWAYS
3912 || (mLinkMode == MinorLinkMode::FOLLOW_ONCOMING && (*j).viaLink->getDirection() ==
LinkDirection::STRAIGHT))) {
3913 visited.insert((*j).lane);
3915 ili.
lane = (*j).lane;
3916 ili.
length = (*j).length + (*it).length;
3918 newFound.push_back(ili);
3924 swap(newFound, toExamine);
3936 bool oppositeDirection)
const {
3950 #ifdef DEBUG_CONTEXT
3955 const MSLane* nextLane =
this;
3960 bool nextInternal =
false;
3961 if (oppositeDirection) {
3962 if (view >= (
int)bestLaneConts.size()) {
3965 nextLane = bestLaneConts[view];
3967 std::vector<MSLink*>::const_iterator link =
succLinkSec(*ego, view, *nextLane, bestLaneConts);
3973 if (linkLeaders.size() > 0) {
3981 #ifdef DEBUG_CONTEXT
3983 std::cout <<
" linkleader=" << veh->
getID() <<
" gap=" << ll.
vehAndGap.second <<
" leaderOffset=" << ll.
latOffset <<
" flags=" << ll.
llFlags <<
"\n";
3994 #ifdef DEBUG_CONTEXT
4000 nextInternal = (*link)->getViaLane() !=
nullptr;
4001 nextLane = (*link)->getViaLaneOrLane();
4002 if (nextLane ==
nullptr) {
4008 #ifdef DEBUG_CONTEXT
4010 std::cout <<
SIMTIME <<
" getLeadersOnConsecutive lane=" <<
getID() <<
" nextLane=" << nextLane->
getID() <<
" leaders=" << leaders.
toString() <<
"\n";
4015 for (
int i = 0; i < iMax; ++i) {
4017 if (veh !=
nullptr) {
4018 #ifdef DEBUG_CONTEXT
4034 if (!nextInternal) {
4038 #ifdef DEBUG_CONTEXT
4048 #ifdef DEBUG_SURROUNDING
4050 std::cout <<
" addLeaders lane=" <<
getID() <<
" veh=" << vehicle->
getID() <<
" vehPos=" << vehPos <<
" opposite=" << opposite <<
"\n";
4054 for (
int i = 0; i < aheadSamePos.
numSublanes(); ++i) {
4056 if (veh !=
nullptr && veh != vehicle) {
4058 #ifdef DEBUG_SURROUNDING
4069 double speed = vehicle->
getSpeed();
4077 #ifdef DEBUG_SURROUNDING
4079 std::cout <<
" aborting forward search. dist=" << dist <<
" seen=" << seen <<
"\n";
4084 #ifdef DEBUG_SURROUNDING
4086 std::cout <<
" add consecutive before=" << result.
toString() <<
" seen=" << seen <<
" dist=" << dist;
4091 #ifdef DEBUG_SURROUNDING
4093 std::cout <<
" upstreamOpposite=" <<
toString(bestLaneConts);
4101 #ifdef DEBUG_SURROUNDING
4103 std::cout <<
" after=" << result.
toString() <<
"\n";
4117 #ifdef DEBUG_CONTEXT
4119 std::cout <<
SIMTIME <<
" getPartialBehind lane=" <<
getID() <<
" ego=" << ego->
getID() <<
" found=" << veh->
getID() <<
"\n";
4125 #ifdef DEBUG_CONTEXT
4148 std::set<MSVehicle*>
4150 assert(checkedLanes !=
nullptr);
4151 if (checkedLanes->find(
this) != checkedLanes->end()) {
4152 #ifdef DEBUG_SURROUNDING
4153 std::cout <<
"Skipping previously scanned lane: " <<
getID() << std::endl;
4155 return std::set<MSVehicle*>();
4158 (*checkedLanes)[
this] = std::make_pair(
MAX2(0.0, startPos - upstreamDist),
MIN2(startPos + downstreamDist,
getLength()));
4160 #ifdef DEBUG_SURROUNDING
4161 std::cout <<
"Scanning on lane " <<
myID <<
"(downstr. " << downstreamDist <<
", upstr. " << upstreamDist <<
", startPos " << startPos <<
"): " << std::endl;
4164 if (startPos < upstreamDist) {
4167 MSLane* incoming = incomingInfo.lane;
4168 #ifdef DEBUG_SURROUNDING
4169 std::cout <<
"Checking on incoming: " << incoming->
getID() << std::endl;
4170 if (checkedLanes->find(incoming) != checkedLanes->end()) {
4171 std::cout <<
"Skipping previous: " << incoming->
getID() << std::endl;
4175 foundVehicles.insert(newVehs.begin(), newVehs.end());
4179 if (
getLength() < startPos + downstreamDist) {
4183 #ifdef DEBUG_SURROUNDING
4184 std::cout <<
"Checking on outgoing: " << l->getViaLaneOrLane()->getID() << std::endl;
4186 std::set<MSVehicle*> newVehs = l->getViaLaneOrLane()->getSurroundingVehicles(0.0, downstreamDist - (
myLength - startPos), upstreamDist, checkedLanes);
4187 foundVehicles.insert(newVehs.begin(), newVehs.end());
4190 #ifdef DEBUG_SURROUNDING
4191 std::cout <<
"On lane (2) " <<
myID <<
": \nFound vehicles: " << std::endl;
4193 std::cout << v->getID() <<
" pos = " << v->getPositionOnLane() << std::endl;
4196 return foundVehicles;
4200 std::set<MSVehicle*>
4202 std::set<MSVehicle*> res;
4205 if (!vehs.empty()) {
4207 if (veh->getPositionOnLane() >= a) {
4208 if (veh->getBackPositionOnLane() > b) {
4220 std::vector<const MSJunction*>
4223 std::vector<const MSJunction*> junctions;
4225 junctions.insert(junctions.end(), l->getJunction());
4231 std::vector<const MSLink*>
4233 #ifdef DEBUG_SURROUNDING
4234 std::cout <<
"getUpcoming links on lane '" <<
getID() <<
"' with pos=" << pos
4235 <<
" range=" << range << std::endl;
4238 std::vector<const MSLink*> links;
4241 const MSLane* lane =
this;
4244 std::vector<MSLane*>::const_iterator contLanesIt = contLanes.begin();
4248 const MSLink* link =
nullptr;
4250 assert(*contLanesIt ==
nullptr);
4252 links.insert(links.end(), link);
4257 assert(*(contLanesIt + 1) == lane);
4259 while (++contLanesIt != contLanes.end()) {
4263 #ifdef DEBUG_SURROUNDING
4264 std::cout <<
"Distance until end of lane '" << lane->
getID() <<
"' is " << dist <<
"." << std::endl;
4270 if (link !=
nullptr) {
4271 links.insert(links.end(), link);
4273 lane = *contLanesIt;
4296 std::pair<MSVehicle* const, double>
4301 #ifdef DEBUG_CONTEXT
4303 std::cout <<
" getFollower lane=" <<
getID() <<
" egoPos=" << egoPos <<
" pred=" << pred->
getID() <<
" predPos=" << pred->
getPositionOnLane(
this) <<
"\n";
4311 if (dist > 0 && backOffset > dist) {
4312 return std::make_pair(
nullptr, -1);
4316 return std::make_pair(
const_cast<MSVehicle*
>(result.first), result.second);
4319 std::pair<MSVehicle* const, double>
4321 #ifdef DEBUG_OPPOSITE
4323 <<
" ego=" << ego->
getID()
4327 <<
" oppositeDir=" << oppositeDir
4335 std::pair<MSVehicle* const, double> result =
getFollower(ego, egoPos + egoLength, dist, mLinkMode);
4336 if (result.first !=
nullptr) {
4338 if (result.first->getLaneChangeModel().isOpposite()) {
4339 result.second -= result.first->getVehicleType().getLength();
4347 std::pair<MSVehicle* const, double>
4349 #ifdef DEBUG_OPPOSITE
4351 <<
" ego=" << ego->
getID()
4361 std::pair<MSVehicle*, double> result =
getLeader(ego, vehPos, std::vector<MSLane*>());
4364 while (result.first ==
nullptr && dist > 0) {
4369 if (next ==
nullptr) {
4373 result = next->
getLeader(ego, vehPos, std::vector<MSLane*>());
4375 if (result.first !=
nullptr) {
4376 if (result.first->getLaneChangeModel().isOpposite()) {
4377 result.second -= result.first->getVehicleType().getLength();
4379 if (result.second > POSITION_EPS) {
4381 return std::make_pair(
static_cast<MSVehicle*
>(
nullptr), -1);
4391 const std::string action = oc.
getString(option);
4392 if (action ==
"none") {
4394 }
else if (action ==
"warn") {
4396 }
else if (action ==
"teleport") {
4398 }
else if (action ==
"remove") {
4479 #ifdef DEBUG_INSERTION
4481 std::cout <<
SIMTIME <<
" check for pedestrians on lane=" <<
getID() <<
" pos=" << pos <<
"\n";
4486 if (leader.first != 0) {
4492 #ifdef DEBUG_INSERTION
4494 <<
" isInsertionSuccess lane=" <<
getID()
4495 <<
" veh=" << aVehicle->
getID()
4498 <<
" patchSpeed=" << patchSpeed
4499 <<
" speed=" << speed
4500 <<
" stopSpeed=" << stopSpeed
4501 <<
" pedestrianLeader=" << leader.first->getID()
4502 <<
" failed (@796)!\n";
4515 const int numRNGs = oc.
getInt(
"thread-rngs");
4516 const bool random = oc.
getBool(
"random");
4517 int seed = oc.
getInt(
"seed");
4519 for (
int i = 0; i < numRNGs; i++) {
4553 myLinks.front()->getFoeLanes().size() > 0
4554 ||
myLinks.front()->getWalkingAreaFoe() !=
nullptr
4555 ||
myLinks.front()->getWalkingAreaFoeExit() !=
nullptr);
4568 foundStopped =
true;
4569 const double lastBrakeGap = last->getCarFollowModel().brakeGap(last->getSpeed());
4570 const double ret = last->getBackPositionOnLane() + lastBrakeGap - lengths;
4574 lengths += last->getVehicleType().getLengthWithGap() * (last->getVehicleType().getWidth() + last->getVehicleType().getMinGapLat()) /
getWidth();
4576 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 permissions 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_JM_STOPLINE_CROSSING_GAP
@ 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 MSRouteIterator & getCurrentRouteEdge() const
Returns an iterator pointing to the current edge in this vehicles route.
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
int getRoutePosition() const
return index of edge within route
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.
void markRecalculateBruttoSum()
Set a flag to recalculate the brutto (including minGaps) occupancy of this lane (used if mingap is ch...
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...
bool myRecalculateBruttoSum
Flag to recalculate the occupancy (including minGaps) after a change in minGap.
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_BREAKDOWN
The vehicle got removed via stationfinder device.
@ 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 nullptr
virtual bool hasPedestrians(const MSLane *lane)
whether the given lane has pedestrians on it
static const double SAFETY_GAP
static bool hasOncomingRailTraffic(MSLink *link, const MSVehicle *ego, bool &brakeBeforeSignal)
static bool hasInsertionConstraint(MSLink *link, const MSVehicle *veh, std::string &info, bool &isInsertionOrder)
int size() const
Returns the number of edges to pass.
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 checkLinkLeader(const MSLink *link, const MSLane *lane, double seen, DriveProcessItem *const lastLink, double &v, double &vLinkPass, double &vLinkWait, bool &setRequest, bool isShadowLink=false) const
checks for link leaders on the given link
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
bool brokeDown() const
Returns how long the vehicle has been stopped already due to lack of energy.
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)
double getJMParam(const SumoXMLAttr attr, const double defaultValue) const
Returns the named value from the map, or the default if it is not contained there.
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.
double speed
the speed at which this stop counts as reached (waypoint mode)
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