54 const std::vector<NBNode*>& junctions,
const std::string& programID,
57 myControlledNodes(junctions),
58 mySubID(programID), myOffset(offset),
60 myNeedsContRelationReady(false),
61 myRightOnRedConflictsReady(false) {
74 for (
NBNode*
const node : junctions) {
75 node->addTrafficLight(
this);
86 myNeedsContRelationReady(false),
87 myRightOnRedConflictsReady(false) {
98 myNeedsContRelationReady(false),
99 myRightOnRedConflictsReady(false) {
112 for (
auto it : nodes) {
113 it->removeTrafficLight(
this);
115 WRITE_WARNINGF(
TL(
"The traffic light '%' does not control any links; it will not be build."),
getID());
123 brakingTime = oc.
getInt(
"tls.yellow.time");
144 if (vmax < 71 / 3.6) {
152 return (
int)(1.8 + vmax / 2 / minDecel);
166 std::set<NBEdge*> reachable;
167 while (outer.size() > 0) {
168 NBEdge* from = outer.back();
171 for (std::vector<NBEdge::Connection>::iterator k = cons.begin(); k != cons.end(); k++) {
173 if (reachable.count(to) == 0 &&
174 (find(within.begin(), within.end(), to) != within.end()) &&
176 reachable.insert(to);
192 const EdgeVector& incoming = (*i)->getIncomingEdges();
193 copy(incoming.begin(), incoming.end(), back_inserter(
myIncomingEdges));
194 const EdgeVector& outgoing = (*i)->getOutgoingEdges();
195 copy(outgoing.begin(), outgoing.end(), back_inserter(myOutgoing));
201 edge->setInsideTLS(
false);
203 EdgeVector::iterator k = std::find(myOutgoing.begin(), myOutgoing.end(), edge);
204 if (k != myOutgoing.end()) {
207 outer.push_back(edge);
220 if (reachable.count(edge) == 1) {
237 std::vector<NBNode*>::const_iterator i =
246 return node->
mustBrake(from, to, -1, -1,
true);
252 const NBEdge*
const possProhibitedTo,
253 const NBEdge*
const possProhibitorFrom,
254 const NBEdge*
const possProhibitorTo,
255 bool regardNonSignalisedLowerPriority)
const {
256 return forbids(possProhibitorFrom, possProhibitorTo,
257 possProhibitedFrom, possProhibitedTo,
258 regardNonSignalisedLowerPriority);
265 bool regardNonSignalisedLowerPriority)
const {
268 regardNonSignalisedLowerPriority);
274 const NBEdge*
const possProhibitorTo,
275 const NBEdge*
const possProhibitedFrom,
276 const NBEdge*
const possProhibitedTo,
277 bool regardNonSignalisedLowerPriority,
278 bool sameNodeOnly)
const {
279 if (possProhibitorFrom ==
nullptr || possProhibitorTo ==
nullptr || possProhibitedFrom ==
nullptr || possProhibitedTo ==
nullptr) {
283 std::vector<NBNode*>::const_iterator incoming =
285 std::vector<NBNode*>::const_iterator outgoing =
288 NBNode* incnode = *incoming;
289 NBNode* outnode = *outgoing;
290 EdgeVector::const_iterator i;
292#ifdef DEBUG_RIGHT_OF_WAY
294 std::cout <<
"foribds tls=" <<
getID() <<
" from=" << possProhibitedFrom->
getID() <<
" to=" << possProhibitedTo->
getID() <<
" foeFrom=" << possProhibitorFrom->
getID() <<
" foeTo=" << possProhibitorTo->
getID() <<
" rnslp=" << regardNonSignalisedLowerPriority <<
" sameNodeOnly=" << sameNodeOnly;
297 if (incnode != outnode) {
299#ifdef DEBUG_RIGHT_OF_WAY
301 std::cout <<
" differentNodes: allows (no check)\n";
310 for (i = ev1.begin(); i != ev1.end(); ++i) {
311 std::vector<NBNode*>::const_iterator outgoing2 =
316 NBNode* outnode2 = *outgoing2;
317 if (incnode != outnode2) {
323 bool ret1 = incnode->
foes(possProhibitorFrom, possProhibitorTo,
324 possProhibitedTo, *i);
325 bool ret2 = incnode->
forbids(possProhibitorFrom, possProhibitorTo,
326 possProhibitedTo, *i,
327 regardNonSignalisedLowerPriority);
328 bool ret = ret1 || ret2;
330#ifdef DEBUG_RIGHT_OF_WAY
332 std::cout <<
" differentNodes: forbids\n";
342 for (i = ev2.begin(); i != ev2.end(); ++i) {
343 std::vector<NBNode*>::const_iterator incoming2 =
348 NBNode* incnode2 = *incoming2;
349 if (incnode2 != outnode) {
355 bool ret1 = incnode2->
foes(possProhibitorTo, *i,
356 possProhibitedFrom, possProhibitedTo);
357 bool ret2 = incnode2->
forbids(possProhibitorTo, *i,
358 possProhibitedFrom, possProhibitedTo,
359 regardNonSignalisedLowerPriority);
360 bool ret = ret1 || ret2;
362#ifdef DEBUG_RIGHT_OF_WAY
364 std::cout <<
" differentNodes: forbids (2)\n";
370#ifdef DEBUG_RIGHT_OF_WAY
372 std::cout <<
" differentNodes: allows\n";
379 const bool result = incnode->
forbids(possProhibitorFrom, possProhibitorTo,
380 possProhibitedFrom, possProhibitedTo,
381 regardNonSignalisedLowerPriority);
382#ifdef DEBUG_RIGHT_OF_WAY
384 std::cout <<
" sameNodes: " << (result ?
"forbids" :
"allows") <<
"\n";
393 const NBEdge*
const from2,
const NBEdge*
const to2)
const {
394 if (to1 ==
nullptr || to2 ==
nullptr) {
398 std::vector<NBNode*>::const_iterator incoming =
401 std::vector<NBNode*>::const_iterator outgoing =
405 NBNode* incnode = *incoming;
406 NBNode* outnode = *outgoing;
407 if (incnode != outnode) {
410 return incnode->
foes(from1, to1, from2, to2);
440std::vector<std::string>
456 std::vector<int> indirectLeft;
460 for (
int j = 0; j < noLanes; j++) {
462 for (std::vector<NBEdge::Connection>::iterator k = connected.begin(); k != connected.end(); k++) {
484 indirectLeft.push_back((
int)into.size() - 1);
491 if (indirectLeft.size() > 0) {
493 for (
int i : indirectLeft) {
497 if (c2.getTo() == c.
getTo() && c2.getFrom() != c.
getFrom()) {
508 if (into.size() > 0 && tlIndex == 0) {
532 (*i)->removeTrafficLight(&dummy);
548 (*i)->removeTrafficLight(&dummy);
#define WRITE_WARNINGF(...)
std::vector< NBConnection > NBConnectionVector
Definition of a connection vector.
std::vector< NBEdge * > EdgeVector
container for (sorted) edges
bool isRailway(SVCPermissions permissions)
Returns whether an edge with the given permission is a railway edge.
LinkDirection
The different directions a link between two lanes may take (or a stream between two edges)....
@ TURN
The link is a 180 degree turn.
@ STRAIGHT
The link is a straight direction.
std::string toString(const T &t, std::streamsize accuracy=gPrecision)
NBEdge * getFrom() const
returns the from-edge (start of the connection)
void setTLIndex2(int tlIndex)
NBEdge * getTo() const
returns the to-edge (end of the connection)
static double maxSpeed(const EdgeVector &ev)
The representation of a single edge during network building.
SVCPermissions getPermissions(int lane=-1) const
get the union of allowed classes over all lanes or for a specific lane
const std::vector< Connection > & getConnections() const
Returns the connections.
NBNode * getToNode() const
Returns the destination node of the edge.
void setInsideTLS(bool inside)
Marks this edge being within an intersection.
int getFirstNonPedestrianLaneIndex(int direction, bool exclusive=false) const
return the first lane with permissions other than SVC_PEDESTRIAN and 0
const std::string & getID() const
int getNumLanes() const
Returns the number of lanes.
std::vector< Connection > getConnectionsFromLane(int lane, const NBEdge *to=nullptr, int toLane=-1) const
Returns connections from a given lane.
bool mayBeTLSControlled(int fromLane, NBEdge *toEdge, int toLane) const
return true if certain connection must be controlled by TLS
EdgeVector getConnectedEdges() const
Returns the list of outgoing edges unsorted.
const NBEdge * getBidiEdge() const
Used for sorting the cells by the begin time they describe.
Represents a single node (junction) during network building.
LinkDirection getDirection(const NBEdge *const incoming, const NBEdge *const outgoing, bool leftHand=false) const
Returns the representation of the described stream's direction.
bool mustBrake(const NBEdge *const from, const NBEdge *const to, int fromLane, int toLane, bool includePedCrossings) const
Returns the information whether the described flow must let any other flow pass.
SumoXMLNodeType getType() const
Returns the type of this node.
bool forbids(const NBEdge *const possProhibitorFrom, const NBEdge *const possProhibitorTo, const NBEdge *const possProhibitedFrom, const NBEdge *const possProhibitedTo, bool regardNonSignalisedLowerPriority) const
Returns the information whether "prohibited" flow must let "prohibitor" flow pass.
bool hasOutgoing(const NBEdge *const e) const
Returns whether the given edge starts at this node.
static const int FORWARD
edge directions (for pedestrian related stuff)
bool foes(const NBEdge *const from1, const NBEdge *const to1, const NBEdge *const from2, const NBEdge *const to2) const
Returns the information whether the given flows cross.
void addTrafficLight(NBTrafficLightDefinition *tlDef)
Adds a traffic light to the list of traffic lights that control this node.
A traffic light logics which must be computed (only nodes/edges are given)
NBTrafficLightLogic * computeLogicAndConts(int brakingTimeSeconds, bool onlyConts=false)
helper function for myCompute
void initNeedsContRelation() const
virtual bool rightOnRedConflict(int index, int foeIndex) const
whether the given index must yield to the foeIndex while turning right on a red light
virtual ~NBTrafficLightDefinition()
Destructor.
const std::string & getProgramID() const
Returns the ProgramID.
void addControlledInnerEdges(const std::vector< std::string > &edges)
Adds the given ids into the list of inner edges controlled by the tls.
const EdgeVector & getIncomingEdges() const
Returns the list of incoming edges (must be build first)
bool needsCont(const NBEdge *fromE, const NBEdge *toE, const NBEdge *otherFromE, const NBEdge *otherToE) const
std::vector< NBNode * > myControlledNodes
The container with participating nodes.
virtual void removeNode(NBNode *node)
Removes the given node from the list of controlled nodes.
EdgeVector myIncomingEdges
The list of incoming edges.
virtual void addNode(NBNode *node)
Adds a node to the traffic light logic.
NBTrafficLightLogic * compute(const OptionsCont &oc)
Computes the traffic light logic.
std::vector< std::string > getControlledInnerEdges() const
Retrieve the ids of edges explicitly controlled by the tls.
virtual NBTrafficLightLogic * myCompute(int brakingTime)=0
Computes the traffic light logic finally in dependence to the type.
static std::set< NBEdge * > collectReachable(EdgeVector outer, const EdgeVector &within, bool checkControlled)
RightOnRedConflicts myRightOnRedConflicts
static const int MIN_YELLOW_SECONDS
EdgeVector myEdgesWithin
The list of edges within the area controlled by the tls.
static const std::string DummyID
id for temporary definitions
virtual void collectLinks()=0
Collects the links participating in this traffic light.
int computeBrakingTime(double minDecel) const
Computes the time vehicles may need to brake.
bool forbids(const NBEdge *const possProhibitorFrom, const NBEdge *const possProhibitorTo, const NBEdge *const possProhibitedFrom, const NBEdge *const possProhibitedTo, bool regardNonSignalisedLowerPriority, bool sameNodeOnly=false) const
Returns the information whether "prohibited" flow must let "prohibitor" flow pass.
virtual bool amInvalid() const
NBConnectionVector myControlledLinks
The list of controlled links.
static const std::string DefaultProgramID
bool mustBrake(const NBEdge *const from, const NBEdge *const to) const
Returns the information whether the described flow must let any other flow pass.
bool myNeedsContRelationReady
virtual void initNeedsContRelation() const
virtual void setParticipantsInformation()
Builds the list of participating nodes/edges/links.
void collectAllLinks(NBConnectionVector &into)
helper method for use in NBOwnTLDef and NBLoadedSUMOTLDef
NBTrafficLightDefinition(const std::string &id, const std::vector< NBNode * > &junctions, const std::string &programID, SUMOTime offset, TrafficLightType type)
Constructor.
static const SUMOTime UNSPECIFIED_DURATION
bool foes(const NBEdge *const from1, const NBEdge *const to1, const NBEdge *const from2, const NBEdge *const to2) const
Returns the information whether the given flows cross.
std::string getDescription() const
get ID and programID together (for convenient debugging)
bool myRightOnRedConflictsReady
NeedsContRelation myNeedsContRelation
virtual void collectEdges()
Build the list of participating edges.
std::set< std::string > myControlledInnerEdges
Set of inner edges that shall be controlled, though.
A SUMO-compliant built logic for a traffic light.
Base class for objects which have an id.
const std::string & getID() const
Returns the id.
A storage for options typed value containers)
double getFloat(const std::string &name) const
Returns the double-value of the named option (only for Option_Float)
int getInt(const std::string &name) const
Returns the int-value of the named option (only for Option_Integer)
bool isDefault(const std::string &name) const
Returns the information whether the named option has still the default value.
bool getBool(const std::string &name) const
Returns the boolean-value of the named option (only for Option_Bool)
static OptionsCont & getOptions()
Retrieves the options.
const Parameterised::Map & getParametersMap() const
Returns the inner key/value map.
void updateParameters(const Parameterised::Map &mapArg)
Adds or updates all given parameters from the map.
A structure which describes a connection between edges or lanes.
bool indirectLeft
Whether this connection is an indirect left turn.
int fromLane
The lane the connections starts at.
int toLane
The lane the connections yields in.
NBEdge * toEdge
The edge the connections yields in.
data structure for caching needsCont information