40#define MAGIC_OFFSET 1.
41#define LOOK_FORWARD 10.
45#define LCA_RIGHT_IMPATIENCE -1.
46#define CUT_IN_LEFT_SPEED_THRESHOLD 27.
47#define MAX_ONRAMP_LENGTH 200.
49#define LOOK_AHEAD_MIN_SPEED 0.0
50#define LOOK_AHEAD_SPEED_MEMORY 0.9
52#define HELP_DECEL_FACTOR 1.0
54#define HELP_OVERTAKE (10.0 / 3.6)
55#define MIN_FALLBEHIND (7.0 / 3.6)
59#define KEEP_RIGHT_TIME 5.0
61#define RELGAIN_NORMALIZATION_MIN_SPEED 10.0
63#define TURN_LANE_DIST 200.0
64#define GAIN_PERCEPTION_THRESHOLD 0.05
66#define ARRIVALPOS_LAT_THRESHOLD 100.0
69#define LATGAP_SPEED_THRESHOLD (50 / 3.6)
72#define LATGAP_SPEED_THRESHOLD2 (50 / 3.6)
75#define SPEEDGAIN_DECAY_FACTOR 0.5
77#define SPEEDGAIN_MEMORY_FACTOR 0.5
79#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)))),
140 myMinImpatience(myImpatience),
192 const std::vector<MSVehicle::LaneQ>& preb,
195 double& latDist,
double& maneuverDist,
int& blocked) {
198 const std::string changeType = laneOffset == -1 ?
"right" : (laneOffset == 1 ?
"left" :
"current");
206 <<
" neigh=" << neighLane.
getID()
211 <<
" considerChangeTo=" << changeType
218 leaders, followers, blockers,
219 neighLeaders, neighFollowers, neighBlockers,
221 lastBlocked, firstBlocked, latDist, maneuverDist, blocked);
223 result =
keepLatGap(result, leaders, followers, blockers,
224 neighLeaders, neighFollowers, neighBlockers,
225 neighLane, laneOffset, latDist, maneuverDist, blocked);
227 result |=
getLCA(result, latDist);
229#if defined(DEBUG_MANEUVER) || defined(DEBUG_STATE)
230 double latDistTmp = latDist;
233#if defined(DEBUG_MANEUVER) || defined(DEBUG_STATE)
235 std::cout <<
SIMTIME <<
" veh=" <<
myVehicle.
getID() <<
" maneuverDist=" << maneuverDist <<
" latDist=" << latDistTmp <<
" mySpeedPrev=" <<
mySpeedLat <<
" speedLat=" <<
DIST2SPEED(latDist) <<
" latDist2=" << latDist <<
"\n";
242 <<
" wantsChangeTo=" << changeType
243 <<
" latDist=" << latDist
244 <<
" maneuverDist=" << maneuverDist
252 <<
" wantsNoChangeTo=" << changeType
309 const double newSpeed =
_patchSpeed(
MAX2(min, 0.0), wanted, max, cfModel);
310#ifdef DEBUG_PATCHSPEED
312 const std::string patched = (wanted != newSpeed ?
" patched=" +
toString(newSpeed) :
"");
319 <<
" wanted=" << wanted
338 double nVSafe = wanted;
344#ifdef DEBUG_PATCHSPEED
352 max =
MIN2(max, safe);
357 if (safe >= vMinEmergency) {
359 min =
MAX2(vMinEmergency, safe);
362#ifdef DEBUG_PATCHSPEED
364 std::cout <<
SIMTIME <<
" veh=" <<
myVehicle.
getID() <<
" slowing down for leading blocker, safe=" << safe << (safe + NUMERICAL_EPS < min ?
" (not enough)" :
"") <<
"\n";
367 nVSafe =
MAX2(min, safe);
374 double accel = i.first;
376 if (v >= min && v <= max) {
379 nVSafe =
MIN2(v, nVSafe);
381 nVSafe =
MIN2(v * coopWeight + (1 - coopWeight) * wanted, nVSafe);
384#ifdef DEBUG_PATCHSPEED
386 std::cout <<
SIMTIME <<
" veh=" <<
myVehicle.
getID() <<
" got accel=" << accel <<
" nVSafe=" << nVSafe <<
"\n";
390#ifdef DEBUG_PATCHSPEED
393 std::cout <<
SIMTIME <<
" veh=" <<
myVehicle.
getID() <<
" ignoring low nVSafe=" << v <<
" (accel=" << accel <<
") min=" << min <<
"\n";
397 std::cout <<
SIMTIME <<
" veh=" <<
myVehicle.
getID() <<
" ignoring high nVSafe=" << v <<
" (accel=" << accel <<
") max=" << max <<
"\n";
405#ifdef DEBUG_PATCHSPEED
418#if defined(DEBUG_PATCHSPEED) || defined(DEBUG_STATE)
423 return (max + wanted) / 2.0;
427#if defined(DEBUG_PATCHSPEED) || defined(DEBUG_STATE)
432 return (min + wanted) / 2.0;
435#if defined(DEBUG_PATCHSPEED) || defined(DEBUG_STATE)
440 return (max + wanted) / 2.0;
481#if defined(DEBUG_PATCHSPEED) || defined(DEBUG_STATE)
486 return (max + wanted) / 2.0;
490#if defined(DEBUG_PATCHSPEED) || defined(DEBUG_STATE)
510 if (pinfo->first >= 0) {
519 <<
" informedBy=" << sender->
getID()
520 <<
" info=" << pinfo->second
521 <<
" vSafe=" << pinfo->first
534 assert(cld.first != 0);
543 double remainingSeconds) {
549 plannedSpeed =
MIN2(plannedSpeed, v);
554 std::cout <<
" informLeader speed=" <<
myVehicle.
getSpeed() <<
" planned=" << plannedSpeed <<
"\n";
565 if (
gDebugFlag2) std::cout <<
" blocked by leader nv=" << nv->
getID() <<
" nvSpeed=" << nv->
getSpeed() <<
" needGap="
569 const double dv = plannedSpeed - nv->
getSpeed();
570 const double overtakeDist = (neighLead.second
582 || dv * remainingSeconds < overtakeDist)
583 && (!neighLead.first->isStopped() || (
isOpposite() && neighLead.second >= 0))) {
598 <<
" cannot overtake leader nv=" << nv->
getID()
600 <<
" remainingSeconds=" << remainingSeconds
601 <<
" targetSpeed=" << targetSpeed
602 <<
" nextSpeed=" << nextSpeed
613 <<
" cannot overtake fast leader nv=" << nv->
getID()
615 <<
" remainingSeconds=" << remainingSeconds
616 <<
" targetSpeed=" << targetSpeed
627 <<
" wants to overtake leader nv=" << nv->
getID()
629 <<
" remainingSeconds=" << remainingSeconds
630 <<
" currentGap=" << neighLead.second
632 <<
" overtakeDist=" << overtakeDist
642 }
else if (neighLead.first != 0) {
645 double dv, nextNVSpeed;
665 std::cout <<
" not blocked by leader nv=" << nv->
getID()
667 <<
" gap=" << neighLead.second
668 <<
" nextGap=" << neighLead.second - dv
670 <<
" targetSpeed=" << targetSpeed
674 return MIN2(targetSpeed, plannedSpeed);
686 double remainingSeconds,
687 double plannedSpeed) {
695 if (
gDebugFlag2) std::cout <<
" blocked by follower nv=" << nv->
getID() <<
" nvSpeed=" << nv->
getSpeed() <<
" needGap="
702 if ((neededGap - neighFollow.second) / remainingSeconds < (plannedSpeed - nv->
getSpeed())) {
705 std::cout <<
" wants to cut in before nv=" << nv->
getID() <<
" without any help neededGap=" << neededGap <<
"\n";
724 const double neighNewSpeed1s =
MAX2(0., nv->
getSpeed() - helpDecel);
725 const double dv = plannedSpeed - neighNewSpeed1s;
727 const double decelGap = neighFollow.second + dv;
733 <<
" egoNV=" << plannedSpeed
734 <<
" nvNewSpeed=" << neighNewSpeed
735 <<
" nvNewSpeed1s=" << neighNewSpeed1s
736 <<
" deltaGap=" << dv
737 <<
" decelGap=" << decelGap
738 <<
" secGap=" << secureGap
742 if (decelGap > 0 && decelGap >= secureGap) {
757 std::cout <<
" wants to cut in before nv=" << nv->
getID()
758 <<
" vsafe1=" << vsafe1
759 <<
" vsafe=" << vsafe
764 }
else if (dv > 0 && dv * remainingSeconds > (secureGap - decelGap + POSITION_EPS)) {
769 std::cout <<
" wants to cut in before nv=" << nv->
getID() <<
" (eventually)\n";
777 std::cout <<
" wants to cut in before nv=" << nv->
getID() <<
" (nv cannot overtake right)\n";
793 std::cout <<
" wants right follower to slow down a bit\n";
799 std::cout <<
" wants to cut in before right follower nv=" << nv->
getID() <<
" (eventually)\n";
808 const double overtakeDist = (neighFollow.second
814 const double needDV = overtakeDist / remainingSeconds;
822 <<
" wants to be overtaken by=" << nv->
getID()
823 <<
" overtakeDist=" << overtakeDist
825 <<
" vhelp=" << vhelp
826 <<
" needDV=" << needDV
832 }
else if (neighFollow.first != 0) {
837 std::cout <<
" wants to cut in before non-blocking follower nv=" << neighFollow.first->getID() <<
"\n";
845 const std::vector<CLeaderDist>& blockers,
846 double remainingSeconds) {
858 plannedSpeed =
MIN2(plannedSpeed, safe);
860 for (std::vector<CLeaderDist>::const_iterator it = blockers.begin(); it != blockers.end(); ++it) {
861 plannedSpeed =
MIN2(plannedSpeed,
informLeader(blocked, dir, *it, remainingSeconds));
869 const std::vector<CLeaderDist>& blockers,
870 double remainingSeconds,
871 double plannedSpeed) {
873 for (std::vector<CLeaderDist>::const_iterator it = blockers.begin(); it != blockers.end(); ++it) {
874 informFollower(blocked, dir, *it, remainingSeconds, plannedSpeed);
899 const double halfWidth =
getWidth() * 0.5;
912 std::vector<double> newExpectedSpeeds;
921 const std::vector<MSLane*>& lanes = currEdge->
getLanes();
922 for (std::vector<MSLane*>::const_iterator it_lane = lanes.begin(); it_lane != lanes.end(); ++it_lane) {
924 for (
int i = 0; i < subLanes; ++i) {
925 newExpectedSpeeds.push_back((*it_lane)->getVehicleMaxSpeed(&
myVehicle));
931 for (
int i = 0; i < subLanes; ++i) {
932 newExpectedSpeeds.push_back(lanes.back()->getVehicleMaxSpeed(&
myVehicle));
940 if (subLaneShift < std::numeric_limits<int>::max()) {
942 const int newI = i + subLaneShift;
943 if (newI > 0 && newI < (
int)newExpectedSpeeds.size()) {
961 if (bestLaneOffset < -1) {
963 }
else if (bestLaneOffset > 1) {
990 for (
const MSLink*
const link : lane->getLinkCont()) {
991 if (&link->getLane()->getEdge() == curEdge) {
993 const MSLane* target = link->getLane();
994 const std::vector<MSLane*>& lanes2 = curEdge->
getLanes();
995 for (std::vector<MSLane*>::const_iterator it_lane2 = lanes2.begin(); it_lane2 != lanes2.end(); ++it_lane2) {
996 const MSLane* lane2 = *it_lane2;
997 if (lane2 == target) {
998 return prevShift + curShift;
1009 return std::numeric_limits<int>::max();
1043#if defined(DEBUG_MANEUVER) || defined(DEBUG_STATE)
1076 const std::vector<MSVehicle::LaneQ>& preb,
1079 double& latDist,
double& maneuverDist,
int& blocked) {
1081 if (laneOffset != 0) {
1083 const double halfWidth =
getWidth() * 0.5;
1085 if (laneOffset < 0) {
1095 int bestLaneOffset = 0;
1096 double currentDist = 0;
1097 double neighDist = 0;
1109 const int prebOffset = (checkOpposite ? 0 : laneOffset);
1110 for (
int p = 0; p < (int) preb.size(); ++p) {
1111 if (preb[p].lane == prebLane && p + laneOffset >= 0) {
1112 assert(p + prebOffset < (
int)preb.size());
1114 neigh = preb[p + prebOffset];
1115 currentDist = curr.
length;
1116 neighDist = neigh.
length;
1119 if (bestLaneOffset == 0 && preb[p + prebOffset].bestLaneOffset == 0 && !checkOpposite) {
1120#ifdef DEBUG_WANTSCHANGE
1124 <<
" bestLaneOffsetOld=" << bestLaneOffset
1125 <<
" bestLaneOffsetNew=" << laneOffset
1129 bestLaneOffset = prebOffset;
1131 best = preb[p + bestLaneOffset];
1135 assert(curr.
lane !=
nullptr);
1136 assert(neigh.
lane !=
nullptr);
1137 assert(best.
lane !=
nullptr);
1138 double driveToNextStop = -std::numeric_limits<double>::max();
1147#ifdef DEBUG_WANTS_CHANGE
1152 <<
" stopPos=" << stopPos
1153 <<
" currentDist=" << currentDist
1154 <<
" neighDist=" << neighDist
1158 currentDist =
MAX2(currentDist, stopPos);
1159 neighDist =
MAX2(neighDist, stopPos);
1162 const bool right = (laneOffset == -1);
1163 const bool left = (laneOffset == 1);
1166 const bool changeToBest = (right && bestLaneOffset < 0) || (left && bestLaneOffset > 0) || (laneOffset == 0 && bestLaneOffset == 0);
1192#ifdef DEBUG_WANTSCHANGE
1199 <<
"\n leaders=" << leaders.
toString()
1200 <<
"\n followers=" << followers.
toString()
1201 <<
"\n blockers=" << blockers.
toString()
1202 <<
"\n neighLeaders=" << neighLeaders.
toString()
1203 <<
"\n neighFollowers=" << neighFollowers.
toString()
1204 <<
"\n neighBlockers=" << neighBlockers.
toString()
1205 <<
"\n changeToBest=" << changeToBest
1206 <<
" latLaneDist=" << latLaneDist
1215 if (lastBlocked != firstBlocked) {
1266 for (
int i = 0; i < neighLeaders.
numSublanes(); ++i) {
1268 if (vehDist.first !=
nullptr && vehDist.first->isStopped()) {
1286 currentDist += roundaboutBonus;
1287 neighDist += roundaboutBonus;
1289 if (laneOffset != 0) {
1307 if ((ret &
LCA_STAY) != 0 && latDist == 0) {
1320 if (changeToBest && abs(bestLaneOffset) > 1
1326#ifdef DEBUG_WANTSCHANGE
1328 std::cout <<
" reserving space for unseen blockers myLeadingBlockerLength=" <<
myLeadingBlockerLength <<
"\n";
1337#ifdef DEBUG_WANTSCHANGE
1343 if (*firstBlocked != neighLeadLongest &&
tieBrakeLeader(*firstBlocked)) {
1352 std::vector<CLeaderDist> collectLeadBlockers;
1353 std::vector<CLeaderDist> collectFollowBlockers;
1354 int blockedFully = 0;
1355 maneuverDist = latDist;
1357 blocked =
checkBlocking(neighLane, latDist, maneuverDist, laneOffset,
1358 leaders, followers, blockers,
1359 neighLeaders, neighFollowers, neighBlockers, &collectLeadBlockers, &collectFollowBlockers,
1360 false, gapFactor, &blockedFully);
1362 const double absLaneOffset = fabs(bestLaneOffset != 0 ? bestLaneOffset : latDist /
SUMO_const_laneWidth);
1363 const double remainingSeconds = ((ret &
LCA_TRACI) == 0 ?
1366 const double plannedSpeed =
informLeaders(blocked, myLca, collectLeadBlockers, remainingSeconds);
1368 if (plannedSpeed >= 0) {
1370 informFollowers(blocked, myLca, collectFollowBlockers, remainingSeconds, plannedSpeed);
1372 if (plannedSpeed > 0) {
1373 commitManoeuvre(blocked, blockedFully, leaders, neighLeaders, neighLane, maneuverDist);
1375#if defined(DEBUG_WANTSCHANGE) || defined(DEBUG_STATE)
1382 <<
" remainingSeconds=" << remainingSeconds
1383 <<
" plannedSpeed=" << plannedSpeed
1394 if (roundaboutBonus > 0) {
1396#ifdef DEBUG_WANTS_CHANGE
1400 <<
" roundaboutBonus=" << roundaboutBonus
1411 latDist = latLaneDist;
1412 maneuverDist = latLaneDist;
1413 blocked =
checkBlocking(neighLane, latDist, maneuverDist, laneOffset,
1414 leaders, followers, blockers,
1415 neighLeaders, neighFollowers, neighBlockers);
1419 ret &= ~LCA_COOPERATIVE;
1435 const double inconvenience = (latLaneDist < 0
1438#ifdef DEBUG_COOPERATE
1446 <<
" inconvenience=" << inconvenience
1448 <<
" wantsChangeToHelp=" << (right ?
"right" :
"left")
1465 && (changeToBest ||
currentDistAllows(neighDist, abs(bestLaneOffset) + 1, laDist))) {
1468#ifdef DEBUG_COOPERATE
1470 std::cout <<
" wants cooperative change\n";
1477 maneuverDist = latDist;
1478 blocked =
checkBlocking(neighLane, latDist, maneuverDist, laneOffset,
1479 leaders, followers, blockers,
1480 neighLeaders, neighFollowers, neighBlockers);
1506 const double vehWidth =
getWidth();
1508 const double leftVehSide = rightVehSide + vehWidth;
1510 double defaultNextSpeed = std::numeric_limits<double>::max();
1512 int leftmostOnEdge = (int)sublaneSides.size() - 1;
1513 while (leftmostOnEdge > 0 && sublaneSides[leftmostOnEdge] > leftVehSide) {
1516 int rightmostOnEdge = leftmostOnEdge;
1517 while (rightmostOnEdge > 0 && sublaneSides[rightmostOnEdge] > rightVehSide + NUMERICAL_EPS) {
1519#ifdef DEBUG_WANTSCHANGE
1521 std::cout <<
" adapted to current sublane=" << rightmostOnEdge <<
" defaultNextSpeed=" << defaultNextSpeed <<
"\n";
1522 std::cout <<
" sublaneSides[rightmostOnEdge]=" << sublaneSides[rightmostOnEdge] <<
" rightVehSide=" << rightVehSide <<
"\n";
1528#ifdef DEBUG_WANTSCHANGE
1530 std::cout <<
" adapted to current sublane=" << rightmostOnEdge <<
" defaultNextSpeed=" << defaultNextSpeed <<
"\n";
1531 std::cout <<
" sublaneSides[rightmostOnEdge]=" << sublaneSides[rightmostOnEdge] <<
" rightVehSide=" << rightVehSide <<
"\n";
1534 double maxGain = -std::numeric_limits<double>::max();
1535 double maxGainRight = -std::numeric_limits<double>::max();
1536 double maxGainLeft = -std::numeric_limits<double>::max();
1537 double latDistNice = std::numeric_limits<double>::max();
1540 double leftMax =
MAX2(
1547 assert(leftMax <= edge.
getWidth());
1549 int sublaneCompact =
MAX2(iMin, rightmostOnEdge - 1);
1555 const double maxLatDist = leftMax - leftVehSide;
1556 const double minLatDist = rightMin - rightVehSide;
1557 const int iStart = laneOffset == 0 ? iMin : 0;
1558 const double rightEnd = laneOffset == 0 ? leftMax : (checkOpposite ?
getLeftBorder() : edge.
getWidth());
1559#ifdef DEBUG_WANTSCHANGE
1561 <<
" checking sublanes rightmostOnEdge=" << rightmostOnEdge
1562 <<
" rightEnd=" << rightEnd
1563 <<
" leftmostOnEdge=" << leftmostOnEdge
1564 <<
" iStart=" << iStart
1566 <<
" sublaneSides=" << sublaneSides.size()
1567 <<
" leftMax=" << leftMax
1568 <<
" minLatDist=" << minLatDist
1569 <<
" maxLatDist=" << maxLatDist
1570 <<
" sublaneCompact=" << sublaneCompact
1573 for (
int i = iStart; i < (int)sublaneSides.size(); ++i) {
1574 if (sublaneSides[i] + vehWidth < rightEnd) {
1580 while (vMin > 0 && j < (
int)sublaneSides.size() && sublaneSides[j] < sublaneSides[i] + vehWidth) {
1582#ifdef DEBUG_WANTSCHANGE
1590 if (laneOffset != 0 &&
overlap(sublaneSides[i], sublaneSides[i] + vehWidth, laneBoundary, laneBoundary)) {
1594 const double currentLatDist =
MIN2(
MAX2(sublaneSides[i] - rightVehSide, minLatDist), maxLatDist);
1598 relativeGain *= 0.5;
1601 if (relativeGain > maxGain) {
1602 maxGain = relativeGain;
1605 latDist = currentLatDist;
1606#ifdef DEBUG_WANTSCHANGE
1608 std::cout <<
" i=" << i <<
" vMin=" << vMin <<
" newLatDist=" << latDist <<
" relGain=" << relativeGain <<
"\n";
1614 if (currentLatDist > 0
1618 && maxGain - relativeGain < NUMERICAL_EPS) {
1619 latDist = currentLatDist;
1622#ifdef DEBUG_WANTSCHANGE
1624 std::cout <<
" i=" << i <<
" rightmostOnEdge=" << rightmostOnEdge <<
" vMin=" << vMin <<
" relGain=" << relativeGain <<
" sublaneCompact=" << sublaneCompact <<
" curLatDist=" << currentLatDist <<
"\n";
1628 maxGainRight =
MAX2(maxGainRight, relativeGain);
1630 maxGainLeft =
MAX2(maxGainLeft, relativeGain);
1632 const double subAlignDist = sublaneSides[i] - rightVehSide;
1633 if (fabs(subAlignDist) < fabs(latDistNice)) {
1634 latDistNice = subAlignDist;
1635#ifdef DEBUG_WANTSCHANGE
1637 <<
" nicest sublane=" << i
1638 <<
" side=" << sublaneSides[i]
1639 <<
" rightSide=" << rightVehSide
1640 <<
" latDistNice=" << latDistNice
1641 <<
" maxGainR=" << maxGainRight
1642 <<
" maxGainL=" << maxGainLeft
1649 if (maxGainRight != -std::numeric_limits<double>::max()) {
1650#ifdef DEBUG_WANTSCHANGE
1656#ifdef DEBUG_WANTSCHANGE
1662 if (maxGainLeft != -std::numeric_limits<double>::max()) {
1663#ifdef DEBUG_WANTSCHANGE
1669#ifdef DEBUG_WANTSCHANGE
1676 if ((fabs(maxGainRight) < NUMERICAL_EPS || maxGainRight == -std::numeric_limits<double>::max())
1677 && (right || (alternatives &
LCA_RIGHT) == 0)) {
1680 if ((fabs(maxGainLeft) < NUMERICAL_EPS || maxGainLeft == -std::numeric_limits<double>::max())
1681 && (left || (alternatives &
LCA_LEFT) == 0)) {
1686#ifdef DEBUG_WANTSCHANGE
1689 <<
" defaultNextSpeed=" << defaultNextSpeed
1690 <<
" maxGain=" << maxGain
1691 <<
" maxGainRight=" << maxGainRight
1692 <<
" maxGainLeft=" << maxGainLeft
1695 <<
" latDist=" << latDist
1696 <<
" latDistNice=" << latDistNice
1697 <<
" sublaneCompact=" << sublaneCompact
1710 double acceptanceTime;
1719 double minFactor = 1.0;
1720 for (
int i = 0; i < followers.
numSublanes(); ++i) {
1722 if (follower.first !=
nullptr && follower.second < 2 * follower.first->getCarFollowModel().brakeGap(follower.first->getSpeed())) {
1725 const double fRSF = follower.first->getLane()->getVehicleMaxSpeed(follower.first) / follower.first->getLane()->getSpeedLimit();
1726 if (fRSF > roadSpeedFactor) {
1729 if (factor < minFactor) {
1735 acceptanceTime *= minFactor;
1739 double fullSpeedDrivingSeconds =
MIN2(acceptanceTime, fullSpeedGap / vMax);
1741 if (neighLead.first != 0 && neighLead.first->getSpeed() < vMax) {
1742 fullSpeedGap =
MAX2(0.,
MIN2(fullSpeedGap,
1744 vMax, neighLead.first->
getSpeed(), neighLead.first->getCarFollowModel().getMaxDecel())));
1745 fullSpeedDrivingSeconds =
MIN2(fullSpeedDrivingSeconds, fullSpeedGap / (vMax - neighLead.first->getSpeed()));
1754#ifdef DEBUG_WANTSCHANGE
1757 <<
" considering keepRight:"
1759 <<
" neighDist=" << neighDist
1761 <<
" leaderSpeed=" << (neighLead.first == 0 ? -1 : neighLead.first->getSpeed())
1763 myVehicle.
getSpeed(), neighLead.first->getSpeed(), neighLead.first->getCarFollowModel().getMaxDecel()))
1764 <<
" acceptanceTime=" << acceptanceTime
1765 <<
" fullSpeedGap=" << fullSpeedGap
1766 <<
" fullSpeedDrivingSeconds=" << fullSpeedDrivingSeconds
1767 <<
" dProb=" << deltaProb
1768 <<
" isSlide=" << isSlide
1779 latDist = latLaneDist;
1780 maneuverDist = latLaneDist;
1781 blocked =
checkBlocking(neighLane, latDist, maneuverDist, laneOffset,
1782 leaders, followers, blockers,
1783 neighLeaders, neighFollowers, neighBlockers);
1786 ret &= ~LCA_KEEPRIGHT;
1792#ifdef DEBUG_WANTSCHANGE
1797 <<
" neighDist=" << neighDist
1801 <<
" latDist=" << latDist
1811 int blockedFully = 0;
1812 maneuverDist = latDist;
1813 blocked =
checkBlocking(neighLane, latDist, maneuverDist, laneOffset,
1814 leaders, followers, blockers,
1815 neighLeaders, neighFollowers, neighBlockers,
1816 nullptr,
nullptr,
false, 0, &blockedFully);
1822 ret &= ~LCA_SPEEDGAIN;
1829#ifdef DEBUG_WANTSCHANGE
1834 <<
" latDist=" << latDist
1835 <<
" neighDist=" << neighDist
1838 <<
" stayInLane=" << stayInLane
1849 int blockedFully = 0;
1850 maneuverDist = latDist;
1851 blocked =
checkBlocking(neighLane, latDist, maneuverDist, laneOffset,
1852 leaders, followers, blockers,
1853 neighLeaders, neighFollowers, neighBlockers,
1854 nullptr,
nullptr,
false, 0, &blockedFully);
1859 ret &= ~LCA_SPEEDGAIN;
1864 double latDistSublane = 0.;
1866 const double halfVehWidth =
getWidth() * 0.5;
1869 && bestLaneOffset == 0
1889#ifdef DEBUG_WANTSCHANGE
1900 latDistSublane = -halfLaneWidth + halfVehWidth -
getPosLat();
1903 latDistSublane = halfLaneWidth - halfVehWidth -
getPosLat();
1910 latDistSublane = latDistNice;
1913 latDistSublane = sublaneSides[sublaneCompact] - rightVehSide;
1931 latDistSublane * latDist > 0) {
1933#if defined(DEBUG_WANTSCHANGE) || defined(DEBUG_STATE) || defined(DEBUG_MANEUVER)
1938 <<
" latDist=" << latDist
1939 <<
" latDistSublane=" << latDistSublane
1940 <<
" relGainSublane=" <<
computeSpeedGain(latDistSublane, defaultNextSpeed)
1941 <<
" maneuverDist=" << maneuverDist
1953#if defined(DEBUG_WANTSCHANGE)
1955 <<
" speedGain=" <<
computeSpeedGain(latDistSublane, defaultNextSpeed) <<
")\n";
1963#if defined(DEBUG_WANTSCHANGE)
1965 std::cout <<
" aborting sublane change due to prior maneuver\n";
1970 latDist = latDistSublane * (
isOpposite() ? -1 : 1);
1975#ifdef DEBUG_WANTSCHANGE
1978 <<
" latDist=" << latDist
1986#ifdef DEBUG_WANTSCHANGE
1992 maneuverDist = latDist;
1993 blocked =
checkBlocking(neighLane, latDist, maneuverDist, laneOffset,
1994 leaders, followers, blockers,
1995 neighLeaders, neighFollowers, neighBlockers);
1998 ret &= ~LCA_SUBLANE;
2024#ifdef DEBUG_WANTSCHANGE
2041 if ((*blocked) !=
nullptr) {
2043#ifdef DEBUG_SLOWDOWN
2052 if (gap > POSITION_EPS) {
2066 (gap - POSITION_EPS), (*blocked)->getSpeed(),
2067 (*blocked)->getCarFollowModel().getMaxDecel()),
false);
2085 if (cand !=
nullptr && cand->getBidiLane() == lane) {
2099 assert(preb.size() == lanes.size() ||
isOpposite());
2100#ifdef DEBUG_EXPECTED_SLSPEED
2103 <<
" sublaneOffset=" << sublaneOffset <<
" laneIndex=" << laneIndex <<
" lane=" << lane->
getID() <<
" ahead=" << ahead.
toString() <<
"\n";
2107 for (
int sublane = 0; sublane < (int)ahead.
numSublanes(); ++sublane) {
2108 const int edgeSublane = sublane + sublaneOffset;
2116 const MSVehicle* leader = ahead[sublane].first;
2117 const double gap = ahead[sublane].second;
2119 if (leader ==
nullptr) {
2124 const int prebIndex =
isOpposite() ? (int)preb.size() - 1 : laneIndex;
2135#ifdef DEBUG_EXPECTED_SLSPEED
2137 std::cout <<
SIMTIME <<
" updateExpectedSublaneSpeeds sublane=" << sublane <<
" leader=" << leader->
getID() <<
" bidi=" << bidi->
getID() <<
" gap=" << gap <<
" vSafe=" << vSafe <<
"\n";
2147#ifdef DEBUG_EXPECTED_SLSPEED
2149 std::cout <<
" updateExpectedSublaneSpeeds edgeSublane=" << edgeSublane <<
" leader=" << leader->
getID() <<
" gap=" << gap <<
" vSafe=" << vSafe <<
"\n";
2158 double foeRight, foeLeft;
2162 if (pedLeader.first != 0) {
2167#ifdef DEBUG_EXPECTED_SLSPEED
2169 std::cout <<
" updateExpectedSublaneSpeeds edgeSublane=" << edgeSublane <<
" pedLeader=" << pedLeader.first->getID() <<
" gap=" << pedGap <<
" vSafe=" << vSafe <<
"\n";
2177 double foeRight, foeLeft;
2179 const double foeRightBidi = bidi->
getWidth() - foeLeft;
2180 const double foeLeftBidi = bidi->
getWidth() - foeRight;
2185 if (pedLeader.first != 0) {
2190#ifdef DEBUG_EXPECTED_SLSPEED
2192 std::cout <<
" updateExpectedSublaneSpeeds edgeSublane=" << edgeSublane <<
" pedLeader=" << pedLeader.first->getID() <<
" (bidi) gap=" << pedGap <<
" vSafe=" << vSafe <<
"\n";
2197 vSafe =
MIN2(vMax, vSafe);
2212 const double deltaV = vMax - vLeader;
2213 if (deltaV > 0 && gap / deltaV < mySpeedGainLookahead && mySpeedGainLookahead > 0) {
2217 const double gapClosingTime =
MAX2(0.0, gap / deltaV);
2218 const double vSafe2 = (gapClosingTime * vSafe + (foreCastTime - gapClosingTime) * vLeader) / foreCastTime;
2219#ifdef DEBUG_EXPECTED_SLSPEED
2221 std::cout <<
" foreCastTime=" << foreCastTime <<
" gapClosingTime=" << gapClosingTime <<
" extrapolated vSafe=" << vSafe2 <<
"\n";
2232 double result = std::numeric_limits<double>::max();
2234 const double vehWidth =
getWidth();
2236 const double leftVehSide = rightVehSide + vehWidth;
2237 for (
int i = 0; i < (int)sublaneSides.size(); ++i) {
2239 if (
overlap(rightVehSide, leftVehSide, sublaneSides[i], leftSide)) {
2244 return result - defaultNextSpeed;
2251 double maxLength = -1;
2262 return iMax >= 0 ? ldi[iMax] : std::make_pair(
nullptr, -1);
2279 double minSpeed = std::numeric_limits<double>::max();
2281 if (ldi[i].first != 0) {
2282 const double speed = ldi[i].first->getSpeed();
2283 if (speed < minSpeed) {
2301 std::vector<CLeaderDist>* collectLeadBlockers,
2302 std::vector<CLeaderDist>* collectFollowBlockers,
2303 bool keepLatGapManeuver,
2305 int* retBlockedFully) {
2308 latDist =
MAX2(
MIN2(latDist, maxDist), -maxDist);
2317 if (laneOffset != 0) {
2328 if (laneOffset != 0) {
2332#ifdef DEBUG_BLOCKING
2344 }
else if (!forcedTraCIChange) {
2350 }
else if (!forcedTraCIChange) {
2356#ifdef DEBUG_BLOCKING
2358 std::cout <<
" checkBlocking fully=" <<
myCanChangeFully <<
" latDist=" << latDist <<
" maneuverDist=" << maneuverDist <<
"\n";
2372 if (laneOffset != 0) {
2379 int blockedFully = 0;
2384 if (laneOffset != 0) {
2390 if (retBlockedFully !=
nullptr) {
2391 *retBlockedFully = blockedFully;
2398 blocked |= blockedFully;
2403 if (collectFollowBlockers !=
nullptr && collectLeadBlockers !=
nullptr) {
2405 for (std::vector<CLeaderDist>::const_iterator it2 = collectLeadBlockers->begin(); it2 != collectLeadBlockers->end(); ++it2) {
2406 for (std::vector<CLeaderDist>::iterator it = collectFollowBlockers->begin(); it != collectFollowBlockers->end();) {
2407 if ((*it2).first == (*it).first) {
2408#ifdef DEBUG_BLOCKING
2410 std::cout <<
" removed follower " << (*it).first->getID() <<
" because it is already a leader\n";
2413 it = collectFollowBlockers->erase(it);
2427 int laneOffset,
double latDist,
double foeOffset,
bool leaders,
2428 double& safeLatGapRight,
double& safeLatGapLeft,
2429 std::vector<CLeaderDist>* collectBlockers)
const {
2436 const double vehWidth =
getWidth();
2438 const double leftVehSide = rightVehSide + vehWidth;
2439 const double rightVehSideDest = rightVehSide + latDist;
2440 const double leftVehSideDest = leftVehSide + latDist;
2441 const double rightNoOverlap =
MIN2(rightVehSideDest, rightVehSide);
2442 const double leftNoOverlap =
MAX2(leftVehSideDest, leftVehSide);
2443#ifdef DEBUG_BLOCKING
2445 std::cout <<
" checkBlockingVehicles"
2446 <<
" laneOffset=" << laneOffset
2447 <<
" latDist=" << latDist
2448 <<
" foeOffset=" << foeOffset
2449 <<
" vehRight=" << rightVehSide
2450 <<
" vehLeft=" << leftVehSide
2451 <<
" rightNoOverlap=" << rightNoOverlap
2452 <<
" leftNoOverlap=" << leftNoOverlap
2453 <<
" destRight=" << rightVehSideDest
2454 <<
" destLeft=" << leftVehSideDest
2455 <<
" leaders=" << leaders
2461 for (
int i = 0; i < vehicles.
numSublanes(); ++i) {
2463 if (vehDist.first != 0 &&
myCFRelated.count(vehDist.first) == 0) {
2464 const MSVehicle* leader = vehDist.first;
2470 double foeRight, foeLeft;
2472 const bool overlapBefore =
overlap(rightVehSide, leftVehSide, foeRight, foeLeft);
2473 const bool overlapDest =
overlap(rightVehSideDest, leftVehSideDest, foeRight, foeLeft);
2474 const bool overlapAny =
overlap(rightNoOverlap, leftNoOverlap, foeRight, foeLeft);
2475#ifdef DEBUG_BLOCKING
2477 std::cout <<
" foe=" << vehDist.first->getID()
2478 <<
" gap=" << vehDist.second
2480 <<
" foeRight=" << foeRight
2481 <<
" foeLeft=" << foeLeft
2482 <<
" overlapBefore=" << overlapBefore
2483 <<
" overlap=" << overlapAny
2484 <<
" overlapDest=" << overlapDest
2489 if (vehDist.second < 0) {
2490 if (overlapBefore && !overlapDest && !
outsideEdge()) {
2491#ifdef DEBUG_BLOCKING
2493 std::cout <<
" ignoring current overlap to come clear\n";
2497#ifdef DEBUG_BLOCKING
2503 if (collectBlockers ==
nullptr) {
2506 collectBlockers->push_back(vehDist);
2522 const double expectedGap =
MSCFModel::gapExtrapolation(timeTillAction, vehDist.second, leader->
getSpeed(), follower->
getSpeed(), leaderAccel, followerAccel, std::numeric_limits<double>::max(), std::numeric_limits<double>::max());
2525 const double followerExpectedSpeed = follower->
getSpeed() + timeTillAction * followerAccel;
2526 const double leaderExpectedSpeed =
MAX2(0., leader->
getSpeed() + timeTillAction * leaderAccel);
2529#if defined(DEBUG_ACTIONSTEPS) && defined(DEBUG_BLOCKING)
2531 std::cout <<
" timeTillAction=" << timeTillAction
2532 <<
" followerAccel=" << followerAccel
2533 <<
" followerExpectedSpeed=" << followerExpectedSpeed
2534 <<
" leaderAccel=" << leaderAccel
2535 <<
" leaderExpectedSpeed=" << leaderExpectedSpeed
2536 <<
"\n gap=" << vehDist.second
2537 <<
" gapChange=" << (expectedGap - vehDist.second)
2538 <<
" expectedGap=" << expectedGap
2539 <<
" expectedSecureGap=" << expectedSecureGap
2540 <<
" safeLatGapLeft=" << safeLatGapLeft
2541 <<
" safeLatGapRight=" << safeLatGapRight
2548 if (expectedGap < secureGap2) {
2550 if (foeRight > leftVehSide) {
2551 safeLatGapLeft =
MIN2(safeLatGapLeft, foeRight - leftVehSide);
2552 }
else if (foeLeft < rightVehSide) {
2553 safeLatGapRight =
MIN2(safeLatGapRight, rightVehSide - foeLeft);
2556#ifdef DEBUG_BLOCKING
2558 std::cout <<
" blocked by " << vehDist.first->getID() <<
" gap=" << vehDist.second <<
" expectedGap=" << expectedGap
2559 <<
" expectedSecureGap=" << expectedSecureGap <<
" secGap2=" << secureGap2 <<
" safetyFactor=" <<
getSafetyFactor()
2560 <<
" safeLatGapLeft=" << safeLatGapLeft <<
" safeLatGapRight=" << safeLatGapRight
2564 result |= blockType;
2565 if (collectBlockers ==
nullptr) {
2568#ifdef DEBUG_BLOCKING
2569 }
else if (
gDebugFlag2 && expectedGap < expectedSecureGap) {
2570 std::cout <<
" ignore blocker " << vehDist.first->getID() <<
" gap=" << vehDist.second <<
" expectedGap=" << expectedGap
2571 <<
" expectedSecureGap=" << expectedSecureGap <<
" secGap2=" << secureGap2 <<
" safetyFactor=" <<
getSafetyFactor() <<
"\n";
2574 if (collectBlockers !=
nullptr) {
2577 collectBlockers->push_back(vehDist);
2594 const double leftVehSide = rightVehSide + vehWidth;
2595#ifdef DEBUG_BLOCKING
2597 std::cout <<
" updateCFRelated foeOffset=" << foeOffset <<
" vehicles=" << vehicles.
toString() <<
"\n";
2600 for (
int i = 0; i < vehicles.
numSublanes(); ++i) {
2602 if (vehDist.first != 0 && (
myCFRelated.count(vehDist.first) == 0 || vehDist.second < 0)) {
2603 double foeRight, foeLeft;
2605#ifdef DEBUG_BLOCKING
2607 std::cout <<
" foe=" << vehDist.first->getID() <<
" gap=" << vehDist.second
2609 <<
" foeOffset=" << foeOffset
2610 <<
" egoR=" << rightVehSide <<
" egoL=" << leftVehSide
2611 <<
" iR=" << foeRight <<
" iL=" << foeLeft
2617 if (
overlap(rightVehSide, leftVehSide, foeRight, foeLeft) && !
outsideEdge() && (vehDist.second >= 0
2623 && -vehDist.second < vehDist.first->getVehicleType().getMinGap()
2626#ifdef DEBUG_BLOCKING
2628 std::cout <<
" ignoring cfrelated foe=" << vehDist.first->getID() <<
"\n";
2633 const int erased = (int)
myCFRelated.erase(vehDist.first);
2634#ifdef DEBUG_BLOCKING
2636 std::cout <<
" restoring cfrelated foe=" << vehDist.first->getID() <<
"\n";
2649 assert(right <= left);
2650 assert(right2 <= left2);
2651 return left2 >= right + NUMERICAL_EPS && left >= right2 + NUMERICAL_EPS;
2672 return changeReason;
2679 if (sd1.
state == 0) {
2681 }
else if (sd2.
state == 0) {
2691#ifdef DEBUG_WANTSCHANGE
2697 <<
" dir1=" << sd1.
dir
2701 <<
" dir2=" << sd2.
dir
2717 if (reason1 < reason2) {
2719 return (!can1 && can2 && sd1.
sameDirection(sd2)) ? sd2 : sd1;
2721 }
else if (reason1 > reason2) {
2723 return (!can2 && can1 && sd1.
sameDirection(sd2)) ? sd1 : sd2;
2731 }
else if (sd2.
dir == 0) {
2736 assert(sd1.
dir == -1);
2737 assert(sd2.
dir == 1);
2740 }
else if (sd2.
latDist >= 0) {
2786 double& currentDist,
2789 double roundaboutBonus,
2794 const bool right = (laneOffset == -1);
2795 const bool left = (laneOffset == 1);
2802 const double neighLeftPlace =
MAX2(0., neighDist - forwardPos - maxJam);
2805#ifdef DEBUG_STRATEGIC_CHANGE
2809 <<
" forwardPos=" << forwardPos
2811 <<
" laDist=" << laDist
2812 <<
" currentDist=" << currentDist
2813 <<
" usableDist=" << usableDist
2814 <<
" bestLaneOffset=" << bestLaneOffset
2815 <<
" best.length=" << best.
length
2816 <<
" maxJam=" << maxJam
2817 <<
" neighLeftPlace=" << neighLeftPlace
2823 if (laneOffset != 0 && changeToBest && bestLaneOffset == curr.
bestLaneOffset
2826 if (!
mustOvertakeStopped(
false, neighLane, neighLeaders, leaders, forwardPos, neighDist, right, latLaneDist, currentDist, latDist)) {
2827 latDist = latLaneDist;
2829#ifdef DEBUG_STRATEGIC_CHANGE
2831 std::cout <<
SIMTIME <<
" mustChangeToBest\n";
2835#ifdef DEBUG_STRATEGIC_CHANGE
2837 std::cout <<
" veh=" <<
myVehicle.
getID() <<
" avoidStoppedNeigh\n";
2856#ifdef DEBUG_STRATEGIC_CHANGE
2859 <<
" avoid overtaking on the right nv=" << nv->
getID()
2871 if (laneOffset != 0 &&
myStrategicParam >= 0 && noOpposites &&
mustOvertakeStopped(
true, neighLane, leaders, neighLeaders, forwardPos, neighDist, right, latLaneDist, currentDist, latDist)) {
2872#ifdef DEBUG_STRATEGIC_CHANGE
2874 std::cout <<
" veh=" <<
myVehicle.
getID() <<
" mustOvertakeStopped\n";
2883 }
else if (!changeToBest && (
currentDistDisallows(neighLeftPlace, abs(bestLaneOffset) + 2, laDist))) {
2890#ifdef DEBUG_STRATEGIC_CHANGE
2892 std::cout <<
" veh=" <<
myVehicle.
getID() <<
" could not change back and forth in time (1) neighLeftPlace=" << neighLeftPlace <<
"\n";
2898 && bestLaneOffset == 0
2901 && roundaboutBonus == 0
2908#ifdef DEBUG_STRATEGIC_CHANGE
2910 std::cout <<
" veh=" <<
myVehicle.
getID() <<
" does not want to leave the bestLane (neighDist=" << neighDist <<
")\n";
2915 && bestLaneOffset == 0
2921#ifdef DEBUG_STRATEGIC_CHANGE
2923 std::cout <<
" veh=" <<
myVehicle.
getID() <<
" does not want to get stranded on the on-ramp of a highway\n";
2937 MSLane* shadowPrev =
nullptr;
2939 if (*it ==
nullptr) {
2943 if (shadow ==
nullptr || currentShadowDist >= requiredDist) {
2946 if (shadowPrev !=
nullptr) {
2949 currentShadowDist += shadow->
getLength();
2950 shadowPrev = shadow;
2951#ifdef DEBUG_STRATEGIC_CHANGE
2953 std::cout <<
" shadow=" << shadow->
getID() <<
" currentShadowDist=" << currentShadowDist <<
"\n";
2957#ifdef DEBUG_STRATEGIC_CHANGE
2962 if (currentShadowDist < requiredDist && currentShadowDist < usableDist) {
2965#ifdef DEBUG_STRATEGIC_CHANGE
2967 std::cout <<
" must change for shadowLane end latDist=" << latDist <<
" myLeftSpace=" <<
myLeftSpace <<
"\n";
2975#if defined(DEBUG_STRATEGIC_CHANGE) || defined(DEBUG_TRACI)
2987 }
else if (((retTraCI &
LCA_RIGHT) != 0 && laneOffset < 0)
2988 || ((retTraCI &
LCA_LEFT) != 0 && laneOffset > 0)) {
2990 latDist = latLaneDist;
2993#if defined(DEBUG_STRATEGIC_CHANGE) || defined(DEBUG_TRACI)
3004 double posOnLane,
double neighDist,
bool right,
double latLaneDist,
double& currentDist,
double& latDist) {
3005 bool mustOvertake =
false;
3010 const int dir = latLaneDist < 0 ? -1 : 1;
3014 if (curHasStopped) {
3016 for (
int i = rightmost; i <= leftmost; i++) {
3020 const double remaining =
MIN2(neighDist, currentDist) - posOnLane;
3021#ifdef DEBUG_STRATEGIC_CHANGE
3023 std::cout <<
" overtakeDist=" << overtakeDist <<
" remaining=" << remaining
3025 <<
" hasLaneBeyond=" << hasLaneBeyond
3030 remaining > overtakeDist
3032 && (!checkCurrent || !checkOverTakeRight || !right)
3041 latDist = latLaneDist;
3042 mustOvertake =
true;
3043#ifdef DEBUG_STRATEGIC_CHANGE
3045 std::cout <<
" veh=" <<
myVehicle.
getID() <<
" overtake stopped leader=" << leader.first->getID()
3046 <<
" newCurrentDist=" << currentDist
3047 <<
" overtakeDist=" << overtakeDist
3048 <<
" remaining=" << remaining
3064 mustOvertake =
true;
3065 if (i >= rightmost && i <= leftmost) {
3072 return mustOvertake;
3093 double& maneuverDist,
3129 const double oldLatDist = latDist;
3130 const double oldManeuverDist = maneuverDist;
3135 const double halfWidth =
getWidth() * 0.5;
3141 double surplusGapRight = oldCenter - halfWidth;
3142 double surplusGapLeft =
getLeftBorder(laneOffset != 0) - oldCenter - halfWidth;
3143 const bool stayInLane = (laneOffset == 0
3147 && (surplusGapLeft >= 0 && surplusGapRight >= 0)));
3150 std::swap(surplusGapLeft, surplusGapRight);
3152#ifdef DEBUG_KEEP_LATGAP
3154 std::cout <<
"\n " <<
SIMTIME <<
" keepLatGap() laneOffset=" << laneOffset
3155 <<
" latDist=" << latDist
3156 <<
" maneuverDist=" << maneuverDist
3160 <<
" gapFactor=" << gapFactor
3161 <<
" stayInLane=" << stayInLane <<
"\n"
3162 <<
" stayInEdge: surplusGapRight=" << surplusGapRight <<
" surplusGapLeft=" << surplusGapLeft <<
"\n";
3166 if (surplusGapLeft < 0 || surplusGapRight < 0) {
3176 if (laneOffset != 0) {
3179 updateGaps(neighLeaders, neighRight, oldCenter, gapFactor, surplusGapRight, surplusGapLeft,
true);
3180 updateGaps(neighFollowers, neighRight, oldCenter, gapFactor, surplusGapRight, surplusGapLeft,
true, netOverlap);
3182#ifdef DEBUG_KEEP_LATGAP
3184 std::cout <<
" minGapLat: surplusGapRight=" << surplusGapRight <<
" surplusGapLeft=" << surplusGapLeft <<
"\n"
3194 if (stayInLane || laneOffset == 1) {
3197 surplusGapRight =
MIN2(surplusGapRight,
MAX2(0.0, halfLaneWidth + posLat - halfWidth));
3198 physicalGapRight =
MIN2(physicalGapRight,
MAX2(0.0, halfLaneWidth + posLat - halfWidth));
3200 if (stayInLane || laneOffset == -1) {
3203 surplusGapLeft =
MIN2(surplusGapLeft,
MAX2(0.0, halfLaneWidth - posLat - halfWidth));
3204 physicalGapLeft =
MIN2(physicalGapLeft,
MAX2(0.0, halfLaneWidth - posLat - halfWidth));
3206#ifdef DEBUG_KEEP_LATGAP
3208 std::cout <<
" stayInLane: surplusGapRight=" << surplusGapRight <<
" surplusGapLeft=" << surplusGapLeft <<
"\n";
3212 if (surplusGapRight + surplusGapLeft < 0) {
3217 const double equalDeficit = 0.5 * (surplusGapLeft + surplusGapRight);
3218 if (surplusGapRight < surplusGapLeft) {
3220 const double delta =
MIN2(equalDeficit - surplusGapRight, physicalGapLeft);
3222 maneuverDist = delta;
3223#ifdef DEBUG_KEEP_LATGAP
3225 std::cout <<
" insufficient latSpace, move left: delta=" << delta <<
"\n";
3230 const double delta =
MIN2(equalDeficit - surplusGapLeft, physicalGapRight);
3232 maneuverDist = -delta;
3233#ifdef DEBUG_KEEP_LATGAP
3235 std::cout <<
" insufficient latSpace, move right: delta=" << delta <<
"\n";
3241 latDist =
MAX2(
MIN2(latDist, surplusGapLeft), -surplusGapRight);
3242 maneuverDist =
MAX2(
MIN2(maneuverDist, surplusGapLeft), -surplusGapRight);
3243 if ((state &
LCA_KEEPRIGHT) != 0 && maneuverDist != oldManeuverDist) {
3245 latDist = oldLatDist;
3246 maneuverDist = oldManeuverDist;
3248#ifdef DEBUG_KEEP_LATGAP
3250 std::cout <<
" adapted latDist=" << latDist <<
" maneuverDist=" << maneuverDist <<
" (old=" << oldLatDist <<
")\n";
3265#ifdef DEBUG_KEEP_LATGAP
3267 std::cout <<
" traci influenced latDist=" << latDist <<
"\n";
3273 const bool traciChange = ((state | traciState) &
LCA_TRACI) != 0;
3274 if (nonSublaneChange && !traciChange) {
3276#ifdef DEBUG_KEEP_LATGAP
3278 std::cout <<
" wanted changeToLeft oldLatDist=" << oldLatDist <<
", blocked latGap changeToRight\n";
3281 latDist = oldLatDist;
3284#ifdef DEBUG_KEEP_LATGAP
3286 std::cout <<
" wanted changeToRight oldLatDist=" << oldLatDist <<
", blocked latGap changeToLeft\n";
3289 latDist = oldLatDist;
3299#ifdef DEBUG_KEEP_LATGAP
3301 std::cout <<
" latDistUpdated=" << latDist <<
" oldLatDist=" << oldLatDist <<
"\n";
3304 blocked =
checkBlocking(neighLane, latDist, maneuverDist, laneOffset, leaders, followers, blockers, neighLeaders, neighFollowers, neighBlockers,
nullptr,
nullptr, nonSublaneChange);
3307 state = (state & ~LCA_STAY);
3318#if defined(DEBUG_KEEP_LATGAP) || defined(DEBUG_STATE)
3320 std::cout <<
" latDist2=" << latDist
3334 double& surplusGapRight,
double& surplusGapLeft,
3335 bool saveMinGap,
double netOverlap,
3337 std::vector<CLeaderDist>* collectBlockers) {
3339 const double halfWidth =
getWidth() * 0.5 + NUMERICAL_EPS;
3342 if (others[i].first != 0 && others[i].second <= 0
3344 && (netOverlap == 0 || others[i].second + others[i].first->getVehicleType().getMinGap() < netOverlap)) {
3348 double foeRight, foeLeft;
3350 const double foeCenter = foeRight + 0.5 * res;
3351 const double gap =
MIN2(fabs(foeRight - oldCenter), fabs(foeLeft - oldCenter)) - halfWidth;
3354 const double currentMinGap = desiredMinGap * gapFactor;
3365#if defined(DEBUG_BLOCKING) || defined(DEBUG_KEEP_LATGAP)
3367 std::cout <<
" updateGaps"
3369 <<
" foe=" << foe->
getID()
3370 <<
" foeRight=" << foeRight
3371 <<
" foeLeft=" << foeLeft
3372 <<
" oldCenter=" << oldCenter
3373 <<
" gap=" << others[i].second
3374 <<
" latgap=" << gap
3375 <<
" currentMinGap=" << currentMinGap
3376 <<
" surplusGapRight=" << surplusGapRight
3377 <<
" surplusGapLeft=" << surplusGapLeft
3385 if (foeCenter < oldCenter) {
3387 surplusGapRight =
MIN3(surplusGapRight, gap - currentMinGap,
MAX2(currentMinGap, gap - foeManeuverDist));
3390 surplusGapLeft =
MIN3(surplusGapLeft, gap - currentMinGap,
MAX2(currentMinGap, gap - foeManeuverDist));
3393 if (foeCenter < oldCenter) {
3394#if defined(DEBUG_BLOCKING) || defined(DEBUG_KEEP_LATGAP)
3396 std::cout <<
" new minimum rightGap=" << gap <<
"\n";
3401#if defined(DEBUG_BLOCKING) || defined(DEBUG_KEEP_LATGAP)
3403 std::cout <<
" new minimum leftGap=" << gap <<
"\n";
3409 if (collectBlockers !=
nullptr) {
3411 if ((foeCenter < oldCenter && latDist < 0 && gap < (desiredMinGap - latDist))
3412 || (foeCenter > oldCenter && latDist > 0 && gap < (desiredMinGap + latDist))) {
3413 collectBlockers->push_back(others[i]);
3430 int currentDirection =
mySpeedLat >= 0 ? 1 : -1;
3431 int directionWish = latDist >= 0 ? 1 : -1;
3438 maxSpeedLat =
MIN2(maxSpeedLat, speedBound);
3442 maxSpeedLat =
MAX2(maxSpeedLat, speedBound);
3448#ifdef DEBUG_MANEUVER
3452 <<
" computeSpeedLat()"
3453 <<
" latDist=" << latDist
3454 <<
" maneuverDist=" << maneuverDist
3455 <<
" urgent=" << urgent
3457 <<
" currentDirection=" << currentDirection
3458 <<
" directionWish=" << directionWish
3460 <<
" maxSpeedLat=" << maxSpeedLat
3466 if (directionWish == 1) {
3480 if (maneuverDist * latDist > 0) {
3481 maneuverDist = fullLatDist;
3484#ifdef DEBUG_MANEUVER
3488 <<
" fullLatDist=" << fullLatDist
3489 <<
" speedAccel=" << speedAccel
3490 <<
" speedDecel=" << speedDecel
3491 <<
" speedBound=" << speedBound
3495 if (speedDecel * speedAccel <= 0 && (
3497 (latDist >= 0 && speedAccel >= speedBound && speedBound >= speedDecel)
3498 || (latDist <= 0 && speedAccel <= speedBound && speedBound <= speedDecel))) {
3500#ifdef DEBUG_MANEUVER
3502 std::cout <<
" computeSpeedLat a)\n";
3509#ifdef DEBUG_MANEUVER
3511 std::cout <<
" computeSpeedLat b)\n";
3518 if ((fabs(minDistAccel) < fabs(fullLatDist)) || (fabs(minDistAccel - fullLatDist) < NUMERICAL_EPS)) {
3519#ifdef DEBUG_MANEUVER
3521 std::cout <<
" computeSpeedLat c)\n";
3526#ifdef DEBUG_MANEUVER
3528 std::cout <<
" minDistAccel=" << minDistAccel <<
"\n";
3533 if ((fabs(minDistCurrent) < fabs(fullLatDist)) || (fabs(minDistCurrent - fullLatDist) < NUMERICAL_EPS)) {
3534#ifdef DEBUG_MANEUVER
3536 std::cout <<
" computeSpeedLat d)\n";
3543#ifdef DEBUG_MANEUVER
3545 std::cout <<
" computeSpeedLat e)\n";
3557#ifdef DEBUG_MANEUVER
3559 std::cout <<
" rightDanger speedLat=" << speedLat <<
"\n";
3564#ifdef DEBUG_MANEUVER
3566 std::cout <<
" leftDanger speedLat=" << speedLat <<
"\n";
3581 const bool indirect = turnInfo.second ==
nullptr ? false : turnInfo.second->isIndirect();
3614 double maneuverDist) {
3617 double secondsToLeaveLane;
3627#if defined(DEBUG_MANEUVER) || defined(DEBUG_COMMITTED_SPEED)
3643 double nextLeftSpace;
3644 if (nextActionStepSpeed > 0.) {
3659#if defined(DEBUG_MANEUVER) || defined(DEBUG_COMMITTED_SPEED)
3663 <<
" avoidArrivalSpeed=" << avoidArrivalSpeed
3666 <<
"\n nextLeftSpace=" << nextLeftSpace
3667 <<
" nextActionStepSpeed=" << nextActionStepSpeed
3668 <<
" nextActionStepRemainingSeconds=" << secondsToLeaveLane - timeTillActionStep
3678#if defined(DEBUG_MANEUVER) || defined(DEBUG_COMMITTED_SPEED)
3682 <<
" secondsToLeave=" << secondsToLeaveLane
3704 const double vehWidth =
getWidth();
3706 const double leftVehSide = rightVehSide + vehWidth;
3707 const double rightVehSideDest = rightVehSide + latDist;
3708 const double leftVehSideDest = leftVehSide + latDist;
3709#if defined(DEBUG_MANEUVER) || defined(DEBUG_COMMITTED_SPEED)
3711 std::cout <<
" commitFollowSpeed"
3712 <<
" latDist=" << latDist
3713 <<
" foeOffset=" << foeOffset
3714 <<
" vehRight=" << rightVehSide
3715 <<
" vehLeft=" << leftVehSide
3716 <<
" destRight=" << rightVehSideDest
3717 <<
" destLeft=" << leftVehSideDest
3723 if (vehDist.first != 0) {
3724 const MSVehicle* leader = vehDist.first;
3726 double foeRight, foeLeft;
3728#if defined(DEBUG_MANEUVER) || defined(DEBUG_COMMITTED_SPEED)
3730 std::cout <<
" foe=" << vehDist.first->getID()
3731 <<
" gap=" << vehDist.second
3733 <<
" foeRight=" << foeRight
3734 <<
" foeLeft=" << foeLeft
3735 <<
" overlapBefore=" <<
overlap(rightVehSide, leftVehSide, foeRight, foeLeft)
3736 <<
" overlapDest=" <<
overlap(rightVehSideDest, leftVehSideDest, foeRight, foeLeft)
3740 if (
overlap(rightVehSideDest, leftVehSideDest, foeRight, foeLeft)) {
3744 speed =
MIN2(speed, vSafe);
3745#if defined(DEBUG_MANEUVER) || defined(DEBUG_COMMITTED_SPEED)
3747 std::cout <<
" case1 vsafe=" << vSafe <<
" speed=" << speed <<
"\n";
3750 }
else if (
overlap(rightVehSide, leftVehSide, foeRight, foeLeft)) {
3755 speed =
MIN2(speed, vSafe);
3756#if defined(DEBUG_MANEUVER) || defined(DEBUG_COMMITTED_SPEED)
3758 std::cout <<
" case2 vsafe=" << vSafe <<
" speed=" << speed <<
"\n";
3778 return myOppositeParam <= 0 ? std::numeric_limits<double>::max() : 1 /
myOppositeParam;
3837 }
else if (key ==
"speedGainProbabilityRight") {
3839 }
else if (key ==
"speedGainProbabilityLeft") {
3841 }
else if (key ==
"keepRightProbability") {
3843 }
else if (key ==
"lookAheadSpeed") {
3845 }
else if (key ==
"sigmaState") {
3848 }
else if (key ==
"speedGainRP") {
3850 }
else if (key ==
"speedGainLP") {
3852 }
else if (key ==
"keepRightP") {
3922 }
else if (key ==
"speedGainProbabilityRight") {
3924 }
else if (key ==
"speedGainProbabilityLeft") {
3926 }
else if (key ==
"keepRightProbability") {
3928 }
else if (key ==
"lookAheadSpeed") {
3930 }
else if (key ==
"sigmaState") {
3944 const std::pair<MSVehicle*, double>& leader,
3945 const std::pair<MSVehicle*, double>& follower,
3946 const std::pair<MSVehicle*, double>& neighLead,
3947 const std::pair<MSVehicle*, double>& neighFollow,
3949 const std::vector<MSVehicle::LaneQ>& preb,
3955#ifdef DEBUG_WANTSCHANGE
3957 std::cout <<
"\nWANTS_CHANGE\n" <<
SIMTIME
3961 <<
" neigh=" << neighLane.
getID()
3965 <<
" considerChangeTo=" << (laneOffset == -1 ?
"right" :
"left")
3979 double maneuverDist;
3982 leaders, followers, blockers,
3983 neighLeaders, neighFollowers, neighBlockers,
3985 lastBlocked, firstBlocked, latDist, maneuverDist, blocked);
3989 result &= ~LCA_SUBLANE;
3990 result |=
getLCA(result, latDist);
3992#if defined(DEBUG_WANTSCHANGE) || defined(DEBUG_STATE)
3997 <<
" wantsChangeTo=" << (laneOffset == -1 ?
"right" :
"left")
3998 << ((result &
LCA_URGENT) ?
" (urgent)" :
"")
4004 << ((result &
LCA_TRACI) ?
" (traci)" :
"")
4056 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
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 currentDistDisallows(double dist, int laneOffset, double lookForwardDist)
double getExtraReservation(int bestLaneOffset) const override
reserve extra space for unseen blockers when more tnan one lane change is required
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.
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
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 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 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 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.