41 #ifdef CHECK_MEMORY_LEAKS
43 #endif // CHECK_MEMORY_LEAKS
51 #define LOOK_FORWARD_SPEED_DIVIDER (SUMOReal)14.
57 #define LOOK_FORWARD_RIGHT (SUMOReal)10.
58 #define LOOK_FORWARD_LEFT (SUMOReal)20.
60 #define JAM_FACTOR (SUMOReal)1.
63 #define LCA_RIGHT_IMPATIENCE (SUMOReal)-1.
64 #define CUT_IN_LEFT_SPEED_THRESHOLD (SUMOReal)27.
65 #define MAX_ONRAMP_LENGTH (SUMOReal)200.
67 #define LOOK_AHEAD_MIN_SPEED (SUMOReal)0.0
68 #define LOOK_AHEAD_SPEED_MEMORY (SUMOReal)0.9
69 #define LOOK_AHEAD_SPEED_DECREMENT 6.
71 #define HELP_DECEL_FACTOR (SUMOReal)1.0
73 #define HELP_OVERTAKE (SUMOReal)(10.0 / 3.6)
74 #define MIN_FALLBEHIND (SUMOReal)(14.0 / 3.6)
76 #define KEEP_RIGHT_HEADWAY (SUMOReal)2.0
78 #define URGENCY (SUMOReal)2.0
80 #define ROUNDABOUT_DIST_BONUS (SUMOReal)100.0
82 #define CHANGE_PROB_THRESHOLD_RIGHT (SUMOReal)2.0
83 #define CHANGE_PROB_THRESHOLD_LEFT (SUMOReal)0.2
84 #define KEEP_RIGHT_TIME (SUMOReal)5.0 // the number of seconds after which a vehicle should move to the right lane
85 #define KEEP_RIGHT_ACCEPTANCE (SUMOReal)7.0 // calibration factor for determining the desire to keep right
87 #define RELGAIN_NORMALIZATION_MIN_SPEED (SUMOReal)10.0
89 #define TURN_LANE_DIST (SUMOReal)200.0 // the distance at which a lane leading elsewhere is considered to be a turn-lane that must be avoided
96 #define DEBUG_COND false
101 return v == 0 ?
"NULL" : v->
getID();
110 mySpeedGainProbability(0),
111 myKeepRightProbability(0),
112 myLeadingBlockerLength(0),
127 const std::pair<MSVehicle*, SUMOReal>& leader,
128 const std::pair<MSVehicle*, SUMOReal>& neighLead,
129 const std::pair<MSVehicle*, SUMOReal>& neighFollow,
131 const std::vector<MSVehicle::LaneQ>& preb,
142 <<
" considerChangeTo=" << (laneOffset == -1 ?
"right" :
"left")
146 const int result =
_wantsChange(laneOffset, msgPass, blocked, leader, neighLead, neighFollow, neighLane, preb, lastBlocked, firstBlocked);
151 <<
" wantsChangeTo=" << (laneOffset == -1 ?
"right" :
"left")
158 << ((result &
LCA_TRACI) ?
" (traci)" :
"")
175 const std::string patched = (wanted != newSpeed ?
" patched=" +
toString(newSpeed) :
"");
181 <<
" wanted=" << wanted
212 std::cout << time <<
" veh=" <<
myVehicle.
getID() <<
" slowing down for leading blocker, safe=" << safe << (safe +
NUMERICAL_EPS < min ?
" (not enough)" :
"") <<
"\n";
214 return MAX2(min, safe);
221 for (std::vector<SUMOReal>::const_iterator i =
myVSafes.begin(); i !=
myVSafes.end(); ++i) {
223 if (v >= min && v <= max) {
224 nVSafe =
MIN2(v, nVSafe);
227 std::cout << time <<
" veh=" <<
myVehicle.
getID() <<
" got nVSafe=" << nVSafe <<
"\n";
232 std::cout << time <<
" veh=" <<
myVehicle.
getID() <<
" ignoring low nVSafe=" << v <<
" min=" << min <<
"\n";
236 std::cout << time <<
" veh=" <<
myVehicle.
getID() <<
" ignoring high nVSafe=" << v <<
" max=" << max <<
"\n";
244 std::cout << time <<
" veh=" <<
myVehicle.
getID() <<
" got vSafe\n";
255 std::cout << time <<
" veh=" <<
myVehicle.
getID() <<
" LCA_WANTS_LANECHANGE (strat, no vSafe)\n";
257 return (max + wanted) / (
SUMOReal) 2.0;
262 std::cout << time <<
" veh=" <<
myVehicle.
getID() <<
" LCA_BLOCKED_BY_LEADER (coop)\n";
264 return (min + wanted) / (
SUMOReal) 2.0;
268 std::cout << time <<
" veh=" <<
myVehicle.
getID() <<
" LCA_BLOCKED_BY_FOLLOWER (coop)\n";
270 return (max + wanted) / (
SUMOReal) 2.0;
312 std::cout << time <<
" veh=" <<
myVehicle.
getID() <<
" LCA_AMBLOCKINGLEADER\n";
314 return (max + wanted) / (
SUMOReal) 2.0;
319 std::cout << time <<
" veh=" <<
myVehicle.
getID() <<
" LCA_AMBLOCKINGFOLLOWER_DONTBRAKE\n";
340 if (pinfo->first >= 0) {
348 <<
" informedBy=" << sender->
getID()
349 <<
" info=" << pinfo->second
350 <<
" vSafe=" << pinfo->first
362 const std::pair<MSVehicle*, SUMOReal>& neighLead,
366 for (std::vector<SUMOReal>::const_iterator i =
myVSafes.begin(); i !=
myVSafes.end(); ++i) {
369 plannedSpeed =
MIN2(plannedSpeed, v);
373 std::cout <<
" informLeader speed=" <<
myVehicle.
getSpeed() <<
" planned=" << plannedSpeed <<
"\n";
377 assert(neighLead.first != 0);
379 if (
gDebugFlag2) std::cout <<
" blocked by leader nv=" << nv->
getID() <<
" nvSpeed=" << nv->
getSpeed() <<
" needGap="
383 const SUMOReal overtakeDist = (neighLead.second
395 || dv * remainingSeconds < overtakeDist) {
409 <<
" cannot overtake leader nv=" << nv->
getID()
411 <<
" remainingSeconds=" << remainingSeconds
412 <<
" targetSpeed=" << targetSpeed
413 <<
" nextSpeed=" << nextSpeed
422 <<
" cannot overtake fast leader nv=" << nv->
getID()
424 <<
" remainingSeconds=" << remainingSeconds
425 <<
" targetSpeed=" << targetSpeed
434 <<
" wants to overtake leader nv=" << nv->
getID()
436 <<
" remainingSeconds=" << remainingSeconds
437 <<
" currentGap=" << neighLead.second
439 <<
" overtakeDist=" << overtakeDist
446 }
else if (neighLead.first != 0) {
455 std::cout <<
" not blocked by leader nv=" << nv->
getID()
457 <<
" gap=" << neighLead.second
458 <<
" nextGap=" << neighLead.second - dv
460 <<
" targetSpeed=" << targetSpeed
463 return MIN2(targetSpeed, plannedSpeed);
475 const std::pair<MSVehicle*, SUMOReal>& neighFollow,
479 assert(neighFollow.first != 0);
481 if (
gDebugFlag2) std::cout <<
" blocked by follower nv=" << nv->
getID() <<
" nvSpeed=" << nv->
getSpeed() <<
" needGap="
487 if ((neededGap - neighFollow.second) / remainingSeconds < (plannedSpeed - nv->
getSpeed())) {
489 std::cout <<
" wants to cut in before nv=" << nv->
getID() <<
" without any help neededGap=" << neededGap <<
"\n";
508 const SUMOReal dv = plannedSpeed - neighNewSpeed1s;
510 const SUMOReal decelGap = neighFollow.second + dv;
515 <<
" egoNV=" << plannedSpeed
516 <<
" nvNewSpeed=" << neighNewSpeed
517 <<
" nvNewSpeed1s=" << neighNewSpeed1s
518 <<
" deltaGap=" << dv
519 <<
" decelGap=" << decelGap
520 <<
" secGap=" << secureGap
523 if (decelGap > 0 && decelGap >= secureGap) {
530 std::cout <<
" wants to cut in before nv=" << nv->
getID()
531 <<
" vsafe=" << vsafe
535 }
else if (dv > 0 && dv * remainingSeconds > (secureGap - decelGap +
POSITION_EPS)) {
539 std::cout <<
" wants to cut in before nv=" << nv->
getID() <<
" (eventually)\n";
545 std::cout <<
" wants to cut in before nv=" << nv->
getID() <<
" (nv cannot overtake right)\n";
559 std::cout <<
" wants right follower to slow down a bit\n";
563 std::cout <<
" wants to cut in before right follower nv=" << nv->
getID() <<
" (eventually)\n";
571 const SUMOReal overtakeDist = (neighFollow.second
577 const SUMOReal needDV = overtakeDist / remainingSeconds;
584 <<
" wants to be overtaken by=" << nv->
getID()
585 <<
" overtakeDist=" << overtakeDist
587 <<
" vhelp=" << vhelp
588 <<
" needDV=" << needDV
593 }
else if (neighFollow.first != 0) {
600 std::cout <<
" wants to cut in before non-blocking follower nv=" << nv->
getID() <<
"\n";
643 const std::pair<MSVehicle*, SUMOReal>& leader,
644 const std::pair<MSVehicle*, SUMOReal>& neighLead,
645 const std::pair<MSVehicle*, SUMOReal>& neighFollow,
647 const std::vector<MSVehicle::LaneQ>& preb,
650 assert(laneOffset == 1 || laneOffset == -1);
654 int bestLaneOffset = 0;
663 for (
int p = 0; p < (int) preb.size(); ++p) {
664 if (preb[p].lane == prebLane && p + laneOffset >= 0) {
665 assert(p + laneOffset < (
int)preb.size());
667 neigh = preb[p + laneOffset];
668 currentDist = curr.
length;
670 bestLaneOffset = curr.bestLaneOffset;
672 if (bestLaneOffset == 0 && preb[p + laneOffset].bestLaneOffset == 0) {
676 <<
" bestLaneOffsetOld=" << bestLaneOffset
677 <<
" bestLaneOffsetNew=" << laneOffset
680 bestLaneOffset = laneOffset;
682 best = preb[p + bestLaneOffset];
688 const bool right = (laneOffset == -1);
693 const bool changeToBest = (right && bestLaneOffset < 0) || (!right && bestLaneOffset > 0);
717 <<
" firstBlocked=" <<
tryID(*firstBlocked)
718 <<
" lastBlocked=" <<
tryID(*lastBlocked)
719 <<
" neighLead=" <<
tryID(neighLead.first)
720 <<
" neighLeadGap=" << neighLead.second
721 <<
" neighFollow=" <<
tryID(neighFollow.first)
722 <<
" neighFollowGap=" << neighFollow.second
728 if (lastBlocked != firstBlocked) {
761 if (bestLaneOffset == 0 && leader.first != 0 && leader.first->isStopped()) {
764 + leader.first->getVehicleType().getLengthWithGap());
775 int roundaboutEdgesAhead = 0;
777 if ((*it) != 0 && (*it)->getEdge().isRoundabout()) {
778 roundaboutEdgesAhead += 1;
779 }
else if (roundaboutEdgesAhead > 0) {
784 int roundaboutEdgesAheadNeigh = 0;
786 if ((*it) != 0 && (*it)->getEdge().isRoundabout()) {
787 roundaboutEdgesAheadNeigh += 1;
788 }
else if (roundaboutEdgesAheadNeigh > 0) {
793 if (roundaboutEdgesAhead > 1) {
797 if (roundaboutEdgesAhead > 0) {
799 std::cout <<
" roundaboutEdgesAhead=" << roundaboutEdgesAhead <<
" roundaboutEdgesAheadNeigh=" << roundaboutEdgesAheadNeigh <<
"\n";
805 const SUMOReal maxJam =
MAX2(preb[currIdx + laneOffset].occupation, preb[currIdx].occupation);
812 <<
" laDist=" << laDist
813 <<
" currentDist=" << currentDist
814 <<
" usableDist=" << usableDist
815 <<
" bestLaneOffset=" << bestLaneOffset
816 <<
" best.length=" << best.
length
817 <<
" maxJam=" << maxJam
818 <<
" neighLeftPlace=" << neighLeftPlace
841 <<
" avoid overtaking on the right nv=" << nv->
getID()
844 <<
" plannedSpeed=" <<
myVSafes.back()
858 std::cout <<
" veh=" <<
myVehicle.
getID() <<
" could not change back and forth in time (1) neighLeftPlace=" << neighLeftPlace <<
"\n";
861 }
else if (bestLaneOffset == 0 && (neighLeftPlace * 2. < laDist)) {
867 std::cout <<
" veh=" <<
myVehicle.
getID() <<
" could not change back and forth in time (2) neighLeftPlace=" << neighLeftPlace <<
"\n";
870 }
else if (bestLaneOffset == 0
871 && (leader.first == 0 || !leader.first->isStopped())
873 && roundaboutEdgesAhead == 0
879 std::cout <<
" veh=" <<
myVehicle.
getID() <<
" does not want to leave the bestLane (neighDist=" << neighDist <<
")\n";
889 if ((ret & lcaCounter) != 0) {
894 std::cout <<
" retAfterInfluence=" << ret <<
"\n";
904 if (changeToBest &&
abs(bestLaneOffset) > 1) {
907 std::cout <<
" reserving space for unseen blockers\n";
915 if (*firstBlocked != neighLead.first) {
922 const SUMOReal plannedSpeed =
informLeader(msgPass, blocked, myLca, neighLead, remainingSeconds);
923 if (plannedSpeed >= 0) {
925 informFollower(msgPass, blocked, myLca, neighFollow, remainingSeconds, plannedSpeed);
932 <<
" remainingSeconds=" << remainingSeconds
933 <<
" plannedSpeed=" << plannedSpeed
940 if (roundaboutEdgesAhead > 1) {
958 std::cout <<
" veh=" <<
myVehicle.
getID() <<
" does not want to get stranded on the on-ramp of a highway\n";
983 <<
" wantsChangeToHelp=" << (right ?
"right" :
"left")
985 << (((
myOwnState & myLcaCounter) != 0) ?
" (counter)" :
"")
1010 if (neighLead.first == 0) {
1015 &
myVehicle,
myVehicle.
getSpeed(), neighLead.second, neighLead.first->getSpeed(), neighLead.first->getCarFollowModel().getMaxDecel()));
1017 if (leader.first == 0) {
1025 thisLaneVSafe =
MIN2(thisLaneVSafe, vMax);
1026 neighLaneVSafe =
MIN2(neighLaneVSafe, vMax);
1027 const SUMOReal relativeGain = (neighLaneVSafe - thisLaneVSafe) /
MAX2(neighLaneVSafe,
1032 if (thisLaneVSafe - 5 / 3.6 > neighLaneVSafe) {
1046 SUMOReal fullSpeedDrivingSeconds =
MIN2(acceptanceTime, fullSpeedGap / vMax);
1047 if (neighLead.first != 0 && neighLead.first->getSpeed() < vMax) {
1050 vMax, neighLead.first->getSpeed(), neighLead.first->getCarFollowModel().getMaxDecel())));
1051 fullSpeedDrivingSeconds =
MIN2(fullSpeedDrivingSeconds, fullSpeedGap / (vMax - neighLead.first->getSpeed()));
1062 <<
" neighDist=" << neighDist
1064 <<
" leaderSpeed=" << (neighLead.first == 0 ? -1 : neighLead.first->getSpeed())
1066 myVehicle.
getSpeed(), neighLead.first->getSpeed(), neighLead.first->getCarFollowModel().getMaxDecel()))
1067 <<
" acceptanceTime=" << acceptanceTime
1068 <<
" fullSpeedGap=" << fullSpeedGap
1069 <<
" fullSpeedDrivingSeconds=" << fullSpeedDrivingSeconds
1070 <<
" dProb=" << deltaProb
1086 <<
" thisLaneVSafe=" << thisLaneVSafe
1087 <<
" neighLaneVSafe=" << neighLaneVSafe
1088 <<
" relativeGain=" << relativeGain
1089 <<
" blocked=" << blocked
1102 if (thisLaneVSafe > neighLaneVSafe) {
1129 && (right ? mySpeedGainProbability < 0 : mySpeedGainProbability > 0)) {
1141 <<
" thisLaneVSafe=" << thisLaneVSafe
1142 <<
" neighLaneVSafe=" << neighLaneVSafe
1152 if ((*blocked) != 0) {
1157 <<
" blocked=" <<
tryID(*blocked)
1176 (*blocked)->getCarFollowModel().getMaxDecel()));
1190 <<
" saveBlockerLength blocker=" <<
tryID(blocker)
1204 <<
" blocker=" <<
tryID(blocker)
1214 <<
" blocker=" <<
tryID(blocker)
1216 <<
" potential=" << potential
void * inform(void *info, MSVehicle *sender)
#define LOOK_AHEAD_MIN_SPEED
bool gDebugFlag1
global utility flags for debugging
int _wantsChange(int laneOffset, MSAbstractLaneChangeModel::MSLCMessager &msgPass, int blocked, const std::pair< MSVehicle *, SUMOReal > &leader, const std::pair< MSVehicle *, SUMOReal > &neighLead, const std::pair< MSVehicle *, SUMOReal > &neighFollow, const MSLane &neighLane, const std::vector< MSVehicle::LaneQ > &preb, MSVehicle **lastBlocked, MSVehicle **firstBlocked)
helper function for doing the actual work
MSEdge & getEdge() const
Returns the lane's edge.
#define CHANGE_PROB_THRESHOLD_LEFT
Representation of a vehicle in the micro simulation.
SUMOReal getMaxSpeed() const
Get vehicle's maximum speed [m/s].
int slowDownForBlocked(MSVehicle **blocked, int state)
compute useful slowdowns for blocked vehicles
const MSCFModel & getCarFollowModel() const
Returns the vehicle's car following model definition.
bool currentDistAllows(SUMOReal dist, int laneOffset, SUMOReal lookForwardDist)
const std::vector< MSLane * > & getLanes() const
Returns this edge's lanes.
The action is done to help someone else.
SUMOReal getLengthWithGap() const
Get vehicle's length including the minimum gap [m].
int bestLaneOffset
The (signed) number of lanes to be crossed to get to the lane which allows to continue the drive...
virtual SUMOReal followSpeed(const MSVehicle *const veh, SUMOReal speed, SUMOReal gap2pred, SUMOReal predSpeed, SUMOReal predMaxDecel) const =0
Computes the vehicle's follow speed (no dawdling)
SUMOReal myLeadingBlockerLength
The car-following model abstraction.
void * informNeighFollower(void *info, MSVehicle *sender)
Informs the follower on the desired lane.
SUMOReal getLength() const
Get vehicle's length [m].
int wantsChange(int laneOffset, MSAbstractLaneChangeModel::MSLCMessager &msgPass, int blocked, const std::pair< MSVehicle *, SUMOReal > &leader, const std::pair< MSVehicle *, SUMOReal > &neighLead, const std::pair< MSVehicle *, SUMOReal > &neighFollow, const MSLane &neighLane, const std::vector< MSVehicle::LaneQ > &preb, MSVehicle **lastBlocked, MSVehicle **firstBlocked)
Called to examine whether the vehicle wants to change using the given laneOffset. This method gets th...
static MSNet * getInstance()
Returns the pointer to the unique instance of MSNet (singleton).
MSLCM_JE2013(MSVehicle &v)
std::vector< SUMOReal > myVSafes
SUMOReal getSecureGap(const SUMOReal speed, const SUMOReal leaderSpeed, const SUMOReal leaderMaxDecel) const
Returns the minimum gap to reserve if the leader is braking at maximum.
void initLastLaneChangeOffset(int dir)
SUMOReal getPositionOnLane() const
Get the vehicle's position along the lane.
The action is due to a TraCI request.
SUMOTime getCurrentTimeStep() const
Returns the current simulation step.
SUMOReal length
The overall length which may be driven when using this lane without a lane change.
The action is urgent (to be defined by lc-model)
MSAbstractLaneChangeModel & getLaneChangeModel()
void informFollower(MSAbstractLaneChangeModel::MSLCMessager &msgPass, int blocked, int dir, const std::pair< MSVehicle *, SUMOReal > &neighFollow, SUMOReal remainingSeconds, SUMOReal plannedSpeed)
decide whether we will try cut in before the follower or allow to be overtaken
#define LCA_RIGHT_IMPATIENCE
std::pair< SUMOReal, int > Info
information regarding save velocity (unused) and state flags of the ego vehicle
static bool myAllowOvertakingRight
whether overtaking on the right is permitted
A class responsible for exchanging messages between cars involved in lane-change interaction.
const std::string & getID() const
Returns the id.
bool cancelRequest(int state)
whether the influencer cancels the given request
SUMOReal brakeGap(const SUMOReal speed) const
Returns the distance the vehicle needs to halt including driver's reaction time.
#define CUT_IN_LEFT_SPEED_THRESHOLD
SUMOReal mySpeedGainProbability
a value for tracking the probability that a change to the offset with the same sign is beneficial ...
SUMOReal getMinGap() const
Get the free space in front of vehicles of this class.
#define RELGAIN_NORMALIZATION_MIN_SPEED
#define LOOK_FORWARD_RIGHT
bool amBlockingFollowerPlusNB()
SUMOReal informLeader(MSAbstractLaneChangeModel::MSLCMessager &msgPass, int blocked, int dir, const std::pair< MSVehicle *, SUMOReal > &neighLead, SUMOReal remainingSeconds)
SUMOReal _patchSpeed(const SUMOReal min, const SUMOReal wanted, const SUMOReal max, const MSCFModel &cfModel)
void saveBlockerLength(MSVehicle *blocker, int lcaCounter)
save space for vehicles which need to counter-lane-change
#define MAX_ONRAMP_LENGTH
virtual SUMOReal stopSpeed(const MSVehicle *const veh, const SUMOReal speed, SUMOReal gap2pred) const =0
Computes the vehicle's safe speed for approaching a non-moving obstacle (no dawdling) ...
SUMOReal getSpeedLimit() const
Returns the lane's maximum allowed speed.
std::string tryID(const MSVehicle *v)
A structure representing the best lanes for continuing the route.
SUMOReal getMaxDecel() const
Get the vehicle type's maximum deceleration [m/s^2].
SUMOReal changeRequestRemainingSeconds(const SUMOTime currentTime) const
Return the remaining number of seconds of the current laneTimeLine assuming one exists.
int myOwnState
The current state of the vehicle.
std::string toString(const T &t, std::streamsize accuracy=OUTPUT_ACCURACY)
virtual void saveBlockerLength(SUMOReal length)
reserve space at the end of the lane to avoid dead locks
#define HELP_DECEL_FACTOR
MSVehicle & myVehicle
The vehicle this lane-changer belongs to.
void * informNeighLeader(void *info, MSVehicle *sender)
Informs the leader on the desired lane.
The action is needed to follow the route (navigational lc)
EdgeBasicFunction getPurpose() const
Returns the edge type (EdgeBasicFunction)
Influencer & getInfluencer()
Returns the velocity/lane influencer.
SUMOReal myKeepRightProbability
#define LOOK_AHEAD_SPEED_MEMORY
#define ROUNDABOUT_DIST_BONUS
SUMOReal occupation
The overall vehicle sum on consecutive lanes which can be passed without a lane change.
#define CHANGE_PROB_THRESHOLD_RIGHT
std::vector< MSLane * > bestContinuations
Consecutive lane that can be followed without a lane change (contribute to length and occupation) ...
SUMOReal myLookAheadSpeed
The action is due to the default of keeping right "Rechtsfahrgebot".
const MSVehicleType & getVehicleType() const
Returns the vehicle's type definition.
const SUMOReal SUMO_const_haltingSpeed
the speed threshold at which vehicles are considered as halting
Needs to stay on the current lane.
SUMOReal getSpeed() const
Returns the vehicle's current speed.
SUMOReal getWaitingSeconds() const
Returns the number of seconds waited (speed was lesser than 0.1m/s)
#define KEEP_RIGHT_ACCEPTANCE
#define LOOK_FORWARD_LEFT
const MSLinkCont & getLinkCont() const
returns the container with all links !!!
SUMOReal getVehicleMaxSpeed(const SUMOVehicle *const veh) const
Returns the lane's maximum speed, given a vehicle's speed limit adaptation.
MSLane * getLane() const
Returns the lane the vehicle is on.
int influenceChangeDecision(int state)
allow TraCI to influence a lane change decision
The edge is an internal edge.
Representation of a lane in the micro simulation.
const MSCFModel & myCarFollowModel
The vehicle's car following model.
bool currentDistDisallows(SUMOReal dist, int laneOffset, SUMOReal lookForwardDist)
Interface for lane-change models.
int getBestLaneOffset() const
returns the current offset from the best lane
SUMOReal patchSpeed(const SUMOReal min, const SUMOReal wanted, const SUMOReal max, const MSCFModel &cfModel)
Called to adapt the speed in order to allow a lane change.
const std::string & getID() const
Returns the name of the vehicle.
The action is due to the wish to be faster (tactical lc)