44#define DEBUG_COND (getID()=="C")
50 "**",
"^",
"*",
"/",
"+",
"-",
"%",
51 "=",
"==",
"!=",
"<",
">",
"<=",
">=",
52 "and",
"&&",
"or",
"||",
58#define DEFAULT_MAX_GAP "3.0"
59#define DEFAULT_PASSING_TIME "1.9"
60#define DEFAULT_DETECTOR_GAP "2.0"
61#define DEFAULT_INACTIVE_THRESHOLD "180"
62#define DEFAULT_CURRENT_PRIORITY 10
63#define DEFAULT_CROSSING_PRIORITY 100
65#define DEFAULT_LENGTH_WITH_GAP 7.5
66#define DEFAULT_BIKE_LENGTH_WITH_GAP (getDefaultVehicleLength(SVC_BICYCLE) + 0.5)
67#define DEFAULT_STATIC_MINDUR TIME2STEPS(0)
69#define NO_DETECTOR "NO_DETECTOR"
70#define DEFAULT_CONDITION "DEFAULT"
76 const std::string&
id,
const std::string& programID,
81 const std::string& basePath,
86 myHasMultiTarget(false),
87 myLastTrySwitchTime(0),
88 myConditions(conditions),
89 myAssignments(assignments),
90 myFunctions(functions),
92 myDetectorPrefix(id +
"_" + programID +
"_") {
106 std::set<std::string> hiddenSet(hidden.begin(), hidden.end());
108 if (hiddenSet.count(item.first) == 0) {
113 const bool showAll =
getParameter(
"show-conditions",
"") ==
"";
115 std::set<std::string> shownSet(shown.begin(), shown.end());
117 if (showAll || shownSet.count(item.first) != 0) {
123 const std::string extraIDs =
getParameter(
"extra-detectors",
"");
126 myExtraLoops.push_back(retrieveDetExpression<MSInductLoop, SUMO_TAG_INDUCTION_LOOP>(customID, extraIDs,
true));
128 myExtraE2.push_back(retrieveDetExpression<MSE2Collector, SUMO_TAG_LANE_AREA_DETECTOR>(customID, extraIDs,
true));
132 myStack.push_back(std::map<std::string, double>());
143 for (
int i = 0; i < (int)
myPhases.size(); i++) {
151 const int numLinks = (int)
myLinks.size();
175 std::map<const MSLane*, MSInductLoop*> laneInductLoopMap;
176 std::map<MSInductLoop*, int> inductLoopInfoMap;
177 int detEdgeIndex = -1;
178 int detLaneIndex = 0;
181 MSEdge* prevDetEdge =
nullptr;
183 for (
MSLane* lane : lanes) {
184 const std::string customID =
getParameter(lane->getID());
185 if (
noVehicles(lane->getPermissions()) && customID ==
"") {
189 if (laneInductLoopMap.find(lane) != laneInductLoopMap.end()) {
194 if (minDur == std::numeric_limits<SUMOTime>::max() && customID ==
"" && !
myBuildAllDetectors) {
198 double length = lane->getLength();
200 double inductLoopPosition;
202 if (&lane->getEdge() != prevDetEdge) {
205 prevDetEdge = &lane->getEdge();
209 const bool isBikeLane = (lane->getPermissions() & ~SVC_PEDESTRIAN) ==
SVC_BICYCLE;
211 if (customID ==
"") {
213 inductLoopPosition =
MIN2(
218 ilpos = length - inductLoopPosition;
219 MSLane* placementLane = lane;
220 while (ilpos < 0 && placementLane->getIncomingLanes().size() == 1
221 && placementLane->
getIncomingLanes().front().viaLink->getCorrespondingEntryLink()->getTLLogic() ==
nullptr) {
229 const double detLength =
getDouble(
"detector-length:" + lane->getID(), detDefaultLength);
237 if (loop ==
nullptr) {
241 inductLoopPosition = length - ilpos;
245 laneInductLoopMap[lane] = loop;
276 std::map<int, std::set<MSInductLoop*> > linkToLoops;
277 std::set<int> actuatedLinks;
279 std::vector<bool> neverMajor(numLinks,
true);
281 const std::string& state = phase->getState();
282 for (
int i = 0; i < numLinks; i++) {
284 neverMajor[i] =
false;
288 std::vector<bool> oneLane(numLinks,
false);
289 std::vector<bool> turnaround(numLinks,
true);
290 for (
int i = 0; i < numLinks; i++) {
293 int numMotorized = 0;
294 for (
MSLane* l : lane->getEdge().getLanes()) {
295 if ((l->getPermissions() & motorized) != 0) {
299 if (numMotorized == 1) {
305 if (!link->isTurnaround()) {
306 turnaround[i] =
false;
314 std::set<MSInductLoop*> loops;
315 if (phase->isActuated() || multiNextTargets.count(phaseIndex) != 0) {
316 const std::string& state = phase->getState();
318 std::set<int> greenLinks;
320 std::set<int> greenLinksPermissive;
322 std::map<MSInductLoop*, std::set<int> > loopLinks;
324 for (
int i = 0; i < numLinks; i++) {
326 greenLinks.insert(i);
327 if (phase->isActuated()) {
328 actuatedLinks.insert(i);
332 if (link->getLane()->isCrossing()) {
341 if (((neverMajor[i] || turnaround[i])
345 greenLinks.insert(i);
346 if (!turnaround[i]) {
347 if (phase->isActuated()) {
348 actuatedLinks.insert(i);
352 greenLinksPermissive.insert(i);
355#ifdef DEBUG_DETECTORS
357 std::cout <<
" phase=" << phaseIndex <<
" i=" << i <<
" state=" << state[i] <<
" green=" << greenLinks.count(i) <<
" oneLane=" << oneLane[i]
358 <<
" turn=" << turnaround[i] <<
" loopLanes=";
360 if (laneInductLoopMap.count(lane) != 0) {
361 std::cout << lane->getID() <<
" ";
368 if (laneInductLoopMap.count(lane) != 0) {
369 loopLinks[laneInductLoopMap[lane]].insert(i);
373 for (
auto& item : loopLinks) {
378 bool foundUsable =
false;
380 for (
int j : item.second) {
381 if (greenLinks.count(j) == 0 && (info.
jamThreshold <= 0 || greenLinksPermissive.count(j) == 0)) {
383#ifdef DEBUG_DETECTORS
385 std::cout <<
" phase=" << phaseIndex <<
" check1: loopLane=" << loopLane->
getID() <<
" notGreen=" << j <<
" oneLane[j]=" << oneLane[j] <<
"\n";
399 if (link->isTurnaround()) {
402 const MSLane* next = link->getLane();
403 if (laneInductLoopMap.count(next) != 0) {
405 for (
int j : loopLinks[nextLoop]) {
406 if (greenLinks.count(j) == 0) {
408#ifdef DEBUG_DETECTORS
409 if (
DEBUG_COND) std::cout <<
" phase=" << phaseIndex <<
" check2: loopLane=" << loopLane->
getID()
410 <<
" nextLane=" << next->
getID() <<
" nextLink=" << j <<
" nextState=" << state[j] <<
"\n";
420 loops.insert(item.first);
421#ifdef DEBUG_DETECTORS
423 std::cout <<
" phase=" << phaseIndex <<
" usableLoops=" << item.first->getID() <<
" links=" <<
joinToString(item.second,
" ") <<
"\n";
426 for (
int j : item.second) {
427 linkToLoops[j].insert(item.first);
431 if (loops.size() == 0 && phase->isActuated()) {
435#ifdef DEBUG_DETECTORS
437 std::cout <<
" phase=" << phaseIndex <<
" loops=" <<
joinNamedToString(loops,
" ") <<
"\n";
440 std::cout <<
" linkToLoops:\n";
441 for (
auto item : linkToLoops) {
442 std::cout <<
" link=" << item.first <<
" loops=" <<
joinNamedToString(item.second,
" ") <<
"\n";
446 std::vector<InductLoopInfo*> loopInfos;
450 if (loopInfo.loop == loop) {
452 loopInfo.servedPhase[phaseIndex] =
true;
457#ifdef DEBUG_DETECTORS
459 std::cout <<
"final linkToLoops:\n";
460 for (
auto item : linkToLoops) {
461 std::cout <<
" link=" << item.first <<
" loops=" <<
joinNamedToString(item.second,
" ") <<
"\n";
465 std::vector<int> warnLinks;
466 for (
int i : actuatedLinks) {
467 if (linkToLoops[i].size() == 0 &&
myLinks[i].size() > 0
468 && (
myLinks[i].front()->getLaneBefore()->getPermissions() & motorized) != 0) {
470 warnLinks.push_back(i);
474 if (warnLinks.size() > 0) {
482 WRITE_ERRORF(
TL(
"Invalid link '%' given as linkMaxDur parameter for actuated tlLogic '%', program '%."), kv.first.substr(11),
getID(),
getProgramID());
492 WRITE_ERRORF(
TL(
"Invalid link '%' given as linkMinDur parameter for actuated tlLogic '%', program '%."), kv.first.substr(11),
getID(),
getProgramID());
504 haveSwitchingRules =
true;
519 int linkIndex = link->getIndex();
520 const MSJunction* junction = link->getJunction();
521 for (
int i = 0; i < (int)
myLinks.size(); i++) {
528 int foeIndex = foe->getIndex();
529 const MSJunction* junction2 = foe->getJunction();
530 if (junction == junction2) {
533 if (logic->
getFoesFor(linkIndex).test(foeIndex)
534 && (foe->getPermissions() & ~SVC_VULNERABLE) != 0
535 && &foe->getLaneBefore()->getEdge() != &link->getLaneBefore()->getEdge()) {
552 step = step < 0 ?
myStep : step;
561 step = step < 0 ?
myStep : step;
570 step = step < 0 ?
myStep : step;
579 step = step < 0 ?
myStep : step;
590 for (
int i = 0; i < (int)
myPhases.size(); i++) {
592 const std::string errorSuffix =
"' for overriding attribute in phase " +
toString(i) +
" of tlLogic '" +
getID() +
"' in program '" +
getProgramID() +
"'.";
594 const std::string cond =
"minDur:" +
toString(i);
596 throw ProcessError(
"Missing condition '" + cond + errorSuffix);
600 const std::string cond =
"maxDur:" +
toString(i);
602 throw ProcessError(
"Missing condition '" + cond + errorSuffix);
606 const std::string cond =
"earliestEnd:" +
toString(i);
608 throw ProcessError(
"Missing condition '" + cond + errorSuffix);
612 const std::string cond =
"latestEnd:" +
toString(i);
614 throw ProcessError(
"Missing condition '" + cond + errorSuffix);
623 for (
int i = 0; i < (int)
myPhases.size(); i++) {
626 std::vector<int> nextPhases = phase->
nextPhases;
627 if (nextPhases.size() == 0) {
628 nextPhases.push_back((i + 1) % (int)
myPhases.size());
629 }
else if (nextPhases.size() > 1) {
632 for (
int next : nextPhases) {
633 if (next >= 0 && next < (
int)
myPhases.size()) {
650 std::map<int, std::map<int, SUMOTime> > reached;
651 const std::vector<int>& next =
myPhases[step]->nextPhases;
655 for (
int target = 0; target < (int)
myPhases.size(); target++) {
656 int bestNext = next[0];
658 for (
auto item : reached) {
659 auto it = item.second.find(target);
660 if (it != item.second.end()) {
661 SUMOTime transitionTime = it->second;
662 if (transitionTime < bestTime) {
663 bestTime = transitionTime;
664 bestNext = item.first;
669 myTargets[step][bestNext].push_back(target);
678 std::pair<int, SUMOTime> tDur =
getTarget(n);
679 int target = tDur.first;
680 SUMOTime transitionTime = tDur.second + priorTransition;
682 if (target == origStep) {
687 auto it = found.find(target);
688 if (it != found.end()) {
689 if (it->second <= transitionTime) {
699 found[target] = transitionTime;
701 for (
int n2 :
myPhases[target]->nextPhases) {
709 std::set<int> result;
713 for (
int next : p->nextPhases) {
724 SUMOTime result = std::numeric_limits<SUMOTime>::max();
725 for (
int pI = 0; pI < (int)
myPhases.size(); pI++) {
727 const std::string& state = phase->
getState();
728 for (
int i = 0; i < (int)state.size(); i++) {
734 }
else if (multiNextTargets.count(pI) != 0) {
747 for (
int i = 0; i < (int)state.size(); i++) {
750 for (
MSLane* lane : lanes) {
776 loopInfo.loop->setVisible(
false);
784 if (step >= 0 && step !=
myStep) {
789 }
else if (step < 0) {
802 const SUMOTime lastSwitch = t - spentDuration;
827 if (state[i] ==
'G' || state[i] ==
'g') {
832 if (state[i] ==
'r' || state[i] ==
'u') {
842 const int origStep =
myStep;
852#ifdef DEBUG_PHASE_SELECTION
855 <<
" trySwitch dGap=" << (detectionGap == std::numeric_limits<double>::max() ?
"inf" :
toString(detectionGap))
856 <<
" multi=" << multiTarget <<
"\n";
859 if (detectionGap < std::numeric_limits<double>::max() && !multiTarget && !
myTraCISwitch) {
876 if (linkMinDur > 0) {
879 return multiTarget ?
TIME2STEPS(1) : linkMinDur;
888 myPhases[origStep]->myLastEnd = now;
896 if (loopInfo->isJammed()) {
901 loopInfo->lastGreenTime = now;
905#ifdef DEBUG_PHASE_SELECTION
928 if (newDuration % 1000 != 0) {
929 const SUMOTime totalDur = newDuration + actDuration;
930 newDuration = (totalDur / 1000 + 1) * 1000 - actDuration;
942 double result = std::numeric_limits<double>::max();
949 if (loopInfo.lastGreenTime < loopInfo.loop->getLastDetectionTime()) {
952 loopInfo.loop->setSpecialColor(
nullptr);
963#ifdef DEBUG_PHASE_SELECTION
975 if (loopInfo->isJammed()) {
981 if (actualGap < loopInfo->maxGap && !loopInfo->isJammed()) {
982 result =
MIN2(result, actualGap);
994 int result = cands.front();
1002#ifdef DEBUG_PHASE_SELECTION
1005 if (currentPrio > maxPrio) {
1007 maxPrio = currentPrio;
1010 for (
int step : cands) {
1014#ifdef DEBUG_PHASE_SELECTION
1016 std::cout <<
SIMTIME <<
" p=" <<
myStep <<
" step=" << step <<
" target=" << target <<
" loops=" <<
myInductLoopsForPhase[target].size() <<
" prio=" << prio <<
"\n";
1029std::pair<int, SUMOTime>
1031 int origStep = step;
1034 while (!
myPhases[step]->isGreenPhase()) {
1036 if (
myPhases[step]->nextPhases.size() > 0 &&
myPhases[step]->nextPhases.front() >= 0) {
1040 step =
myPhases[step]->nextPhases.front();
1042 step = (step + 1) % (
int)
myPhases.size();
1044 if (step == origStep) {
1046 return std::make_pair(0, 0);
1049 return std::make_pair(step, dur);
1061#ifdef DEBUG_PHASE_SELECTION
1073#ifdef DEBUG_PHASE_SELECTION
1075 std::cout <<
" loop=" << loop->
getID()
1076 <<
" actDuration=" <<
STEPS2TIME(actDuration)
1079 <<
" canExtend=" << canExtend
1103 auto* aPersons = crossingEntry->getApproachingPersons();
1104 if (aPersons !=
nullptr && aPersons->size() > 0) {
1141 const std::string& targetState =
myPhases[target]->getState();
1144 targetState[i] ==
'G' || targetState[i] ==
'g')) {
1157 const std::string& targetState =
myPhases[target]->getState();
1160 && (state[i] ==
'G' || state[i] ==
'g')
1161 && !(targetState[i] ==
'G' || targetState[i] ==
'g')) {
1177 if (condition !=
"") {
1180 if (
gapControl() == std::numeric_limits<double>::max()) {
1194 const size_t bracketOpen = condition.find(
'(');
1195 if (bracketOpen != std::string::npos) {
1197 size_t bracketClose = std::string::npos;
1199 for (
size_t i = bracketOpen + 1; i < condition.size(); i++) {
1200 if (condition[i] ==
'(') {
1202 }
else if (condition[i] ==
')') {
1210 if (bracketClose == std::string::npos) {
1211 throw ProcessError(
TLF(
"Unmatched parentheses in condition %'", condition));
1213 std::string cond2 = condition;
1214 const std::string inBracket = condition.substr(bracketOpen + 1, bracketClose - bracketOpen - 1);
1216 cond2.replace(bracketOpen, bracketClose - bracketOpen + 1,
toString(bracketVal));
1220 throw ProcessError(
"Error when evaluating expression '" + condition +
"':\n " + e.what());
1225 if (tokens.size() == 0) {
1227 }
else if (tokens.size() == 1) {
1231 throw ProcessError(
"Error when evaluating expression '" + condition +
"':\n " + e.what());
1233 }
else if (tokens.size() == 2) {
1234 if (tokens[0] ==
"not") {
1238 throw ProcessError(
"Error when evaluating expression '" + condition +
"':\n " + e.what());
1243 }
else if (tokens.size() == 3) {
1247 const std::string& o = tokens[1];
1252 throw ProcessError(
"Error when evaluating expression '" + condition +
"':\n " + e.what());
1255 const int iEnd = (int)tokens.size() - 1;
1257 for (
int i = 1; i < iEnd; i++) {
1258 if (tokens[i] == o) {
1263 std::vector<std::string> newTokens(tokens.begin(), tokens.begin() + (i - 1));
1264 newTokens.push_back(
toString(val));
1265 newTokens.insert(newTokens.end(), tokens.begin() + (i + 2), tokens.end());
1268 throw ProcessError(
"Error when evaluating expression '" + condition +
"':\n " + e.what());
1273 throw ProcessError(
"Parsing expressions with " +
toString(tokens.size()) +
" elements ('" + condition +
"') is not supported");
1280 if (o ==
"=" || o ==
"==") {
1281 return (
double)(a == b);
1282 }
else if (o ==
"<") {
1283 return (
double)(a < b);
1284 }
else if (o ==
">") {
1285 return (
double)(a > b);
1286 }
else if (o ==
"<=") {
1287 return (
double)(a <= b);
1288 }
else if (o ==
">=") {
1289 return (
double)(a >= b);
1290 }
else if (o ==
"!=") {
1291 return (
double)(a != b);
1292 }
else if (o ==
"or" || o ==
"||") {
1293 return (
double)(a || b);
1294 }
else if (o ==
"and" || o ==
"&&") {
1295 return (
double)(a && b);
1296 }
else if (o ==
"+") {
1298 }
else if (o ==
"-") {
1300 }
else if (o ==
"*") {
1302 }
else if (o ==
"/") {
1308 }
else if (o ==
"%") {
1310 }
else if (o ==
"**" || o ==
"^") {
1313 throw ProcessError(
"Unsupported operator '" + o +
"' in condition '" + condition +
"'");
1321 if ((
int)args.size() != f.
nArgs) {
1324 std::vector<double> args2;
1325 for (
auto a : args) {
1330 for (
int i = 0; i < (int)args2.size(); i++) {
1337 throw ProcessError(
"Error when evaluating function '" + fun +
"' with args '" +
joinToString(args2,
",") +
"' (" + e.what() +
")");
1339 double result =
myStack.back()[
"$0"];
1347 for (
const auto& assignment : assignments) {
1349 const std::string&
id = std::get<0>(assignment);
1351 ConditionMap::iterator it = conditions.find(
id);
1352 if (it != conditions.end()) {
1354 }
else if (forbidden.find(
id) != forbidden.end()) {
1355 throw ProcessError(
TLF(
"Modifying global condition '%' is forbidden",
id));
1366 if (expr.size() == 0) {
1368 }
else if (expr[0] ==
'!') {
1370 }
else if (expr[0] ==
'-') {
1374 const size_t pos = expr.find(
':');
1375 if (pos == std::string::npos) {
1382 auto it2 =
myStack.back().find(expr);
1383 if (it2 !=
myStack.back().end()) {
1390 const std::string fun = expr.substr(0, pos);
1391 const std::string arg = expr.substr(pos + 1);
1393 return retrieveDetExpression<MSInductLoop, SUMO_TAG_INDUCTION_LOOP>(arg, expr,
true)->getTimeSinceLastDetection();
1394 }
else if (fun ==
"a") {
1396 return retrieveDetExpression<MSInductLoop, SUMO_TAG_INDUCTION_LOOP>(arg, expr,
true)->getTimeSinceLastDetection() == 0;
1398 return retrieveDetExpression<MSE2Collector, SUMO_TAG_LANE_AREA_DETECTOR>(arg, expr,
true)->getCurrentVehicleNumber();
1400 }
else if (fun ==
"g" || fun ==
"r") {
1403 if (linkIndex >= 0 && linkIndex <
myNumLinks) {
1405 if (times.empty()) {
1417 return STEPS2TIME(times[linkIndex] + currentGreen);
1426 throw ProcessError(
"Invalid link index '" + arg +
"' in expression '" + expr +
"'");
1427 }
else if (fun ==
"c") {
1431 throw ProcessError(
"Unsupported function '" + fun +
"' in expression '" + expr +
"'");
1440std::map<std::string, double>
1442 std::map<std::string, double> result;
1444 result[li.loop->getID()] = li.loop->getOccupancy() > 0 ? 1 : 0;
1447 result[loop->getID()] = loop->getOccupancy() > 0 ? 1 : 0;
1450 result[loop->getID()] = loop->getCurrentVehicleNumber();
1457 double result = 0.0;
1459 if (li.lane->getID() == laneID) {
1460 result = li.loop->getOccupancy() > 0 ? 1 : 0;
1467std::map<std::string, double>
1469 std::map<std::string, double> result;
1475 WRITE_ERRORF(
TL(
"Error when retrieving conditions '%' for tlLogic '%' (%)"), item.first,
getID(), e.what());
1485 const std::string cond = key.substr(10);
1490 throw InvalidArgument(
"Unknown condition '" + cond +
"' for actuated traffic light '" +
getID() +
"'");
1500 if (key ==
"detector-gap" || key ==
"passing-time" || key ==
"file" || key ==
"freq" || key ==
"vTypes"
1501 || key ==
"build-all-detectors"
1504 throw InvalidArgument(key +
" cannot be changed dynamically for actuated traffic light '" +
getID() +
"'");
1505 }
else if (key ==
"max-gap") {
1513 const std::string laneID = key.substr(8);
1515 if (loopInfo.lane->getID() == laneID) {
1521 throw InvalidArgument(
"Invalid lane '" + laneID +
"' in key '" + key +
"' for actuated traffic light '" +
getID() +
"'");
1522 }
else if (key ==
"jam-threshold") {
1530 const std::string laneID = key.substr(14);
1532 if (loopInfo.lane->getID() == laneID) {
1538 throw InvalidArgument(
"Invalid lane '" + laneID +
"' in key '" + key +
"' for actuated traffic light '" +
getID() +
"'");
1539 }
else if (key ==
"show-detectors") {
1545 }
else if (key ==
"inactive-threshold") {
#define DEFAULT_DETECTOR_GAP
#define DEFAULT_STATIC_MINDUR
#define DEFAULT_PASSING_TIME
#define DEFAULT_BIKE_LENGTH_WITH_GAP
#define DEFAULT_LENGTH_WITH_GAP
#define DEFAULT_INACTIVE_THRESHOLD
#define DEFAULT_CROSSING_PRIORITY
#define DEFAULT_CONDITION
#define DEFAULT_CURRENT_PRIORITY
#define WRITE_WARNINGF(...)
#define WRITE_ERRORF(...)
#define WRITE_WARNING(msg)
SUMOTime string2time(const std::string &r)
convert string to SUMOTime
std::string time2string(SUMOTime t, bool humanReadable)
convert SUMOTime to string (independently of global format setting)
bool noVehicles(SVCPermissions permissions)
Returns whether an edge with the given permissions forbids vehicles.
long long int SVCPermissions
bitset where each bit declares whether a certain SVC may use this edge/lane
const double DEFAULT_BICYCLE_SPEED
@ SVC_BICYCLE
vehicle is a bicycle
@ SVC_PEDESTRIAN
pedestrian
@ SUMO_TAG_INDUCTION_LOOP
alternative tag for e1 detector
LinkState
The right-of-way state of a link between two lanes used when constructing a NBTrafficLightLogic,...
@ LINKSTATE_TL_REDYELLOW
The link has red light (must brake) but indicates upcoming green.
@ LINKSTATE_TL_GREEN_MAJOR
The link has green light, may pass.
@ LINKSTATE_TL_RED
The link has red light (must brake)
@ LINKSTATE_TL_GREEN_MINOR
The link has green light, has to brake.
std::string joinNamedToString(const std::set< T *, C > &ns, const T_BETWEEN &between)
std::string joinToString(const std::vector< T > &v, const T_BETWEEN &between, std::streamsize accuracy=gPrecision)
std::string toString(const T &t, std::streamsize accuracy=gPrecision)
static std::string checkForRelativity(const std::string &filename, const std::string &basePath)
Returns the path from a configuration so that it is accessable from the current working directory.
double myDetectorGap
The detector distance in seconds.
void findTargets(int origStep, int n, SUMOTime priorTransition, std::map< int, SUMOTime > &found)
FunctionMap myFunctions
The loaded functions.
double myJamThreshold
The minimum continuous occupancy time to mark a detector as jammed.
bool myBuildAllDetectors
Whether all detectors shall be built.
double myMaxGap
The maximum gap to check in seconds.
const std::string getParameter(const std::string &key, const std::string defaultValue="") const override
try to get the value of the given parameter (including prefixed parameters)
std::map< int, std::map< int, std::vector< int > > > myTargets
std::vector< SwitchingRules > mySwitchingRules
~MSActuatedTrafficLightLogic()
Destructor.
std::vector< std::map< std::string, double > > myStack
The function call stack;.
double evalAtomicExpression(const std::string &expr) const
evaluate atomic expression
SUMOTime trySwitch() override
Switches to the next phase.
std::set< int > getMultiNextTargets() const
find green phases target by a next attribute
SUMOTime myLastTrySwitchTime
last time trySwitch was called
int getDetectorPriority(const InductLoopInfo &loopInfo) const
SUMOTime myFreq
The frequency for aggregating detector output.
std::vector< const MSInductLoop * > myExtraLoops
extra loops for output/tracking
bool myShowDetectors
Whether the detectors shall be shown in the GUI.
std::vector< SUMOTime > myLinkMaxGreenTimes
maximum consecutive time that the given link may remain green
MSActuatedTrafficLightLogic(MSTLLogicControl &tlcontrol, const std::string &id, const std::string &programID, const SUMOTime offset, const MSSimpleTrafficLightLogic::Phases &phases, int step, SUMOTime delay, const Parameterised::Map ¶meter, const std::string &basePath, const ConditionMap &conditions=ConditionMap(), const AssignmentMap &assignments=AssignmentMap(), const FunctionMap &functions=FunctionMap())
Constructor.
void loadState(MSTLLogicControl &tlcontrol, SUMOTime t, int step, SUMOTime spentDuration) override
restores the tls state
SUMOTime getMaxDur(int step=-1) const override
std::vector< std::vector< const MSLink * > > myCrossingsForPhase
AssignmentMap myAssignments
The condition assignments.
std::string myVehicleTypes
Whether detector output separates by vType.
double gapControl()
Return the minimum detection gap of all detectors if the current phase should be extended and double:...
std::vector< std::tuple< std::string, std::string, std::string > > AssignmentMap
std::set< std::string > myListedConditions
the conditions which shall be listed in GUITLLogicPhasesTrackerWindow
double evalExpression(const std::string &condition) const
evaluate custom switching condition
std::vector< SUMOTime > myLinkMinGreenTimes
minimum consecutive time that the given link must remain green
void changeStepAndDuration(MSTLLogicControl &tlcontrol, SUMOTime simStep, int step, SUMOTime stepDuration) override
Changes the current phase and her duration.
bool weakConflict(int linkIndex, const std::string &state) const
whether a given link has only weak mode foes that are green in the given state
static const std::vector< std::string > OPERATOR_PRECEDENCE
void deactivateProgram() override
bool myHasMultiTarget
Whether any of the phases has multiple targets.
double myPassingTime
The passing time used in seconds.
SUMOTime getLinkMinDuration(int target) const
the minimum duratin for keeping the current phase due to linkMinDur constraints
SUMOTime getMinDur(int step=-1) const override
bool canExtendLinkGreen(int target)
whether the target phase is acceptable in light of linkMaxDur constraints
InductLoopMap myInductLoopsForPhase
A map from phase to induction loops to be used for gap control.
SUMOTime getMinimumMinDuration(MSLane *lane, const std::set< int > &multiNextTargets) const
get the minimum min duration for all stretchable phases that affect the given lane
int decideNextPhaseCustom(bool mustSwitch)
select among candidate phases based on detector states and custom switching rules
double evalTernaryExpression(double a, const std::string &o, double b, const std::string &condition) const
evaluate atomic expression
void executeAssignments(const AssignmentMap &assignments, ConditionMap &conditions, const ConditionMap &forbidden=ConditionMap()) const
execute assignemnts of the logic or a custom function
void setShowDetectors(bool show)
void initTargets(int step)
bool myTraCISwitch
whether the next switch time was requested via TraCI
int getPhasePriority(int step) const
count the number of active detectors for the given step
SUMOTime duration(const double detectionGap) const
Returns the minimum duration of the current phase.
void activateProgram() override
called when switching programs
std::vector< InductLoopInfo > myInductLoops
bool maxLinkDurationReached()
whether the current phase cannot be continued due to linkMaxDur constraints
double evalCustomFunction(const std::string &fun, const std::string &arg) const
evaluate function expression
void initAttributeOverride()
initialize custom switching rules
std::map< std::string, double > getConditions() const override
return all named conditions defined for this traffic light
bool hasMajor(const std::string &state, const LaneVector &lanes) const
return whether there is a major link from the given lane in the given phase
std::vector< const MSE2Collector * > myExtraE2
SUMOTime getEarliestEnd(int step=-1) const override
std::map< std::string, Function > FunctionMap
std::map< std::string, double > getDetectorStates() const override
retrieve all detectors used by this program
double getDetectorState(const std::string laneID) const override
retrieve a specific detector used by this program
void setParameter(const std::string &key, const std::string &value) override
Sets a parameter and updates internal constants.
std::vector< SUMOTime > myLinkGreenTimes
consecutive time that the given link index has been green
SUMOTime getLatestEnd(int step=-1) const override
std::vector< SUMOTime > myLinkRedTimes
Parameterised::Map ConditionMap
std::string myFile
The output file for generated detectors.
void initSwitchingRules()
std::pair< int, SUMOTime > getTarget(int step) const
get the green phase following step and the transition time
ConditionMap myConditions
The custom switching conditions.
const std::string myDetectorPrefix
void init(NLDetectorBuilder &nb) override
Initialises the tls with information about incoming lanes.
int decideNextPhase()
select among candidate phases based on detector states
SUMOTime myInactiveThreshold
The time threshold to avoid starved phases.
const NamedObjectCont< MSDetectorFileOutput * > & getTypedDetectors(SumoXMLTag type) const
Returns the list of detectors of the given type.
void add(SumoXMLTag type, MSDetectorFileOutput *d, const std::string &device, SUMOTime interval, SUMOTime begin=-1)
Adds a detector/output combination into the containers.
A road/street connecting two junctions.
double getSpeedLimit() const
Returns the speed limit of the edge @caution The speed limit of the first lane is retured; should pro...
virtual void addEvent(Command *operation, SUMOTime execTimeStep=-1)
Adds an Event.
An unextended detector measuring at a fixed position on a fixed lane.
double getPosition() const
Returns the position of the detector on the lane.
virtual void setSpecialColor(const RGBColor *)
allows for special color in the gui version
double getTimeSinceLastDetection() const
Returns the time since the last vehicle left the detector.
SUMOTime getLastDetectionTime() const
return last time a vehicle was on the detector
The base class for an intersection.
virtual const MSJunctionLogic * getLogic() const
virtual const MSLogicJunction::LinkBits & getFoesFor(int linkIndex) const
Returns the foes for the given link.
Representation of a lane in the micro simulation.
const std::vector< IncomingLaneInfo > & getIncomingLanes() const
double getLength() const
Returns the lane's length.
MSLane * getLogicalPredecessorLane() const
get the most likely precedecessor lane (sorted using by_connections_to_sorter). The result is cached ...
const std::vector< MSLink * > & getLinkCont() const
returns the container with all links !!!
MSDetectorControl & getDetectorControl()
Returns the detector control.
static MSNet * getInstance()
Returns the pointer to the unique instance of MSNet (singleton).
MSEventControl * getBeginOfTimestepEvents()
Returns the event control for events executed at the begin of a time step.
SUMOTime getCurrentTimeStep() const
Returns the current simulation step.
The definition of a single phase of a tls logic.
SUMOTime maxDuration
The maximum duration of the phase.
LinkState getSignalState(int pos) const
Returns the state of the tls signal at the given position.
static const SUMOTime OVERRIDE_DURATION
SUMOTime latestEnd
The maximum time within the cycle for switching (for coordinated actuation)
SUMOTime minDuration
The minimum duration of the phase.
const std::string & getState() const
Returns the state within this phase.
bool isGreenPhase() const
Returns whether this phase is a pure "green" phase.
std::vector< int > nextPhases
The index of the phase that suceeds this one (or -1)
std::string finalTarget
The condition expression for switching into this phase when the active phase must end.
std::string earlyTarget
The condition expression for an early switch into this phase.
SUMOTime earliestEnd
The minimum time within the cycle for switching (for coordinated actuation)
A fixed traffic light logic.
SUMOTime getLatest() const
the maximum duration for keeping the current phase when considering 'latestEnd'
Phases myPhases
The list of phases this logic uses.
const MSPhaseDefinition & getPhase(int givenstep) const override
Returns the definition of the phase from the given position within the plan.
SUMOTime getEarliest(SUMOTime prevStart) const
the minimum duration for keeping the current phase when considering 'earliestEnd'
int myStep
The current step.
virtual const std::string getParameter(const std::string &key, const std::string defaultValue="") const override
gets a parameter
virtual void setParameter(const std::string &key, const std::string &value) override
Sets a parameter and updates internal constants.
const MSPhaseDefinition & getCurrentPhaseDef() const override
Returns the definition of the current phase.
void executeOnSwitchActions() const
A class that stores and controls tls and switching of their programs.
TLSLogicVariants & get(const std::string &id) const
Returns the variants of a named tls.
Class realising the switch between the traffic light phases.
void deschedule(MSTrafficLightLogic *tlLogic)
Marks this swicth as invalid (if the phase duration has changed, f.e.)
const LaneVector & getLanesAt(int i) const
Returns the list of lanes that are controlled by the signals at the given position.
std::vector< MSLane * > LaneVector
Definition of the list of arrival lanes subjected to this tls.
virtual void deactivateProgram()
SUMOTime getTimeInCycle() const
return time within the current cycle
const std::string & getProgramID() const
Returns this tl-logic's id.
LaneVectorVector myLanes
The list of LaneVectors; each vector contains the incoming lanes that belong to the same link index.
SwitchCommand * mySwitchCommand
The current switch command.
int myNumLinks
number of controlled links
virtual void activateProgram()
called when switching programs
bool setTrafficLightSignals(SUMOTime t) const
Applies the current signal states to controlled links.
std::vector< MSPhaseDefinition * > Phases
Definition of a list of phases, being the junction logic.
const LinkVector & getLinksAt(int i) const
Returns the list of links that are controlled by the signals at the given position.
LinkVectorVector myLinks
The list of LinkVectors; each vector contains the links that belong to the same link index.
virtual void init(NLDetectorBuilder &nb)
Initialises the tls with information about incoming lanes.
Builds detectors for microsim.
virtual MSDetectorFileOutput * createInductLoop(const std::string &id, MSLane *lane, double pos, double length, const std::string name, const std::string &vTypes, const std::string &nextEdges, int detectPersons, bool show)
Creates an instance of an e1 detector using the given values.
const std::string & getID() const
Returns the id.
T get(const std::string &id) const
Retrieves an item.
static OptionsCont & getOptions()
Retrieves the options.
bool hasParameter(const std::string &key) const
Returns whether the parameter is set.
std::map< std::string, std::string > Map
parameters map
double getDouble(const std::string &key, const double defaultValue) const
Returns the value for a given key converted to a double.
const Parameterised::Map & getParametersMap() const
Returns the inner key/value map.
virtual void setParameter(const std::string &key, const std::string &value)
Sets a parameter.
static const RGBColor ORANGE
static const RGBColor GREEN
static const RGBColor RED
named colors
std::vector< std::string > getVector()
return vector of strings
static double toDouble(const std::string &sData)
converts a string into the double value described by it by calling the char-type converter
static bool startsWith(const std::string &str, const std::string prefix)
Checks whether a given string starts with the prefix.
static int toInt(const std::string &sData)
converts a string into the integer value described by it by calling the char-type converter,...
static bool toBool(const std::string &sData)
converts a string into the bool value described by it by calling the char-type converter
AssignmentMap assignments
std::vector< bool > servedPhase