83 #define DEBUG_COND2(obj) ((obj != 0 && (obj)->isSelected())) 201 for (MSLinkCont::iterator i =
myLinks.begin(); i !=
myLinks.end(); ++i) {
237 (*veh)->addReminder(rem);
248 std::cout <<
SIMTIME <<
" setPartialOccupation. lane=" <<
getID() <<
" veh=" << v->
getID() <<
"\n";
261 std::cout <<
SIMTIME <<
" resetPartialOccupation. lane=" <<
getID() <<
" veh=" << v->
getID() <<
"\n";
280 std::cout <<
SIMTIME <<
" setManeuverReservation. lane=" <<
getID() <<
" veh=" << v->
getID() <<
"\n";
291 std::cout <<
SIMTIME <<
" resetManeuverReservation(): lane=" <<
getID() <<
" veh=" << v->
getID() <<
"\n";
332 if (leader ==
nullptr) {
337 leader = leaderInfo.first;
343 if (leader ==
nullptr) {
349 if (leaderBack >= frontGapNeeded) {
350 pos =
MIN2(pos, leaderBack - frontGapNeeded);
364 bool adaptableSpeed =
true;
373 if (missingRearGap > 0) {
374 if (minPos + missingRearGap <=
myLength) {
381 return isInsertionSuccess(&veh, mspeed, minPos + missingRearGap, posLat, adaptableSpeed, notification);
386 return isInsertionSuccess(&veh, mspeed, minPos, posLat, adaptableSpeed, notification);
393 const double speed = adaptableSpeed ? leader->
getSpeed() : mspeed;
395 if (leaderPos >= frontGapNeeded) {
405 MSLane::VehCont::iterator predIt =
myVehicles.begin();
416 double speed = mspeed;
417 if (adaptableSpeed && leader !=
nullptr) {
423 if (leader !=
nullptr) {
426 frontMax = leaderRearPos - frontGapNeeded;
434 if (frontMax > minPos && backMin +
POSITION_EPS < frontMax) {
503 bool patchSpeed =
true;
520 for (
int i = 0; i < 10; i++) {
546 for (
int i = 0; i < 10; i++) {
577 MSLane::checkFailure(
const MSVehicle* aVehicle,
double& speed,
double& dist,
const double nspeed,
const bool patchSpeed,
const std::string errorMsg)
const {
578 if (nspeed < speed) {
580 speed =
MIN2(nspeed, speed);
582 }
else if (speed > 0) {
586 if (emergencyBrakeGap <= dist) {
589 WRITE_WARNING(
"Vehicle '" + aVehicle->
getID() +
"' is inserted in emergency situation.");
594 if (errorMsg !=
"") {
595 WRITE_ERROR(
"Vehicle '" + aVehicle->
getID() +
"' will not be able to depart using the given velocity (" + errorMsg +
")!");
607 double speed,
double pos,
double posLat,
bool patchSpeed,
612 aVehicle->
getID() +
"'. Inserting at lane end instead.");
616 #ifdef DEBUG_INSERTION 618 std::cout <<
"\nIS_INSERTION_SUCCESS\n" 620 <<
" veh '" << aVehicle->
getID() <<
"'\n";
628 std::vector<MSLane*>::const_iterator ri = bestLaneConts.begin();
636 if (nextStop.
lane ==
this) {
637 std::stringstream msg;
638 msg <<
"scheduled stop on lane '" <<
myID <<
"' too close";
639 const double distToStop = nextStop.
pars.
endPos - pos;
641 patchSpeed, msg.str())) {
651 MSLane* currentLane =
this;
654 while (seen < dist && ri != bestLaneConts.end()) {
656 MSLinkCont::const_iterator link =
succLinkSec(*aVehicle, nRouteSuccs, *currentLane, bestLaneConts);
662 patchSpeed,
"arrival speed too low")) {
670 patchSpeed,
"junction too close")) {
679 || !(*link)->havePriority()) {
681 std::string errorMsg =
"";
682 const LinkState state = (*link)->getState();
688 errorMsg =
"unpriorised junction too close";
691 patchSpeed, errorMsg)) {
695 #ifdef DEBUG_INSERTION 697 std::cout <<
"trying insertion before minor link: " 698 <<
"insertion speed = " << speed <<
" dist=" << dist
705 nextLane = (*link)->getViaLaneOrLane();
707 if (nextLane !=
nullptr) {
713 if (nextStop.
lane == nextLane) {
714 std::stringstream msg;
715 msg <<
"scheduled stop on lane '" << nextStop.
lane->
getID() <<
"' too close";
716 const double distToStop = seen + nextStop.
pars.
endPos;
718 patchSpeed, msg.str())) {
729 #ifdef DEBUG_INSERTION 731 <<
" leader on lane '" << nextLane->
getID() <<
"': " << leaders.
toString() <<
" nspeed=" << nspeed <<
"\n";
735 #ifdef DEBUG_INSERTION 737 <<
" isInsertionSuccess lane=" <<
getID()
738 <<
" veh=" << aVehicle->
getID()
740 <<
" posLat=" << posLat
741 <<
" patchSpeed=" << patchSpeed
742 <<
" speed=" << speed
743 <<
" nspeed=" << nspeed
744 <<
" nextLane=" << nextLane->
getID()
747 <<
" failed (@641)!\n";
757 if (nspeed < speed) {
763 WRITE_ERROR(
"Vehicle '" + aVehicle->
getID() +
"' will not be able to depart using the given velocity (slow lane ahead)!");
772 if ((*link)->hasApproachingFoe(arrivalTime, leaveTime, speed, cfModel.
getMaxDecel())) {
780 currentLane = nextLane;
781 if ((*link)->getViaLane() ==
nullptr) {
795 #ifdef DEBUG_INSERTION 797 <<
" isInsertionSuccess lane=" <<
getID()
798 <<
" veh=" << aVehicle->
getID()
800 <<
" posLat=" << posLat
801 <<
" patchSpeed=" << patchSpeed
802 <<
" speed=" << speed
803 <<
" nspeed=" << nspeed
804 <<
" nextLane=" << nextLane->
getID()
805 <<
" leaders=" << leaders.
toString()
806 <<
" failed (@700)!\n";
810 #ifdef DEBUG_INSERTION 812 <<
" speed = " << speed
813 <<
" nspeed = " << nspeed
818 for (
int i = 0; i < followers.
numSublanes(); ++i) {
819 const MSVehicle* follower = followers[i].first;
820 if (follower !=
nullptr) {
822 if (followers[i].second < backGapNeeded) {
824 #ifdef DEBUG_INSERTION 826 <<
" isInsertionSuccess lane=" <<
getID()
827 <<
" veh=" << aVehicle->
getID()
829 <<
" posLat=" << posLat
830 <<
" patchSpeed=" << patchSpeed
831 <<
" speed=" << speed
832 <<
" nspeed=" << nspeed
833 <<
" follower=" << follower->
getID()
834 <<
" backGapNeeded=" << backGapNeeded
835 <<
" gap=" << followers[i].second
836 <<
" failure (@719)!\n";
848 #ifdef DEBUG_INSERTION 853 if (shadowLane !=
nullptr) {
855 for (
int i = 0; i < followers.
numSublanes(); ++i) {
856 const MSVehicle* follower = followers[i].first;
857 if (follower !=
nullptr) {
859 if (followers[i].second < backGapNeeded) {
861 #ifdef DEBUG_INSERTION 863 <<
" isInsertionSuccess shadowlane=" << shadowLane->
getID()
864 <<
" veh=" << aVehicle->
getID()
866 <<
" posLat=" << posLat
867 <<
" patchSpeed=" << patchSpeed
868 <<
" speed=" << speed
869 <<
" nspeed=" << nspeed
870 <<
" follower=" << follower->
getID()
871 <<
" backGapNeeded=" << backGapNeeded
872 <<
" gap=" << followers[i].second
873 <<
" failure (@812)!\n";
882 if (veh !=
nullptr) {
885 if (gap < gapNeeded) {
887 #ifdef DEBUG_INSERTION 889 <<
" isInsertionSuccess shadowlane=" << shadowLane->
getID()
890 <<
" veh=" << aVehicle->
getID()
892 <<
" posLat=" << posLat
893 <<
" patchSpeed=" << patchSpeed
894 <<
" speed=" << speed
895 <<
" nspeed=" << nspeed
896 <<
" leader=" << veh->
getID()
897 <<
" gapNeeded=" << gapNeeded
899 <<
" failure (@842)!\n";
910 if (missingRearGap > 0) {
912 #ifdef DEBUG_INSERTION 914 <<
" isInsertionSuccess lane=" <<
getID()
915 <<
" veh=" << aVehicle->
getID()
917 <<
" posLat=" << posLat
918 <<
" patchSpeed=" << patchSpeed
919 <<
" speed=" << speed
920 <<
" nspeed=" << nspeed
921 <<
" missingRearGap=" << missingRearGap
922 <<
" failure (@728)!\n";
929 #ifdef DEBUG_INSERTION 931 <<
" isInsertionSuccess lane=" <<
getID()
932 <<
" veh=" << aVehicle->
getID()
934 <<
" posLat=" << posLat
935 <<
" patchSpeed=" << patchSpeed
936 <<
" speed=" << speed
937 <<
" nspeed=" << nspeed
938 <<
" failed (@733)!\n";
944 #ifdef DEBUG_INSERTION 946 <<
" isInsertionSuccess lane=" <<
getID()
947 <<
" veh=" << aVehicle->
getID()
949 <<
" posLat=" << posLat
950 <<
" patchSpeed=" << patchSpeed
951 <<
" speed=" << speed
952 <<
" nspeed=" << nspeed
956 <<
"\n leaders=" << leaders.
toString()
974 double nspeed = speed;
975 #ifdef DEBUG_INSERTION 977 std::cout <<
SIMTIME <<
" safeInsertionSpeed veh=" << veh->
getID() <<
" speed=" << speed <<
"\n";
982 if (leader !=
nullptr) {
987 nspeed =
MIN2(nspeed,
989 #ifdef DEBUG_INSERTION 991 std::cout <<
" leader=" << leader->
getID() <<
" nspeed=" << nspeed <<
"\n";
1006 int freeSublanes = 1;
1011 while (freeSublanes > 0 && veh !=
nullptr) {
1012 #ifdef DEBUG_PLAN_MOVE 1015 std::cout <<
" getLastVehicleInformation lane=" <<
getID() <<
" minPos=" << minPos <<
" veh=" << veh->
getID() <<
" pos=" << veh->
getPositionOnLane(
this) <<
"\n";
1021 #ifdef DEBUG_PLAN_MOVE 1029 if (ego ==
nullptr && minPos == 0) {
1034 #ifdef DEBUG_PLAN_MOVE 1060 int freeSublanes = 1;
1062 while (freeSublanes > 0 && veh !=
nullptr) {
1063 #ifdef DEBUG_PLAN_MOVE 1065 std::cout <<
" veh=" << veh->
getID() <<
" pos=" << veh->
getPositionOnLane(
this) <<
" maxPos=" << maxPos <<
"\n";
1072 #ifdef DEBUG_PLAN_MOVE 1074 std::cout <<
" veh=" << veh->
getID() <<
" latOffset=" << latOffset <<
"\n";
1081 if (ego ==
nullptr && maxPos == std::numeric_limits<double>::max()) {
1086 #ifdef DEBUG_PLAN_MOVE 1109 double cumulatedVehLength = 0.;
1113 VehCont::reverse_iterator veh =
myVehicles.rbegin();
1116 #ifdef DEBUG_PLAN_MOVE 1120 <<
" planMovements() lane=" <<
getID()
1128 #ifdef DEBUG_PLAN_MOVE 1130 std::cout <<
" plan move for: " << (*veh)->getID();
1134 #ifdef DEBUG_PLAN_MOVE 1136 std::cout <<
" leaders=" << leaders.
toString() <<
"\n";
1139 (*veh)->planMove(t, leaders, cumulatedVehLength);
1140 cumulatedVehLength += (*veh)->getVehicleType().getLengthWithGap();
1148 veh->setApproachingForAllLinks(t);
1156 bool nextToConsiderIsPartial;
1159 while (moreReservationsAhead || morePartialVehsAhead) {
1160 if ((!moreReservationsAhead || (*vehRes)->getPositionOnLane(
this) <= veh->
getPositionOnLane())
1161 && (!morePartialVehsAhead || (*vehPart)->getPositionOnLane(
this) <= veh->
getPositionOnLane())) {
1167 if (moreReservationsAhead && !morePartialVehsAhead) {
1168 nextToConsiderIsPartial =
false;
1169 }
else if (morePartialVehsAhead && !moreReservationsAhead) {
1170 nextToConsiderIsPartial =
true;
1172 assert(morePartialVehsAhead && moreReservationsAhead);
1174 nextToConsiderIsPartial = (*vehPart)->getPositionOnLane(
this) > (*vehRes)->getPositionOnLane(
this);
1177 if (nextToConsiderIsPartial) {
1178 const double latOffset = (*vehPart)->getLatOffset(
this);
1179 #ifdef DEBUG_PLAN_MOVE 1181 std::cout <<
" partial ahead: " << (*vehPart)->getID() <<
" latOffset=" << latOffset <<
"\n";
1184 ahead.
addLeader(*vehPart,
false, latOffset);
1188 const double latOffset = (*vehRes)->getLatOffset(
this);
1189 #ifdef DEBUG_PLAN_MOVE 1191 std::cout <<
" reservation ahead: " << (*vehRes)->getID() <<
" latOffset=" << latOffset <<
"\n";
1194 ahead.
addLeader(*vehRes,
false, latOffset);
1205 #ifdef DEBUG_COLLISIONS 1207 std::vector<const MSVehicle*> all;
1209 all.push_back(*last);
1211 std::cout <<
SIMTIME <<
" detectCollisions stage=" << stage <<
" lane=" <<
getID() <<
":\n" 1214 <<
" all=" <<
toString(all) <<
"\n" 1222 std::set<const MSVehicle*, ComparatorNumericalIdLess> toRemove;
1223 std::set<const MSVehicle*> toTeleport;
1226 VehCont::reverse_iterator lastVeh =
myVehicles.rend() - 1;
1227 for (VehCont::reverse_iterator pred =
myVehicles.rbegin(); pred != lastVeh; ++pred) {
1228 VehCont::reverse_iterator veh = pred + 1;
1248 if (lead == follow) {
1267 if (lead !=
nullptr && lead != follow && shadowLane->
detectCollisionBetween(timestep, stage, follow, lead, toRemove, toTeleport)) {
1277 #ifdef DEBUG_JUNCTION_COLLISIONS 1279 std::cout <<
SIMTIME <<
" detect junction Collisions stage=" << stage <<
" lane=" <<
getID() <<
":\n" 1287 const std::vector<const MSLane*>& foeLanes =
myLinks.front()->getFoeLanes();
1292 for (std::vector<const MSLane*>::const_iterator it = foeLanes.begin(); it != foeLanes.end(); ++it) {
1293 const MSLane* foeLane = *it;
1298 if (victim == collider) {
1303 #ifdef DEBUG_JUNCTION_COLLISIONS 1305 std::cout <<
SIMTIME <<
" foe=" << victim->
getID() <<
" bound=" << colliderBoundary <<
" foeBound=" << victim->
getBoundingBox() <<
"\n";
1317 if (
myLinks.front()->getWalkingAreaFoe() !=
nullptr) {
1324 #ifdef DEBUG_PEDESTRIAN_COLLISIONS 1326 std::cout <<
SIMTIME <<
" detect pedestrian collisions stage=" << stage <<
" lane=" <<
getID() <<
"\n";
1336 #ifdef DEBUG_PEDESTRIAN_COLLISIONS 1338 std::cout <<
SIMTIME <<
" back=" << back <<
" right=" << right <<
" person=" <<
Named::getIDSecure(leader.first) <<
" dist=" << leader.second <<
"\n";
1341 if (leader.first != 0 && leader.second < length) {
1343 "Vehicle '" + v->
getID()
1344 +
"' collision with person '" + leader.first->getID()
1345 +
"', lane='" +
getID()
1346 +
"', gap=" +
toString(leader.second - length)
1348 +
" stage=" + stage +
".");
1355 for (std::set<const MSVehicle*, ComparatorNumericalIdLess>::iterator it = toRemove.begin(); it != toRemove.end(); ++it) {
1359 if (toTeleport.count(veh) > 0) {
1371 SUMOTime timestep,
const std::string& stage) {
1373 #ifdef DEBUG_PEDESTRIAN_COLLISIONS 1375 std::cout <<
SIMTIME <<
" detect pedestrian junction collisions stage=" << stage <<
" lane=" <<
getID() <<
" foeLane=" << foeLane->
getID() <<
"\n";
1379 for (std::vector<MSTransportable*>::const_iterator it_p = persons.begin(); it_p != persons.end(); ++it_p) {
1380 #ifdef DEBUG_PEDESTRIAN_COLLISIONS 1382 std::cout <<
" collider=" << collider->
getID()
1383 <<
" ped=" << (*it_p)->getID()
1384 <<
" colliderBoundary=" << colliderBoundary
1385 <<
" pedBoundary=" << (*it_p)->getBoundingBox()
1389 if (colliderBoundary.
overlapsWith((*it_p)->getBoundingBox())) {
1391 "Vehicle '" + collider->
getID()
1392 +
"' collision with person '" + (*it_p)->getID()
1393 +
"', lane='" +
getID()
1395 +
" stage=" + stage +
".");
1404 std::set<const MSVehicle*, ComparatorNumericalIdLess>& toRemove,
1405 std::set<const MSVehicle*>& toTeleport)
const {
1412 if (collider == victim) {
1419 std::swap(victim, collider);
1427 #ifdef DEBUG_COLLISIONS 1430 <<
" thisLane=" <<
getID()
1431 <<
" collider=" << collider->
getID()
1432 <<
" victim=" << victim->
getID()
1435 <<
" colliderPos=" << colliderPos
1440 <<
" minGapFactor=" << minGapFactor
1457 && victim->
getLane() !=
this) {
1470 double gap,
double latGap, std::set<const MSVehicle*, ComparatorNumericalIdLess>& toRemove,
1471 std::set<const MSVehicle*>& toTeleport)
const {
1473 "frontal collision" :
"collision");
1476 std::swap(collider, victim);
1478 std::string prefix =
"Vehicle '" + collider->
getID() +
"'; " + collisionType +
" with vehicle '" + victim->
getID() ;
1483 std::string dummyError;
1497 double victimSpeed = victim->
getSpeed();
1498 double colliderSpeed = collider->
getSpeed();
1501 if (collisionAngle < 45) {
1503 colliderSpeed =
MIN2(colliderSpeed, victimSpeed);
1504 }
else if (collisionAngle < 135) {
1521 victim->
addStop(stop, dummyError, 0,
true);
1528 collider->
addStop(stop, dummyError, 0,
true);
1539 prefix =
"Teleporting vehicle '" + collider->
getID() +
"'; " + collisionType +
" with vehicle '" + victim->
getID() ;
1540 toRemove.insert(collider);
1541 toTeleport.insert(collider);
1544 prefix =
"Removing " + collisionType +
" participants: vehicle '" + collider->
getID() +
"', vehicle '" + victim->
getID();
1545 bool removeCollider =
true;
1546 bool removeVictim =
true;
1550 toRemove.insert(victim);
1552 if (removeCollider) {
1553 toRemove.insert(collider);
1555 if (!removeVictim) {
1556 if (!removeCollider) {
1557 prefix =
"Keeping remote-controlled " + collisionType +
" participants: vehicle '" + collider->
getID() +
"', vehicle '" + victim->
getID();
1559 prefix =
"Removing " + collisionType +
" participant: vehicle '" + collider->
getID() +
"', keeping remote-controlled vehicle '" + victim->
getID();
1561 }
else if (!removeCollider) {
1562 prefix =
"Keeping remote-controlled " + collisionType +
" participant: vehicle '" + collider->
getID() +
"', removing vehicle '" + victim->
getID();
1571 +
"', lane='" +
getID()
1575 +
" stage=" + stage +
".");
1576 #ifdef DEBUG_COLLISIONS 1578 toRemove.erase(collider);
1579 toTeleport.erase(collider);
1582 toRemove.erase(victim);
1583 toTeleport.erase(victim);
1605 #ifdef DEBUG_EXEC_MOVE 1607 std::cout <<
SIMTIME <<
" veh " << veh->
getID() <<
" has arrived." << std::endl;
1612 }
else if (target !=
nullptr && moved) {
1620 lanesWithVehiclesToIntegrate.push_back(target);
1630 WRITE_WARNING(
"Teleporting vehicle '" + veh->
getID() +
"'; beyond end of lane, target lane='" +
getID() +
"', time=" +
1656 i = VehCont::reverse_iterator(
myVehicles.erase(i.base()));
1667 const bool minorLink = !wrongLane && (link !=
myLinks.end()) && !((*link)->havePriority());
1668 const std::string reason = (wrongLane ?
" (wrong lane)" : (minorLink ?
" (yield)" :
" (jam)"));
1675 + (r2 ?
" (highway)" :
"")
1679 }
else if (minorLink) {
1695 lanesWithVehiclesToIntegrate.push_back(
this);
1717 const MSLane* firstInternal =
this;
1719 while (pred !=
nullptr && pred->
isInternal()) {
1720 firstInternal = pred;
1724 return firstInternal;
1731 DictType::iterator it =
myDict.find(
id);
1732 if (it ==
myDict.end()) {
1734 myDict.insert(DictType::value_type(
id, ptr));
1743 DictType::iterator it =
myDict.find(
id);
1744 if (it ==
myDict.end()) {
1754 for (DictType::iterator i =
myDict.begin(); i !=
myDict.end(); ++i) {
1763 for (DictType::iterator i =
myDict.begin(); i !=
myDict.end(); ++i) {
1764 into.push_back((*i).first);
1769 template<
class RTREE>
void 1771 for (DictType::iterator i =
myDict.begin(); i !=
myDict.end(); ++i) {
1775 const float cmin[2] = {(float) b.
xmin(), (float) b.
ymin()};
1776 const float cmax[2] = {(float) b.
xmax(), (float) b.
ymax()};
1777 into.Insert(cmin, cmax, l);
1781 template void MSLane::fill<NamedRTree>(
NamedRTree& into);
1799 return (link !=
myLinks.end());
1810 assert(veh->
getLane() ==
this);
1823 #ifdef DEBUG_VEHICLE_CONTAINER 1827 return wasInactive &&
myVehicles.size() != 0;
1842 #ifdef DEBUG_CONTEXT 1844 std::cout <<
"sortManeuverReservations on lane " <<
getID()
1849 #ifdef DEBUG_CONTEXT 1925 MSLinkCont::const_iterator
1927 const MSLane& succLinkSource,
const std::vector<MSLane*>& conts) {
1930 if (nRouteEdge ==
nullptr) {
1932 return succLinkSource.
myLinks.end();
1936 assert(succLinkSource.
myLinks.size() == 1);
1939 return succLinkSource.
myLinks.begin();
1950 MSLinkCont::const_iterator link;
1951 if (nRouteSuccs < (
int)conts.size()) {
1953 for (link = succLinkSource.
myLinks.begin(); link != succLinkSource.
myLinks.end(); ++link) {
1954 if ((*link)->getLane() !=
nullptr && (*link)->getLane()->myEdge == nRouteEdge && (*link)->getLane()->allowsVehicleClass(veh.
getVehicleType().
getVehicleClass())) {
1956 if ((*link)->getLane() == conts[nRouteSuccs]) {
1963 return succLinkSource.
myLinks.end();
1966 #ifdef DEBUG_NO_CONNECTION 1968 WRITE_WARNING(
"Could not find connection between lane " + succLinkSource.
getID() +
" and lane " + conts[nRouteSuccs]->getID() +
1971 return succLinkSource.
myLinks.end();
1983 MSLinkCont::const_iterator l =
myLinks.begin();
1986 if ((*l)->getViaLane()->getID() == target->
getID()) {
1993 if ((*l)->getLane()->getID() == target->
getID()) {
2007 const MSLane*
internal =
this;
2046 assert(remVehicle->
getLane() ==
this);
2048 if (remVehicle == *it) {
2083 }
else if (!approachingEdge->
isInternal() && warnMultiCon) {
2086 WRITE_WARNING(
"Lane '" +
getID() +
"' is approached multiple times from edge '" + approachingEdge->
getID() +
"'. This may cause collisions.");
2100 std::map<MSEdge*, std::vector<MSLane*> >::const_iterator i =
myApproachingLanes.find(edge);
2104 const std::vector<MSLane*>& lanes = (*i).second;
2105 return find(lanes.begin(), lanes.end(), lane) != lanes.end();
2111 inline int operator()(
const std::pair<const MSVehicle*, double>& p1,
const std::pair<const MSVehicle*, double>& p2)
const {
2112 return p1.second < p2.second;
2124 const MSVehicle* v = followerInfo.first;
2142 std::pair<MSVehicle* const, double>
2143 MSLane::getLeader(
const MSVehicle* veh,
const double vehPos,
const std::vector<MSLane*>& bestLaneConts,
double dist,
bool checkTmpVehicles)
const {
2146 #ifdef DEBUG_CONTEXT 2151 if (checkTmpVehicles) {
2158 #ifdef DEBUG_CONTEXT 2160 std::cout << std::setprecision(
gPrecision) <<
" getLeader lane=" <<
getID() <<
" ego=" << veh->
getID() <<
" egoPos=" << vehPos <<
" pred=" << pred->
getID() <<
" predPos=" << pred->
getPositionOnLane() <<
"\n";
2174 #ifdef DEBUG_CONTEXT 2176 std::cout <<
" getLeader lane=" <<
getID() <<
" ego=" << veh->
getID() <<
" egoPos=" << vehPos
2186 if (bestLaneConts.size() > 0) {
2192 #ifdef DEBUG_CONTEXT 2194 std::cout <<
" getLeader lane=" <<
getID() <<
" seen=" << seen <<
" dist=" << dist <<
"\n";
2198 return std::pair<MSVehicle* const, double>(
static_cast<MSVehicle*
>(
nullptr), -1);
2202 return std::make_pair(static_cast<MSVehicle*>(
nullptr), -1);
2207 std::pair<MSVehicle* const, double>
2209 const std::vector<MSLane*>& bestLaneConts)
const {
2210 #ifdef DEBUG_CONTEXT 2212 std::cout <<
" getLeaderOnConsecutive lane=" <<
getID() <<
" ego=" << veh.
getID() <<
" seen=" << seen <<
" dist=" << dist <<
" conts=" <<
toString(bestLaneConts) <<
"\n";
2216 return std::make_pair(static_cast<MSVehicle*>(
nullptr), -1);
2224 #ifdef DEBUG_CONTEXT 2231 return std::pair<MSVehicle* const, double>(pred, gap);
2234 const MSLane* nextLane =
this;
2237 nextLane->getVehiclesSecure();
2239 MSLinkCont::const_iterator link =
succLinkSec(veh, view, *nextLane, bestLaneConts);
2240 if (nextLane->isLinkEnd(link) || !(*link)->opened(arrivalTime, speed, speed, veh.
getVehicleType().
getLength(),
2242 #ifdef DEBUG_CONTEXT 2244 std::cout <<
" cannot continue after nextLane=" << nextLane->getID() <<
"\n";
2247 nextLane->releaseVehicles();
2251 #ifdef DEBUG_CONTEXT 2256 const bool laneChanging = veh.
getLane() !=
this;
2258 #ifdef DEBUG_CONTEXT 2261 nextLane->releaseVehicles();
2262 if (linkLeaders.size() > 0) {
2263 std::pair<MSVehicle*, double> result;
2264 double shortestGap = std::numeric_limits<double>::max();
2265 for (
auto ll : linkLeaders) {
2266 double gap = ll.vehAndGap.second;
2268 if (lVeh !=
nullptr) {
2272 #ifdef DEBUG_CONTEXT 2275 <<
" isLeader=" << veh.
isLeader(*link, lVeh)
2276 <<
" gap=" << ll.vehAndGap.second
2277 <<
" gap+brakeing=" << gap
2282 if (lVeh !=
nullptr && !laneChanging && !veh.
isLeader(*link, lVeh)) {
2285 if (gap < shortestGap) {
2287 result = ll.vehAndGap;
2290 if (shortestGap != std::numeric_limits<double>::max()) {
2291 #ifdef DEBUG_CONTEXT 2293 std::cout <<
" found linkLeader after nextLane=" << nextLane->getID() <<
"\n";
2299 bool nextInternal = (*link)->getViaLane() !=
nullptr;
2300 nextLane = (*link)->getViaLaneOrLane();
2301 if (nextLane ==
nullptr) {
2304 nextLane->getVehiclesSecure();
2305 MSVehicle* leader = nextLane->getLastAnyVehicle();
2306 if (leader !=
nullptr) {
2307 #ifdef DEBUG_CONTEXT 2309 std::cout <<
" found leader " << leader->
getID() <<
" on nextLane=" << nextLane->getID() <<
"\n";
2313 nextLane->releaseVehicles();
2314 return std::make_pair(leader, dist);
2316 nextLane->releaseVehicles();
2317 if (nextLane->getVehicleMaxSpeed(&veh) < speed) {
2320 seen += nextLane->getLength();
2325 if (!nextInternal) {
2328 }
while (seen <= dist || nextLane->
isInternal());
2329 return std::make_pair(static_cast<MSVehicle*>(
nullptr), -1);
2333 std::pair<MSVehicle* const, double>
2335 #ifdef DEBUG_CONTEXT 2337 std::cout <<
SIMTIME <<
" getCriticalLeader. lane=" <<
getID() <<
" veh=" << veh.
getID() <<
"\n";
2341 std::pair<MSVehicle*, double> result = std::make_pair(static_cast<MSVehicle*>(
nullptr), -1);
2342 double safeSpeed = std::numeric_limits<double>::max();
2347 const MSLane* nextLane =
this;
2351 MSLinkCont::const_iterator link =
succLinkSec(veh, view, *nextLane, bestLaneConts);
2358 for (MSLink::LinkLeaders::const_iterator it = linkLeaders.begin(); it != linkLeaders.end(); ++it) {
2359 const MSVehicle* leader = (*it).vehAndGap.first;
2360 if (leader !=
nullptr && leader != result.first) {
2364 const double tmpSpeed = veh.
getSafeFollowSpeed((*it).vehAndGap, seen, nextLane, (*it).distToCrossing);
2365 #ifdef DEBUG_CONTEXT 2367 std::cout <<
" linkLeader=" << leader->
getID() <<
" gap=" << result.second <<
" tmpSpeed=" << tmpSpeed <<
" safeSpeed=" << safeSpeed <<
"\n";
2370 if (tmpSpeed < safeSpeed) {
2371 safeSpeed = tmpSpeed;
2372 result = (*it).vehAndGap;
2376 bool nextInternal = (*link)->getViaLane() !=
nullptr;
2377 nextLane = (*link)->getViaLaneOrLane();
2378 if (nextLane ==
nullptr) {
2382 if (leader !=
nullptr && leader != result.first) {
2385 if (tmpSpeed < safeSpeed) {
2386 safeSpeed = tmpSpeed;
2387 result = std::make_pair(leader, gap);
2398 if (!nextInternal) {
2401 }
while (seen <= dist || nextLane->
isInternal());
2411 for (MSEdgeVector::iterator i = pred.begin(); i != pred.end();) {
2420 if (pred.size() != 0) {
2422 MSEdge* best = *pred.begin();
2434 MSLane* cand = (*i).lane;
2435 if (&(cand->
getEdge()) == &fromEdge) {
2455 #ifdef DEBUG_LANE_SORTER 2456 std::cout <<
"\nBest predecessor lane for lane '" <<
myID <<
"': '" << best.lane->getID() <<
"'" << std::endl;
2471 std::vector<MSLink*> candidateLinks =
myLinks;
2474 MSLane* best = (*candidateLinks.begin())->getViaLaneOrLane();
2475 #ifdef DEBUG_LANE_SORTER 2476 std::cout <<
"\nBest successor lane for lane '" <<
myID <<
"': '" << best->getID() <<
"'" << std::endl;
2486 if (pred ==
nullptr) {
2494 const std::vector<std::pair<const MSLane*, const MSEdge*> >
2496 std::vector<std::pair<const MSLane*, const MSEdge*> > result;
2498 assert(link->getLane() !=
nullptr);
2499 result.push_back(std::make_pair(link->getLane(), link->getViaLane() ==
nullptr ? nullptr : &link->getViaLane()->getEdge()));
2521 for (MSLinkCont::const_iterator i =
myLinks.begin(); i !=
myLinks.end(); ++i) {
2522 if ((*i)->getLane()->getEdge().isCrossing()) {
2523 return (
int)(i -
myLinks.begin());
2567 wtime += (*i)->getWaitingSeconds();
2580 for (VehCont::const_iterator i = vehs.begin(); i != vehs.end(); ++i) {
2581 v += (*i)->getSpeed();
2593 for (MSLane::VehCont::const_iterator i = vehs.begin(); i != vehs.end(); ++i) {
2594 ret += (*i)->getCO2Emissions();
2605 for (MSLane::VehCont::const_iterator i = vehs.begin(); i != vehs.end(); ++i) {
2606 ret += (*i)->getCOEmissions();
2617 for (MSLane::VehCont::const_iterator i = vehs.begin(); i != vehs.end(); ++i) {
2618 ret += (*i)->getPMxEmissions();
2629 for (MSLane::VehCont::const_iterator i = vehs.begin(); i != vehs.end(); ++i) {
2630 ret += (*i)->getNOxEmissions();
2641 for (MSLane::VehCont::const_iterator i = vehs.begin(); i != vehs.end(); ++i) {
2642 ret += (*i)->getHCEmissions();
2653 for (MSLane::VehCont::const_iterator i = vehs.begin(); i != vehs.end(); ++i) {
2654 ret += (*i)->getFuelConsumption();
2665 for (MSLane::VehCont::const_iterator i = vehs.begin(); i != vehs.end(); ++i) {
2666 ret += (*i)->getElectricityConsumption();
2677 if (vehs.size() == 0) {
2681 for (MSLane::VehCont::const_iterator i = vehs.begin(); i != vehs.end(); ++i) {
2682 double sv = (*i)->getHarmonoise_NoiseEmissions();
2683 ret += (double) pow(10., (sv / 10.));
2714 myLaneDir(e->getLanes()[0]->
getShape().angleAt2D(0)) {
2725 if (ae1 !=
nullptr && ae1->size() != 0) {
2735 if (ae2 !=
nullptr && ae2->size() != 0) {
2773 #ifdef DEBUG_LANE_SORTER 2774 std::cout <<
"\nincoming_lane_priority sorter()\n" 2775 <<
"noninternal predecessor for lane '" << laneInfo1.
lane->
getID()
2776 <<
"': '" << noninternal1->
getID() <<
"'\n" 2777 <<
"noninternal predecessor for lane '" << laneInfo2.
lane->
getID()
2778 <<
"': '" << noninternal2->
getID() <<
"'\n";
2786 bool priorized1 =
true;
2787 bool priorized2 =
true;
2789 std::vector<MSLink*>::const_iterator j;
2790 #ifdef DEBUG_LANE_SORTER 2791 std::cout <<
"FoeLinks of '" << noninternal1->
getID() <<
"'" << std::endl;
2794 #ifdef DEBUG_LANE_SORTER 2795 std::cout << (*j)->getLaneBefore()->getID() << std::endl;
2803 #ifdef DEBUG_LANE_SORTER 2804 std::cout <<
"FoeLinks of '" << noninternal2->
getID() <<
"'" << std::endl;
2807 #ifdef DEBUG_LANE_SORTER 2808 std::cout << (*j)->getLaneBefore()->getID() << std::endl;
2817 assert(priorized1 || priorized2);
2818 if (priorized1 != priorized2) {
2839 if (target2 ==
nullptr) {
2842 if (target1 ==
nullptr) {
2846 #ifdef DEBUG_LANE_SORTER 2847 std::cout <<
"\noutgoing_lane_priority sorter()\n" 2848 <<
"noninternal successors for lane '" <<
myLane->
getID()
2849 <<
"': '" << target1->
getID() <<
"' and " 2850 <<
"'" << target2->
getID() <<
"'\n";
2857 if (priority1 != priority2) {
2858 return priority1 > priority2;
2894 for (std::vector<std::string>::const_iterator it = vehIds.begin(); it != vehIds.end(); ++it) {
2923 bool allSublanes,
double searchDist,
bool ignoreMinorLinks)
const {
2926 #ifdef DEBUG_CONTEXT 2928 std::cout <<
SIMTIME <<
" getFollowers lane=" <<
getID() <<
" ego=" << ego->
getID()
2929 <<
" backOffset=" << backOffset <<
" pos=" << egoPos
2930 <<
" allSub=" << allSublanes <<
" searchDist=" << searchDist <<
" ignoreMinor=" << ignoreMinorLinks
2940 #ifdef DEBUG_CONTEXT 2950 #ifdef DEBUG_CONTEXT 2952 std::cout <<
" (1) added veh=" << veh->
getID() <<
" latOffset=" << latOffset <<
" result=" << result.
toString() <<
"\n";
2957 #ifdef DEBUG_CONTEXT 2959 std::cout <<
" result.numFreeSublanes=" << result.
numFreeSublanes() <<
"\n";
2967 if (searchDist == -1) {
2971 std::set<MSLane*> visited;
2972 std::vector<MSLane::IncomingLaneInfo> newFound;
2974 while (toExamine.size() != 0) {
2975 for (std::vector<MSLane::IncomingLaneInfo>::iterator it = toExamine.begin(); it != toExamine.end(); ++it) {
2976 MSLane* next = (*it).lane;
2980 #ifdef DEBUG_CONTEXT 2982 std::cout <<
" next=" << next->
getID() <<
" seen=" << (*it).length <<
" first=" << first.toString() <<
" firstFront=" << firstFront.
toString() <<
"\n";
2986 if (backOffset + (*it).length - next->
getLength() < 0) {
2989 for (
const auto& ll : linkLeaders) {
2990 if (ll.vehAndGap.first !=
nullptr) {
2991 const bool egoIsLeader = ll.vehAndGap.first->isLeader((*it).viaLink, ego);
2992 const double gap = egoIsLeader ?
NUMERICAL_EPS : ll.vehAndGap.second;
2994 #ifdef DEBUG_CONTEXT 2996 std::cout <<
SIMTIME <<
" ego=" << ego->getID() <<
" link=" << (*it).viaLink->getViaLaneOrLane()->getID()
2998 <<
" gap=" << ll.vehAndGap.second <<
" dtC=" << ll.distToCrossing
2999 <<
" egoIsLeader=" << egoIsLeader <<
" gap2=" << gap
3006 #ifdef DEBUG_CONTEXT 3010 for (
int i = 0; i < first.numSublanes(); ++i) {
3017 if (v !=
nullptr && v != ego) {
3024 agap = (*it).length - next->
getLength() + backOffset
3027 #ifdef DEBUG_CONTEXT 3029 std::cout <<
" agap1=" << agap <<
"\n";
3032 if (agap > 0 && &v->
getLane()->
getEdge() != &ego->getLane()->getEdge()) {
3036 if (v !=
nullptr && v != ego) {
3044 if (!(*it).viaLink->havePriority() && !ego->onFurtherEdge(&(*it).lane->getEdge())
3048 agap =
MAX2(agap, 0.0);
3052 #ifdef DEBUG_CONTEXT 3059 if ((*it).length < searchDist) {
3060 const std::vector<MSLane::IncomingLaneInfo>& followers = next->
getIncomingLanes();
3061 for (std::vector<MSLane::IncomingLaneInfo>::const_iterator j = followers.begin(); j != followers.end(); ++j) {
3062 if (visited.find((*j).lane) == visited.end() && ((*j).viaLink->havePriority() || !ignoreMinorLinks)) {
3063 visited.insert((*j).lane);
3065 ili.
lane = (*j).lane;
3066 ili.
length = (*j).length + (*it).length;
3068 newFound.push_back(ili);
3074 swap(newFound, toExamine);
3099 const MSLane* nextLane =
this;
3105 MSLinkCont::const_iterator link =
succLinkSec(*ego, view, *nextLane, bestLaneConts);
3112 if (linkLeaders.size() > 0) {
3118 #ifdef DEBUG_CONTEXT 3120 std::cout <<
" linkleader=" << veh->
getID() <<
" gap=" << ll.
vehAndGap.second <<
"\n";
3128 bool nextInternal = (*link)->getViaLane() !=
nullptr;
3129 nextLane = (*link)->getViaLaneOrLane();
3130 if (nextLane ==
nullptr) {
3135 #ifdef DEBUG_CONTEXT 3137 std::cout <<
SIMTIME <<
" getLeadersOnConsecutive lane=" <<
getID() <<
" nextLane=" << nextLane->
getID() <<
" leaders=" << leaders.
toString() <<
"\n";
3142 for (
int i = 0; i < iMax; ++i) {
3144 if (veh !=
nullptr) {
3145 #ifdef DEBUG_CONTEXT 3165 if (!nextInternal) {
3180 #ifdef DEBUG_CONTEXT 3182 std::cout <<
SIMTIME <<
" getPartialBehind lane=" <<
getID() <<
" ego=" << ego->
getID() <<
" found=" << veh->
getID() <<
"\n";
3188 #ifdef DEBUG_CONTEXT 3211 std::set<MSVehicle*>
3213 assert(checkedLanes !=
nullptr);
3214 if (checkedLanes->find(
this) != checkedLanes->end()) {
3215 #ifdef DEBUG_SURROUNDING 3216 std::cout <<
"Skipping previously scanned lane: " <<
getID() << std::endl;
3218 return std::set<MSVehicle*>();
3221 (*checkedLanes)[
this] = std::make_pair(
MAX2(0.0, startPos-upstreamDist),
MIN2(startPos+downstreamDist,
getLength()));
3223 #ifdef DEBUG_SURROUNDING 3224 std::cout <<
"Scanning on lane " <<
myID <<
"(downstr. " << downstreamDist <<
", upstr. " << upstreamDist <<
", startPos " << startPos <<
"): " << std::endl;
3227 if (startPos < upstreamDist) {
3230 MSLane* incoming = incomingInfo.lane;
3231 #ifdef DEBUG_SURROUNDING 3232 std::cout <<
"Checking on incoming: " << incoming->
getID() << std::endl;
3233 if (checkedLanes->find(incoming) != checkedLanes->end()) {
3234 std::cout <<
"Skipping previous: " << incoming->
getID() << std::endl;
3238 foundVehicles.insert(newVehs.begin(), newVehs.end());
3242 if (
getLength() < startPos + downstreamDist) {
3246 #ifdef DEBUG_SURROUNDING 3247 std::cout <<
"Checking on outgoing: " << l->getViaLaneOrLane()->getID() << std::endl;
3249 std::set<MSVehicle*> newVehs = l->getViaLaneOrLane()->getSurroundingVehicles(0.0, downstreamDist - (
myLength - startPos), upstreamDist, checkedLanes);
3250 foundVehicles.insert(newVehs.begin(), newVehs.end());
3253 #ifdef DEBUG_SURROUNDING 3254 std::cout <<
"On lane (2) " <<
myID <<
": \nFound vehicles: " << std::endl;
3256 std::cout << v->getID() <<
" pos = " << v->getPositionOnLane() << std::endl;
3259 return foundVehicles;
3263 std::set<MSVehicle*>
3265 std::set<MSVehicle*> res;
3268 const int nV = (int)vehs.size();
3280 int ia = 0, ib = nV-1;
3282 if(vehs[ia]->getPositionOnLane() >= a) {
3288 if(vehs[ib]->getBackPositionOnLane() <= b){
3294 res.insert(vehs.begin()+ia, vehs.begin()+ib+1);
3299 std::vector<const MSJunction*>
3302 std::vector<const MSJunction*> junctions;
3304 junctions.insert(junctions.end(), l->getJunction());
3310 std::vector<const MSLink*>
3312 #ifdef DEBUG_SURROUNDING 3313 std::cout <<
"getUpcoming links on lane '" <<
getID() <<
"' with pos=" << pos
3314 <<
" range=" << range << std::endl;
3317 std::vector<const MSLink*> links;
3320 const MSLane* lane =
this;
3323 std::vector<MSLane*>::const_iterator contLanesIt = contLanes.begin();
3329 assert(*contLanesIt ==
nullptr);
3331 links.insert(links.end(), link);
3336 assert(*(contLanesIt+1) == lane);
3338 while (++contLanesIt != contLanes.end()) {
3342 #ifdef DEBUG_SURROUNDING 3343 std::cout <<
"Distance until end of lane '" << lane->
getID() <<
"' is " << dist <<
"." << std::endl;
3349 if (link!=
nullptr) {
3350 links.insert(links.end(), link);
3352 lane = *contLanesIt;
3370 if (opposite ==
nullptr) {
3372 throw ProcessError(
"Lane '" +
getID() +
"' cannot compute oppositePos as there is no opposite lane.");
3379 std::pair<MSVehicle* const, double>
3384 #ifdef DEBUG_CONTEXT 3386 std::cout <<
" getFollower lane=" <<
getID() <<
" egoPos=" << egoPos <<
" pred=" << pred->
getID() <<
" predPos=" << pred->
getPositionOnLane(
this) <<
"\n";
3395 return std::make_pair(const_cast<MSVehicle*>(result.first), result.second);
3398 std::pair<MSVehicle* const, double>
3400 #ifdef DEBUG_OPPOSITE 3402 <<
" ego=" << ego->
getID()
3406 <<
" oppositeDir=" << oppositeDir
3414 std::pair<MSVehicle* const, double> result =
getFollower(ego, egoPos + egoLength, dist,
true);
3421 std::pair<MSVehicle* const, double>
3423 #ifdef DEBUG_OPPOSITE 3425 <<
" ego=" << ego->
getID()
3435 if (result.first !=
nullptr) {
3436 if (result.first->getLaneChangeModel().isOpposite()) {
3437 result.second -= result.first->getVehicleType().getLength();
3441 return std::make_pair(static_cast<MSVehicle*>(
nullptr), -1);
3452 const std::string action = oc.
getString(
"collision.action");
3453 if (action ==
"none") {
3455 }
else if (action ==
"warn") {
3457 }
else if (action ==
"teleport") {
3459 }
else if (action ==
"remove") {
3462 WRITE_ERROR(
"Invalid collision.action '" + action +
"'.");
3500 #ifdef DEBUG_INSERTION 3502 std::cout <<
SIMTIME <<
" check for pedestrians on lane=" <<
getID() <<
" pos=" << pos <<
"\n";
3507 if (leader.first != 0) {
3510 if (gap < 0 ||
checkFailure(aVehicle, speed, dist, stopSpeed, patchSpeed,
"")) {
3512 #ifdef DEBUG_INSERTION 3514 <<
" isInsertionSuccess lane=" <<
getID()
3515 <<
" veh=" << aVehicle->
getID()
3518 <<
" patchSpeed=" << patchSpeed
3519 <<
" speed=" << speed
3520 <<
" stopSpeed=" << stopSpeed
3521 <<
" pedestrianLeader=" << leader.first->getID()
3522 <<
" failed (@796)!\n";
void detectPedestrianJunctionCollision(const MSVehicle *collider, const PositionVector &colliderBoundary, const MSLane *foeLane, SUMOTime timestep, const std::string &stage)
detect whether a vehicle collids with pedestrians on the junction
const std::vector< IncomingLaneInfo > & getIncomingLanes() const
bool gDebugFlag1
global utility flags for debugging
std::pair< MSVehicle *const, double > getFollower(const MSVehicle *ego, double egoPos, double dist, bool ignoreMinorLinks) const
Find follower vehicle for the given ego vehicle (which may be on the opposite direction lane) ...
bool isChangingLanes() const
return true if the vehicle currently performs a lane change maneuver
double getBruttoOccupancy() const
Returns the brutto (including minGaps) occupancy of this lane during the last step.
double getLengthWithGap() const
Get vehicle's length including the minimum gap [m].
void loadState(std::vector< std::string > &vehIDs, MSVehicleControl &vc)
Loads the state of this segment with the given parameters.
static double gLateralResolution
OutputDevice & writeAttr(const SumoXMLAttr attr, const T &val)
writes a named attribute
SVCPermissions myPermissions
The vClass permissions for this lane.
MSLane * getLogicalPredecessorLane() const
get the most likely precedecessor lane (sorted using by_connections_to_sorter). The result is cached ...
double ymin() const
Returns minimum y-coordinate.
VehCont myVehicles
The lane's vehicles. This container holds all vehicles that have their front (longitudinally) and the...
double getVehicleMaxSpeed(const SUMOVehicle *const veh) const
Returns the lane's maximum speed, given a vehicle's speed limit adaptation.
double brakeGap(const double speed) const
Returns the distance the vehicle needs to halt including driver's reaction time tau (i...
saves leader/follower vehicles and their distances relative to an ego vehicle
virtual double freeSpeed(const MSVehicle *const veh, double speed, double seen, double maxSpeed, const bool onInsertion=false) const
Computes the vehicle's safe speed without a leader.
double xmax() const
Returns maximum x-coordinate.
double getNOxEmissions() const
Returns the sum of last step NOx emissions.
MSEdge & getEdge() const
Returns the lane's edge.
A free lateral position is chosen.
Representation of a vehicle in the micro simulation.
MSVehicle * getFirstFullVehicle() const
returns the first vehicle for which this lane is responsible or 0
At the leftmost side of the lane.
virtual int addLeader(const MSVehicle *veh, bool beyond, double latOffset=0)
bool detectCollisionBetween(SUMOTime timestep, const std::string &stage, MSVehicle *collider, MSVehicle *victim, std::set< const MSVehicle *, ComparatorNumericalIdLess > &toRemove, std::set< const MSVehicle *> &toTeleport) const
detect whether there is a collision between the two vehicles
MSLane(const std::string &id, double maxSpeed, double length, MSEdge *const edge, int numericalID, const PositionVector &shape, double width, SVCPermissions permissions, int index, bool isRampAccel)
Constructor.
int getPriority() const
Returns the priority of the edge.
double getAngle() const
Returns the vehicle's direction in radians.
void informVehicleStateListener(const SUMOVehicle *const vehicle, VehicleState to, const std::string &info="")
Informs all added listeners about a vehicle's state change.
PositionVector getBoundingPoly() const
get bounding polygon
int operator()(MSVehicle *v1, MSVehicle *v2) const
Comparing operator.
void sortManeuverReservations()
sorts myManeuverReservations
SUMOTime getWaitingTime() const
Returns the SUMOTime waited (speed was lesser than 0.1m/s)
const MSEdge * getNextNormal() const
Returns the lane's follower if it is an internal lane, the edge of the lane otherwise.
std::string containerstop
(Optional) container stop if one is assigned to the stop
static void insertIDs(std::vector< std::string > &into)
Adds the ids of all stored lanes into the given vector.
std::set< MSVehicle * > getSurroundingVehicles(double startPos, double downstreamDist, double upstreamDist, std::shared_ptr< LaneCoverageInfo > checkedLanes) const
Returns all vehicles closer than downstreamDist along the along the road network starting on the give...
void enterLaneAtInsertion(MSLane *enteredLane, double pos, double speed, double posLat, MSMoveReminder::Notification notification)
Update when the vehicle enters a new lane in the emit step.
void updateLeaderInfo(const MSVehicle *veh, VehCont::reverse_iterator &vehPart, VehCont::reverse_iterator &vehRes, MSLeaderInfo &ahead) const
This updates the MSLeaderInfo argument with respect to the given MSVehicle. All leader-vehicles on th...
Sorts lanes (IncomingLaneInfos) by their priority or, if this doesn't apply, wrt. the angle differenc...
MSLane * parallelLane(const MSLane *const lane, int offset) const
Returns the lane with the given offset parallel to the given lane one or 0 if it does not exist...
virtual bool hasPedestrians(const MSLane *lane)
whether the given lane has pedestrians on it
virtual void removeParking(MSVehicle *veh)
remove parking vehicle. This must be syncrhonized when running with GUI
std::pair< MSVehicle *const, double > getOppositeLeader(const MSVehicle *ego, double dist, bool oppositeDir) const
bool parking
whether the vehicle is removed from the net while stopping
MSLane * getLane() const
Returns the connected lane.
double getMaxSpeedFactor() const
return the maximum speed factor for all vehicles that ever entered the network
begin/end of the description of a single lane
bool hasDeparted() const
Returns whether this vehicle has already departed.
bool checkFailure(const MSVehicle *aVehicle, double &speed, double &dist, const double nspeed, const bool patchSpeed, const std::string errorMsg) const
int myI2
index for myPartialVehicles
bool resumeFromStopping()
MSLane * getLane() const
Returns the lane the vehicle is on.
double getFuelConsumption() const
Returns the sum of last step fuel consumption.
SUMOTime duration
The stopping duration.
bool isInsertionSuccess(MSVehicle *vehicle, double speed, double pos, double posLat, bool recheckNextLanes, MSMoveReminder::Notification notification)
Tries to insert the given vehicle with the given state (speed and pos)
void registerTeleportYield()
register one non-collision-related teleport
static void fill(RTREE &into)
Fills the given RTree with lane instances.
double getMaximumBrakeDist() const
compute maximum braking distance on this lane
int gPrecision
the precision for floating point outputs
The vehicle arrived at a junction.
void setMaxSpeed(double val)
Sets a new maximum speed for the lane (used by TraCI and MSCalibrator)
const SUMOVehicleParameter::Stop pars
The stop parameter.
void recalcCache()
Recalculates the cached values.
This is an uncontrolled, minor link, has to stop.
const MSEdgeVector & getPredecessors() const
static bool haveLateralDynamics()
whether any kind of lateral dynamics is active
std::vector< IncomingLaneInfo > myIncomingLanes
All direct predecessor lanes.
The car-following model abstraction.
int SVCPermissions
bitset where each bit declares whether a certain SVC may use this edge/lane
int myI2End
end index for myPartialVehicles
double getPositionOnLane() const
Get the vehicle's position along the lane.
std::vector< const MSJunction * > getUpcomingJunctions(double pos, double range, const std::vector< MSLane *> &contLanes) const
Returns all upcoming junctions within given range along the given (non-internal) continuation lanes m...
void addLink(MSLink *link)
Delayed initialization.
MSLane * myCanonicalPredecessorLane
Similar to LogicalPredecessorLane,.
int myIndex
The lane index.
static double rand(std::mt19937 *rng=0)
Returns a random real number in [0, 1)
virtual bool integrateNewVehicle(SUMOTime t)
Insert buffered vehicle into the real lane.
The lateral position is chosen randomly.
const SUMOVehicleParameter & getParameter() const
Returns the vehicle's parameter (including departure definition)
static double myCollisionMinGapFactor
SUMOTime myLeaderInfoTime
time step for which myLeaderInfo was last updated
If a fixed number of random choices fails, a free lateral position is chosen.
SUMOVehicle * getVehicle(const std::string &id) const
Returns the vehicle with the given id.
bool operator()(const MSVehicle *cmp, double pos) const
compares vehicle position to the detector position
AnyVehicleIterator is a structure, which manages the iteration through all vehicles on the lane...
static SUMOTime myCollisionStopTime
Notification
Definition of a vehicle state.
virtual void resetManeuverReservation(MSVehicle *v)
Unregisters a vehicle, which previously registered for maneuvering into this lane.
std::string time2string(SUMOTime t)
A RT-tree for efficient storing of SUMO's Named objects.
virtual MSVehicle * removeVehicle(MSVehicle *remVehicle, MSMoveReminder::Notification notification, bool notify=true)
double myBruttoVehicleLengthSum
The current length of all vehicles on this lane, including their minGaps.
MSVehicle * getFirstAnyVehicle() const
returns the first vehicle that is fully or partially on this lane
const std::vector< MSLane * > * allowedLanes(const MSEdge &destination, SUMOVehicleClass vclass=SVC_IGNORING) const
Get the allowed lanes to reach the destination-edge.
const MSEdge *const myEdge
std::map< long long, SVCPermissions > myPermissionChanges
void addIncomingLane(MSLane *lane, MSLink *viaLink)
static MSNet * getInstance()
Returns the pointer to the unique instance of MSNet (singleton).
double getPMxEmissions() const
Returns the sum of last step PMx emissions.
by_connections_to_sorter(const MSEdge *const e)
constructor
std::set< MSVehicle * > getVehiclesInRange(double a, double b) const
Returns all vehicles on the lane overlapping with the interval [a,b].
double getLength() const
Returns the lane's length.
virtual const VehCont & getVehiclesSecure() const
Returns the vehicles container; locks it for microsimulation.
const PositionVector & getShape() const
Returns this lane's shape.
static std::string getIDSecure(const T *obj, const std::string &fallBack="NULL")
get an identifier for Named-like object which may be Null
The speed is chosen randomly.
PositionVector getBoundingBox() const
get bounding rectangle
bool isLinkEnd(MSLinkCont::const_iterator &i) const
static void initCollisionOptions(const OptionsCont &oc)
virtual void addMoveReminder(MSMoveReminder *rem)
Add a move-reminder to move-reminder container.
const MSRoute & getRoute() const
Returns the current route.
MSLink * getLinkTo(const MSLane *) const
returns the link to the given lane or 0, if it is not connected
double getCollisionMinGapFactor() const
Get the factor of minGap that must be maintained to avoid a collision event.
The vehicle got vaporized.
void leftByLaneChange(MSVehicle *v)
SUMOTime until
The time at which the vehicle may continue its journey.
bool addStop(const SUMOVehicleParameter::Stop &stopPar, std::string &errorMsg, SUMOTime untilOffset=0, bool collision=false, MSRouteIterator *searchStart=0)
Adds a stop.
double getRightSideOnLane() const
Get the vehicle's lateral position on the lane:
const MSEdge * getLastEdge() const
returns the destination edge
MSLane * getCanonicalPredecessorLane() const
This is an uncontrolled, right-before-left link.
bool executeMove()
Executes planned vehicle movements with regards to right-of-way.
double getSafeFollowSpeed(const std::pair< const MSVehicle *, double > leaderInfo, const double seen, const MSLane *const lane, double distToCrossing) const
compute safe speed for following the given leader
void addNeigh(const std::string &id)
Adds a neighbor to this lane.
bool getBool(const std::string &name) const
Returns the boolean-value of the named option (only for Option_Bool)
ArrivalSpeedDefinition arrivalSpeedProcedure
Information how the vehicle's end speed shall be chosen.
const std::string & getID() const
Returns the id.
const SVCPermissions SVCAll
all VClasses are allowed
void gotActive(MSLane *l)
Informs the control that the given lane got active.
double getInternalLengthsAfter() const
Returns the cumulative length of all internal lanes after this link.
virtual double insertionStopSpeed(const MSVehicle *const veh, double speed, double gap) const
Computes the vehicle's safe speed for approaching an obstacle at insertion without constraints due to...
virtual double setPartialOccupation(MSVehicle *v)
Sets the information about a vehicle lapping into this lane.
VehCont myPartialVehicles
The lane's partial vehicles. This container holds all vehicles that are partially on this lane but wh...
std::vector< MSTransportable * > getSortedPersons(SUMOTime timestep, bool includeRiding=false) const
Returns this edge's persons sorted by pos.
The position is chosen randomly.
static bool myCheckJunctionCollisions
This is an uncontrolled, all-way stop link.
virtual void setManeuverReservation(MSVehicle *v)
Registers the lane change intentions (towards this lane) for the given vehicle.
double getWidth() const
Returns the lane's width.
int myI1End
end index for myVehicles
bool hasArrived() const
Returns whether this vehicle has already arived (reached the arrivalPosition on its final edge) ...
A class that stores a 2D geometrical boundary.
virtual double insertionFollowSpeed(const MSVehicle *const veh, double speed, double gap2pred, double predSpeed, double predMaxDecel) const
Computes the vehicle's safe speed (no dawdling) This method is used during the insertion stage...
int myDirection
index delta
std::string parkingarea
(Optional) parking area if one is assigned to the stop
PositionVector myShape
The shape of the lane.
#define WRITE_WARNING(msg)
int myI3
index for myTmpVehicles
MSLane * getCanonicalSuccessorLane() const
std::set< const MSVehicle * > myParkingVehicles
void getLeadersOnConsecutive(double dist, double seen, double speed, const MSVehicle *ego, const std::vector< MSLane *> &bestLaneConts, MSLeaderDistanceInfo &result) const
Returns the immediate leaders and the distance to them (as getLeaderOnConsecutive but for the sublane...
bool myDownstream
iteration direction
MSAbstractLaneChangeModel & getLaneChangeModel()
bool isVaporizing() const
Returns whether vehicles on this edge shall be vaporized.
bool isFrontOnLane(const MSLane *lane) const
Returns the information whether the front of the vehicle is on the given lane.
std::vector< std::string > myNeighs
LinkState getState() const
Returns the current state of the link.
bool isLeader(const MSLink *link, const MSVehicle *veh) const
whether the given vehicle must be followed at the given junction
static CollisionAction myCollisionAction
the action to take on collisions
const std::string & getEdgeType() const
Returns the type of the edge.
std::map< std::string, MSLane *> DictType
definition of the static dictionary type
static CollisionAction getCollisionAction()
virtual void detectCollisions(SUMOTime timestep, const std::string &stage)
Check if vehicles are too close.
static DictType myDict
Static dictionary to associate string-ids with objects.
Sorts lanes (their origin link) by the priority of their noninternal target edges or...
std::string busstop
(Optional) bus stop if one is assigned to the stop
void addApproachingLane(MSLane *lane, bool warnMultiCon)
double departSpeed
(optional) The initial speed of the vehicle
virtual const MSEdge * succEdge(int nSuccs) const =0
Returns the nSuccs'th successor of edge the vehicle is currently at.
A road/street connecting two junctions.
void leaveLane(const MSMoveReminder::Notification reason, const MSLane *approachedLane=0)
Update of members if vehicle leaves a new lane in the lane change step or at arrival.
virtual int addLeader(const MSVehicle *veh, double gap, double latOffset=0, int sublane=-1)
double getLatOffset(const MSLane *lane) const
Get the offset that that must be added to interpret myState.myPosLat for the given lane...
bool insertVehicle(MSVehicle &v)
Tries to insert the given vehicle.
No information given; use default.
const MSCFModel & getCarFollowModel() const
Returns the vehicle's car following model definition.
double myLength
Lane length [m].
void resetPermissions(long long transientID)
DepartSpeedDefinition departSpeedProcedure
Information how the vehicle's initial speed shall be chosen.
VehCont myTmpVehicles
Container for lane-changing vehicles. After completion of lane-change- process, the containers will b...
void setPermissions(SVCPermissions permissions, long long transientID)
Sets the permissions to the given value. If a transientID is given, the permissions are recored as te...
int operator()(const IncomingLaneInfo &lane1, const IncomingLaneInfo &lane2) const
comparing operator
MSLink * getEntryLink() const
Returns the entry link if this is an internal lane, else 0.
const MSVehicle * operator*()
std::string toString(const T &t, std::streamsize accuracy=gPrecision)
int getCrossingIndex() const
return the index of the link to the next crossing if this is walkingArea, else -1 ...
The vehicle is involved in a collision.
virtual void resetPartialOccupation(MSVehicle *v)
Removes the information about a vehicle lapping into this lane.
double getCO2Emissions() const
Returns the sum of last step CO2 emissions.
const bool myIsRampAccel
whether this lane is an acceleration lane
virtual double getSecureGap(const double speed, const double leaderSpeed, const double leaderMaxDecel) const
Returns the minimum gap to reserve if the leader is braking at maximum (>=0)
Representation of a vehicle.
double startPos
The stopping position start.
DepartPosDefinition departPosProcedure
Information how the vehicle shall choose the departure position.
int operator()(const std::pair< const MSVehicle *, double > &p1, const std::pair< const MSVehicle *, double > &p2) const
void setLength(double val)
Sets a new length for the lane (used by TraCI only)
static MSPModel * getModel()
This is an uncontrolled, minor link, has to brake.
Sorts vehicles by their position (descending)
double myRightSideOnEdge
the combined width of all lanes with lower index on myEdge
std::string chargingStation
(Optional) charging station if one is assigned to the stop
bool lastInsertion(MSVehicle &veh, double mspeed, double posLat, bool patchSpeed)
inserts vehicle as close as possible to the last vehicle on this lane (or at the end of the lane if t...
SVCPermissions myOriginalPermissions
The original vClass permissions for this lane (before temporary modifications)
outgoing_lane_priority_sorter(const MSLane *sourceLane)
constructor
void updateBestLanes(bool forceRebuild=false, const MSLane *startLane=0)
computes the best lanes to use in order to continue the route
void enteredByLaneChange(MSVehicle *v)
virtual void setJunctionApproaches(const SUMOTime t)
Register junction approaches for all vehicles after velocities have been planned. ...
const std::vector< MSLane * > & getBestLanesContinuation() const
Returns the best sequence of lanes to continue the route starting at myLane.
double getEmergencyDecel() const
Get the vehicle type's maximal phisically possible deceleration [m/s^2].
const MSLeaderInfo & getLastVehicleInformation(const MSVehicle *ego, double latOffset, double minPos=0, bool allowCached=true) const
Returns the last vehicles on the lane.
MSVehicleControl & getVehicleControl()
Returns the vehicle control.
const std::set< MSTransportable * > & getPersons() const
Returns this edge's persons set.
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 getMinDeceleration() const
return the minimum deceleration capability for all vehicles that ever entered the network ...
const std::map< SUMOVehicleClass, double > * myRestrictions
The vClass speed restrictions for this lane.
bool triggered
whether an arriving person lets the vehicle continue
std::pair< MSVehicle *const, double > getOppositeFollower(const MSVehicle *ego) const
bool checkForPedestrians(const MSVehicle *aVehicle, double &speed, double &dist, double pos, bool patchSpeed) const
check whether pedestrians on this lane interfere with vehicle insertion
std::string getString(const std::string &name) const
Returns the string-value of the named option (only for Option_String)
ConstMSEdgeVector::const_iterator MSRouteIterator
The vehicle arrived at its destination (is deleted)
double safeInsertionSpeed(const MSVehicle *veh, double seen, const MSLeaderInfo &leaders, double speed)
return the maximum safe speed for insertion behind leaders (a negative value indicates that safe inse...
double getSpeedLimit() const
Returns the lane's maximum allowed speed.
const std::map< SUMOVehicleClass, double > * getRestrictions(const std::string &id) const
Returns the restrictions for an edge type If no restrictions are present, 0 is returned.
bool hasStops() const
Returns whether the vehicle has to stop somewhere.
LinkState
The right-of-way state of a link between two lanes used when constructing a NBTrafficLightLogic, in MSLink and GNEInternalLane.
int operator()(const MSLink *link1, const MSLink *link2) const
comparing operator
Sorts edges by their angle relative to the given edge (straight comes first)
The maximum speed is used.
std::string toString() const
print a debugging representation
void forceVehicleInsertion(MSVehicle *veh, double pos, MSMoveReminder::Notification notification, double posLat=0)
Inserts the given vehicle at the given position.
SUMOTime getCurrentTimeStep() const
Returns the current simulation step.
SUMOTime string2time(const std::string &r)
MSVehicle * getPartialBehind(const MSVehicle *ego) const
double xmin() const
Returns minimum x-coordinate.
AnyVehicleIterator anyVehiclesEnd() const
end iterator for iterating over all vehicles touching this lane in downstream direction ...
void add(const SUMOTime t, MSVehicle *veh)
Adds a vehicle to this transfer object.
AnyVehicleIterator anyVehiclesBegin() const
begin iterator for iterating over all vehicles touching this lane in downstream direction ...
std::vector< LinkLeader > LinkLeaders
LinkState getIncomingLinkState() const
get the state of the link from the logical predecessor to this lane
double getImpatience() const
Returns this vehicles impatience.
No information given; use default.
virtual bool executeMovements(SUMOTime t, std::vector< MSLane *> &lanesWithVehiclesToIntegrate)
Executes planned vehicle movements with regards to right-of-way.
std::pair< MSVehicle *const, double > getLeader(const MSVehicle *veh, const double vehPos, const std::vector< MSLane *> &bestLaneConts, double dist=-1, bool checkTmpVehicles=false) const
Returns the immediate leader of veh and the distance to veh starting on this lane.
void onRemovalFromNet(const MSMoveReminder::Notification reason)
Called when the vehicle is removed from the network.
std::pair< MSVehicle *, double > vehAndGap
virtual PersonDist nextBlocking(const MSLane *lane, double minPos, double minRight, double maxLeft, double stopTime=0)
returns the next pedestrian beyond minPos that is laterally between minRight and maxLeft or 0 ...
Boundary & grow(double by)
extends the boundary by the given amount
bool hasInfluencer() const
int myRightmostSublane
the index of the rightmost sublane of this lane on myEdge
MSLane * myLogicalPredecessorLane
double endPos
The stopping position end.
double getMinGap() const
Get the free space in front of vehicles of this class.
SUMOTime collisionStopTime() const
Returns the remaining time a vehicle needs to stop due to a collision. A negative value indicates tha...
Something on a lane to be noticed about vehicle movement.
const std::vector< std::pair< const MSLane *, const MSEdge * > > getOutgoingViaLanes() const
get the list of outgoing lanes
double getMaxDecel() const
Get the vehicle type's maximal comfortable deceleration [m/s^2].
double basePos(const MSEdge *edge) const
departure position where the vehicle fits fully onto the edge (if possible)
MSLane * getOpposite() const
return the opposite direction lane for lane changing or 0
bool overlapsWith(const AbstractPoly &poly, double offset=0) const
Returns the information whether the given polygon overlaps with this.
AnyVehicleIterator anyVehiclesUpstreamBegin() const
begin iterator for iterating over all vehicles touching this lane in upstream direction ...
virtual void swapAfterLaneChange(SUMOTime t)
moves myTmpVehicles int myVehicles after a lane change procedure
bool isInternal() const
return whether this edge is an internal edge
void registerTeleportJam()
register one non-collision-related teleport
double getHCEmissions() const
Returns the sum of last step HC emissions.
If a fixed number of random choices fails, a free position is chosen.
std::map< MSEdge *, std::vector< MSLane * > > myApproachingLanes
All direct internal and direct (disregarding internal predecessors) non-internal predecessor lanes of...
double getFloat(const std::string &name) const
Returns the double-value of the named option (only for Option_Float)
std::vector< MSVehicle * > VehCont
Container for vehicles.
const MSLane * lane
The lane to stop at.
bool containerTriggered
whether an arriving container lets the vehicle continue
static MSLinkCont::const_iterator succLinkSec(const SUMOVehicle &veh, int nRouteSuccs, const MSLane &succLinkSource, const std::vector< MSLane *> &conts)
int operator()(const MSEdge *const e1, const MSEdge *const e2) const
comparing operator
Base class for objects which have an id.
std::map< SVCPermissions, double > myStopOffsets
int myNumericalID
Unique numerical ID (set on reading by netload)
std::vector< MSMoveReminder *> myMoveReminders
This lane's move reminder.
VehCont myManeuverReservations
The vehicles which registered maneuvering into the lane within their current action step...
const MSLane *const myLane
double getLateralPositionOnLane() const
Get the vehicle's lateral position on the lane.
double getRightSideOnEdge() const
incoming_lane_priority_sorter(const MSLane *targetLane)
constructor
MSLeaderInfo getPartialBeyond() const
get all vehicles that are inlapping from consecutive edges
std::string lane
The lane to stop at.
void initRestrictions()
initialized vClass-specific speed limits
AnyVehicleIterator & operator++()
static MSVehicleTransfer * getInstance()
Returns the instance of this object.
double departPosLat
(optional) The lateral position the vehicle shall depart from
std::pair< const MSPerson *, double > PersonDist
MSVehicle * getLastFullVehicle() const
returns the last vehicle for which this lane is responsible or 0
void sortPartialVehicles()
sorts myPartialVehicles
const MSEdgeVector & getSuccessors(SUMOVehicleClass vClass=SVC_IGNORING) const
Returns the following edges, restricted by vClass.
double getWidth() const
Get the width which vehicles of this class shall have when being drawn.
bool freeInsertion(MSVehicle &veh, double speed, double posLat, MSMoveReminder::Notification notification=MSMoveReminder::NOTIFICATION_DEPARTED)
Tries to insert the given vehicle on any place.
virtual std::string toString() const
print a debugging representation
double getElectricityConsumption() const
Returns the sum of last step electricity consumption.
double departPos
(optional) The position the vehicle shall depart from
static bool dictionary(const std::string &id, MSLane *lane)
Static (sic!) container methods {.
static SUMOTime gTimeToGridlockHighways
std::pair< const MSVehicle *, double > CLeaderDist
int addFollower(const MSVehicle *veh, const MSVehicle *ego, double gap, double latOffset=0, int sublane=-1)
std::string myID
The name of the object.
const std::vector< MSLink * > & getFoeLinks() const
SUMOVehicleClass getVClass() const
Returns the vehicle's access class.
The vehicle has departed (was inserted into the network)
Influencer & getInfluencer()
Returns the velocity/lane influencer.
void scheduleVehicleRemoval(SUMOVehicle *veh)
Removes a vehicle after it has ended.
double getCOEmissions() const
Returns the sum of last step CO emissions.
Structure representing possible vehicle parameter.
std::pair< MSVehicle *const, double > getLeaderOnConsecutive(double dist, double seen, double speed, const MSVehicle &veh, const std::vector< MSLane *> &bestLaneConts) const
Returns the immediate leader and the distance to him.
int myI1
index for myVehicles
double getOppositePos(double pos) const
return the corresponding position on the opposite lane
const MSVehicleType & getVehicleType() const
Returns the vehicle's type definition.
static bool gUnitTests
whether unit tests are being run
double processNextStop(double currentVelocity)
Processes stops, returns the velocity needed to reach the stop.
void setTentativeLaneAndPosition(MSLane *lane, double pos, double posLat=0)
set tentative lane and position during insertion to ensure that all cfmodels work (some of them requi...
static MSLink * getConnectingLink(const MSLane &from, const MSLane &to)
Returns the link connecting both lanes Both lanes have to be non-internal; 0 may be returned if no co...
MSInsertionControl & getInsertionControl()
Returns the insertion control.
static void clear()
Clears the dictionary.
const MSLane * getFirstInternalInConnection(double &offset) const
Returns 0 if the lane is not internal. Otherwise the first part of the connection (sequence of intern...
bool nextIsMyVehicles() const
int myI3End
end index for myTmpVehicles
MSEdge *const myEdge
The lane's edge, for routing only.
Definition of vehicle stop (position and duration)
At the rightmost side of the lane.
At the center of the lane.
const MSLane * myLane
the lane that is being iterated
A storage for options typed value containers)
void handleCollisionBetween(SUMOTime timestep, const std::string &stage, MSVehicle *collider, MSVehicle *victim, double gap, double latGap, std::set< const MSVehicle *, ComparatorNumericalIdLess > &toRemove, std::set< const MSVehicle *> &toTeleport) const
take action upon collision
double angleAt2D(int pos) const
get angle in certain position of position vector
int index
at which position in the stops list
MSVehicle * getLastAnyVehicle() const
returns the last vehicle that is fully or partially on this lane
bool isApproachedFrom(MSEdge *const edge)
double getHarmonoise_NoiseEmissions() const
Returns the sum of last step noise emissions.
double getStopOffset(const MSVehicle *veh) const
Returns vehicle class specific stopOffset for the vehicle.
std::pair< MSVehicle *const, double > getCriticalLeader(double dist, double seen, double speed, const MSVehicle &veh) const
Returns the most dangerous leader and the distance to him.
static SUMOTime gTimeToGridlock
double getLength() const
Get vehicle's length [m].
AnyVehicleIterator anyVehiclesUpstreamEnd() const
end iterator for iterating over all vehicles touching this lane in upstream direction ...
const MSLeaderInfo & getFirstVehicleInformation(const MSVehicle *ego, double latOffset, bool onlyFrontOnLane, double maxPos=std::numeric_limits< double >::max(), bool allowCached=true) const
analogue to getLastVehicleInformation but in the upstream direction
const MSEdge * succEdge(int nSuccs) const
Returns the nSuccs'th successor of edge the vehicle is currently at.
const double SUMO_const_haltingSpeed
the speed threshold at which vehicles are considered as halting
int operator()(MSVehicle *v1, MSVehicle *v2) const
Comparing operator.
bool isRemoteAffected(SUMOTime t) const
void saveState(OutputDevice &out)
Saves the state of this lane into the given stream.
MSLeaderInfo myLeaderInfo
leaders on all sublanes as seen by approaching vehicles (cached)
const MSLane *const myLane
double getBackPositionOnLane(const MSLane *lane) const
Get the vehicle's position relative to the given lane.
MSLane * myCanonicalSuccessorLane
Main successor lane,.
Static storage of an output device and its base (abstract) implementation.
bool closeTag(const std::string &comment="")
Closes the most recently opened tag and optionally adds a comment.
void registerCollision()
registers one collision-related teleport
MSEdgeControl & getEdgeControl()
Returns the edge control.
Boundary getBoxBoundary() const
Returns a boundary enclosing this list of lines.
double myNettoVehicleLengthSum
The current length of all vehicles on this lane, excluding their minGaps.
double getMeanSpeed() const
Returns the mean speed on this lane.
MSLeaderInfo myFollowerInfo
followers on all sublanes as seen by vehicles on consecutive lanes (cached)
double arrivalSpeed
(optional) The final speed of the vehicle (not used yet)
virtual ~MSLane()
Destructor.
MSLane * getShadowLane() const
Returns the lane the vehicle's shadow is on during continuous/sublane lane change.
MSRouteIterator begin() const
Returns the begin of the list of edges to pass.
void addParking(MSVehicle *veh)
add parking vehicle. This should only used during state loading
int numFreeSublanes() const
bool isStopped() const
Returns whether the vehicle is at a stop.
No information given; use default.
A free position is chosen.
The class responsible for building and deletion of vehicles.
double getMissingRearGap(const MSVehicle *leader, double backOffset, double leaderSpeed) const
return by how much further the leader must be inserted to avoid rear end collisions ...
const double myLengthGeometryFactor
precomputed myShape.length / myLength
std::vector< MSEdge * > MSEdgeVector
MSLeaderInfo myLeaderInfoTmp
Insert behind the last vehicle as close as possible to still allow the specified departSpeed. Fallback to DEPART_POS_BASE if there is no vehicle on the departLane yet.
const MSLinkCont & getLinkCont() const
returns the container with all links !!!
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) ...
const std::vector< LaneQ > & getBestLanes() const
Returns the description of best lanes to use in order to continue the route.
VehCont myVehBuffer
Buffer for vehicles that moved from their previous lane onto this one. Integrated after all vehicles ...
static double angleDiff(const double angle1, const double angle2)
Returns the difference of the second angle to the first angle in radiants.
bool isParking() const
Returns whether the vehicle is parking.
double getDepartPosLat(const MSVehicle &veh)
double getSpeed() const
Returns the vehicle's current speed.
static const long CHANGE_PERMISSIONS_PERMANENT
MSLeaderDistanceInfo getFollowersOnConsecutive(const MSVehicle *ego, double backOffset, bool allSublanes, double searchDist=-1, bool ignoreMinorLinks=false) const
return the sublane followers with the largest missing rear gap among all predecessor lanes (within di...
double ymax() const
Returns maximum y-coordinate.
SUMOTime myFollowerInfoTime
time step for which myFollowerInfo was last updated
virtual void releaseVehicles() const
Allows to use the container for microsimulation again.
static SUMOTime gLaneChangeDuration
double myMaxSpeed
Lane-wide speedlimit [m/s].
double getNettoOccupancy() const
Returns the netto (excluding minGaps) occupancy of this lane during the last step (including minGaps)...
static double sum(double val)
Computes the resulting noise.
const std::string & getID() const
Returns the name of the vehicle.
void registerTeleportWrongLane()
register one non-collision-related teleport
Representation of a lane in the micro simulation.
std::vector< const MSLink * > getUpcomingLinks(double pos, double range, const std::vector< MSLane *> &contLanes) const
Returns all upcoming junctions within given range along the given (non-internal) continuation lanes m...
double getWaitingSeconds() const
Returns the overall waiting time on this lane.
virtual const std::string & getID() const =0
Get the vehicle's ID.
void descheduleDeparture(const SUMOVehicle *veh)
stops trying to emit the given vehicle (and delete it)
bool myNeedsCollisionCheck
whether a collision check is currently needed
const double myWidth
Lane width [m].
OutputDevice & openTag(const std::string &xmlElement)
Opens an XML tag.
virtual double stopSpeed(const MSVehicle *const veh, const double speed, double gap) const =0
Computes the vehicle's safe speed for approaching a non-moving obstacle (no dawdling) ...
SUMOVehicleClass getVehicleClass() const
Get this vehicle type's vehicle class.
virtual void incorporateVehicle(MSVehicle *veh, double pos, double speed, double posLat, const MSLane::VehCont::iterator &at, MSMoveReminder::Notification notification=MSMoveReminder::NOTIFICATION_DEPARTED)
Inserts the vehicle into this lane, and informs it about entering the network.
virtual bool appropriate(const MSVehicle *veh)
The vehicle is being teleported.
virtual void planMovements(const SUMOTime t)
Compute safe velocities for all vehicles based on positions and speeds from the last time step...
MSLane * getParallelLane(int offset) const
Returns the lane with the given offset parallel to this one or 0 if it does not exist.
Definition of vehicle stop (position and duration)
virtual const MSVehicleType & getVehicleType() const =0
Returns the vehicle's type.
double getDepartSpeed(const MSVehicle &veh, bool &patchSpeed)
DepartPosLatDefinition departPosLatProcedure
Information how the vehicle shall choose the lateral departure position.