45#define DEBUG_COND (getID()=="C")
51 "**",
"^",
"*",
"/",
"+",
"-",
"%",
52 "=",
"==",
"!=",
"<",
">",
"<=",
">=",
53 "and",
"&&",
"or",
"||",
59#define DEFAULT_MAX_GAP "3.0"
60#define DEFAULT_PASSING_TIME "1.9"
61#define DEFAULT_DETECTOR_GAP "2.0"
62#define DEFAULT_INACTIVE_THRESHOLD "180"
63#define DEFAULT_CURRENT_PRIORITY 10
64#define DEFAULT_CROSSING_PRIORITY 100
66#define DEFAULT_LENGTH_WITH_GAP 7.5
67#define DEFAULT_BIKE_LENGTH_WITH_GAP (getDefaultVehicleLength(SVC_BICYCLE) + 0.5)
68#define DEFAULT_STATIC_MINDUR TIME2STEPS(0)
70#define NO_DETECTOR "NO_DETECTOR"
71#define DEFAULT_CONDITION "DEFAULT"
77 const std::string&
id,
const std::string& programID,
82 const std::string& basePath,
87 myHasMultiTarget(false),
88 myLastTrySwitchTime(0),
89 myConditions(conditions),
90 myAssignments(assignments),
91 myFunctions(functions),
93 myDetectorPrefix(id +
"_" + programID +
"_") {
107 std::set<std::string> hiddenSet(hidden.begin(), hidden.end());
109 if (hiddenSet.count(item.first) == 0) {
114 const bool showAll =
getParameter(
"show-conditions",
"") ==
"";
116 std::set<std::string> shownSet(shown.begin(), shown.end());
118 if (showAll || shownSet.count(item.first) != 0) {
124 const std::string extraIDs =
getParameter(
"extra-detectors",
"");
127 myExtraLoops.push_back(retrieveDetExpression<MSInductLoop, SUMO_TAG_INDUCTION_LOOP>(customID, extraIDs,
true));
129 myExtraE2.push_back(retrieveDetExpression<MSE2Collector, SUMO_TAG_LANE_AREA_DETECTOR>(customID, extraIDs,
true));
133 myStack.push_back(std::map<std::string, double>());
144 for (
int i = 0; i < (int)
myPhases.size(); i++) {
152 const int numLinks = (int)
myLinks.size();
176 std::map<const MSLane*, MSInductLoop*> laneInductLoopMap;
177 std::map<MSInductLoop*, int> inductLoopInfoMap;
178 int detEdgeIndex = -1;
179 int detLaneIndex = 0;
182 MSEdge* prevDetEdge =
nullptr;
184 for (
MSLane* lane : lanes) {
185 const std::string customID =
getParameter(lane->getID());
186 if (
noVehicles(lane->getPermissions()) && customID ==
"") {
190 if (laneInductLoopMap.find(lane) != laneInductLoopMap.end()) {
195 if (minDur == std::numeric_limits<SUMOTime>::max() && customID ==
"" && !
myBuildAllDetectors) {
199 double length = lane->getLength();
201 double inductLoopPosition;
203 if (&lane->getEdge() != prevDetEdge) {
206 prevDetEdge = &lane->getEdge();
210 const bool isBikeLane = (lane->getPermissions() & ~SVC_PEDESTRIAN) ==
SVC_BICYCLE;
212 if (customID ==
"") {
214 inductLoopPosition =
MIN2(
219 ilpos = length - inductLoopPosition;
220 MSLane* placementLane = lane;
221 while (ilpos < 0 && placementLane->getIncomingLanes().size() == 1
222 && placementLane->
getIncomingLanes().front().viaLink->getCorrespondingEntryLink()->getTLLogic() ==
nullptr) {
230 const double detLength =
getDouble(
"detector-length:" + lane->getID(), detDefaultLength);
238 if (loop ==
nullptr) {
242 inductLoopPosition = length - ilpos;
246 laneInductLoopMap[lane] = loop;
277 std::map<int, std::set<MSInductLoop*> > linkToLoops;
278 std::set<int> actuatedLinks;
280 std::vector<bool> neverMajor(numLinks,
true);
282 const std::string& state = phase->getState();
283 for (
int i = 0; i < numLinks; i++) {
285 neverMajor[i] =
false;
289 std::vector<bool> oneLane(numLinks,
false);
290 std::vector<bool> turnaround(numLinks,
true);
291 for (
int i = 0; i < numLinks; i++) {
294 int numMotorized = 0;
295 for (
MSLane* l : lane->getEdge().getLanes()) {
296 if ((l->getPermissions() & motorized) != 0) {
300 if (numMotorized == 1) {
306 if (!link->isTurnaround()) {
307 turnaround[i] =
false;
315 std::set<MSInductLoop*> loops;
316 if (phase->isActuated() || multiNextTargets.count(phaseIndex) != 0) {
317 const std::string& state = phase->getState();
319 std::set<int> greenLinks;
321 std::set<int> greenLinksPermissive;
323 std::map<MSInductLoop*, std::set<int> > loopLinks;
325 for (
int i = 0; i < numLinks; i++) {
327 greenLinks.insert(i);
328 if (phase->isActuated()) {
329 actuatedLinks.insert(i);
333 if (link->getLane()->isCrossing()) {
342 if (((neverMajor[i] || turnaround[i])
346 greenLinks.insert(i);
347 if (!turnaround[i]) {
348 if (phase->isActuated()) {
349 actuatedLinks.insert(i);
353 greenLinksPermissive.insert(i);
356#ifdef DEBUG_DETECTORS
358 std::cout <<
" phase=" << phaseIndex <<
" i=" << i <<
" state=" << state[i] <<
" green=" << greenLinks.count(i) <<
" oneLane=" << oneLane[i]
359 <<
" turn=" << turnaround[i] <<
" loopLanes=";
361 if (laneInductLoopMap.count(lane) != 0) {
362 std::cout << lane->getID() <<
" ";
369 if (laneInductLoopMap.count(lane) != 0) {
370 loopLinks[laneInductLoopMap[lane]].insert(i);
374 for (
auto& item : loopLinks) {
379 bool foundUsable =
false;
381 for (
int j : item.second) {
382 if (greenLinks.count(j) == 0 && (info.
jamThreshold <= 0 || greenLinksPermissive.count(j) == 0)) {
384#ifdef DEBUG_DETECTORS
386 std::cout <<
" phase=" << phaseIndex <<
" check1: loopLane=" << loopLane->
getID() <<
" notGreen=" << j <<
" oneLane[j]=" << oneLane[j] <<
"\n";
400 if (link->isTurnaround()) {
403 const MSLane* next = link->getLane();
404 if (laneInductLoopMap.count(next) != 0) {
406 for (
int j : loopLinks[nextLoop]) {
407 if (greenLinks.count(j) == 0) {
409#ifdef DEBUG_DETECTORS
410 if (
DEBUG_COND) std::cout <<
" phase=" << phaseIndex <<
" check2: loopLane=" << loopLane->
getID()
411 <<
" nextLane=" << next->
getID() <<
" nextLink=" << j <<
" nextState=" << state[j] <<
"\n";
421 loops.insert(item.first);
422#ifdef DEBUG_DETECTORS
424 std::cout <<
" phase=" << phaseIndex <<
" usableLoops=" << item.first->getID() <<
" links=" <<
joinToString(item.second,
" ") <<
"\n";
427 for (
int j : item.second) {
428 linkToLoops[j].insert(item.first);
432 if (loops.size() == 0 && phase->isActuated()) {
436#ifdef DEBUG_DETECTORS
438 std::cout <<
" phase=" << phaseIndex <<
" loops=" <<
joinNamedToString(loops,
" ") <<
"\n";
441 std::cout <<
" linkToLoops:\n";
442 for (
auto item : linkToLoops) {
443 std::cout <<
" link=" << item.first <<
" loops=" <<
joinNamedToString(item.second,
" ") <<
"\n";
447 std::vector<InductLoopInfo*> loopInfos;
451 if (loopInfo.loop == loop) {
453 loopInfo.servedPhase[phaseIndex] =
true;
458#ifdef DEBUG_DETECTORS
460 std::cout <<
"final linkToLoops:\n";
461 for (
auto item : linkToLoops) {
462 std::cout <<
" link=" << item.first <<
" loops=" <<
joinNamedToString(item.second,
" ") <<
"\n";
466 std::vector<int> warnLinks;
467 for (
int i : actuatedLinks) {
468 if (linkToLoops[i].size() == 0 &&
myLinks[i].size() > 0
469 && (
myLinks[i].front()->getLaneBefore()->getPermissions() & motorized) != 0) {
471 warnLinks.push_back(i);
475 if (warnLinks.size() > 0) {
483 WRITE_ERRORF(
TL(
"Invalid link '%' given as linkMaxDur parameter for actuated tlLogic '%', program '%."), kv.first.substr(11),
getID(),
getProgramID());
493 WRITE_ERRORF(
TL(
"Invalid link '%' given as linkMinDur parameter for actuated tlLogic '%', program '%."), kv.first.substr(11),
getID(),
getProgramID());
505 haveSwitchingRules =
true;
520 int linkIndex = link->getIndex();
521 const MSJunction* junction = link->getJunction();
522 for (
int i = 0; i < (int)
myLinks.size(); i++) {
529 int foeIndex = foe->getIndex();
530 const MSJunction* junction2 = foe->getJunction();
531 if (junction == junction2) {
534 if (logic->
getFoesFor(linkIndex).test(foeIndex)
535 && (foe->getPermissions() & ~SVC_VULNERABLE) != 0
536 && &foe->getLaneBefore()->getEdge() != &link->getLaneBefore()->getEdge()) {
553 step = step < 0 ?
myStep : step;
562 step = step < 0 ?
myStep : step;
571 step = step < 0 ?
myStep : step;
580 step = step < 0 ?
myStep : step;
591 for (
int i = 0; i < (int)
myPhases.size(); i++) {
593 const std::string errorSuffix =
"' for overriding attribute in phase " +
toString(i) +
" of tlLogic '" +
getID() +
"' in program '" +
getProgramID() +
"'.";
595 const std::string cond =
"minDur:" +
toString(i);
597 throw ProcessError(
"Missing condition '" + cond + errorSuffix);
601 const std::string cond =
"maxDur:" +
toString(i);
603 throw ProcessError(
"Missing condition '" + cond + errorSuffix);
607 const std::string cond =
"earliestEnd:" +
toString(i);
609 throw ProcessError(
"Missing condition '" + cond + errorSuffix);
613 const std::string cond =
"latestEnd:" +
toString(i);
615 throw ProcessError(
"Missing condition '" + cond + errorSuffix);
624 for (
int i = 0; i < (int)
myPhases.size(); i++) {
627 std::vector<int> nextPhases = phase->
nextPhases;
628 if (nextPhases.size() == 0) {
629 nextPhases.push_back((i + 1) % (int)
myPhases.size());
630 }
else if (nextPhases.size() > 1) {
633 for (
int next : nextPhases) {
634 if (next >= 0 && next < (
int)
myPhases.size()) {
651 std::map<int, std::map<int, SUMOTime> > reached;
652 const std::vector<int>& next =
myPhases[step]->nextPhases;
656 for (
int target = 0; target < (int)
myPhases.size(); target++) {
657 int bestNext = next[0];
659 for (
auto item : reached) {
660 auto it = item.second.find(target);
661 if (it != item.second.end()) {
662 SUMOTime transitionTime = it->second;
663 if (transitionTime < bestTime) {
664 bestTime = transitionTime;
665 bestNext = item.first;
670 myTargets[step][bestNext].push_back(target);
679 std::pair<int, SUMOTime> tDur =
getTarget(n);
680 int target = tDur.first;
681 SUMOTime transitionTime = tDur.second + priorTransition;
683 if (target == origStep) {
688 auto it = found.find(target);
689 if (it != found.end()) {
690 if (it->second <= transitionTime) {
700 found[target] = transitionTime;
702 for (
int n2 :
myPhases[target]->nextPhases) {
710 std::set<int> result;
714 for (
int next : p->nextPhases) {
725 SUMOTime result = std::numeric_limits<SUMOTime>::max();
726 for (
int pI = 0; pI < (int)
myPhases.size(); pI++) {
728 const std::string& state = phase->
getState();
729 for (
int i = 0; i < (int)state.size(); i++) {
735 }
else if (multiNextTargets.count(pI) != 0) {
748 for (
int i = 0; i < (int)state.size(); i++) {
751 for (
MSLane* lane : lanes) {
777 loopInfo.loop->setVisible(
false);
785 if (step >= 0 && step !=
myStep) {
790 }
else if (step < 0) {
804 const SUMOTime lastSwitch = t - spentDuration;
831 if (state[i] ==
'G' || state[i] ==
'g') {
836 if (state[i] ==
'r' || state[i] ==
'u') {
846 const int origStep =
myStep;
856#ifdef DEBUG_PHASE_SELECTION
859 <<
" trySwitch dGap=" << (detectionGap == std::numeric_limits<double>::max() ?
"inf" :
toString(detectionGap))
860 <<
" multi=" << multiTarget <<
"\n";
863 if (detectionGap < std::numeric_limits<double>::max() && !multiTarget && !
myTraCISwitch) {
880 if (linkMinDur > 0) {
883 return multiTarget ?
TIME2STEPS(1) : linkMinDur;
892 myPhases[origStep]->myLastEnd = now;
900 if (loopInfo->isJammed()) {
905 loopInfo->lastGreenTime = now;
909#ifdef DEBUG_PHASE_SELECTION
932 if (newDuration % 1000 != 0) {
933 const SUMOTime totalDur = newDuration + actDuration;
934 newDuration = (totalDur / 1000 + 1) * 1000 - actDuration;
946 double result = std::numeric_limits<double>::max();
953 if (loopInfo.lastGreenTime < loopInfo.loop->getLastDetectionTime()) {
956 loopInfo.loop->setSpecialColor(
nullptr);
967#ifdef DEBUG_PHASE_SELECTION
979 if (loopInfo->isJammed()) {
985 if (actualGap < loopInfo->maxGap && !loopInfo->isJammed()) {
986 result =
MIN2(result, actualGap);
998 int result = cands.front();
1006#ifdef DEBUG_PHASE_SELECTION
1009 if (currentPrio > maxPrio) {
1011 maxPrio = currentPrio;
1014 for (
int step : cands) {
1018#ifdef DEBUG_PHASE_SELECTION
1020 std::cout <<
SIMTIME <<
" p=" <<
myStep <<
" step=" << step <<
" target=" << target <<
" loops=" <<
myInductLoopsForPhase[target].size() <<
" prio=" << prio <<
"\n";
1033std::pair<int, SUMOTime>
1036 int origStep = step;
1040 while (!
myPhases[step]->isGreenPhase()) {
1043 if (
myPhases[step]->nextPhases.size() > 0 &&
myPhases[step]->nextPhases.front() >= 0) {
1044 for (
int next :
myPhases[step]->nextPhases) {
1051 step = (step + 1) % (
int)
myPhases.size();
1053 if (step == origStep || seen > (
int)
myPhases.size()) {
1055 return std::make_pair(0, 0);
1058 return std::make_pair(step, dur);
1070#ifdef DEBUG_PHASE_SELECTION
1082#ifdef DEBUG_PHASE_SELECTION
1084 std::cout <<
" loop=" << loop->
getID()
1085 <<
" actDuration=" <<
STEPS2TIME(actDuration)
1088 <<
" canExtend=" << canExtend
1112 auto* aPersons = crossingEntry->getApproachingPersons();
1113 if (aPersons !=
nullptr && aPersons->size() > 0) {
1150 const std::string& targetState =
myPhases[target]->getState();
1153 targetState[i] ==
'G' || targetState[i] ==
'g')) {
1166 const std::string& targetState =
myPhases[target]->getState();
1169 && (state[i] ==
'G' || state[i] ==
'g')
1170 && !(targetState[i] ==
'G' || targetState[i] ==
'g')) {
1185#ifdef DEBUG_PHASE_SELECTION_CUSTOM
1187 std::cout <<
SIMTIME <<
" mustSwitch=" << mustSwitch <<
" cur=" <<
myStep <<
" next=" << next <<
" condition=" << condition
1188 <<
" eval=" << (condition ==
"" ? NAN :
evalExpression(condition)) <<
"\n";
1191 if (condition !=
"") {
1194 if (
gapControl() == std::numeric_limits<double>::max()) {
1208 const size_t bracketOpen = condition.find(
'(');
1209 if (bracketOpen != std::string::npos) {
1211 size_t bracketClose = std::string::npos;
1213 for (
size_t i = bracketOpen + 1; i < condition.size(); i++) {
1214 if (condition[i] ==
'(') {
1216 }
else if (condition[i] ==
')') {
1224 if (bracketClose == std::string::npos) {
1225 throw ProcessError(
TLF(
"Unmatched parentheses in condition %'", condition));
1227 std::string cond2 = condition;
1228 const std::string inBracket = condition.substr(bracketOpen + 1, bracketClose - bracketOpen - 1);
1230 cond2.replace(bracketOpen, bracketClose - bracketOpen + 1,
toString(bracketVal));
1234 throw ProcessError(
TLF(
"Error when evaluating expression '%':\n %", condition, e.what()));
1239 if (tokens.size() == 0) {
1241 }
else if (tokens.size() == 1) {
1245 throw ProcessError(
TLF(
"Error when evaluating expression '%':\n %", condition, e.what()));
1247 }
else if (tokens.size() == 2) {
1248 if (tokens[0] ==
"not") {
1252 throw ProcessError(
TLF(
"Error when evaluating expression '%':\n %", condition, e.what()));
1257 }
else if (tokens.size() == 3) {
1261 const std::string& o = tokens[1];
1266 throw ProcessError(
TLF(
"Error when evaluating expression '%':\n %", condition, e.what()));
1269 const int iEnd = (int)tokens.size() - 1;
1271 for (
int i = 1; i < iEnd; i++) {
1272 if (tokens[i] == o) {
1277 std::vector<std::string> newTokens(tokens.begin(), tokens.begin() + (i - 1));
1278 newTokens.push_back(
toString(val));
1279 newTokens.insert(newTokens.end(), tokens.begin() + (i + 2), tokens.end());
1282 throw ProcessError(
TLF(
"Error when evaluating expression '%':\n %", condition, e.what()));
1287 throw ProcessError(
TLF(
"Parsing expressions with % elements ('%') is not supported",
toString(tokens.size()), condition));
1294 if (o ==
"=" || o ==
"==") {
1295 return (
double)(a == b);
1296 }
else if (o ==
"<") {
1297 return (
double)(a < b);
1298 }
else if (o ==
">") {
1299 return (
double)(a > b);
1300 }
else if (o ==
"<=") {
1301 return (
double)(a <= b);
1302 }
else if (o ==
">=") {
1303 return (
double)(a >= b);
1304 }
else if (o ==
"!=") {
1305 return (
double)(a != b);
1306 }
else if (o ==
"or" || o ==
"||") {
1307 return (
double)(a || b);
1308 }
else if (o ==
"and" || o ==
"&&") {
1309 return (
double)(a && b);
1310 }
else if (o ==
"+") {
1312 }
else if (o ==
"-") {
1314 }
else if (o ==
"*") {
1316 }
else if (o ==
"/") {
1322 }
else if (o ==
"%") {
1324 }
else if (o ==
"**" || o ==
"^") {
1327 throw ProcessError(
TLF(
"Unsupported operator '%' in condition '%'", o, condition));
1335 if ((
int)args.size() != f.
nArgs) {
1338 std::vector<double> args2;
1339 for (
auto a : args) {
1344 for (
int i = 0; i < (int)args2.size(); i++) {
1353 double result =
myStack.back()[
"$0"];
1361 for (
const auto& assignment : assignments) {
1363 const std::string&
id = std::get<0>(assignment);
1365 ConditionMap::iterator it = conditions.find(
id);
1366 if (it != conditions.end()) {
1368 }
else if (forbidden.find(
id) != forbidden.end()) {
1369 throw ProcessError(
TLF(
"Modifying global condition '%' is forbidden",
id));
1380 if (expr.size() == 0) {
1382 }
else if (expr[0] ==
'!') {
1384 }
else if (expr[0] ==
'-') {
1388 const size_t pos = expr.find(
':');
1389 if (pos == std::string::npos) {
1396 auto it2 =
myStack.back().find(expr);
1397 if (it2 !=
myStack.back().end()) {
1404 const std::string fun = expr.substr(0, pos);
1405 const std::string arg = expr.substr(pos + 1);
1407 return retrieveDetExpression<MSInductLoop, SUMO_TAG_INDUCTION_LOOP>(arg, expr,
true)->getTimeSinceLastDetection();
1408 }
else if (fun ==
"a") {
1410 return retrieveDetExpression<MSInductLoop, SUMO_TAG_INDUCTION_LOOP>(arg, expr,
true)->getTimeSinceLastDetection() == 0;
1412 return retrieveDetExpression<MSE2Collector, SUMO_TAG_LANE_AREA_DETECTOR>(arg, expr,
true)->getCurrentVehicleNumber();
1414 }
else if (fun ==
"w") {
1416 return retrieveDetExpression<MSInductLoop, SUMO_TAG_INDUCTION_LOOP>(arg, expr,
true)->getOccupancyTime();
1418 return retrieveDetExpression<MSE2Collector, SUMO_TAG_LANE_AREA_DETECTOR>(arg, expr,
true)->getCurrentJamDuration();
1420 }
else if (fun ==
"g" || fun ==
"r") {
1423 if (linkIndex >= 0 && linkIndex <
myNumLinks) {
1425 if (times.empty()) {
1437 return STEPS2TIME(times[linkIndex] + currentGreen);
1446 throw ProcessError(
TLF(
"Invalid link index '%' in expression '%'", arg, expr));
1447 }
else if (fun ==
"p") {
1450 if (linkIndex >= 0 && linkIndex <
myNumLinks) {
1451 double approachingPersons = 0;
1453 auto* aPersons = link->getApproachingPersons();
1454 if (aPersons !=
nullptr) {
1455 approachingPersons += (double)aPersons->size();
1458 return approachingPersons;
1461 throw ProcessError(
TLF(
"Invalid link index '%' in expression '%'", arg, expr));
1462 }
else if (fun ==
"c") {
1466 throw ProcessError(
TLF(
"Unsupported function '%' in expression '%'", fun, expr));
1475std::map<std::string, double>
1477 std::map<std::string, double> result;
1479 result[li.loop->getID()] = li.loop->getOccupancy() > 0 ? 1 : 0;
1482 result[loop->getID()] = loop->getOccupancy() > 0 ? 1 : 0;
1485 result[loop->getID()] = loop->getCurrentVehicleNumber();
1492 double result = 0.0;
1494 if (li.lane->getID() == laneID) {
1495 result = li.loop->getOccupancy() > 0 ? 1 : 0;
1502std::map<std::string, double>
1504 std::map<std::string, double> result;
1510 WRITE_ERRORF(
TL(
"Error when retrieving conditions '%' for tlLogic '%' (%)"), item.first,
getID(), e.what());
1520 const std::string cond = key.substr(10);
1535 if (key ==
"detector-gap" || key ==
"passing-time" || key ==
"file" || key ==
"freq" || key ==
"vTypes"
1536 || key ==
"build-all-detectors"
1539 throw InvalidArgument(key +
" cannot be changed dynamically for actuated traffic light '" +
getID() +
"'");
1540 }
else if (key ==
"max-gap") {
1548 const std::string laneID = key.substr(8);
1550 if (loopInfo.lane->getID() == laneID) {
1556 throw InvalidArgument(
TLF(
"Invalid lane '%' in key '%' for actuated traffic light '%'", laneID, key,
getID()));
1557 }
else if (key ==
"jam-threshold") {
1565 const std::string laneID = key.substr(14);
1567 if (loopInfo.lane->getID() == laneID) {
1573 throw InvalidArgument(
TLF(
"Invalid lane '%' in key '%' for actuated traffic light '%'", laneID, key,
getID()));
1574 }
else if (key ==
"show-detectors") {
1580 }
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 accessible 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.
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.
void loadState(MSTLLogicControl &tlcontrol, SUMOTime t, int step, SUMOTime spentDuration, bool active) override
restores the tls state
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 myAmActive
whether the current program is active
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