40#define LOOK_FORWARD 10.
44#define LCA_RIGHT_IMPATIENCE -1.
45#define CUT_IN_LEFT_SPEED_THRESHOLD 27.
46#define MAX_ONRAMP_LENGTH 200.
48#define LOOK_AHEAD_MIN_SPEED 0.0
49#define LOOK_AHEAD_SPEED_MEMORY 0.9
51#define HELP_DECEL_FACTOR 1.0
53#define HELP_OVERTAKE (10.0 / 3.6)
54#define MIN_FALLBEHIND (7.0 / 3.6)
58#define KEEP_RIGHT_TIME 5.0
60#define RELGAIN_NORMALIZATION_MIN_SPEED 10.0
62#define TURN_LANE_DIST 200.0
63#define GAIN_PERCEPTION_THRESHOLD 0.05
65#define ARRIVALPOS_LAT_THRESHOLD 100.0
68#define LATGAP_SPEED_THRESHOLD (50 / 3.6)
71#define LATGAP_SPEED_THRESHOLD2 (50 / 3.6)
74#define SPEEDGAIN_DECAY_FACTOR 0.5
76#define SPEEDGAIN_MEMORY_FACTOR 0.5
78#define REACT_TO_STOPPED_DISTANCE 100
104#define DEBUG_COND (myVehicle.isSelected())
116 mySpeedGainProbabilityRight(0),
117 mySpeedGainProbabilityLeft(0),
118 myKeepRightProbability(0),
119 myLeadingBlockerLength(0),
123 myCanChangeFully(true),
124 mySafeLatDistRight(0),
125 mySafeLatDistLeft(0),
133 myMinGapLat(v.getVehicleType().getMinGapLat()),
136 MAX2(NUMERICAL_EPS, myMinGapLat)) /
137 MAX2(NUMERICAL_EPS, myMinGapLat)))),
139 myMinImpatience(myImpatience),
191 const std::vector<MSVehicle::LaneQ>& preb,
194 double& latDist,
double& maneuverDist,
int& blocked) {
197 const std::string changeType = laneOffset == -1 ?
"right" : (laneOffset == 1 ?
"left" :
"current");
205 <<
" neigh=" << neighLane.
getID()
210 <<
" considerChangeTo=" << changeType
217 leaders, followers, blockers,
218 neighLeaders, neighFollowers, neighBlockers,
220 lastBlocked, firstBlocked, latDist, maneuverDist, blocked);
222 result =
keepLatGap(result, leaders, followers, blockers,
223 neighLeaders, neighFollowers, neighBlockers,
224 neighLane, laneOffset, latDist, maneuverDist, blocked);
226 result |=
getLCA(result, latDist);
228#if defined(DEBUG_MANEUVER) || defined(DEBUG_STATE)
229 double latDistTmp = latDist;
232#if defined(DEBUG_MANEUVER) || defined(DEBUG_STATE)
234 std::cout <<
SIMTIME <<
" veh=" <<
myVehicle.
getID() <<
" maneuverDist=" << maneuverDist <<
" latDist=" << latDistTmp <<
" mySpeedPrev=" <<
mySpeedLat <<
" speedLat=" <<
DIST2SPEED(latDist) <<
" latDist2=" << latDist <<
"\n";
241 <<
" wantsChangeTo=" << changeType
242 <<
" latDist=" << latDist
243 <<
" maneuverDist=" << maneuverDist
251 <<
" wantsNoChangeTo=" << changeType
308 const double newSpeed =
_patchSpeed(
MAX2(min, 0.0), wanted, max, cfModel);
309#ifdef DEBUG_PATCHSPEED
311 const std::string patched = (wanted != newSpeed ?
" patched=" +
toString(newSpeed) :
"");
318 <<
" wanted=" << wanted
337 double nVSafe = wanted;
343#ifdef DEBUG_PATCHSPEED
351 max =
MIN2(max, safe);
356 if (safe >= vMinEmergency) {
358 min =
MAX2(vMinEmergency, safe);
361#ifdef DEBUG_PATCHSPEED
363 std::cout <<
SIMTIME <<
" veh=" <<
myVehicle.
getID() <<
" slowing down for leading blocker, safe=" << safe << (safe + NUMERICAL_EPS < min ?
" (not enough)" :
"") <<
"\n";
366 nVSafe =
MAX2(min, safe);
373 double accel = i.first;
375 if (v >= min && v <= max) {
378 nVSafe =
MIN2(v, nVSafe);
380 nVSafe =
MIN2(v * coopWeight + (1 - coopWeight) * wanted, nVSafe);
383#ifdef DEBUG_PATCHSPEED
385 std::cout <<
SIMTIME <<
" veh=" <<
myVehicle.
getID() <<
" got accel=" << accel <<
" nVSafe=" << nVSafe <<
"\n";
389#ifdef DEBUG_PATCHSPEED
392 std::cout <<
SIMTIME <<
" veh=" <<
myVehicle.
getID() <<
" ignoring low nVSafe=" << v <<
" (accel=" << accel <<
") min=" << min <<
"\n";
396 std::cout <<
SIMTIME <<
" veh=" <<
myVehicle.
getID() <<
" ignoring high nVSafe=" << v <<
" (accel=" << accel <<
") max=" << max <<
"\n";
404#ifdef DEBUG_PATCHSPEED
417#if defined(DEBUG_PATCHSPEED) || defined(DEBUG_STATE)
422 return (max + wanted) / 2.0;
426#if defined(DEBUG_PATCHSPEED) || defined(DEBUG_STATE)
431 return (min + wanted) / 2.0;
434#if defined(DEBUG_PATCHSPEED) || defined(DEBUG_STATE)
439 return (max + wanted) / 2.0;
480#if defined(DEBUG_PATCHSPEED) || defined(DEBUG_STATE)
485 return (max + wanted) / 2.0;
489#if defined(DEBUG_PATCHSPEED) || defined(DEBUG_STATE)
509 if (pinfo->first >= 0) {
518 <<
" informedBy=" << sender->
getID()
519 <<
" info=" << pinfo->second
520 <<
" vSafe=" << pinfo->first
533 assert(cld.first != 0);
542 double remainingSeconds) {
548 plannedSpeed =
MIN2(plannedSpeed, v);
553 std::cout <<
" informLeader speed=" <<
myVehicle.
getSpeed() <<
" planned=" << plannedSpeed <<
"\n";
564 if (
gDebugFlag2) std::cout <<
" blocked by leader nv=" << nv->
getID() <<
" nvSpeed=" << nv->
getSpeed() <<
" needGap="
568 const double dv = plannedSpeed - nv->
getSpeed();
569 const double overtakeDist = (neighLead.second
581 || dv * remainingSeconds < overtakeDist)
582 && (!neighLead.first->isStopped() || (
isOpposite() && neighLead.second >= 0))) {
597 <<
" cannot overtake leader nv=" << nv->
getID()
599 <<
" remainingSeconds=" << remainingSeconds
600 <<
" targetSpeed=" << targetSpeed
601 <<
" nextSpeed=" << nextSpeed
612 <<
" cannot overtake fast leader nv=" << nv->
getID()
614 <<
" remainingSeconds=" << remainingSeconds
615 <<
" targetSpeed=" << targetSpeed
626 <<
" wants to overtake leader nv=" << nv->
getID()
628 <<
" remainingSeconds=" << remainingSeconds
629 <<
" currentGap=" << neighLead.second
631 <<
" overtakeDist=" << overtakeDist
641 }
else if (neighLead.first != 0) {
644 double dv, nextNVSpeed;
664 std::cout <<
" not blocked by leader nv=" << nv->
getID()
666 <<
" gap=" << neighLead.second
667 <<
" nextGap=" << neighLead.second - dv
669 <<
" targetSpeed=" << targetSpeed
673 return MIN2(targetSpeed, plannedSpeed);
685 double remainingSeconds,
686 double plannedSpeed) {
694 if (
gDebugFlag2) std::cout <<
" blocked by follower nv=" << nv->
getID() <<
" nvSpeed=" << nv->
getSpeed() <<
" needGap="
701 if ((neededGap - neighFollow.second) / remainingSeconds < (plannedSpeed - nv->
getSpeed())) {
704 std::cout <<
" wants to cut in before nv=" << nv->
getID() <<
" without any help neededGap=" << neededGap <<
"\n";
723 const double neighNewSpeed1s =
MAX2(0., nv->
getSpeed() - helpDecel);
724 const double dv = plannedSpeed - neighNewSpeed1s;
726 const double decelGap = neighFollow.second + dv;
732 <<
" egoNV=" << plannedSpeed
733 <<
" nvNewSpeed=" << neighNewSpeed
734 <<
" nvNewSpeed1s=" << neighNewSpeed1s
735 <<
" deltaGap=" << dv
736 <<
" decelGap=" << decelGap
737 <<
" secGap=" << secureGap
741 if (decelGap > 0 && decelGap >= secureGap) {
756 std::cout <<
" wants to cut in before nv=" << nv->
getID()
757 <<
" vsafe1=" << vsafe1
758 <<
" vsafe=" << vsafe
763 }
else if (dv > 0 && dv * remainingSeconds > (secureGap - decelGap + POSITION_EPS)) {
768 std::cout <<
" wants to cut in before nv=" << nv->
getID() <<
" (eventually)\n";
776 std::cout <<
" wants to cut in before nv=" << nv->
getID() <<
" (nv cannot overtake right)\n";
792 std::cout <<
" wants right follower to slow down a bit\n";
798 std::cout <<
" wants to cut in before right follower nv=" << nv->
getID() <<
" (eventually)\n";
807 const double overtakeDist = (neighFollow.second
813 const double needDV = overtakeDist / remainingSeconds;
821 <<
" wants to be overtaken by=" << nv->
getID()
822 <<
" overtakeDist=" << overtakeDist
824 <<
" vhelp=" << vhelp
825 <<
" needDV=" << needDV
831 }
else if (neighFollow.first != 0) {
836 std::cout <<
" wants to cut in before non-blocking follower nv=" << neighFollow.first->getID() <<
"\n";
844 const std::vector<CLeaderDist>& blockers,
845 double remainingSeconds) {
857 plannedSpeed =
MIN2(plannedSpeed, safe);
859 for (std::vector<CLeaderDist>::const_iterator it = blockers.begin(); it != blockers.end(); ++it) {
860 plannedSpeed =
MIN2(plannedSpeed,
informLeader(blocked, dir, *it, remainingSeconds));
868 const std::vector<CLeaderDist>& blockers,
869 double remainingSeconds,
870 double plannedSpeed) {
872 for (std::vector<CLeaderDist>::const_iterator it = blockers.begin(); it != blockers.end(); ++it) {
873 informFollower(blocked, dir, *it, remainingSeconds, plannedSpeed);
898 const double halfWidth =
getWidth() * 0.5;
911 std::vector<double> newExpectedSpeeds;
920 const std::vector<MSLane*>& lanes = currEdge->
getLanes();
921 for (std::vector<MSLane*>::const_iterator it_lane = lanes.begin(); it_lane != lanes.end(); ++it_lane) {
923 for (
int i = 0; i < subLanes; ++i) {
924 newExpectedSpeeds.push_back((*it_lane)->getVehicleMaxSpeed(&
myVehicle));
930 for (
int i = 0; i < subLanes; ++i) {
931 newExpectedSpeeds.push_back(lanes.back()->getVehicleMaxSpeed(&
myVehicle));
939 if (subLaneShift < std::numeric_limits<int>::max()) {
941 const int newI = i + subLaneShift;
942 if (newI > 0 && newI < (
int)newExpectedSpeeds.size()) {
978 for (
const MSLink*
const link : lane->getLinkCont()) {
979 if (&link->getLane()->getEdge() == curEdge) {
981 const MSLane* target = link->getLane();
982 const std::vector<MSLane*>& lanes2 = curEdge->
getLanes();
983 for (std::vector<MSLane*>::const_iterator it_lane2 = lanes2.begin(); it_lane2 != lanes2.end(); ++it_lane2) {
984 const MSLane* lane2 = *it_lane2;
985 if (lane2 == target) {
986 return prevShift + curShift;
997 return std::numeric_limits<int>::max();
1032#if defined(DEBUG_MANEUVER) || defined(DEBUG_STATE)
1065 const std::vector<MSVehicle::LaneQ>& preb,
1068 double& latDist,
double& maneuverDist,
int& blocked) {
1070 if (laneOffset != 0) {
1072 const double halfWidth =
getWidth() * 0.5;
1074 if (laneOffset < 0) {
1084 int bestLaneOffset = 0;
1085 double currentDist = 0;
1086 double neighDist = 0;
1098 const int prebOffset = (checkOpposite ? 0 : laneOffset);
1099 for (
int p = 0; p < (int) preb.size(); ++p) {
1100 if (preb[p].lane == prebLane && p + laneOffset >= 0) {
1101 assert(p + prebOffset < (
int)preb.size());
1103 neigh = preb[p + prebOffset];
1104 currentDist = curr.
length;
1105 neighDist = neigh.
length;
1108 if (bestLaneOffset == 0 && preb[p + prebOffset].bestLaneOffset == 0 && !checkOpposite) {
1109#ifdef DEBUG_WANTSCHANGE
1113 <<
" bestLaneOffsetOld=" << bestLaneOffset
1114 <<
" bestLaneOffsetNew=" << laneOffset
1118 bestLaneOffset = prebOffset;
1120 best = preb[p + bestLaneOffset];
1124 assert(curr.
lane !=
nullptr);
1125 assert(neigh.
lane !=
nullptr);
1126 assert(best.
lane !=
nullptr);
1127 double driveToNextStop = -std::numeric_limits<double>::max();
1136#ifdef DEBUG_WANTS_CHANGE
1141 <<
" stopPos=" << stopPos
1142 <<
" currentDist=" << currentDist
1143 <<
" neighDist=" << neighDist
1147 currentDist =
MAX2(currentDist, stopPos);
1148 neighDist =
MAX2(neighDist, stopPos);
1151 const bool right = (laneOffset == -1);
1152 const bool left = (laneOffset == 1);
1155 const bool changeToBest = (right && bestLaneOffset < 0) || (left && bestLaneOffset > 0) || (laneOffset == 0 && bestLaneOffset == 0);
1181#ifdef DEBUG_WANTSCHANGE
1188 <<
"\n leaders=" << leaders.
toString()
1189 <<
"\n followers=" << followers.
toString()
1190 <<
"\n blockers=" << blockers.
toString()
1191 <<
"\n neighLeaders=" << neighLeaders.
toString()
1192 <<
"\n neighFollowers=" << neighFollowers.
toString()
1193 <<
"\n neighBlockers=" << neighBlockers.
toString()
1194 <<
"\n changeToBest=" << changeToBest
1195 <<
" latLaneDist=" << latLaneDist
1204 if (lastBlocked != firstBlocked) {
1255 for (
int i = 0; i < neighLeaders.
numSublanes(); ++i) {
1257 if (vehDist.first !=
nullptr && vehDist.first->isStopped()) {
1275 currentDist += roundaboutBonus;
1276 neighDist += roundaboutBonus;
1295 if ((ret &
LCA_STAY) != 0 && latDist == 0) {
1308 if (changeToBest && abs(bestLaneOffset) > 1
1314#ifdef DEBUG_WANTSCHANGE
1316 std::cout <<
" reserving space for unseen blockers myLeadingBlockerLength=" <<
myLeadingBlockerLength <<
"\n";
1325#ifdef DEBUG_WANTSCHANGE
1331 if (*firstBlocked != neighLeadLongest &&
tieBrakeLeader(*firstBlocked)) {
1340 std::vector<CLeaderDist> collectLeadBlockers;
1341 std::vector<CLeaderDist> collectFollowBlockers;
1342 int blockedFully = 0;
1343 maneuverDist = latDist;
1345 blocked =
checkBlocking(neighLane, latDist, maneuverDist, laneOffset,
1346 leaders, followers, blockers,
1347 neighLeaders, neighFollowers, neighBlockers, &collectLeadBlockers, &collectFollowBlockers,
1348 false, gapFactor, &blockedFully);
1350 const double absLaneOffset = fabs(bestLaneOffset != 0 ? bestLaneOffset : latDist /
SUMO_const_laneWidth);
1351 const double remainingSeconds = ((ret &
LCA_TRACI) == 0 ?
1354 const double plannedSpeed =
informLeaders(blocked, myLca, collectLeadBlockers, remainingSeconds);
1356 if (plannedSpeed >= 0) {
1358 informFollowers(blocked, myLca, collectFollowBlockers, remainingSeconds, plannedSpeed);
1360 if (plannedSpeed > 0) {
1361 commitManoeuvre(blocked, blockedFully, leaders, neighLeaders, neighLane, maneuverDist);
1363#if defined(DEBUG_WANTSCHANGE) || defined(DEBUG_STATE)
1370 <<
" remainingSeconds=" << remainingSeconds
1371 <<
" plannedSpeed=" << plannedSpeed
1382 if (roundaboutBonus > 0) {
1384#ifdef DEBUG_WANTS_CHANGE
1388 <<
" roundaboutBonus=" << roundaboutBonus
1399 latDist = latLaneDist;
1400 maneuverDist = latLaneDist;
1401 blocked =
checkBlocking(neighLane, latDist, maneuverDist, laneOffset,
1402 leaders, followers, blockers,
1403 neighLeaders, neighFollowers, neighBlockers);
1407 ret &= ~LCA_COOPERATIVE;
1423 const double inconvenience = (latLaneDist < 0
1426#ifdef DEBUG_COOPERATE
1434 <<
" inconvenience=" << inconvenience
1436 <<
" wantsChangeToHelp=" << (right ?
"right" :
"left")
1453 && (changeToBest ||
currentDistAllows(neighDist, abs(bestLaneOffset) + 1, laDist))) {
1456#ifdef DEBUG_COOPERATE
1458 std::cout <<
" wants cooperative change\n";
1465 maneuverDist = latDist;
1466 blocked =
checkBlocking(neighLane, latDist, maneuverDist, laneOffset,
1467 leaders, followers, blockers,
1468 neighLeaders, neighFollowers, neighBlockers);
1494 const double vehWidth =
getWidth();
1496 const double leftVehSide = rightVehSide + vehWidth;
1498 double defaultNextSpeed = std::numeric_limits<double>::max();
1500 int leftmostOnEdge = (int)sublaneSides.size() - 1;
1501 while (leftmostOnEdge > 0 && sublaneSides[leftmostOnEdge] > leftVehSide) {
1504 int rightmostOnEdge = leftmostOnEdge;
1505 while (rightmostOnEdge > 0 && sublaneSides[rightmostOnEdge] > rightVehSide + NUMERICAL_EPS) {
1507#ifdef DEBUG_WANTSCHANGE
1509 std::cout <<
" adapted to current sublane=" << rightmostOnEdge <<
" defaultNextSpeed=" << defaultNextSpeed <<
"\n";
1510 std::cout <<
" sublaneSides[rightmostOnEdge]=" << sublaneSides[rightmostOnEdge] <<
" rightVehSide=" << rightVehSide <<
"\n";
1516#ifdef DEBUG_WANTSCHANGE
1518 std::cout <<
" adapted to current sublane=" << rightmostOnEdge <<
" defaultNextSpeed=" << defaultNextSpeed <<
"\n";
1519 std::cout <<
" sublaneSides[rightmostOnEdge]=" << sublaneSides[rightmostOnEdge] <<
" rightVehSide=" << rightVehSide <<
"\n";
1522 double maxGain = -std::numeric_limits<double>::max();
1523 double maxGainRight = -std::numeric_limits<double>::max();
1524 double maxGainLeft = -std::numeric_limits<double>::max();
1525 double latDistNice = std::numeric_limits<double>::max();
1528 double leftMax =
MAX2(
1535 assert(leftMax <= edge.
getWidth());
1537 int sublaneCompact =
MAX2(iMin, rightmostOnEdge - 1);
1543 const double maxLatDist = leftMax - leftVehSide;
1544 const double minLatDist = rightMin - rightVehSide;
1545 const int iStart = laneOffset == 0 ? iMin : 0;
1546 const double rightEnd = laneOffset == 0 ? leftMax : (checkOpposite ?
getLeftBorder() : edge.
getWidth());
1547#ifdef DEBUG_WANTSCHANGE
1549 <<
" checking sublanes rightmostOnEdge=" << rightmostOnEdge
1550 <<
" rightEnd=" << rightEnd
1551 <<
" leftmostOnEdge=" << leftmostOnEdge
1552 <<
" iStart=" << iStart
1554 <<
" sublaneSides=" << sublaneSides.size()
1555 <<
" leftMax=" << leftMax
1556 <<
" minLatDist=" << minLatDist
1557 <<
" maxLatDist=" << maxLatDist
1558 <<
" sublaneCompact=" << sublaneCompact
1561 for (
int i = iStart; i < (int)sublaneSides.size(); ++i) {
1562 if (sublaneSides[i] + vehWidth < rightEnd) {
1568 while (vMin > 0 && j < (
int)sublaneSides.size() && sublaneSides[j] < sublaneSides[i] + vehWidth) {
1570#ifdef DEBUG_WANTSCHANGE
1578 if (laneOffset != 0 &&
overlap(sublaneSides[i], sublaneSides[i] + vehWidth, laneBoundary, laneBoundary)) {
1582 double currentLatDist = sublaneSides[i] - rightVehSide;
1583 if ((laneOffset == 0 && (currentLatDist > maxLatDist || currentLatDist < minLatDist))
1584 || (laneOffset < 0 && currentLatDist > maxLatDist)
1585 || (laneOffset > 0 && currentLatDist < minLatDist)) {
1586#ifdef DEBUG_WANTSCHANGE
1588 std::cout <<
" i=" << i <<
" currentLatDist=" << currentLatDist <<
" outOfBounds\n";
1593 currentLatDist =
MIN2(
MAX2(currentLatDist, minLatDist), maxLatDist);
1597 relativeGain *= 0.5;
1600 if (relativeGain > maxGain && currentLatDist * laneOffset >= 0) {
1601 maxGain = relativeGain;
1604 latDist = currentLatDist;
1605#ifdef DEBUG_WANTSCHANGE
1607 std::cout <<
" i=" << i <<
" vMin=" << vMin <<
" newLatDist=" << latDist <<
" relGain=" << relativeGain <<
"\n";
1613 if (currentLatDist > 0
1617 && maxGain - relativeGain < NUMERICAL_EPS) {
1618 latDist = currentLatDist;
1621#ifdef DEBUG_WANTSCHANGE
1623 std::cout <<
" i=" << i <<
" rightmostOnEdge=" << rightmostOnEdge <<
" vMin=" << vMin <<
" relGain=" << relativeGain <<
" sublaneCompact=" << sublaneCompact <<
" curLatDist=" << currentLatDist <<
"\n";
1627 maxGainRight =
MAX2(maxGainRight, relativeGain);
1629 maxGainLeft =
MAX2(maxGainLeft, relativeGain);
1631 const double subAlignDist = sublaneSides[i] - rightVehSide;
1632 if (fabs(subAlignDist) < fabs(latDistNice)) {
1633 latDistNice = subAlignDist;
1634#ifdef DEBUG_WANTSCHANGE
1636 <<
" nicest sublane=" << i
1637 <<
" side=" << sublaneSides[i]
1638 <<
" rightSide=" << rightVehSide
1639 <<
" latDistNice=" << latDistNice
1640 <<
" maxGainR=" << (maxGainRight == -std::numeric_limits<double>::max() ?
"n/a" :
toString(maxGainRight))
1641 <<
" maxGainL=" << (maxGainLeft == -std::numeric_limits<double>::max() ?
"n/a" :
toString(maxGainLeft))
1648 if (maxGainRight != -std::numeric_limits<double>::max()) {
1649#ifdef DEBUG_WANTSCHANGE
1655#ifdef DEBUG_WANTSCHANGE
1661 if (maxGainLeft != -std::numeric_limits<double>::max()) {
1662#ifdef DEBUG_WANTSCHANGE
1668#ifdef DEBUG_WANTSCHANGE
1675 if ((fabs(maxGainRight) < NUMERICAL_EPS || maxGainRight == -std::numeric_limits<double>::max())
1676 && (right || (alternatives &
LCA_RIGHT) == 0)) {
1679 if ((fabs(maxGainLeft) < NUMERICAL_EPS || maxGainLeft == -std::numeric_limits<double>::max())
1680 && (left || (alternatives &
LCA_LEFT) == 0)) {
1685#ifdef DEBUG_WANTSCHANGE
1688 <<
" defaultNextSpeed=" << defaultNextSpeed
1689 <<
" maxGain=" << maxGain
1690 <<
" maxGainRight=" << maxGainRight
1691 <<
" maxGainLeft=" << maxGainLeft
1694 <<
" latDist=" << latDist
1695 <<
" latDistNice=" << latDistNice
1696 <<
" sublaneCompact=" << sublaneCompact
1709 double acceptanceTime;
1718 double minFactor = 1.0;
1719 for (
int i = 0; i < followers.
numSublanes(); ++i) {
1721 if (follower.first !=
nullptr && follower.second < 2 * follower.first->getCarFollowModel().brakeGap(follower.first->getSpeed())) {
1724 const double fRSF = follower.first->getLane()->getVehicleMaxSpeed(follower.first) / follower.first->getLane()->getSpeedLimit();
1725 if (fRSF > roadSpeedFactor) {
1728 if (factor < minFactor) {
1734 acceptanceTime *= minFactor;
1738 double fullSpeedDrivingSeconds =
MIN2(acceptanceTime, fullSpeedGap / vMax);
1740 if (neighLead.first != 0 && neighLead.first->getSpeed() < vMax) {
1741 fullSpeedGap =
MAX2(0.,
MIN2(fullSpeedGap,
1743 vMax, neighLead.first->
getSpeed(), neighLead.first->getCarFollowModel().getMaxDecel())));
1744 fullSpeedDrivingSeconds =
MIN2(fullSpeedDrivingSeconds, fullSpeedGap / (vMax - neighLead.first->getSpeed()));
1753#ifdef DEBUG_WANTSCHANGE
1756 <<
" considering keepRight:"
1758 <<
" neighDist=" << neighDist
1760 <<
" leaderSpeed=" << (neighLead.first == 0 ? -1 : neighLead.first->getSpeed())
1762 myVehicle.
getSpeed(), neighLead.first->getSpeed(), neighLead.first->getCarFollowModel().getMaxDecel()))
1763 <<
" acceptanceTime=" << acceptanceTime
1764 <<
" fullSpeedGap=" << fullSpeedGap
1765 <<
" fullSpeedDrivingSeconds=" << fullSpeedDrivingSeconds
1766 <<
" dProb=" << deltaProb
1767 <<
" isSlide=" << isSlide
1778 latDist = latLaneDist;
1779 maneuverDist = latLaneDist;
1780 blocked =
checkBlocking(neighLane, latDist, maneuverDist, laneOffset,
1781 leaders, followers, blockers,
1782 neighLeaders, neighFollowers, neighBlockers);
1785 ret &= ~LCA_KEEPRIGHT;
1791#ifdef DEBUG_WANTSCHANGE
1796 <<
" neighDist=" << neighDist
1800 <<
" latDist=" << latDist
1810 int blockedFully = 0;
1811 maneuverDist = latDist;
1812 blocked =
checkBlocking(neighLane, latDist, maneuverDist, laneOffset,
1813 leaders, followers, blockers,
1814 neighLeaders, neighFollowers, neighBlockers,
1815 nullptr,
nullptr,
false, 0, &blockedFully);
1821 ret &= ~LCA_SPEEDGAIN;
1828#ifdef DEBUG_WANTSCHANGE
1833 <<
" latDist=" << latDist
1834 <<
" neighDist=" << neighDist
1837 <<
" stayInLane=" << stayInLane
1848 int blockedFully = 0;
1849 maneuverDist = latDist;
1850 blocked =
checkBlocking(neighLane, latDist, maneuverDist, laneOffset,
1851 leaders, followers, blockers,
1852 neighLeaders, neighFollowers, neighBlockers,
1853 nullptr,
nullptr,
false, 0, &blockedFully);
1858 ret &= ~LCA_SPEEDGAIN;
1863 double latDistSublane = 0.;
1865 const double halfVehWidth =
getWidth() * 0.5;
1868 && bestLaneOffset == 0
1888#ifdef DEBUG_WANTSCHANGE
1899 latDistSublane = -halfLaneWidth + halfVehWidth -
getPosLat();
1902 latDistSublane = halfLaneWidth - halfVehWidth -
getPosLat();
1909 latDistSublane = latDistNice;
1912 latDistSublane = sublaneSides[sublaneCompact] - rightVehSide;
1918 if (fabs(posLat) > hLW) {
1921 latDistSublane -= (posLat - hLW);
1923 latDistSublane += (-posLat - hLW);
1928 if (rightVehSide < 0) {
1929 latDistSublane -= rightVehSide;
1930 }
else if (leftVehSide > edgeWidth) {
1931 latDistSublane -= leftVehSide - edgeWidth;
1950 latDistSublane * latDist > 0) {
1952#if defined(DEBUG_WANTSCHANGE) || defined(DEBUG_STATE) || defined(DEBUG_MANEUVER)
1957 <<
" latDist=" << latDist
1958 <<
" latDistSublane=" << latDistSublane
1959 <<
" relGainSublane=" <<
computeSpeedGain(latDistSublane, defaultNextSpeed)
1960 <<
" maneuverDist=" << maneuverDist
1972#if defined(DEBUG_WANTSCHANGE)
1974 <<
" speedGain=" <<
computeSpeedGain(latDistSublane, defaultNextSpeed) <<
")\n";
1982#if defined(DEBUG_WANTSCHANGE)
1984 std::cout <<
" aborting sublane change due to prior maneuver\n";
1989 latDist = latDistSublane * (
isOpposite() ? -1 : 1);
1994#ifdef DEBUG_WANTSCHANGE
1997 <<
" latDist=" << latDist
2005#ifdef DEBUG_WANTSCHANGE
2011 maneuverDist = latDist;
2012 blocked =
checkBlocking(neighLane, latDist, maneuverDist, laneOffset,
2013 leaders, followers, blockers,
2014 neighLeaders, neighFollowers, neighBlockers);
2017 ret &= ~LCA_SUBLANE;
2043#ifdef DEBUG_WANTSCHANGE
2060 if ((*blocked) !=
nullptr) {
2062#ifdef DEBUG_SLOWDOWN
2071 if (gap > POSITION_EPS) {
2085 (gap - POSITION_EPS), (*blocked)->getSpeed(),
2086 (*blocked)->getCarFollowModel().getMaxDecel()),
false);
2104 if (cand !=
nullptr && cand->getBidiLane() == lane) {
2117 const MSLink* link = next !=
nullptr ? lane->
getLinkTo(next) :
nullptr;
2121 assert(preb.size() == lanes.size() ||
isOpposite());
2122#ifdef DEBUG_EXPECTED_SLSPEED
2125 <<
" sublaneOffset=" << sublaneOffset <<
" laneIndex=" << laneIndex <<
" lane=" << lane->
getID() <<
" ahead=" << ahead.
toString() <<
"\n";
2129 for (
int sublane = 0; sublane < (int)ahead.
numSublanes(); ++sublane) {
2130 const int edgeSublane = sublane + sublaneOffset;
2138#ifdef DEBUG_EXPECTED_SLSPEED
2140 std::cout <<
" updateExpectedSublaneSpeeds sublane=" << sublane <<
" doesNotContinue\n";
2147 const MSVehicle* leader = ahead[sublane].first;
2148 const double gap = ahead[sublane].second;
2150 if (leader ==
nullptr) {
2155 const int prebIndex =
isOpposite() ? (int)preb.size() - 1 : laneIndex;
2166#ifdef DEBUG_EXPECTED_SLSPEED
2168 std::cout <<
SIMTIME <<
" updateExpectedSublaneSpeeds sublane=" << sublane <<
" leader=" << leader->
getID() <<
" bidi=" << bidi->
getID() <<
" gap=" << gap <<
" vSafe=" << vSafe <<
"\n";
2178#ifdef DEBUG_EXPECTED_SLSPEED
2180 std::cout <<
" updateExpectedSublaneSpeeds edgeSublane=" << edgeSublane <<
" leader=" << leader->
getID() <<
" gap=" << gap <<
" vSafe=" << vSafe <<
"\n";
2189 double foeRight, foeLeft;
2193 if (pedLeader.first != 0) {
2198#ifdef DEBUG_EXPECTED_SLSPEED
2200 std::cout <<
" updateExpectedSublaneSpeeds edgeSublane=" << edgeSublane <<
" pedLeader=" << pedLeader.first->getID() <<
" gap=" << pedGap <<
" vSafe=" << vSafe <<
"\n";
2208 double foeRight, foeLeft;
2210 const double foeRightBidi = bidi->
getWidth() - foeLeft;
2211 const double foeLeftBidi = bidi->
getWidth() - foeRight;
2216 if (pedLeader.first != 0) {
2221#ifdef DEBUG_EXPECTED_SLSPEED
2223 std::cout <<
" updateExpectedSublaneSpeeds edgeSublane=" << edgeSublane <<
" pedLeader=" << pedLeader.first->getID() <<
" (bidi) gap=" << pedGap <<
" vSafe=" << vSafe <<
"\n";
2228 vSafe =
MIN2(vMax, vSafe);
2235#ifdef DEBUG_EXPECTED_SLSPEED
2237 std::cout <<
" updateExpectedSublaneSpeeds edgeSublane=" << edgeSublane <<
" lane " << lane->
getID() <<
" forbidden\n";
2249 return ((side < -NUMERICAL_EPS
2258 const double deltaV = vMax - vLeader;
2259 if (deltaV > 0 && gap / deltaV < mySpeedGainLookahead && mySpeedGainLookahead > 0) {
2263 const double gapClosingTime =
MAX2(0.0, gap / deltaV);
2264 const double vSafe2 = (gapClosingTime * vSafe + (foreCastTime - gapClosingTime) * vLeader) / foreCastTime;
2265#ifdef DEBUG_EXPECTED_SLSPEED
2267 std::cout <<
" foreCastTime=" << foreCastTime <<
" gapClosingTime=" << gapClosingTime <<
" extrapolated vSafe=" << vSafe2 <<
"\n";
2278 double result = std::numeric_limits<double>::max();
2280 const double vehWidth =
getWidth();
2282 const double leftVehSide = rightVehSide + vehWidth;
2283 for (
int i = 0; i < (int)sublaneSides.size(); ++i) {
2285 if (
overlap(rightVehSide, leftVehSide, sublaneSides[i], leftSide)) {
2290 return result - defaultNextSpeed;
2297 double maxLength = -1;
2308 return iMax >= 0 ? ldi[iMax] : std::make_pair(
nullptr, -1);
2325 double minSpeed = std::numeric_limits<double>::max();
2327 if (ldi[i].first != 0) {
2328 const double speed = ldi[i].first->getSpeed();
2329 if (speed < minSpeed) {
2347 std::vector<CLeaderDist>* collectLeadBlockers,
2348 std::vector<CLeaderDist>* collectFollowBlockers,
2349 bool keepLatGapManeuver,
2351 int* retBlockedFully) {
2354 latDist =
MAX2(
MIN2(latDist, maxDist), -maxDist);
2363 if (laneOffset != 0) {
2374 if (laneOffset != 0) {
2378#ifdef DEBUG_BLOCKING
2390 }
else if (!forcedTraCIChange) {
2396 }
else if (!forcedTraCIChange) {
2402#ifdef DEBUG_BLOCKING
2404 std::cout <<
" checkBlocking latDist=" << latDist <<
" maneuverDist=" << maneuverDist <<
"\n";
2418 if (laneOffset != 0) {
2425 int blockedFully = 0;
2430 if (laneOffset != 0) {
2436 if (retBlockedFully !=
nullptr) {
2437 *retBlockedFully = blockedFully;
2439#ifdef DEBUG_BLOCKING
2442 <<
" canChangeFully=" <<
myCanChangeFully <<
" keepLatGapManeuver=" << keepLatGapManeuver <<
"\n";
2450 blocked |= blockedFully;
2455#ifdef DEBUG_BLOCKING
2460 if (collectFollowBlockers !=
nullptr && collectLeadBlockers !=
nullptr) {
2462 for (std::vector<CLeaderDist>::const_iterator it2 = collectLeadBlockers->begin(); it2 != collectLeadBlockers->end(); ++it2) {
2463 for (std::vector<CLeaderDist>::iterator it = collectFollowBlockers->begin(); it != collectFollowBlockers->end();) {
2464 if ((*it2).first == (*it).first) {
2465#ifdef DEBUG_BLOCKING
2467 std::cout <<
" removed follower " << (*it).first->getID() <<
" because it is already a leader\n";
2470 it = collectFollowBlockers->erase(it);
2484 int laneOffset,
double latDist,
double foeOffset,
bool leaders,
2485 double& safeLatGapRight,
double& safeLatGapLeft,
2486 std::vector<CLeaderDist>* collectBlockers)
const {
2493 const double vehWidth =
getWidth();
2495 const double leftVehSide = rightVehSide + vehWidth;
2496 const double rightVehSideDest = rightVehSide + latDist;
2497 const double leftVehSideDest = leftVehSide + latDist;
2498 const double rightNoOverlap =
MIN2(rightVehSideDest, rightVehSide);
2499 const double leftNoOverlap =
MAX2(leftVehSideDest, leftVehSide);
2500#ifdef DEBUG_BLOCKING
2502 std::cout <<
" checkBlockingVehicles"
2503 <<
" laneOffset=" << laneOffset
2504 <<
" latDist=" << latDist
2505 <<
" foeOffset=" << foeOffset
2506 <<
" vehRight=" << rightVehSide
2507 <<
" vehLeft=" << leftVehSide
2508 <<
" rightNoOverlap=" << rightNoOverlap
2509 <<
" leftNoOverlap=" << leftNoOverlap
2510 <<
" destRight=" << rightVehSideDest
2511 <<
" destLeft=" << leftVehSideDest
2512 <<
" leaders=" << leaders
2518 for (
int i = 0; i < vehicles.
numSublanes(); ++i) {
2520 if (vehDist.first != 0 &&
myCFRelated.count(vehDist.first) == 0) {
2521 const MSVehicle* leader = vehDist.first;
2527 double foeRight, foeLeft;
2529 const bool overlapBefore =
overlap(rightVehSide, leftVehSide, foeRight, foeLeft);
2530 const bool overlapDest =
overlap(rightVehSideDest, leftVehSideDest, foeRight, foeLeft);
2531 const bool overlapAny =
overlap(rightNoOverlap, leftNoOverlap, foeRight, foeLeft);
2532#ifdef DEBUG_BLOCKING
2534 std::cout <<
" foe=" << vehDist.first->getID()
2535 <<
" gap=" << vehDist.second
2537 <<
" foeRight=" << foeRight
2538 <<
" foeLeft=" << foeLeft
2539 <<
" overlapBefore=" << overlapBefore
2540 <<
" overlap=" << overlapAny
2541 <<
" overlapDest=" << overlapDest
2546 if (vehDist.second < 0) {
2547 if (overlapBefore && !overlapDest && !
outsideEdge()) {
2548#ifdef DEBUG_BLOCKING
2550 std::cout <<
" ignoring current overlap to come clear\n";
2554#ifdef DEBUG_BLOCKING
2560 if (collectBlockers ==
nullptr) {
2563 collectBlockers->push_back(vehDist);
2579 const double expectedGap =
MSCFModel::gapExtrapolation(timeTillAction, vehDist.second, leader->
getSpeed(), follower->
getSpeed(), leaderAccel, followerAccel, std::numeric_limits<double>::max(), std::numeric_limits<double>::max());
2582 const double followerExpectedSpeed = follower->
getSpeed() + timeTillAction * followerAccel;
2583 const double leaderExpectedSpeed =
MAX2(0., leader->
getSpeed() + timeTillAction * leaderAccel);
2586#if defined(DEBUG_ACTIONSTEPS) && defined(DEBUG_BLOCKING)
2588 std::cout <<
" timeTillAction=" << timeTillAction
2589 <<
" followerAccel=" << followerAccel
2590 <<
" followerExpectedSpeed=" << followerExpectedSpeed
2591 <<
" leaderAccel=" << leaderAccel
2592 <<
" leaderExpectedSpeed=" << leaderExpectedSpeed
2593 <<
"\n gap=" << vehDist.second
2594 <<
" gapChange=" << (expectedGap - vehDist.second)
2595 <<
" expectedGap=" << expectedGap
2596 <<
" expectedSecureGap=" << expectedSecureGap
2597 <<
" safeLatGapLeft=" << safeLatGapLeft
2598 <<
" safeLatGapRight=" << safeLatGapRight
2605 if (expectedGap < secureGap2) {
2607 if (foeRight > leftVehSide) {
2608 safeLatGapLeft =
MIN2(safeLatGapLeft, foeRight - leftVehSide);
2609 }
else if (foeLeft < rightVehSide) {
2610 safeLatGapRight =
MIN2(safeLatGapRight, rightVehSide - foeLeft);
2613#ifdef DEBUG_BLOCKING
2615 std::cout <<
" blocked by " << vehDist.first->getID() <<
" gap=" << vehDist.second <<
" expectedGap=" << expectedGap
2616 <<
" expectedSecureGap=" << expectedSecureGap <<
" secGap2=" << secureGap2 <<
" safetyFactor=" <<
getSafetyFactor()
2617 <<
" safeLatGapLeft=" << safeLatGapLeft <<
" safeLatGapRight=" << safeLatGapRight
2621 result |= blockType;
2622 if (collectBlockers ==
nullptr) {
2625#ifdef DEBUG_BLOCKING
2626 }
else if (
gDebugFlag2 && expectedGap < expectedSecureGap) {
2627 std::cout <<
" ignore blocker " << vehDist.first->getID() <<
" gap=" << vehDist.second <<
" expectedGap=" << expectedGap
2628 <<
" expectedSecureGap=" << expectedSecureGap <<
" secGap2=" << secureGap2 <<
" safetyFactor=" <<
getSafetyFactor() <<
"\n";
2631 if (collectBlockers !=
nullptr) {
2634 collectBlockers->push_back(vehDist);
2651 const double leftVehSide = rightVehSide + vehWidth;
2652#ifdef DEBUG_BLOCKING
2654 std::cout <<
" updateCFRelated foeOffset=" << foeOffset <<
" vehicles=" << vehicles.
toString() <<
"\n";
2657 for (
int i = 0; i < vehicles.
numSublanes(); ++i) {
2659 if (vehDist.first != 0 && (
myCFRelated.count(vehDist.first) == 0 || vehDist.second < 0)) {
2660 double foeRight, foeLeft;
2662#ifdef DEBUG_BLOCKING
2664 std::cout <<
" foe=" << vehDist.first->getID() <<
" gap=" << vehDist.second
2666 <<
" foeOffset=" << foeOffset
2667 <<
" egoR=" << rightVehSide <<
" egoL=" << leftVehSide
2668 <<
" iR=" << foeRight <<
" iL=" << foeLeft
2674 if (
overlap(rightVehSide, leftVehSide, foeRight, foeLeft) && !
outsideEdge() && (vehDist.second >= 0
2680 && -vehDist.second < vehDist.first->getVehicleType().getMinGap()
2683#ifdef DEBUG_BLOCKING
2685 std::cout <<
" ignoring cfrelated foe=" << vehDist.first->getID() <<
"\n";
2690 const int erased = (int)
myCFRelated.erase(vehDist.first);
2691#ifdef DEBUG_BLOCKING
2693 std::cout <<
" restoring cfrelated foe=" << vehDist.first->getID() <<
"\n";
2706 assert(right <= left);
2707 assert(right2 <= left2);
2708 return left2 >= right + NUMERICAL_EPS && left >= right2 + NUMERICAL_EPS;
2729 return changeReason;
2736 if (sd1.
state == 0) {
2738 }
else if (sd2.
state == 0) {
2748#ifdef DEBUG_DECISION
2754 <<
" dir1=" << sd1.
dir
2758 <<
" dir2=" << sd2.
dir
2774 if (reason1 < reason2) {
2776 return (!can1 && can2 && sd1.
sameDirection(sd2)) ? sd2 : sd1;
2778 }
else if (reason1 > reason2) {
2780 return (!can2 && can1 && sd1.
sameDirection(sd2)) ? sd1 : sd2;
2788 }
else if (sd2.
dir == 0) {
2793 assert(sd1.
dir == -1);
2794 assert(sd2.
dir == 1);
2797 }
else if (sd2.
latDist >= 0) {
2853 double& currentDist,
2856 double roundaboutBonus,
2861 const bool right = (laneOffset == -1);
2862 const bool left = (laneOffset == 1);
2865 if (laneOffset != 0) {
2871 const double neighLeftPlace =
MAX2(0., neighDist - forwardPos - maxJam);
2875#ifdef DEBUG_STRATEGIC_CHANGE
2879 <<
" forwardPos=" << forwardPos
2881 <<
" laDist=" << laDist
2882 <<
" currentDist=" << currentDist
2883 <<
" usableDist=" << usableDist
2884 <<
" bestLaneOffset=" << bestLaneOffset
2885 <<
" best.length=" << best.
length
2886 <<
" maxJam=" << maxJam
2887 <<
" neighLeftPlace=" << neighLeftPlace
2894 if (laneOffset == 0) {
2901#ifdef DEBUG_STRATEGIC_CHANGE
2903 std::cout <<
SIMTIME <<
" returnToLaneBounds\n";
2912 if (link !=
nullptr &&
getWidth() < next->
getWidth() && distOnLane < 100) {
2918 latDist = -rightVehSide;
2921#ifdef DEBUG_STRATEGIC_CHANGE
2928 latDist = -(leftVehSide - next->
getWidth());
2931#ifdef DEBUG_STRATEGIC_CHANGE
2940 }
else if (laneOffset != 0 && changeToBest && bestLaneOffset == curr.
bestLaneOffset
2943 if (!
mustOvertakeStopped(
false, neighLane, neighLeaders, leaders, forwardPos, neighDist, right, latLaneDist, currentDist, latDist)) {
2944 latDist = latLaneDist;
2946#ifdef DEBUG_STRATEGIC_CHANGE
2948 std::cout <<
SIMTIME <<
" mustChangeToBest\n";
2952#ifdef DEBUG_STRATEGIC_CHANGE
2954 std::cout <<
" veh=" <<
myVehicle.
getID() <<
" avoidStoppedNeigh\n";
2973#ifdef DEBUG_STRATEGIC_CHANGE
2976 <<
" avoid overtaking on the right nv=" << nv->
getID()
2988 if (laneOffset != 0 &&
myStrategicParam >= 0 && noOpposites &&
mustOvertakeStopped(
true, neighLane, leaders, neighLeaders, forwardPos, neighDist, right, latLaneDist, currentDist, latDist)) {
2989#ifdef DEBUG_STRATEGIC_CHANGE
2991 std::cout <<
" veh=" <<
myVehicle.
getID() <<
" mustOvertakeStopped\n";
3000 }
else if (!changeToBest && (
currentDistDisallows(neighLeftPlace, abs(bestLaneOffset) + 2, laDist))) {
3007#ifdef DEBUG_STRATEGIC_CHANGE
3009 std::cout <<
" veh=" <<
myVehicle.
getID() <<
" could not change back and forth in time (1) neighLeftPlace=" << neighLeftPlace <<
"\n";
3015 && bestLaneOffset == 0
3018 && roundaboutBonus == 0
3025#ifdef DEBUG_STRATEGIC_CHANGE
3027 std::cout <<
" veh=" <<
myVehicle.
getID() <<
" does not want to leave the bestLane (neighDist=" << neighDist <<
")\n";
3032 && bestLaneOffset == 0
3038#ifdef DEBUG_STRATEGIC_CHANGE
3040 std::cout <<
" veh=" <<
myVehicle.
getID() <<
" does not want to get stranded on the on-ramp of a highway\n";
3054 MSLane* shadowPrev =
nullptr;
3056 if (*it ==
nullptr) {
3060 if (shadow ==
nullptr || currentShadowDist >= requiredDist) {
3063 if (shadowPrev !=
nullptr) {
3066 currentShadowDist += shadow->
getLength();
3067 shadowPrev = shadow;
3068#ifdef DEBUG_STRATEGIC_CHANGE
3070 std::cout <<
" shadow=" << shadow->
getID() <<
" currentShadowDist=" << currentShadowDist <<
"\n";
3074#ifdef DEBUG_STRATEGIC_CHANGE
3076 std::cout <<
" veh=" <<
myVehicle.
getID() <<
" currentShadowDist=" << currentShadowDist <<
" requiredDist=" << requiredDist <<
" overlap=" <<
overlap <<
"\n";
3079 if (currentShadowDist < requiredDist && currentShadowDist < usableDist) {
3082#ifdef DEBUG_STRATEGIC_CHANGE
3084 std::cout <<
" must change for shadowLane end latDist=" << latDist <<
" myLeftSpace=" <<
myLeftSpace <<
"\n";
3092#if defined(DEBUG_STRATEGIC_CHANGE) || defined(DEBUG_TRACI)
3104 }
else if (((retTraCI &
LCA_RIGHT) != 0 && laneOffset < 0)
3105 || ((retTraCI &
LCA_LEFT) != 0 && laneOffset > 0)) {
3107 latDist = latLaneDist;
3110#if defined(DEBUG_STRATEGIC_CHANGE) || defined(DEBUG_TRACI)
3121 double posOnLane,
double neighDist,
bool right,
double latLaneDist,
double& currentDist,
double& latDist) {
3122 bool mustOvertake =
false;
3127 const int dir = latLaneDist < 0 ? -1 : 1;
3131 if (curHasStopped) {
3133 for (
int i = rightmost; i <= leftmost; i++) {
3137 const double remaining =
MIN2(neighDist, currentDist) - posOnLane;
3138#ifdef DEBUG_STRATEGIC_CHANGE
3140 std::cout <<
" overtakeDist=" << overtakeDist <<
" remaining=" << remaining
3142 <<
" hasLaneBeyond=" << hasLaneBeyond
3147 remaining > overtakeDist
3149 && (!checkCurrent || !checkOverTakeRight || !right)
3158 latDist = latLaneDist;
3159 mustOvertake =
true;
3160#ifdef DEBUG_STRATEGIC_CHANGE
3162 std::cout <<
" veh=" <<
myVehicle.
getID() <<
" overtake stopped leader=" << leader.first->getID()
3163 <<
" newCurrentDist=" << currentDist
3164 <<
" overtakeDist=" << overtakeDist
3165 <<
" remaining=" << remaining
3181 mustOvertake =
true;
3182 if (i >= rightmost && i <= leftmost) {
3189 return mustOvertake;
3210 double& maneuverDist,
3246 const double oldLatDist = latDist;
3247 const double oldManeuverDist = maneuverDist;
3252 const double halfWidth =
getWidth() * 0.5;
3258 double surplusGapRight = oldCenter - halfWidth;
3259 double surplusGapLeft =
getLeftBorder(laneOffset != 0) - oldCenter - halfWidth;
3260 const bool stayInLane = (laneOffset == 0
3264 && (surplusGapLeft >= 0 && surplusGapRight >= 0)));
3267 std::swap(surplusGapLeft, surplusGapRight);
3269#ifdef DEBUG_KEEP_LATGAP
3271 std::cout <<
"\n " <<
SIMTIME <<
" keepLatGap() laneOffset=" << laneOffset
3272 <<
" latDist=" << latDist
3273 <<
" maneuverDist=" << maneuverDist
3277 <<
" gapFactor=" << gapFactor
3278 <<
" stayInLane=" << stayInLane <<
"\n"
3279 <<
" stayInEdge: surplusGapRight=" << surplusGapRight <<
" surplusGapLeft=" << surplusGapLeft <<
"\n";
3283 if (surplusGapLeft < 0 || surplusGapRight < 0) {
3293 if (laneOffset != 0) {
3296 updateGaps(neighLeaders, neighRight, oldCenter, gapFactor, surplusGapRight, surplusGapLeft,
true);
3297 updateGaps(neighFollowers, neighRight, oldCenter, gapFactor, surplusGapRight, surplusGapLeft,
true, netOverlap);
3299#ifdef DEBUG_KEEP_LATGAP
3301 std::cout <<
" minGapLat: surplusGapRight=" << surplusGapRight <<
" surplusGapLeft=" << surplusGapLeft <<
"\n"
3311 if (stayInLane || laneOffset == 1) {
3314 surplusGapRight =
MIN2(surplusGapRight,
MAX2(0.0, halfLaneWidth + posLat - halfWidth));
3315 physicalGapRight =
MIN2(physicalGapRight,
MAX2(0.0, halfLaneWidth + posLat - halfWidth));
3317 if (stayInLane || laneOffset == -1) {
3320 surplusGapLeft =
MIN2(surplusGapLeft,
MAX2(0.0, halfLaneWidth - posLat - halfWidth));
3321 physicalGapLeft =
MIN2(physicalGapLeft,
MAX2(0.0, halfLaneWidth - posLat - halfWidth));
3323#ifdef DEBUG_KEEP_LATGAP
3325 std::cout <<
" stayInLane: surplusGapRight=" << surplusGapRight <<
" surplusGapLeft=" << surplusGapLeft <<
"\n";
3329 if (surplusGapRight + surplusGapLeft < 0) {
3334 const double equalDeficit = 0.5 * (surplusGapLeft + surplusGapRight);
3335 if (surplusGapRight < surplusGapLeft) {
3337 const double delta =
MIN2(equalDeficit - surplusGapRight, physicalGapLeft);
3339 maneuverDist = delta;
3340#ifdef DEBUG_KEEP_LATGAP
3342 std::cout <<
" insufficient latSpace, move left: delta=" << delta <<
"\n";
3347 const double delta =
MIN2(equalDeficit - surplusGapLeft, physicalGapRight);
3349 maneuverDist = -delta;
3350#ifdef DEBUG_KEEP_LATGAP
3352 std::cout <<
" insufficient latSpace, move right: delta=" << delta <<
"\n";
3358 latDist =
MAX2(
MIN2(latDist, surplusGapLeft), -surplusGapRight);
3359 maneuverDist =
MAX2(
MIN2(maneuverDist, surplusGapLeft), -surplusGapRight);
3360 if ((state &
LCA_KEEPRIGHT) != 0 && maneuverDist != oldManeuverDist) {
3362 latDist = oldLatDist;
3363 maneuverDist = oldManeuverDist;
3365#ifdef DEBUG_KEEP_LATGAP
3367 std::cout <<
" adapted latDist=" << latDist <<
" maneuverDist=" << maneuverDist <<
" (old=" << oldLatDist <<
")\n";
3382#ifdef DEBUG_KEEP_LATGAP
3384 std::cout <<
" traci influenced latDist=" << latDist <<
"\n";
3390 const bool traciChange = ((state | traciState) &
LCA_TRACI) != 0;
3391 if (nonSublaneChange && !traciChange) {
3393#ifdef DEBUG_KEEP_LATGAP
3395 std::cout <<
" wanted changeToLeft oldLatDist=" << oldLatDist <<
", blocked latGap changeToRight\n";
3398 latDist = oldLatDist;
3401#ifdef DEBUG_KEEP_LATGAP
3403 std::cout <<
" wanted changeToRight oldLatDist=" << oldLatDist <<
", blocked latGap changeToLeft\n";
3406 latDist = oldLatDist;
3416#ifdef DEBUG_KEEP_LATGAP
3418 std::cout <<
" latDistUpdated=" << latDist <<
" oldLatDist=" << oldLatDist <<
"\n";
3421 blocked =
checkBlocking(neighLane, latDist, maneuverDist, laneOffset, leaders, followers, blockers, neighLeaders, neighFollowers, neighBlockers,
nullptr,
nullptr, nonSublaneChange);
3424 state = (state & ~LCA_STAY);
3435#if defined(DEBUG_KEEP_LATGAP) || defined(DEBUG_STATE)
3437 std::cout <<
" latDist2=" << latDist
3451 double& surplusGapRight,
double& surplusGapLeft,
3452 bool saveMinGap,
double netOverlap,
3454 std::vector<CLeaderDist>* collectBlockers) {
3456 const double halfWidth =
getWidth() * 0.5 + NUMERICAL_EPS;
3459 if (others[i].first != 0 && others[i].second <= 0
3461 && (netOverlap == 0 || others[i].second + others[i].first->getVehicleType().getMinGap() < netOverlap)) {
3465 double foeRight, foeLeft;
3467 const double foeCenter = foeRight + 0.5 * res;
3468 const double gap =
MIN2(fabs(foeRight - oldCenter), fabs(foeLeft - oldCenter)) - halfWidth;
3471 const double currentMinGap = desiredMinGap * gapFactor;
3482#if defined(DEBUG_BLOCKING) || defined(DEBUG_KEEP_LATGAP)
3484 std::cout <<
" updateGaps"
3486 <<
" foe=" << foe->
getID()
3487 <<
" foeRight=" << foeRight
3488 <<
" foeLeft=" << foeLeft
3489 <<
" oldCenter=" << oldCenter
3490 <<
" gap=" << others[i].second
3491 <<
" latgap=" << gap
3492 <<
" currentMinGap=" << currentMinGap
3493 <<
" surplusGapRight=" << surplusGapRight
3494 <<
" surplusGapLeft=" << surplusGapLeft
3502 if (foeCenter < oldCenter) {
3504 surplusGapRight =
MIN3(surplusGapRight, gap - currentMinGap,
MAX2(currentMinGap, gap - foeManeuverDist));
3507 surplusGapLeft =
MIN3(surplusGapLeft, gap - currentMinGap,
MAX2(currentMinGap, gap - foeManeuverDist));
3510 if (foeCenter < oldCenter) {
3511#if defined(DEBUG_BLOCKING) || defined(DEBUG_KEEP_LATGAP)
3513 std::cout <<
" new minimum rightGap=" << gap <<
"\n";
3518#if defined(DEBUG_BLOCKING) || defined(DEBUG_KEEP_LATGAP)
3520 std::cout <<
" new minimum leftGap=" << gap <<
"\n";
3526 if (collectBlockers !=
nullptr) {
3528 if ((foeCenter < oldCenter && latDist < 0 && gap < (desiredMinGap - latDist))
3529 || (foeCenter > oldCenter && latDist > 0 && gap < (desiredMinGap + latDist))) {
3530 collectBlockers->push_back(others[i]);
3547 int currentDirection =
mySpeedLat >= 0 ? 1 : -1;
3548 int directionWish = latDist >= 0 ? 1 : -1;
3555 maxSpeedLat =
MIN2(maxSpeedLat, speedBound);
3559 maxSpeedLat =
MAX2(maxSpeedLat, speedBound);
3568 accelLat =
MAX2(accelLat, 2 * edgeOverlap);
3569 maxSpeedLat =
MAX2(maxSpeedLat, edgeOverlap);
3572#ifdef DEBUG_MANEUVER
3576 <<
" computeSpeedLat()"
3577 <<
" latDist=" << latDist
3578 <<
" maneuverDist=" << maneuverDist
3579 <<
" urgent=" << urgent
3581 <<
" currentDirection=" << currentDirection
3582 <<
" directionWish=" << directionWish
3584 <<
" maxSpeedLat=" << maxSpeedLat
3590 if (directionWish == 1) {
3604 if (maneuverDist * latDist > 0) {
3605 maneuverDist = fullLatDist;
3608#ifdef DEBUG_MANEUVER
3612 <<
" fullLatDist=" << fullLatDist
3613 <<
" speedAccel=" << speedAccel
3614 <<
" speedDecel=" << speedDecel
3615 <<
" speedBound=" << speedBound
3619 if (speedDecel * speedAccel <= 0 && (
3621 (latDist >= 0 && speedAccel >= speedBound && speedBound >= speedDecel)
3622 || (latDist <= 0 && speedAccel <= speedBound && speedBound <= speedDecel))) {
3624#ifdef DEBUG_MANEUVER
3626 std::cout <<
" computeSpeedLat a)\n";
3633#ifdef DEBUG_MANEUVER
3635 std::cout <<
" computeSpeedLat b)\n";
3642 if ((fabs(minDistAccel) < fabs(fullLatDist)) || (fabs(minDistAccel - fullLatDist) < NUMERICAL_EPS)) {
3643#ifdef DEBUG_MANEUVER
3645 std::cout <<
" computeSpeedLat c)\n";
3650#ifdef DEBUG_MANEUVER
3652 std::cout <<
" minDistAccel=" << minDistAccel <<
"\n";
3657 if ((fabs(minDistCurrent) < fabs(fullLatDist)) || (fabs(minDistCurrent - fullLatDist) < NUMERICAL_EPS)) {
3658#ifdef DEBUG_MANEUVER
3660 std::cout <<
" computeSpeedLat d)\n";
3667#ifdef DEBUG_MANEUVER
3669 std::cout <<
" computeSpeedLat e)\n";
3681#ifdef DEBUG_MANEUVER
3683 std::cout <<
" rightDanger speedLat=" << speedLat <<
"\n";
3688#ifdef DEBUG_MANEUVER
3690 std::cout <<
" leftDanger speedLat=" << speedLat <<
"\n";
3705 const bool indirect = turnInfo.second ==
nullptr ? false : turnInfo.second->isIndirect();
3738 double maneuverDist) {
3741 double secondsToLeaveLane;
3751#if defined(DEBUG_MANEUVER) || defined(DEBUG_COMMITTED_SPEED)
3767 double nextLeftSpace;
3768 if (nextActionStepSpeed > 0.) {
3783#if defined(DEBUG_MANEUVER) || defined(DEBUG_COMMITTED_SPEED)
3787 <<
" avoidArrivalSpeed=" << avoidArrivalSpeed
3790 <<
"\n nextLeftSpace=" << nextLeftSpace
3791 <<
" nextActionStepSpeed=" << nextActionStepSpeed
3792 <<
" nextActionStepRemainingSeconds=" << secondsToLeaveLane - timeTillActionStep
3802#if defined(DEBUG_MANEUVER) || defined(DEBUG_COMMITTED_SPEED)
3806 <<
" secondsToLeave=" << secondsToLeaveLane
3828 const double vehWidth =
getWidth();
3830 const double leftVehSide = rightVehSide + vehWidth;
3831 const double rightVehSideDest = rightVehSide + latDist;
3832 const double leftVehSideDest = leftVehSide + latDist;
3833#if defined(DEBUG_MANEUVER) || defined(DEBUG_COMMITTED_SPEED)
3835 std::cout <<
" commitFollowSpeed"
3836 <<
" latDist=" << latDist
3837 <<
" foeOffset=" << foeOffset
3838 <<
" vehRight=" << rightVehSide
3839 <<
" vehLeft=" << leftVehSide
3840 <<
" destRight=" << rightVehSideDest
3841 <<
" destLeft=" << leftVehSideDest
3847 if (vehDist.first != 0) {
3848 const MSVehicle* leader = vehDist.first;
3850 double foeRight, foeLeft;
3852#if defined(DEBUG_MANEUVER) || defined(DEBUG_COMMITTED_SPEED)
3854 std::cout <<
" foe=" << vehDist.first->getID()
3855 <<
" gap=" << vehDist.second
3857 <<
" foeRight=" << foeRight
3858 <<
" foeLeft=" << foeLeft
3859 <<
" overlapBefore=" <<
overlap(rightVehSide, leftVehSide, foeRight, foeLeft)
3860 <<
" overlapDest=" <<
overlap(rightVehSideDest, leftVehSideDest, foeRight, foeLeft)
3864 if (
overlap(rightVehSideDest, leftVehSideDest, foeRight, foeLeft)) {
3868 speed =
MIN2(speed, vSafe);
3869#if defined(DEBUG_MANEUVER) || defined(DEBUG_COMMITTED_SPEED)
3871 std::cout <<
" case1 vsafe=" << vSafe <<
" speed=" << speed <<
"\n";
3874 }
else if (
overlap(rightVehSide, leftVehSide, foeRight, foeLeft)) {
3879 speed =
MIN2(speed, vSafe);
3880#if defined(DEBUG_MANEUVER) || defined(DEBUG_COMMITTED_SPEED)
3882 std::cout <<
" case2 vsafe=" << vSafe <<
" speed=" << speed <<
"\n";
3902 return myOppositeParam <= 0 ? std::numeric_limits<double>::max() : 1 /
myOppositeParam;
3961 }
else if (key ==
"speedGainProbabilityRight") {
3963 }
else if (key ==
"speedGainProbabilityLeft") {
3965 }
else if (key ==
"keepRightProbability") {
3967 }
else if (key ==
"lookAheadSpeed") {
3969 }
else if (key ==
"sigmaState") {
3972 }
else if (key ==
"speedGainRP") {
3974 }
else if (key ==
"speedGainLP") {
3976 }
else if (key ==
"keepRightP") {
4046 }
else if (key ==
"speedGainProbabilityRight") {
4048 }
else if (key ==
"speedGainProbabilityLeft") {
4050 }
else if (key ==
"keepRightProbability") {
4052 }
else if (key ==
"lookAheadSpeed") {
4054 }
else if (key ==
"sigmaState") {
4068 const std::pair<MSVehicle*, double>& leader,
4069 const std::pair<MSVehicle*, double>& follower,
4070 const std::pair<MSVehicle*, double>& neighLead,
4071 const std::pair<MSVehicle*, double>& neighFollow,
4073 const std::vector<MSVehicle::LaneQ>& preb,
4079#ifdef DEBUG_WANTSCHANGE
4081 std::cout <<
"\nWANTS_CHANGE\n" <<
SIMTIME
4085 <<
" neigh=" << neighLane.
getID()
4089 <<
" considerChangeTo=" << (laneOffset == -1 ?
"right" :
"left")
4103 double maneuverDist;
4106 leaders, followers, blockers,
4107 neighLeaders, neighFollowers, neighBlockers,
4109 lastBlocked, firstBlocked, latDist, maneuverDist, blocked);
4113 result &= ~LCA_SUBLANE;
4114 result |=
getLCA(result, latDist);
4116#if defined(DEBUG_WANTSCHANGE) || defined(DEBUG_STATE)
4121 <<
" wantsChangeTo=" << (laneOffset == -1 ?
"right" :
"left")
4122 << ((result &
LCA_URGENT) ?
" (urgent)" :
"")
4128 << ((result &
LCA_TRACI) ?
" (traci)" :
"")
4180 std::cout <<
SIMTIME <<
" veh=" <<
myVehicle.
getID() <<
" bgap=" << brakeGap <<
" maneuverDist=" << maneuverDist
#define HELP_DECEL_FACTOR
#define LOOK_AHEAD_MIN_SPEED
#define LCA_RIGHT_IMPATIENCE
#define REACT_TO_STOPPED_DISTANCE
#define RELGAIN_NORMALIZATION_MIN_SPEED
#define CUT_IN_LEFT_SPEED_THRESHOLD
#define MAX_ONRAMP_LENGTH
#define LOOK_AHEAD_SPEED_MEMORY
#define ARRIVALPOS_LAT_THRESHOLD
#define SPEEDGAIN_MEMORY_FACTOR
#define LOOK_AHEAD_MIN_SPEED
#define SPEEDGAIN_DECAY_FACTOR
#define LATGAP_SPEED_THRESHOLD
#define GAIN_PERCEPTION_THRESHOLD
#define LATGAP_SPEED_THRESHOLD2
std::pair< const MSVehicle *, double > CLeaderDist
std::pair< const MSPerson *, double > PersonDist
LatAlignmentDefinition
Possible ways to choose the lateral alignment, i.e., how vehicles align themselves within their lane.
@ RIGHT
drive on the right side
@ GIVEN
The alignment as offset is given.
@ DEFAULT
No information given; use default.
@ LEFT
drive on the left side
@ ARBITRARY
maintain the current alignment
@ NICE
align with the closest sublane border
@ COMPACT
align with the rightmost sublane that allows keeping the current speed
@ CENTER
drive in the middle
@ SVC_EMERGENCY
public emergency vehicles
@ 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.
@ CENTER
At the center of the lane.
LinkDirection
The different directions a link between two lanes may take (or a stream between two edges)....
@ PARTLEFT
The link is a partial left direction.
@ RIGHT
The link is a (hard) right direction.
@ TURN
The link is a 180 degree turn.
@ LEFT
The link is a (hard) left direction.
@ STRAIGHT
The link is a straight direction.
@ TURN_LEFTHAND
The link is a 180 degree turn (left-hand network)
@ PARTRIGHT
The link is a partial right direction.
@ NODIR
The link has no direction (is a dead end link)
LaneChangeAction
The state of a vehicle's lane-change behavior.
@ LCA_BLOCKED_LEFT
blocked left
@ LCA_KEEPRIGHT
The action is due to the default of keeping right "Rechtsfahrgebot".
@ LCA_BLOCKED
blocked in all directions
@ LCA_URGENT
The action is urgent (to be defined by lc-model)
@ LCA_BLOCKED_BY_RIGHT_LEADER
The vehicle is blocked by right leader.
@ LCA_STAY
Needs to stay on the current lane.
@ LCA_SUBLANE
used by the sublane model
@ LCA_BLOCKED_BY_LEADER
blocked by leader
@ LCA_BLOCKED_BY_LEFT_FOLLOWER
The vehicle is blocked by left follower.
@ LCA_AMBLOCKINGFOLLOWER_DONTBRAKE
@ LCA_COOPERATIVE
The action is done to help someone else.
@ LCA_OVERLAPPING
The vehicle is blocked being overlapping.
@ LCA_LEFT
Wants go to the left.
@ LCA_BLOCKED_RIGHT
blocked right
@ LCA_BLOCKED_BY_RIGHT_FOLLOWER
The vehicle is blocked by right follower.
@ LCA_STRATEGIC
The action is needed to follow the route (navigational lc)
@ LCA_AMBACKBLOCKER_STANDING
@ LCA_CHANGE_REASONS
reasons of lane change
@ LCA_TRACI
The action is due to a TraCI request.
@ LCA_SPEEDGAIN
The action is due to the wish to be faster (tactical lc)
@ LCA_WANTS_LANECHANGE
lane can change
@ LCA_RIGHT
Wants go to the right.
@ LCA_BLOCKED_BY_FOLLOWER
blocker by follower
@ LCA_BLOCKED_BY_LEFT_LEADER
@ SUMO_ATTR_LCA_COOPERATIVE_SPEED
@ SUMO_ATTR_LCA_ASSERTIVE
@ SUMO_ATTR_LCA_LANE_DISCIPLINE
@ SUMO_ATTR_LCA_TURN_ALIGNMENT_DISTANCE
@ SUMO_ATTR_LCA_LOOKAHEADLEFT
@ SUMO_ATTR_LCA_SPEEDGAIN_PARAM
@ SUMO_ATTR_LCA_MAXDISTLATSTANDING
@ SUMO_ATTR_LCA_IMPATIENCE
@ SUMO_ATTR_LCA_COOPERATIVE_ROUNDABOUT
@ SUMO_ATTR_LCA_SPEEDGAIN_LOOKAHEAD
@ SUMO_ATTR_LCA_MAXSPEEDLATFACTOR
@ SUMO_ATTR_LCA_MAXSPEEDLATSTANDING
@ SUMO_ATTR_LCA_KEEPRIGHT_PARAM
@ SUMO_ATTR_LCA_COOPERATIVE_PARAM
@ SUMO_ATTR_LCA_OPPOSITE_PARAM
@ SUMO_ATTR_LCA_SPEEDGAIN_REMAIN_TIME
@ SUMO_ATTR_LCA_OVERTAKE_DELTASPEED_FACTOR
@ SUMO_ATTR_LCA_SUBLANE_PARAM
@ SUMO_ATTR_LCA_ACCEL_LAT
@ SUMO_ATTR_LCA_STRATEGIC_PARAM
@ SUMO_ATTR_LCA_KEEPRIGHT_ACCEPTANCE_TIME
@ SUMO_ATTR_LCA_TIME_TO_IMPATIENCE
@ SUMO_ATTR_LCA_SPEEDGAINRIGHT
int gPrecision
the precision for floating point outputs
const double SUMO_const_laneWidth
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 responsible for exchanging messages between cars involved in lane-change interaction.
Interface for lane-change models.
double getForwardPos() const
get vehicle position relative to the forward direction lane
virtual double getExtraReservation(int bestLaneOffset, double neighExtraDist=0) const
bool hasBlueLight() const
double getPreviousManeuverDist() const
virtual void setOwnState(const int state)
int myPreviousState
lane changing state from the previous simulation step
double getManeuverDist() const
Returns the remaining unblocked distance for the current maneuver. (only used by sublane model)
int myOwnState
The current state of the vehicle.
virtual void prepareStep()
MSLane * getShadowLane() const
Returns the lane the vehicle's shadow is on during continuous/sublane lane change.
double myLastLateralGapRight
double myCommittedSpeed
the speed when committing to a change maneuver
virtual LatAlignmentDefinition getDesiredAlignment() const
static const double NO_NEIGHBOR
double myMaxDistLatStanding
static bool myAllowOvertakingRight
whether overtaking on the right is permitted
void addLCSpeedAdvice(const double vSafe, bool ownAdvice=true)
Takes a vSafe (speed advice for speed in the next simulation step), converts it into an acceleration ...
int & getCanceledState(const int dir)
double myMaxSpeedLatFactor
const LaneChangeModel myModel
the type of this model
bool cancelRequest(int state, int laneOffset)
whether the influencer cancels the given request
std::vector< std::pair< double, bool > > myLCAccelerationAdvices
double getMaxSpeedLat2() const
return the max of maxSpeedLat and lcMaxSpeedLatStanding
const MSCFModel & getCarFollowModel() const
The vehicle's car following model.
double mySpeedLat
the current lateral speed
double myMaxSpeedLatStanding
MSVehicle & myVehicle
The vehicle this lane-changer belongs to.
double myLastLateralGapLeft
the minimum lateral gaps to other vehicles that were found when last changing to the left and right
virtual bool avoidOvertakeRight() const
virtual bool debugVehicle() const
whether the current vehicles shall be debugged
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 getLength() const
Returns the vehicle's length.
const MSEdge * getEdge() const
Returns the edge the vehicle is currently at.
double getWaitingSeconds() const
Returns the number of seconds waited (speed was lesser than 0.1m/s)
const MSStop & getNextStop() const
SUMOVehicleClass getVClass() const
Returns the vehicle's access class.
const MSRoute & getRoute() const
Returns the current route.
const MSVehicleType & getVehicleType() const
Returns the vehicle's type definition.
The car-following model abstraction.
virtual double maxNextSpeed(double speed, const MSVehicle *const veh) const
Returns the maximum speed given the current speed.
static double gapExtrapolation(const double duration, const double currentGap, double v1, double v2, double a1=0, double a2=0, const double maxV1=std::numeric_limits< double >::max(), const double maxV2=std::numeric_limits< double >::max())
return the resulting gap if, starting with gap currentGap, two vehicles continue with constant accele...
virtual double minNextSpeedEmergency(double speed, const MSVehicle *const veh=0) const
Returns the minimum speed after emergency braking, given the current speed (depends on the numerical ...
virtual double followSpeedTransient(double duration, const MSVehicle *const veh, double speed, double gap2pred, double predSpeed, double predMaxDecel) const
Computes the vehicle's follow speed that avoids a collision for the given amount of time.
double getEmergencyDecel() const
Get the vehicle type's maximal physically possible deceleration [m/s^2].
static double brakeGapEuler(const double speed, const double decel, const double headwayTime)
static double avoidArrivalAccel(double dist, double time, double speed, double maxDecel)
Computes the acceleration needed to arrive not before the given time.
virtual double minNextSpeed(double speed, const MSVehicle *const veh=0) const
Returns the minimum speed given the current speed (depends on the numerical update scheme and its ste...
virtual void setMaxDecel(double decel)
Sets a new value for maximal comfortable deceleration [m/s^2].
@ LANE_CHANGE
the return value is used for lane change calculations
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 getMaxAccel() const
Get the vehicle type's maximum acceleration [m/s^2].
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].
static double estimateArrivalTime(double dist, double speed, double maxSpeed, double accel)
Computes the time needed to travel a distance dist given an initial speed and constant acceleration....
virtual double followSpeed(const MSVehicle *const veh, double speed, double gap2pred, double predSpeed, double predMaxDecel, const MSVehicle *const pred=0, const CalcReason usage=CalcReason::CURRENT) const =0
Computes the vehicle's follow speed (no dawdling)
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)
A road/street connecting two junctions.
const std::set< MSTransportable *, ComparatorNumericalIdLess > & getPersons() const
Returns this edge's persons set.
const std::vector< MSLane * > & getLanes() const
Returns this edge's lanes.
double getInternalFollowingLengthTo(const MSEdge *followerAfterInternal, SUMOVehicleClass vClass) const
returns the length of all internal edges on the junction until reaching the non-internal edge followe...
bool canChangeToOpposite() const
whether this edge allows changing to the opposite direction edge
bool isInternal() const
return whether this edge is an internal edge
double getWidth() const
Returns the edges's width (sum over all lanes)
const std::vector< double > getSubLaneSides() const
Returns the right side offsets of this edge's sublanes.
static double gLateralResolution
static bool gSemiImplicitEulerUpdate
static bool gLefthand
Whether lefthand-drive is being simulated.
static bool canSaveBlockerLength(const MSVehicle &veh, double requested, double leftSpace)
static double getSpeedPreservingSecureGap(const MSVehicle &leader, const MSVehicle &follower, double currentGap, double leaderPlannedSpeed)
static double getRoundaboutDistBonus(const MSVehicle &veh, double bonusParam, const MSVehicle::LaneQ &curr, const MSVehicle::LaneQ &neigh, const MSVehicle::LaneQ &best)
static bool updateBlockerLength(const MSVehicle &veh, MSVehicle *blocker, int lcaCounter, double leftSpace, bool reliefConnection, double &leadingBlockerLength)
static bool divergentRoute(const MSVehicle &v1, const MSVehicle &v2)
return whether the vehicles are on the same junction but on divergent paths
double mySafeLatDistRight
the lateral distance the vehicle can safely move in the currently considered direction
static bool overlap(double right, double left, double right2, double left2)
return whether the given intervals overlap
double _patchSpeed(double min, const double wanted, double max, const MSCFModel &cfModel)
double informLeaders(int blocked, int dir, const std::vector< CLeaderDist > &blockers, double remainingSeconds)
void commitManoeuvre(int blocked, int blockedFully, const MSLeaderDistanceInfo &leaders, const MSLeaderDistanceInfo &neighLeaders, const MSLane &neighLane, double maneuverDist)
commit to lane change maneuver potentially overriding safe speed
std::set< const MSVehicle * > myCFRelated
set of vehicles that are in a car-following relationship with ego (leader of followers)
void prepareStep() override
double myKeepRightProbability
double commitFollowSpeed(double speed, double latDist, double secondsToLeaveLane, const MSLeaderDistanceInfo &leaders, double foeOffset) const
compute speed when committing to an urgent change that is safe in regard to leading vehicles
double getLeftBorder(bool checkOpposite=true) const
return current edge width optionally extended by opposite direction lane width
double myChangeProbThresholdRight
double informLeader(int blocked, int dir, const CLeaderDist &neighLead, double remainingSeconds)
MSLCM_SL2015(MSVehicle &v)
int computeSublaneShift(const MSEdge *prevEdge, const MSEdge *curEdge)
compute shift so that prevSublane + shift = newSublane
double patchSpeed(const double min, const double wanted, const double max, const MSCFModel &cfModel) override
Called to adapt the speed in order to allow a lane change. It uses information on LC-related desired ...
double getSafetyFactor() const override
return factor for modifying the safety constraints of the car-following model
double myCooperativeSpeed
double computeSpeedLat(double latDist, double &maneuverDist, bool urgent) const override
decides the next lateral speed depending on the remaining lane change distance to be covered and upda...
std::vector< double > myExpectedSublaneSpeeds
expected travel speeds on all sublanes on the current edge(!)
double getWidth() const
return the width of this vehicle (padded for numerical stability)
bool myCanChangeFully
whether the current lane changing maneuver can be finished in a single step
int wantsChange(int laneOffset, MSAbstractLaneChangeModel::MSLCMessager &msgPass, int blocked, const std::pair< MSVehicle *, double > &leader, const std::pair< MSVehicle *, double > &follower, const std::pair< MSVehicle *, double > &neighLead, const std::pair< MSVehicle *, double > &neighFollow, const MSLane &neighLane, const std::vector< MSVehicle::LaneQ > &preb, MSVehicle **lastBlocked, MSVehicle **firstBlocked) override
Called to examine whether the vehicle wants to change using the given laneOffset (this is a wrapper a...
bool mustOvertakeStopped(bool checkCurrent, const MSLane &neighLane, const MSLeaderDistanceInfo &leaders, const MSLeaderDistanceInfo &neighLead, double posOnLane, double neighDist, bool right, double latLaneDist, double ¤tDist, double &latDist)
bool outsideEdge() const
whether the ego vehicle is driving outside edgebounds
bool myDontBrake
flag to prevent speed adaptation by slowing down
std::string getParameter(const std::string &key) const override
try to retrieve the given parameter from this device. Throw exception for unsupported key
bool wantsKeepRight(double keepRightProb) const
check against thresholds
double forecastAverageSpeed(double vSafe, double vMax, double gap, double vLeader) const
estimate average speed over mySpeedGainLookahead time
int checkStrategicChange(int ret, const MSLane &neighLane, int laneOffset, const MSLeaderDistanceInfo &leaders, const MSLeaderDistanceInfo &neighLeaders, const MSVehicle::LaneQ &curr, const MSVehicle::LaneQ &neigh, const MSVehicle::LaneQ &best, int bestLaneOffset, bool changeToBest, double ¤tDist, double neighDist, double laDist, double roundaboutBonus, double latLaneDist, bool checkOpposite, double &latDist)
compute strategic lane change actions TODO: Better documentation, refs #2
void updateCFRelated(const MSLeaderDistanceInfo &vehicles, double foeOffset, bool leaders)
find leaders/followers that are already in a car-following relationship with ego
bool debugVehicle() const override
whether the current vehicles shall be debugged
int wantsChangeSublane(int laneOffset, LaneChangeAction alternatives, const MSLeaderDistanceInfo &leaders, const MSLeaderDistanceInfo &followers, const MSLeaderDistanceInfo &blockers, const MSLeaderDistanceInfo &neighLeaders, const MSLeaderDistanceInfo &neighFollowers, const MSLeaderDistanceInfo &neighBlockers, const MSLane &neighLane, const std::vector< MSVehicle::LaneQ > &preb, MSVehicle **lastBlocked, MSVehicle **firstBlocked, double &latDist, double &maneuverDist, int &blocked) override
Called to examine whether the vehicle wants to change with the given laneOffset (using the sublane mo...
LatAlignmentDefinition getDesiredAlignment() const override
double mySpeedGainProbabilityRight
a value for tracking the probability that a change to the right is beneficial
int slowDownForBlocked(MSVehicle **blocked, int state)
compute useful slowdowns for blocked vehicles
void initDerivedParameters()
init cached parameters derived directly from model parameters
int keepLatGap(int state, const MSLeaderDistanceInfo &leaders, const MSLeaderDistanceInfo &followers, const MSLeaderDistanceInfo &blockers, const MSLeaderDistanceInfo &neighLeaders, const MSLeaderDistanceInfo &neighFollowers, const MSLeaderDistanceInfo &neighBlockers, const MSLane &neighLane, int laneOffset, double &latDist, double &maneuverDist, int &blocked)
check whether lateral gap requirements are met override the current maneuver if necessary
bool tieBrakeLeader(const MSVehicle *veh) const
bool currentDistAllows(double dist, int laneOffset, double lookForwardDist)
CLeaderDist getLongest(const MSLeaderDistanceInfo &ldi) const
get the longest vehicle in the given info
double myCooperativeParam
double getNeighRight(const MSLane &neighLane) const
return the right offset of the neighboring lane relative to the current edge
double computeSpeedGain(double latDistSublane, double defaultNextSpeed) const
compute speedGain when moving by the given amount
double emergencySpeedLat(double speedLat) const
avoid unsafe lateral speed (overruling lcAccelLat)
double myKeepRightAcceptanceTime
void updateGaps(const MSLeaderDistanceInfo &others, double foeOffset, double oldCenter, double gapFactor, double &surplusGapRight, double &surplusGapLeft, bool saveMinGap=false, double netOverlap=0, double latDist=0, std::vector< CLeaderDist > *collectBlockers=0)
check remaining lateral gaps for the given foe vehicles and optionally update minimum lateral gaps
virtual void updateSafeLatDist(const double travelledLatDist) override
Updates the value of safe lateral distances (mySafeLatDistLeft and mySafeLatDistRight) during maneuve...
const MSEdge * myLastEdge
expected travel speeds on all sublanes on the current edge(!)
double getOppositeSafetyFactor() const override
return factor for modifying the safety constraints for opposite-diretction overtaking of the car-foll...
StateAndDist decideDirection(StateAndDist sd1, StateAndDist sd2) const override
decide in which direction to move in case both directions are desirable
std::pair< double, int > Info
information regarding save velocity (unused) and state flags of the ego vehicle
void msg(const CLeaderDist &cld, double speed, int state)
send a speed recommendation to the given vehicle
double mySpeedGainRemainTime
int checkBlocking(const MSLane &neighLane, double &latDist, double maneuverDist, int laneOffset, const MSLeaderDistanceInfo &leaders, const MSLeaderDistanceInfo &followers, const MSLeaderDistanceInfo &blockers, const MSLeaderDistanceInfo &neighLeaders, const MSLeaderDistanceInfo &neighFollowers, const MSLeaderDistanceInfo &neighBlockers, std::vector< CLeaderDist > *collectLeadBlockers=0, std::vector< CLeaderDist > *collectFollowBlockers=0, bool keepLatGapManeuver=false, double gapFactor=0, int *retBlockedFully=0)
restrict latDist to permissible speed and determine blocking state depending on that distance
double getVehicleCenter() const
return vehicle position relative to the current edge (extend by another virtual lane for opposite-dir...
int _wantsChangeSublane(int laneOffset, LaneChangeAction alternatives, const MSLeaderDistanceInfo &leaders, const MSLeaderDistanceInfo &followers, const MSLeaderDistanceInfo &blockers, const MSLeaderDistanceInfo &neighLeaders, const MSLeaderDistanceInfo &neighFollowers, const MSLeaderDistanceInfo &neighBlockers, const MSLane &neighLane, const std::vector< MSVehicle::LaneQ > &preb, MSVehicle **lastBlocked, MSVehicle **firstBlocked, double &latDist, double &maneuverDist, int &blocked)
helper function for doing the actual work
double getLateralDrift()
get lateral drift for the current step
double computeGapFactor(int state) const
compute the gap factor for the given state
double getPosLat()
get lateral position of this vehicle
bool preventSliding(double maneuverDist) const
bool isBidi(const MSLane *lane) const
check whether lane is an upcoming bidi lane
void * inform(void *info, MSVehicle *sender) override
void informFollower(int blocked, int dir, const CLeaderDist &neighFollow, double remainingSeconds, double plannedSpeed)
decide whether we will try cut in before the follower or allow to be overtaken
void setParameter(const std::string &key, const std::string &value) override
try to set the given parameter for this laneChangeModel. Throw exception for unsupported key
bool saveBlockerLength(double length, double foeLeftSpace) override
reserve space at the end of the lane to avoid dead locks
double myOvertakeDeltaSpeedFactor
double myTurnAlignmentDist
double myLeadingBlockerLength
void setOwnState(const int state) override
int checkBlockingVehicles(const MSVehicle *ego, const MSLeaderDistanceInfo &vehicles, int laneOffset, double latDist, double foeOffset, bool leaders, double &safeLatGapRight, double &safeLatGapLeft, std::vector< CLeaderDist > *collectBlockers=0) const
check whether any of the vehicles overlaps with ego
void informFollowers(int blocked, int dir, const std::vector< CLeaderDist > &blockers, double remainingSeconds, double plannedSpeed)
call informFollower for multiple followers
double mySpeedGainLookahead
double mySpeedLossProbThreshold
void resetState() override
double mySpeedGainProbabilityLeft
a value for tracking the probability that a change to the left is beneficial
static LaneChangeAction getLCA(int state, double latDist)
compute lane change action from desired lateral distance
double myChangeProbThresholdLeft
void updateExpectedSublaneSpeeds(const MSLeaderDistanceInfo &ahead, int sublaneOffset, int laneIndex) override
update expected speeds for each sublane of the current edge
bool sublaneEnds(int i, const MSLane *next, double shift)
check whether the sublane continues on the next lane
bool currentDistDisallows(double dist, int laneOffset, double lookForwardDist)
double myTimeToImpatience
static int lowest_bit(int changeReason)
return the most important change reason
static CLeaderDist getSlowest(const MSLeaderDistanceInfo &ldi)
get the slowest vehicle in the given info
bool amBlockingFollowerPlusNB()
Representation of a lane in the micro simulation.
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.
const MSLink * getLinkTo(const MSLane *const) const
returns the link to the given lane or nullptr, if it is not connected
double getSpeedLimit() const
Returns the lane's maximum allowed speed.
double getLength() const
Returns the lane's length.
bool allowsVehicleClass(SUMOVehicleClass vclass) const
double getVehicleMaxSpeed(const SUMOTrafficObject *const veh) const
Returns the lane's maximum speed, given a vehicle's speed limit adaptation.
double getRightSideOnEdge() const
bool hasPedestrians() const
whether the lane has pedestrians on it
int getIndex() const
Returns the lane's index.
MSLane * getOpposite() const
return the neighboring opposite direction lane for lane changing or nullptr
MSLane * getBidiLane() const
retrieve bidirectional lane or nullptr
MSLane * getParallelOpposite() const
return the opposite direction lane of this lanes edge or nullptr
MSEdge & getEdge() const
Returns the lane's edge.
const MSLane * getNormalPredecessorLane() const
get normal lane leading to this internal lane, for normal lanes, the lane itself is returned
double getWidth() const
Returns the lane's width.
const std::vector< MSLink * > & getLinkCont() const
returns the container with all links !!!
int getRightmostSublane() const
saves leader/follower vehicles and their distances relative to an ego vehicle
virtual std::string toString() const
print a debugging representation
double getMinDistToStopped() const
return minimum distance to a stopped vehicle or max double
bool hasStoppedVehicle() const
whether a stopped vehicle is leader
void getSublaneBorders(int sublane, double latOffset, double &rightSide, double &leftSide) const
void getSubLanes(const MSVehicle *veh, double latOffset, int &rightmost, int &leftmost) const
double getLateralShift() const
return lateral shift that must be applied when passing this link
static MSNet * getInstance()
Returns the pointer to the unique instance of MSNet (singleton).
SUMOTime getCurrentTimeStep() const
Returns the current simulation step.
const MSEdge * getLastEdge() const
returns the destination edge
const MSLane * lane
The lane to stop at (microsim only)
double getLatDist() const
double changeRequestRemainingSeconds(const SUMOTime currentTime) const
Return the remaining number of seconds of the current laneTimeLine assuming one exists.
bool ignoreOverlap() const
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)
double getLeftSideOnEdge(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)
bool isActive() const
Returns whether the current simulation step is an action point for the vehicle.
const std::pair< double, const MSLink * > & getNextTurn()
Get the distance and direction of the next upcoming turn for the vehicle (within its look-ahead range...
MSAbstractLaneChangeModel & getLaneChangeModel()
double getLeftSideOnLane() const
Get the lateral position of the vehicles left side on the lane:
double getActionStepLengthSecs() const
Returns the vehicle's action step length in secs, i.e. the interval between two action points.
int influenceChangeDecision(int state)
allow TraCI to influence a lane change decision
double nextStopDist() const
return the distance to the next stop or doubleMax if there is none.
double getAcceleration() const
Returns the vehicle's acceleration in m/s (this is computed as the last step's mean acceleration in c...
const std::vector< MSLane * > & getBestLanesContinuation() const
Returns the best sequence of lanes to continue the route starting at myLane.
int getBestLaneOffset() const
double lateralDistanceToLane(const int offset) const
Get the minimal lateral distance required to move fully onto the lane at given offset.
const MSEdge * getCurrentEdge() const
Returns the edge the vehicle is currently at (possibly an internal edge or nullptr)
const MSLane * getLane() const
Returns the lane the vehicle is on.
double getLastStepDist() const
Get the distance the vehicle covered in the previous timestep.
Influencer & getInfluencer()
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.
const MSCFModel & getCarFollowModel() const
Returns the vehicle's car following model definition.
double getPositionOnLane() const
Get the vehicle's position along the lane.
double getLateralOverlap() const
return the amount by which the vehicle extends laterally outside it's primary lane
bool hasInfluencer() const
whether the vehicle is individually influenced (via TraCI or special parameters)
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)
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.
const LatAlignmentDefinition & getPreferredLateralAlignment() const
Get vehicle's preferred lateral alignment procedure.
double getMinGap() const
Get the free space in front of vehicles of this class.
double getMaxSpeedLat() const
Get vehicle's maximum lateral speed [m/s].
double getLength() const
Get vehicle's length [m].
double getPreferredLateralAlignmentOffset() const
Get vehicle's preferred lateral alignment offset (in m from center line)
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.
void step(double dt)
evolve for a time step of length dt.
double arrivalPosLat
(optional) The lateral position the vehicle shall arrive on
ArrivalPosLatDefinition arrivalPosLatProcedure
Information how the vehicle shall choose the lateral arrival position.
static double toDouble(const std::string &sData)
converts a string into the double value described by it by calling the char-type converter
#define UNUSED_PARAMETER(x)
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
bool sameDirection(const StateAndDist &other) const
A structure representing the best lanes for continuing the current route starting at 'lane'.
double length
The overall length which may be driven when using this lane without a lane change.
std::vector< MSLane * > bestContinuations
MSLane * lane
The described lane.
int bestLaneOffset
The (signed) number of lanes to be crossed to get to the lane which allows to continue the drive.
double occupation
The overall vehicle sum on consecutive lanes which can be passed without a lane change.