Eclipse SUMO - Simulation of Urban MObility
Loading...
Searching...
No Matches
MSTriggeredRerouter.cpp
Go to the documentation of this file.
1/****************************************************************************/
2// Eclipse SUMO, Simulation of Urban MObility; see https://eclipse.dev/sumo
3// Copyright (C) 2001-2025 German Aerospace Center (DLR) and others.
4// This program and the accompanying materials are made available under the
5// terms of the Eclipse Public License 2.0 which is available at
6// https://www.eclipse.org/legal/epl-2.0/
7// This Source Code may also be made available under the following Secondary
8// Licenses when the conditions for such availability set forth in the Eclipse
9// Public License 2.0 are satisfied: GNU General Public License, version 2
10// or later which is available at
11// https://www.gnu.org/licenses/old-licenses/gpl-2.0-standalone.html
12// SPDX-License-Identifier: EPL-2.0 OR GPL-2.0-or-later
13/****************************************************************************/
22// Reroutes vehicles passing an edge
23/****************************************************************************/
24#include <config.h>
25
26#include <string>
27#include <algorithm>
28#ifdef HAVE_FOX
30#endif
43#include <microsim/MSLane.h>
44#include <microsim/MSLink.h>
45#include <microsim/MSVehicle.h>
47#include <microsim/MSRoute.h>
48#include <microsim/MSEdge.h>
50#include <microsim/MSNet.h>
52#include <microsim/MSGlobals.h>
54#include <microsim/MSStop.h>
60#include "MSTriggeredRerouter.h"
61
62#include <mesosim/MELoop.h>
63#include <mesosim/MESegment.h>
64
65//#define DEBUG_REROUTER
66//#define DEBUG_OVERTAKING
67#define DEBUGCOND(veh) (veh.isSelected())
68//#define DEBUGCOND(veh) (true)
69//#define DEBUGCOND(veh) (veh.getID() == "")
70
72#define DEFAULT_PRIO_OVERTAKER 1
73#define DEFAULT_PRIO_OVERTAKEN 0.001
74
75// ===========================================================================
76// static member definition
77// ===========================================================================
78MSEdge MSTriggeredRerouter::mySpecialDest_keepDestination("MSTriggeredRerouter_keepDestination", -1, SumoXMLEdgeFunc::UNKNOWN, "", "", "", -1, 0);
79MSEdge MSTriggeredRerouter::mySpecialDest_terminateRoute("MSTriggeredRerouter_terminateRoute", -1, SumoXMLEdgeFunc::UNKNOWN, "", "", "", -1, 0);
81std::map<std::string, MSTriggeredRerouter*> MSTriggeredRerouter::myInstances;
82
83
84// ===========================================================================
85// method definitions
86// ===========================================================================
88 const MSEdgeVector& edges, double prob, bool off, bool optional,
89 SUMOTime timeThreshold, const std::string& vTypes, const Position& pos, const double radius) :
90 Named(id),
92 MSStoppingPlaceRerouter("parking"),
93 myEdges(edges),
94 myProbability(prob),
95 myUserProbability(prob),
96 myAmInUserMode(false),
97 myAmOptional(optional),
98 myPosition(pos),
99 myRadius(radius),
100 myTimeThreshold(timeThreshold),
101 myHaveParkProbs(false) {
102 myInstances[id] = this;
103 // build actors
104 for (const MSEdge* const e : edges) {
107 }
108 for (MSLane* const lane : e->getLanes()) {
109 lane->addMoveReminder(this);
110 }
111 }
112 if (off) {
113 setUserMode(true);
115 }
116 const std::vector<std::string> vt = StringTokenizer(vTypes).getVector();
117 myVehicleTypes.insert(vt.begin(), vt.end());
119 myPosition = edges.front()->getLanes()[0]->getShape()[0];
120 }
121}
122
123
127
128
129// ------------ loading begin
130void
132 const SUMOSAXAttributes& attrs) {
133 if (element == SUMO_TAG_INTERVAL) {
134 bool ok = true;
139 throw ProcessError(TLF("rerouter '%': interval end % is not after begin %.", getID(),
142 }
143 }
144 if (element == SUMO_TAG_DEST_PROB_REROUTE) {
145 // by giving probabilities of new destinations
146 // get the destination edge
147 std::string dest = attrs.getStringSecure(SUMO_ATTR_ID, "");
148 if (dest == "") {
149 throw ProcessError(TLF("rerouter '%': destProbReroute has no destination edge id.", getID()));
150 }
151 MSEdge* to = MSEdge::dictionary(dest);
152 if (to == nullptr) {
153 if (dest == "keepDestination") {
155 } else if (dest == "terminateRoute") {
157 } else {
158 throw ProcessError(TLF("rerouter '%': Destination edge '%' is not known.", getID(), dest));
159 }
160 }
161 // get the probability to reroute
162 bool ok = true;
163 double prob = attrs.getOpt<double>(SUMO_ATTR_PROB, getID().c_str(), ok, 1.);
164 if (!ok) {
165 throw ProcessError();
166 }
167 if (prob < 0) {
168 throw ProcessError(TLF("rerouter '%': Attribute 'probability' for destination '%' is negative (must not).", getID(), dest));
169 }
170 // add
172 }
173
174 if (element == SUMO_TAG_CLOSING_REROUTE) {
175 // by closing edge
176 const std::string& closed_id = attrs.getStringSecure(SUMO_ATTR_ID, "");
177 MSEdge* const closedEdge = MSEdge::dictionary(closed_id);
178 if (closedEdge == nullptr) {
179 throw ProcessError(TLF("rerouter '%': Edge '%' to close is not known.", getID(), closed_id));
180 }
181 bool ok;
182 const std::string allow = attrs.getOpt<std::string>(SUMO_ATTR_ALLOW, getID().c_str(), ok, "", false);
183 const std::string disallow = attrs.getOpt<std::string>(SUMO_ATTR_DISALLOW, getID().c_str(), ok, "");
184 const SUMOTime until = attrs.getOptSUMOTimeReporting(SUMO_ATTR_UNTIL, nullptr, ok, -1);
185 SVCPermissions permissions = parseVehicleClasses(allow, disallow);
186 myParsedRerouteInterval.closed[closedEdge] = std::make_pair(permissions, STEPS2TIME(until));
187 }
188
189 if (element == SUMO_TAG_CLOSING_LANE_REROUTE) {
190 // by closing lane
191 std::string closed_id = attrs.getStringSecure(SUMO_ATTR_ID, "");
192 MSLane* closedLane = MSLane::dictionary(closed_id);
193 if (closedLane == nullptr) {
194 throw ProcessError(TLF("rerouter '%': Lane '%' to close is not known.", getID(), closed_id));
195 }
196 bool ok;
197 SVCPermissions permissions = SVC_AUTHORITY;
199 const std::string allow = attrs.getOpt<std::string>(SUMO_ATTR_ALLOW, getID().c_str(), ok, "", false);
200 const std::string disallow = attrs.getOpt<std::string>(SUMO_ATTR_DISALLOW, getID().c_str(), ok, "");
201 permissions = parseVehicleClasses(allow, disallow);
202 }
203 myParsedRerouteInterval.closedLanes[closedLane] = permissions;
204 }
205
206 if (element == SUMO_TAG_ROUTE_PROB_REROUTE) {
207 // by explicit rerouting using routes
208 // check if route exists
209 std::string routeStr = attrs.getStringSecure(SUMO_ATTR_ID, "");
210 if (routeStr == "") {
211 throw ProcessError(TLF("rerouter '%': routeProbReroute has no alternative route id.", getID()));
212 }
213 ConstMSRoutePtr route = MSRoute::dictionary(routeStr);
214 if (route == nullptr) {
215 throw ProcessError(TLF("rerouter '%': Alternative route '%' does not exist.", getID(), routeStr));
216 }
217
218 // get the probability to reroute
219 bool ok = true;
220 double prob = attrs.getOpt<double>(SUMO_ATTR_PROB, getID().c_str(), ok, 1.);
221 if (!ok) {
222 throw ProcessError();
223 }
224 if (prob < 0) {
225 throw ProcessError(TLF("rerouter '%': Attribute 'probability' for alternative route '%' is negative (must not).", getID(), routeStr));
226 }
227 // add
229 }
230
231 if (element == SUMO_TAG_PARKING_AREA_REROUTE) {
232 std::string parkingarea = attrs.getStringSecure(SUMO_ATTR_ID, "");
233 if (parkingarea == "") {
234 throw ProcessError(TLF("rerouter '%': parkingAreaReroute requires a parkingArea id.", getID()));
235 }
237 if (pa == nullptr) {
238 throw ProcessError(TLF("rerouter '%': parkingArea '%' is not known.", getID(), parkingarea));
239 }
240 // get the probability to reroute
241 bool ok = true;
242 const double prob = attrs.getOpt<double>(SUMO_ATTR_PROB, getID().c_str(), ok, 1.);
243 if (!ok) {
244 throw ProcessError();
245 }
246 if (prob < 0) {
247 throw ProcessError(TLF("rerouter '%': Attribute 'probability' for parkingArea '%' is negative (must not).", getID(), parkingarea));
248 }
249 const bool visible = attrs.getOpt<bool>(SUMO_ATTR_VISIBLE, getID().c_str(), ok, false);
250 // add
251 myParsedRerouteInterval.parkProbs.add(std::make_pair(pa, visible), prob);
252 myHaveParkProbs = true;
253 }
254
255 if (element == SUMO_TAG_VIA_PROB_REROUTE) {
256 // by giving probabilities of vias
257 std::string viaID = attrs.getStringSecure(SUMO_ATTR_ID, "");
258 if (viaID == "") {
259 throw ProcessError(TLF("rerouter '%': No via edge id given.", getID()));
260 }
261 MSEdge* const via = MSEdge::dictionary(viaID);
262 if (via == nullptr) {
263 throw ProcessError(TLF("rerouter '%': Via Edge '%' is not known.", getID(), viaID));
264 }
265 // get the probability to reroute
266 bool ok = true;
267 double prob = attrs.getOpt<double>(SUMO_ATTR_PROB, getID().c_str(), ok, 1.);
268 if (!ok) {
269 throw ProcessError();
270 }
271 if (prob < 0) {
272 throw ProcessError(TLF("rerouter '%': Attribute 'probability' for via '%' is negative (must not).", getID(), viaID));
273 }
274 // add
277 }
278 if (element == SUMO_TAG_OVERTAKING_REROUTE) {
279 // for letting a slow train use a siding to be overtaken by a fast train
280 OvertakeLocation oloc;
281 bool ok = true;
282 for (const std::string& edgeID : attrs.get<std::vector<std::string> >(SUMO_ATTR_MAIN, getID().c_str(), ok)) {
283 MSEdge* edge = MSEdge::dictionary(edgeID);
284 if (edge == nullptr) {
285 throw InvalidArgument(TLF("The main edge '%' to use within rerouter '%' is not known.", edgeID, getID()));
286 }
287 oloc.main.push_back(edge);
288 oloc.cMain.push_back(edge);
289 }
290 for (const std::string& edgeID : attrs.get<std::vector<std::string> >(SUMO_ATTR_SIDING, getID().c_str(), ok)) {
291 MSEdge* edge = MSEdge::dictionary(edgeID);
292 if (edge == nullptr) {
293 throw InvalidArgument(TLF("The siding edge '%' to use within rerouter '%' is not known.", edgeID, getID()));
294 }
295 oloc.siding.push_back(edge);
296 oloc.cSiding.push_back(edge);
297 }
298 oloc.sidingExit = findSignal(oloc.cSiding.begin(), oloc.cSiding.end());
299 if (oloc.sidingExit == nullptr) {
300 throw InvalidArgument(TLF("The siding within rerouter '%' does not have a rail signal.", getID()));
301 }
302 for (auto it = oloc.cSiding.begin(); it != oloc.cSiding.end(); it++) {
303 oloc.sidingLength += (*it)->getLength();
304 if ((*it)->getToJunction()->getID() == oloc.sidingExit->getID()) {
305 break;
306 }
307 }
308 oloc.minSaving = attrs.getOpt<double>(SUMO_ATTR_MINSAVING, getID().c_str(), ok, 300);
310 }
311 if (element == SUMO_TAG_STATION_REROUTE) {
312 // for letting a train switch it's stopping place in case of conflict
313 const std::string stopID = attrs.getStringSecure(SUMO_ATTR_ID, "");
314 if (stopID == "") {
315 throw ProcessError(TLF("rerouter '%': stationReroute requires a stopping place id.", getID()));
316 }
318 if (stop == nullptr) {
319 throw ProcessError(TLF("rerouter '%': stopping place '%' is not known.", getID(), stopID));
320 }
321 myParsedRerouteInterval.stopAlternatives.push_back(std::make_pair(stop, true));
322 }
323}
324
325
326void
328 if (element == SUMO_TAG_INTERVAL) {
329 // precompute permissionsAllowAll
330 bool allowAll = true;
331 for (const auto& entry : myParsedRerouteInterval.closed) {
332 allowAll = allowAll && entry.second.first == SVCAll;
333 if (!allowAll) {
334 break;
335 }
336 }
338
339 for (auto paVi : myParsedRerouteInterval.parkProbs.getVals()) {
340 dynamic_cast<MSParkingArea*>(paVi.first)->setNumAlternatives((int)myParsedRerouteInterval.parkProbs.getVals().size() - 1);
341 }
342 if (myParsedRerouteInterval.closedLanes.size() > 0) {
343 // collect edges that are affect by a closed lane
344 std::set<MSEdge*> affected;
345 for (std::pair<MSLane*, SVCPermissions> settings : myParsedRerouteInterval.closedLanes) {
346 affected.insert(&settings.first->getEdge());
347 }
349 }
350 const SUMOTime closingBegin = myParsedRerouteInterval.begin;
351 const SUMOTime simBegin = string2time(OptionsCont::getOptions().getString("begin"));
352 if (closingBegin < simBegin && myParsedRerouteInterval.end > simBegin) {
353 // interval started before simulation begin but is still active at
354 // the start of the simulation
356 }
358 myIntervals.back().id = (long long int)&myIntervals.back();
362 }
363 }
364}
365
366
367// ------------ loading end
368
369
372 bool updateVehicles = false;
373 for (const RerouteInterval& i : myIntervals) {
374 if (i.begin == currentTime && !(i.closed.empty() && i.closedLanes.empty()) /*&& i.permissions != SVCAll*/) {
375 for (const auto& settings : i.closed) {
376 for (MSLane* lane : settings.first->getLanes()) {
377 //std::cout << SIMTIME << " closing: intervalID=" << i.id << " lane=" << lane->getID() << " prevPerm=" << getVehicleClassNames(lane->getPermissions()) << " new=" << getVehicleClassNames(i.permissions) << "\n";
378 lane->setPermissions(settings.second.first, i.id);
379 }
380 settings.first->rebuildAllowedLanes();
381 updateVehicles = true;
382 }
383 for (std::pair<MSLane*, SVCPermissions> settings : i.closedLanes) {
384 settings.first->setPermissions(settings.second, i.id);
385 settings.first->getEdge().rebuildAllowedLanes();
386 updateVehicles = true;
387 }
390 }
391 if (i.end == currentTime && !(i.closed.empty() && i.closedLanes.empty()) /*&& i.permissions != SVCAll*/) {
392 for (auto settings : i.closed) {
393 for (MSLane* lane : settings.first->getLanes()) {
394 lane->resetPermissions(i.id);
395 //std::cout << SIMTIME << " opening: intervalID=" << i.id << " lane=" << lane->getID() << " restore prevPerm=" << getVehicleClassNames(lane->getPermissions()) << "\n";
396 }
397 settings.first->rebuildAllowedLanes();
398 updateVehicles = true;
399 }
400 for (std::pair<MSLane*, SVCPermissions> settings : i.closedLanes) {
401 settings.first->resetPermissions(i.id);
402 settings.first->getEdge().rebuildAllowedLanes();
403 updateVehicles = true;
404 }
405 }
406 }
407 if (updateVehicles) {
408 // only vehicles on the affected lanes had their bestlanes updated so far
409 for (MSEdge* e : myEdges) {
410 // also updates vehicles
411 e->rebuildAllowedTargets();
412 }
413 }
414 return 0;
415}
416
417
420 for (const RerouteInterval& ri : myIntervals) {
421 if (ri.begin <= time && ri.end > time) {
422 if (
423 // destProbReroute
424 ri.edgeProbs.getOverallProb() > 0 ||
425 // routeProbReroute
426 ri.routeProbs.getOverallProb() > 0 ||
427 // parkingZoneReroute
428 ri.parkProbs.getOverallProb() > 0 ||
429 // stationReroute
430 ri.stopAlternatives.size() > 0) {
431 return &ri;
432 }
433 if (!ri.closed.empty() || !ri.closedLanesAffected.empty() || !ri.overtakeLocations.empty()) {
434 const std::set<SUMOTrafficObject::NumericalID>& edgeIndices = obj.getUpcomingEdgeIDs();
435 if (affected(edgeIndices, ri.getClosedEdges())
436 || affected(edgeIndices, ri.closedLanesAffected)) {
437 return &ri;
438 }
439 for (const OvertakeLocation& oloc : ri.overtakeLocations) {
440 if (affected(edgeIndices, oloc.main)) {
441 return &ri;
442 }
443 }
444
445 }
446 }
447 }
448 return nullptr;
449}
450
451
454 for (const RerouteInterval& ri : myIntervals) {
455 if (ri.begin <= time && ri.end > time) {
456 if (ri.edgeProbs.getOverallProb() != 0 || ri.routeProbs.getOverallProb() != 0 || ri.parkProbs.getOverallProb() != 0
457 || !ri.closed.empty() || !ri.closedLanesAffected.empty() || !ri.overtakeLocations.empty()) {
458 return &ri;
459 }
460 }
461 }
462 return nullptr;
463}
464
465
466bool
468 if (myAmOptional || myRadius != std::numeric_limits<double>::max()) {
469 return true;
470 }
471 return triggerRouting(tObject, reason);
472}
473
474
475bool
477 double /*newPos*/, double /*newSpeed*/) {
479}
480
481
482bool
484 MSMoveReminder::Notification reason, const MSLane* /* enteredLane */) {
485 return reason == NOTIFICATION_LANE_CHANGE;
486}
487
488
489bool
491 if (!applies(tObject)) {
492 return false;
493 }
494 if (myRadius != std::numeric_limits<double>::max() && tObject.getPosition().distanceTo(myPosition) > myRadius) {
495 return true;
496 }
497 // check whether the vehicle shall be rerouted
499 const MSTriggeredRerouter::RerouteInterval* const rerouteDef = getCurrentReroute(now, tObject);
500 if (rerouteDef == nullptr) {
501 return true; // an active interval could appear later
502 }
503 const double prob = myAmInUserMode ? myUserProbability : myProbability;
504 if (prob < 1 && RandHelper::rand(tObject.getRNG()) > prob) {
505 return false; // XXX another interval could appear later but we would have to track whether the current interval was already tried
506 }
507 if (myTimeThreshold > 0 && MAX2(tObject.getWaitingTime(), tObject.getWaitingTime(true)) < myTimeThreshold) {
508 return true; // waiting time may be reached later
509 }
510 if (reason == NOTIFICATION_LANE_CHANGE) {
511 return false;
512 }
513 // if we have a closingLaneReroute, only vehicles with a rerouting device can profit from rerouting (otherwise, edge weights will not reflect local jamming)
514 const bool hasReroutingDevice = tObject.getDevice(typeid(MSDevice_Routing)) != nullptr;
515 if (rerouteDef->closedLanes.size() > 0 && !hasReroutingDevice) {
516 return true; // an active interval could appear later
517 }
518 const MSEdge* lastEdge = tObject.getRerouteDestination();
519#ifdef DEBUG_REROUTER
520 if (DEBUGCOND(tObject)) {
521 std::cout << SIMTIME << " veh=" << tObject.getID() << " check rerouter " << getID() << " lane=" << Named::getIDSecure(tObject.getLane()) << " edge=" << tObject.getEdge()->getID() << " finalEdge=" << lastEdge->getID() /*<< " arrivalPos=" << tObject.getArrivalPos()*/ << "\n";
522 }
523#endif
524
525 if (rerouteDef->parkProbs.getOverallProb() > 0) {
526#ifdef HAVE_FOX
527 ScopedLocker<> lock(myNotificationMutex, MSGlobals::gNumSimThreads > 1);
528#endif
529 if (!tObject.isVehicle()) {
530 return false;
531 }
532 SUMOVehicle& veh = static_cast<SUMOVehicle&>(tObject);
533 bool newDestination = false;
534 ConstMSEdgeVector newRoute;
535 MSParkingArea* newParkingArea = rerouteParkingArea(rerouteDef, veh, newDestination, newRoute);
536 if (newParkingArea != nullptr) {
537 // adapt plans of any riders
538 for (MSTransportable* p : veh.getPersons()) {
539 p->rerouteParkingArea(veh.getNextParkingArea(), newParkingArea);
540 }
541
542 if (newDestination) {
543 // update arrival parameters
544 SUMOVehicleParameter* newParameter = new SUMOVehicleParameter();
545 *newParameter = veh.getParameter();
547 newParameter->arrivalPos = newParkingArea->getEndLanePosition();
548 veh.replaceParameter(newParameter);
549 }
550
551 SUMOAbstractRouter<MSEdge, SUMOVehicle>& router = hasReroutingDevice
552 ? MSRoutingEngine::getRouterTT(veh.getRNGIndex(), veh.getVClass(), rerouteDef->getClosed())
553 : MSNet::getInstance()->getRouterTT(veh.getRNGIndex(), rerouteDef->getClosed());
554 const double routeCost = router.recomputeCosts(newRoute, &veh, MSNet::getInstance()->getCurrentTimeStep());
555 ConstMSEdgeVector prevEdges(veh.getCurrentRouteEdge(), veh.getRoute().end());
556 const double previousCost = router.recomputeCosts(prevEdges, &veh, MSNet::getInstance()->getCurrentTimeStep());
557 const double savings = previousCost - routeCost;
558 resetClosedEdges(hasReroutingDevice, veh);
559 //if (getID() == "ego") std::cout << SIMTIME << " pCost=" << previousCost << " cost=" << routeCost
560 // << " prevEdges=" << toString(prevEdges)
561 // << " newEdges=" << toString(edges)
562 // << "\n";
563
564 std::string errorMsg;
565 if (veh.replaceParkingArea(newParkingArea, errorMsg)) {
566 veh.replaceRouteEdges(newRoute, routeCost, savings, getID() + ":" + toString(SUMO_TAG_PARKING_AREA_REROUTE), false, false, false);
567 } else {
568 WRITE_WARNING("Vehicle '" + veh.getID() + "' at rerouter '" + getID()
569 + "' could not reroute to new parkingArea '" + newParkingArea->getID()
570 + "' reason=" + errorMsg + ", time=" + time2string(MSNet::getInstance()->getCurrentTimeStep()) + ".");
571 }
572 }
573 return false;
574 }
575 if (rerouteDef->overtakeLocations.size() > 0) {
576 if (!tObject.isVehicle()) {
577 return false;
578 }
579 SUMOVehicle& veh = static_cast<SUMOVehicle&>(tObject);
580 const ConstMSEdgeVector& oldEdges = veh.getRoute().getEdges();
581 double bestSavings = -std::numeric_limits<double>::max();
582 double netSaving;
583 int bestIndex = -1;
584 MSRouteIterator bestMainStart = oldEdges.end();
585 std::pair<const SUMOVehicle*, MSRailSignal*> best_overtaker_signal(nullptr, nullptr);
586 int index = -1;
587 // sort locations by descending distance to vehicle
588 std::vector<std::pair<int, int> > sortedLocs;
589 for (const OvertakeLocation& oloc : rerouteDef->overtakeLocations) {
590 index++;
591 if (veh.getLength() > oloc.sidingLength) {
592 continue;
593 }
594 auto mainStart = std::find(veh.getCurrentRouteEdge(), oldEdges.end(), oloc.main.front());
595 if (mainStart == oldEdges.end()
596 // exit main within
597 || ConstMSEdgeVector(mainStart, mainStart + oloc.main.size()) != oloc.cMain
598 // stop in main
599 || (veh.hasStops() && veh.getNextStop().edge < (mainStart + oloc.main.size()))) {
600 //std::cout << SIMTIME << " veh=" << veh.getID() << " wrong route or stop\n";
601 continue;
602 }
603 // negated iterator distance for descending order
604 sortedLocs.push_back(std::make_pair(-(mainStart - veh.getCurrentRouteEdge()), index));
605 }
606 std::sort(sortedLocs.begin(), sortedLocs.end());
607 for (auto item : sortedLocs) {
608 index = item.second;
609 const OvertakeLocation& oloc = rerouteDef->overtakeLocations[index];
610 auto mainStart = veh.getCurrentRouteEdge() - item.first; // subtracting negative difference
611 std::pair<const SUMOVehicle*, MSRailSignal*> overtaker_signal = overtakingTrain(veh, mainStart, oloc, netSaving);
612 if (overtaker_signal.first != nullptr && netSaving > bestSavings) {
613 bestSavings = netSaving;
614 bestIndex = index;
615 best_overtaker_signal = overtaker_signal;
616 bestMainStart = mainStart;
617#ifdef DEBUG_OVERTAKING
618 std::cout << " newBest index=" << bestIndex << " saving=" << bestSavings << "\n";
619#endif
620 }
621 }
622 if (bestIndex >= 0) {
623 const OvertakeLocation& oloc = rerouteDef->overtakeLocations[bestIndex];
624 SUMOAbstractRouter<MSEdge, SUMOVehicle>& router = hasReroutingDevice
625 ? MSRoutingEngine::getRouterTT(veh.getRNGIndex(), veh.getVClass(), rerouteDef->getClosed())
626 : MSNet::getInstance()->getRouterTT(veh.getRNGIndex(), rerouteDef->getClosed());
627 ConstMSEdgeVector newEdges(veh.getCurrentRouteEdge(), bestMainStart);
628 newEdges.insert(newEdges.end(), oloc.siding.begin(), oloc.siding.end());
629 newEdges.insert(newEdges.end(), bestMainStart + oloc.main.size(), oldEdges.end());
630 const double routeCost = router.recomputeCosts(newEdges, &veh, MSNet::getInstance()->getCurrentTimeStep());
631 const double savings = (router.recomputeCosts(oloc.cMain, &veh, MSNet::getInstance()->getCurrentTimeStep())
633 const std::string info = getID() + ":" + toString(SUMO_TAG_OVERTAKING_REROUTE) + ":" + best_overtaker_signal.first->getID();
634 veh.replaceRouteEdges(newEdges, routeCost, savings, info, false, false, false);
636 MSRailSignalConstraint::PREDECESSOR, best_overtaker_signal.second, best_overtaker_signal.first->getID(), 100, true));
637 resetClosedEdges(hasReroutingDevice, veh);
638 }
639 return false;
640 }
641 if (rerouteDef->stopAlternatives.size() > 0) {
642 // somewhat similar to parkProbs but taking into account public transport schedule
643 if (!tObject.isVehicle()) {
644 return false;
645 }
646 checkStopSwitch(static_cast<MSBaseVehicle&>(tObject), rerouteDef);
647 }
648 // get rerouting params
649 ConstMSRoutePtr newRoute = rerouteDef->routeProbs.getOverallProb() > 0 ? rerouteDef->routeProbs.get() : nullptr;
650 // we will use the route if given rather than calling our own dijsktra...
651 if (newRoute != nullptr) {
652#ifdef DEBUG_REROUTER
653 if (DEBUGCOND(tObject)) {
654 std::cout << " replacedRoute from routeDist " << newRoute->getID() << "\n";
655 }
656#endif
657 tObject.replaceRoute(newRoute, getID());
658 return false; // XXX another interval could appear later but we would have to track whether the currenty interval was already used
659 }
660 const MSEdge* newEdge = lastEdge;
661 // ok, try using a new destination
662 double newArrivalPos = -1;
663 const MSEdgeVector closedEdges = rerouteDef->getClosedEdges();
664 const bool destUnreachable = std::find(closedEdges.begin(), closedEdges.end(), lastEdge) != closedEdges.end();
665 bool keepDestination = false;
666 // if we have a closingReroute, only assign new destinations to vehicles which cannot reach their original destination
667 // if we have a closingLaneReroute, no new destinations should be assigned
668 if (closedEdges.empty() || destUnreachable || rerouteDef->isVia) {
669 newEdge = rerouteDef->edgeProbs.getOverallProb() > 0 ? rerouteDef->edgeProbs.get() : lastEdge;
670 assert(newEdge != nullptr);
671 if (newEdge == &mySpecialDest_terminateRoute) {
672 keepDestination = true;
673 newEdge = tObject.getEdge();
674 newArrivalPos = tObject.getPositionOnLane(); // instant arrival
675 } else if (newEdge == &mySpecialDest_keepDestination || newEdge == lastEdge) {
676 if (destUnreachable && rerouteDef->permissionsAllowAll) {
677 // if permissions aren't set vehicles will simply drive through
678 // the closing unless terminated. If the permissions are specified, assume that the user wants
679 // vehicles to stand and wait until the closing ends
680 WRITE_WARNINGF(TL("Cannot keep destination edge '%' for vehicle '%' due to closed edges. Terminating route."), lastEdge->getID(), tObject.getID());
681 newEdge = tObject.getEdge();
682 } else {
683 newEdge = lastEdge;
684 }
685 }
686 }
687 ConstMSEdgeVector edges;
688 std::vector<MSTransportableRouter::TripItem> items;
689 // we have a new destination, let's replace the route (if it is affected)
690 MSEdgeVector closed = rerouteDef->getClosedEdges();
691 Prohibitions prohibited = rerouteDef->getClosed();
692 if (rerouteDef->closed.empty() || destUnreachable || rerouteDef->isVia || affected(tObject.getUpcomingEdgeIDs(), closed)) {
693 if (tObject.isVehicle()) {
694 SUMOVehicle& veh = static_cast<SUMOVehicle&>(tObject);
695 const bool canChangeDest = rerouteDef->edgeProbs.getOverallProb() > 0;
696 MSVehicleRouter& router = hasReroutingDevice
697 ? MSRoutingEngine::getRouterTT(veh.getRNGIndex(), veh.getVClass(), prohibited)
698 : MSNet::getInstance()->getRouterTT(veh.getRNGIndex(), prohibited);
699 bool ok = veh.reroute(now, getID(), router, false, false, canChangeDest, newEdge);
700 if (!ok && !keepDestination && canChangeDest) {
701 // destination unreachable due to closed intermediate edges. pick among alternative targets
702 RandomDistributor<MSEdge*> edgeProbs2 = rerouteDef->edgeProbs;
703 edgeProbs2.remove(const_cast<MSEdge*>(newEdge));
704 while (!ok && edgeProbs2.getVals().size() > 0) {
705 newEdge = edgeProbs2.get();
706 edgeProbs2.remove(const_cast<MSEdge*>(newEdge));
707 if (newEdge == &mySpecialDest_terminateRoute) {
708 newEdge = veh.getEdge();
709 newArrivalPos = veh.getPositionOnLane(); // instant arrival
710 }
711 if (newEdge == &mySpecialDest_keepDestination && !rerouteDef->permissionsAllowAll) {
712 newEdge = lastEdge;
713 break;
714 }
715 ok = veh.reroute(now, getID(), router, false, false, true, newEdge);
716 }
717
718 }
719 if (!rerouteDef->isVia) {
720#ifdef DEBUG_REROUTER
721 if (DEBUGCOND(tObject)) std::cout << " rerouting: newDest=" << newEdge->getID()
722 << " newEdges=" << toString(edges)
723 << " newArrivalPos=" << newArrivalPos << " numClosed=" << rerouteDef->closed.size()
724 << " destUnreachable=" << destUnreachable << " containsClosed=" << veh.getRoute().containsAnyOf(rerouteDef->getClosedEdges()) << "\n";
725#endif
726 if (ok && newArrivalPos != -1) {
727 // must be called here because replaceRouteEdges may also set the arrivalPos
728 veh.setArrivalPos(newArrivalPos);
729 }
730
731 }
732 } else {
733 // person rerouting here
734 MSTransportableRouter& router = hasReroutingDevice
736 : MSNet::getInstance()->getIntermodalRouter(tObject.getRNGIndex(), 0, prohibited);
737 const bool success = router.compute(tObject.getEdge(), newEdge, tObject.getPositionOnLane(), "",
738 rerouteDef->isVia ? newEdge->getLength() / 2. : tObject.getParameter().arrivalPos, "",
739 tObject.getMaxSpeed(), nullptr, tObject.getVTypeParameter(), 0, now, items);
740 if (!rerouteDef->isVia) {
741 if (success) {
742 for (const MSTransportableRouter::TripItem& it : items) {
743 if (!it.edges.empty() && !edges.empty() && edges.back() == it.edges.front()) {
744 edges.pop_back();
745 }
746 edges.insert(edges.end(), std::make_move_iterator(it.edges.begin()), std::make_move_iterator(it.edges.end()));
747 if (!edges.empty()) {
748 static_cast<MSPerson&>(tObject).replaceWalk(edges, tObject.getPositionOnLane(), 0, 1);
749 }
750 }
751 } else {
752 // maybe the pedestrian model still finds a way (JuPedSim)
753 static_cast<MSPerson&>(tObject).replaceWalk({tObject.getEdge(), newEdge}, tObject.getPositionOnLane(), 0, 1);
754 }
755 }
756 }
757 if (!prohibited.empty()) {
758 resetClosedEdges(hasReroutingDevice, tObject);
759 }
760 }
761 // it was only a via so calculate the remaining part
762 if (rerouteDef->isVia) {
763 if (tObject.isVehicle()) {
764 SUMOVehicle& veh = static_cast<SUMOVehicle&>(tObject);
765 if (!edges.empty()) {
766 edges.pop_back();
767 }
768 MSVehicleRouter& router = hasReroutingDevice
769 ? MSRoutingEngine::getRouterTT(veh.getRNGIndex(), veh.getVClass(), prohibited)
770 : MSNet::getInstance()->getRouterTT(veh.getRNGIndex(), prohibited);
771 router.compute(newEdge, lastEdge, &veh, now, edges);
772 const double routeCost = router.recomputeCosts(edges, &veh, now);
773 hasReroutingDevice
775 : MSNet::getInstance()->getRouterTT(veh.getRNGIndex()); // reset closed edges
776 const bool useNewRoute = veh.replaceRouteEdges(edges, routeCost, 0, getID());
777#ifdef DEBUG_REROUTER
778 if (DEBUGCOND(tObject)) std::cout << " rerouting: newDest=" << newEdge->getID()
779 << " newEdges=" << toString(edges)
780 << " useNewRoute=" << useNewRoute << " newArrivalPos=" << newArrivalPos << " numClosed=" << rerouteDef->closed.size()
781 << " destUnreachable=" << destUnreachable << " containsClosed=" << veh.getRoute().containsAnyOf(rerouteDef->getClosedEdges()) << "\n";
782#endif
783 if (useNewRoute && newArrivalPos != -1) {
784 // must be called here because replaceRouteEdges may also set the arrivalPos
785 veh.setArrivalPos(newArrivalPos);
786 }
787 } else {
788 // person rerouting here
789 bool success = !items.empty();
790 if (success) {
791 MSTransportableRouter& router = hasReroutingDevice
793 : MSNet::getInstance()->getIntermodalRouter(tObject.getRNGIndex(), 0, prohibited);
794 success = router.compute(newEdge, lastEdge, newEdge->getLength() / 2., "",
795 tObject.getParameter().arrivalPos, "",
796 tObject.getMaxSpeed(), nullptr, tObject.getVTypeParameter(), 0, now, items);
797 }
798 if (success) {
799 for (const MSTransportableRouter::TripItem& it : items) {
800 if (!it.edges.empty() && !edges.empty() && edges.back() == it.edges.front()) {
801 edges.pop_back();
802 }
803 edges.insert(edges.end(), std::make_move_iterator(it.edges.begin()), std::make_move_iterator(it.edges.end()));
804 }
805 if (!edges.empty()) {
806 static_cast<MSPerson&>(tObject).replaceWalk(edges, tObject.getPositionOnLane(), 0, 1);
807 }
808 } else {
809 // maybe the pedestrian model still finds a way (JuPedSim)
810 static_cast<MSPerson&>(tObject).replaceWalk({tObject.getEdge(), newEdge, lastEdge}, tObject.getPositionOnLane(), 0, 1);
811 }
812 }
813 if (!prohibited.empty()) {
814 resetClosedEdges(hasReroutingDevice, tObject);
815 }
816 }
817 return false; // XXX another interval could appear later but we would have to track whether the currenty interval was already used
818}
819
820
821void
825
826
827void
831
832
833bool
837
838
839double
843
844
845double
849
850
851double
853 return (double)(sp->getElement() == SUMO_TAG_PARKING_AREA
854 ? dynamic_cast<MSParkingArea*>(sp)->getOccupancy()
855 : sp->getStoppedVehicles().size());
856}
857
858
859double
861 return (double)(sp->getElement() == SUMO_TAG_PARKING_AREA
862 ? dynamic_cast<MSParkingArea*>(sp)->getLastStepOccupancy()
863 : sp->getStoppedVehicles().size());
864}
865
866
867double
869 if (myBlockedStoppingPlaces.count(sp) == 0) {
870 return (double)(sp->getElement() == SUMO_TAG_PARKING_AREA
871 ? dynamic_cast<MSParkingArea*>(sp)->getCapacity()
872 // assume only one vehicle at a time (for stationReroute)
873 : 1.);
874 } else {
875 return 0.;
876 }
877}
878
879
880void
882 veh.rememberBlockedParkingArea(parkingArea, blocked);
883}
884
885
886void
888 veh.rememberParkingAreaScore(parkingArea, score);
889}
890
891
892void
896
897
900 return veh.sawBlockedParkingArea(parkingArea, local);
901}
902
903
904int
908
909
910void
914
915
918 SUMOVehicle& veh, bool& newDestination, ConstMSEdgeVector& newRoute) {
919 MSStoppingPlace* destStoppingPlace = veh.getNextParkingArea();
920 if (destStoppingPlace == nullptr) {
921 // not driving towards the right type of stop
922 return nullptr;
923 }
924 std::vector<StoppingPlaceVisible> parks;
925 for (auto cand : rerouteDef->parkProbs.getVals()) {
926 if (cand.first->accepts(&veh)) {
927 parks.push_back(cand);
928 }
929 }
930 StoppingPlaceParamMap_t addInput = {};
931 return dynamic_cast<MSParkingArea*>(rerouteStoppingPlace(destStoppingPlace, parks, rerouteDef->parkProbs.getProbs(), veh, newDestination, newRoute, addInput, rerouteDef->getClosed()));
932}
933
934
935std::pair<const SUMOVehicle*, MSRailSignal*>
937 ConstMSEdgeVector::const_iterator mainStart,
938 const OvertakeLocation& oloc,
939 double& netSaving) {
940 const ConstMSEdgeVector& route = veh.getRoute().getEdges();
941 const MSEdgeVector& main = oloc.main;
942 const double vMax = veh.getMaxSpeed();
943 const double prio = veh.getFloatParam(toString(SUMO_TAG_OVERTAKING_REROUTE) + ".prio", false, DEFAULT_PRIO_OVERTAKEN, false);
945 for (MSVehicleControl::constVehIt it_veh = c.loadedVehBegin(); it_veh != c.loadedVehEnd(); ++it_veh) {
946 const MSBaseVehicle* veh2 = dynamic_cast<const MSBaseVehicle*>((*it_veh).second);
947 if (veh2->isOnRoad() && veh2->getMaxSpeed() > vMax) {
948 const double arrivalDelay = veh2->getStopArrivalDelay();
949 const double delay = MAX2(veh2->getStopDelay(), arrivalDelay == INVALID_DOUBLE ? 0 : arrivalDelay);
950 if (delay > veh2->getFloatParam(toString(SUMO_TAG_OVERTAKING_REROUTE) + ".maxDelay", false, DEFAULT_MAXDELAY, false)) {
951 continue;
952 }
953 const ConstMSEdgeVector& route2 = veh2->getRoute().getEdges();
954 auto itOnMain2 = route2.end();
955 int mainIndex = 0;
956 for (const MSEdge* m : main) {
957 itOnMain2 = std::find(veh2->getCurrentRouteEdge(), route2.end(), m);
958 if (itOnMain2 != route2.end()) {
959 break;
960 }
961 mainIndex++;
962 }
963 if (itOnMain2 != route2.end() && itOnMain2 > veh2->getCurrentRouteEdge()) {
964 auto itOnMain = mainStart + mainIndex;
965 double timeToMain = 0;
966 for (auto it = veh.getCurrentRouteEdge(); it != itOnMain; it++) {
967 timeToMain += (*it)->getMinimumTravelTime(&veh);
968 }
969 // veh2 may be anywhere on the current edge so we have to discount
970 double timeToMain2 = -veh2->getEdge()->getMinimumTravelTime(veh2) * veh2->getPositionOnLane() / veh2->getEdge()->getLength();
971 double timeToLastSignal2 = timeToMain2;
972 for (auto it = veh2->getCurrentRouteEdge(); it != itOnMain2; it++) {
973 timeToMain2 += (*it)->getMinimumTravelTime(veh2);
974 auto signal = getRailSignal(*it);
975 if (signal) {
976 timeToLastSignal2 = timeToMain2;
977#ifdef DEBUG_OVERTAKING
978 std::cout << " lastBeforeMain2 " << signal->getID() << "\n";
979#endif
980 }
981 }
982 double exitMainTime = timeToMain;
983 double exitMainBlockTime2 = timeToMain2;
984 double commonTime = 0;
985 double commonTime2 = 0;
986 int nCommon = 0;
987 auto exitMain2 = itOnMain2;
988 const MSRailSignal* firstAfterMain = nullptr;
989 const MSEdge* common = nullptr;
990 double vMinCommon = (*itOnMain)->getVehicleMaxSpeed(&veh);
991 double vMinCommon2 = (*itOnMain2)->getVehicleMaxSpeed(veh2);
992 while (itOnMain2 != route2.end()
993 && itOnMain != route.end()
994 && *itOnMain == *itOnMain2) {
995 common = *itOnMain;
996 commonTime += common->getMinimumTravelTime(&veh);
997 commonTime2 += common->getMinimumTravelTime(veh2);
998 vMinCommon = MIN2(vMinCommon, common->getVehicleMaxSpeed(&veh));
999 vMinCommon2 = MIN2(vMinCommon2, common->getVehicleMaxSpeed(veh2));
1000 const bool onMain = nCommon < (int)main.size() - mainIndex;
1001 if (onMain) {
1002 exitMainTime = timeToMain + commonTime;
1003 }
1004 if (firstAfterMain == nullptr) {
1005 exitMainBlockTime2 = timeToMain2 + commonTime2;
1006 }
1007 auto signal = getRailSignal(common);
1008 if (signal) {
1009 if (!onMain && firstAfterMain == nullptr) {
1010 firstAfterMain = signal;
1011#ifdef DEBUG_OVERTAKING
1012 std::cout << " firstAfterMain " << signal->getID() << "\n";
1013#endif
1014 }
1015 }
1016 nCommon++;
1017 itOnMain++;
1018 itOnMain2++;
1019 }
1020 const double vMaxLast = common->getVehicleMaxSpeed(&veh);
1021 const double vMaxLast2 = common->getVehicleMaxSpeed(veh2);
1022 commonTime += veh.getLength() / vMaxLast;
1023 exitMainBlockTime2 += veh2->getLength() / vMaxLast2;
1024 exitMain2 += MIN2(nCommon, (int)main.size() - mainIndex);
1025 double timeLoss2 = MAX2(0.0, timeToMain + veh.getLength() / oloc.siding.front()->getVehicleMaxSpeed(&veh) - timeToLastSignal2);
1026 const double saving = timeToMain + commonTime - (timeToMain2 + commonTime2) - timeLoss2;
1027 const double loss = exitMainBlockTime2 - exitMainTime;
1028 const double prio2 = veh2->getFloatParam(toString(SUMO_TAG_OVERTAKING_REROUTE) + ".prio", false, DEFAULT_PRIO_OVERTAKER, false);
1029 // losses from acceleration after stopping at a signal
1030 const double accelTimeLoss = loss > 0 ? 0.5 * vMinCommon / veh.getVehicleType().getCarFollowModel().getMaxAccel() : 0;
1031 const double accelTimeLoss2 = timeLoss2 > 0 ? 0.5 * vMinCommon2 / veh2->getVehicleType().getCarFollowModel().getMaxAccel() : 0;
1032 netSaving = prio2 * (saving - accelTimeLoss2) - prio * (loss + accelTimeLoss);
1033#ifdef DEBUG_OVERTAKING
1034 std::cout << SIMTIME << " veh=" << veh.getID() << " veh2=" << veh2->getID()
1035 << " sidingStart=" << oloc.siding.front()->getID()
1036 << " ttm=" << timeToMain << " ttm2=" << timeToMain2
1037 << " nCommon=" << nCommon << " cT=" << commonTime << " cT2=" << commonTime2
1038 << " em=" << exitMainTime << " emb2=" << exitMainBlockTime2
1039 << " ttls2=" << timeToLastSignal2
1040 << " saving=" << saving << " loss=" << loss
1041 << " atl=" << accelTimeLoss << " atl2=" << accelTimeLoss2 << " tl2=" << timeLoss2
1042 << " prio=" << prio << " prio2=" << prio2 << " netSaving=" << netSaving << "\n";
1043#endif
1044 if (netSaving > oloc.minSaving) {
1045 MSRailSignal* s = findSignal(veh2->getCurrentRouteEdge(), exitMain2);
1046 if (s != nullptr) {
1047 return std::make_pair(veh2, s);
1048 }
1049 }
1050 }
1051 }
1052 }
1053 return std::make_pair(nullptr, nullptr);
1054}
1055
1056
1057void
1060#ifdef DEBUG_REROUTER
1061 std::cout << SIMTIME << " " << getID() << " ego=" << ego.getID() << "\n";
1062#endif
1063 if (!ego.hasStops()) {
1064 return;
1065 }
1066 const MSStop& stop = ego.getNextStop();
1067 if (stop.reached || stop.joinTriggered || (stop.pars.arrival < 0 && stop.pars.until < 0)) {
1068 return;
1069 }
1070 MSStoppingPlace* cur = nullptr;
1071 for (MSStoppingPlace* sp : stop.getPlaces()) {
1072 for (auto item : def->stopAlternatives) {
1073 if (sp == item.first) {
1074 cur = sp;
1075 break;
1076 }
1077 }
1078 }
1079 if (cur == nullptr) {
1080 return;
1081 }
1082 std::vector<const SUMOVehicle*> stopped = cur->getStoppedVehicles();
1083#ifdef DEBUG_REROUTER
1084 std::cout << SIMTIME << " " << getID() << " ego=" << ego.getID() << " stopped=" << toString(stopped) << "\n";
1085#endif
1086 SUMOTime stoppedDuration = -1;
1087 if (stopped.empty()) {
1089 const MSLane& stopLane = cur->getLane();
1091 for (MSVehicleControl::constVehIt it_veh = c.loadedVehBegin(); it_veh != c.loadedVehEnd(); ++it_veh) {
1092 const MSBaseVehicle* veh = dynamic_cast<const MSBaseVehicle*>((*it_veh).second);
1093 if (veh->isOnRoad() && veh->hasStops()) {
1094 const MSStop& vehStop = veh->getNextStop();
1095 if (vehStop.pars.lane == stopLane.getID()) {
1096 myBlockedStoppingPlaces.insert(cur);
1097 if (veh->isStopped()) {
1098 // stopped somewhere else on the same lane
1099 stoppedDuration = MAX3((SUMOTime)0, stoppedDuration, veh->getStopDuration());
1100 } else {
1101 std::pair<double, double> timeDist = veh->estimateTimeToNextStop();
1102 SUMOTime timeTo = TIME2STEPS(timeDist.first);
1103 stoppedDuration = MAX3((SUMOTime)0, stoppedDuration, timeTo + vehStop.getMinDuration(SIMSTEP + timeTo));
1104 }
1105 }
1106 }
1107 }
1108 } else {
1109 stoppedDuration = 0;
1110 for (const SUMOVehicle* veh : cur->getStoppedVehicles()) {
1111 stoppedDuration = MAX2(stoppedDuration, veh->getStopDuration());
1112 }
1113 }
1114 if (stoppedDuration < 0) {
1115 return;
1116 }
1118 const SUMOTime stopFree = SIMSTEP + stoppedDuration;
1119 const SUMOTime scheduledArrival = stop.pars.arrival >= 0 ? stop.pars.arrival : stop.pars.until - stop.pars.duration;
1120#ifdef DEBUG_REROUTER
1121 std::cout << SIMTIME << " " << getID() << " ego=" << ego.getID() << " stopFree=" << stopFree << " scheduledArrival=" << time2string(scheduledArrival) << "\n";
1122#endif
1123 if (stopFree < scheduledArrival) {
1124 // no conflict according to the schedule
1125 return;
1126 }
1127 const SUMOTime estimatedArrival = SIMSTEP + (stop.pars.arrival >= 0
1129 : TIME2STEPS(ego.getStopDelay()) - stop.pars.duration);
1130#ifdef DEBUG_REROUTER
1131 std::cout << SIMTIME << " " << getID() << " ego=" << ego.getID() << " stopFree=" << stopFree << " estimatedArrival=" << time2string(estimatedArrival) << "\n";
1132#endif
1133 if (stopFree < estimatedArrival) {
1134 // no conflict when considering current delay
1135 return;
1136 }
1137 const std::vector<double> probs(def->stopAlternatives.size(), 1.);
1138 StoppingPlaceParamMap_t scores = {};
1139 bool newDestination;
1140 ConstMSEdgeVector newRoute;
1141 // @todo: consider future conflicts caused by rerouting
1142 // @todo: reject alternatives with large detour
1143 const MSStoppingPlace* alternative = rerouteStoppingPlace(nullptr, def->stopAlternatives, probs, ego, newDestination, newRoute, scores);
1144#ifdef DEBUG_REROUTER
1145 std::cout << SIMTIME << " " << getID() << " ego=" << ego.getID() << " alternative=" << Named::getIDSecure(alternative) << "\n";
1146#endif
1147 if (alternative != nullptr) {
1148 // @todo adapt plans of any riders
1149 //for (MSTransportable* p : ego.getPersons()) {
1150 // p->rerouteParkingArea(ego.getNextParkingArea(), newParkingArea);
1151 //}
1152
1153 if (newDestination) {
1154 // update arrival parameters
1155 SUMOVehicleParameter* newParameter = new SUMOVehicleParameter();
1156 *newParameter = ego.getParameter();
1158 newParameter->arrivalPos = alternative->getEndLanePosition();
1159 ego.replaceParameter(newParameter);
1160 }
1161
1162 SUMOVehicleParameter::Stop newStop = stop.pars;
1163 newStop.lane = alternative->getLane().getID();
1164 newStop.startPos = alternative->getBeginLanePosition();
1165 newStop.endPos = alternative->getEndLanePosition();
1166 switch (alternative->getElement()) {
1168 newStop.parkingarea = alternative->getID();
1169 break;
1171 newStop.containerstop = alternative->getID();
1172 break;
1174 newStop.chargingStation = alternative->getID();
1175 break;
1177 newStop.overheadWireSegment = alternative->getID();
1178 break;
1179 case SUMO_TAG_BUS_STOP:
1181 default:
1182 newStop.busstop = alternative->getID();
1183 }
1184 std::string errorMsg;
1185 if (!ego.replaceStop(0, newStop, getID() + ":" + toString(SUMO_TAG_STATION_REROUTE), false, errorMsg)) {
1186 WRITE_WARNING("Vehicle '" + ego.getID() + "' at rerouter '" + getID()
1187 + "' could not perform stationReroute to '" + alternative->getID()
1188 + "' reason=" + errorMsg + ", time=" + time2string(MSNet::getInstance()->getCurrentTimeStep()) + ".");
1189 }
1190 }
1191}
1192
1193
1195MSTriggeredRerouter::findSignal(ConstMSEdgeVector::const_iterator begin, ConstMSEdgeVector::const_iterator end) {
1196 auto it = end;
1197 do {
1198 it--;
1199 auto signal = getRailSignal(*it);
1200 if (signal != nullptr) {
1201 return signal;
1202 }
1203 } while (it != begin);
1204 return nullptr;
1205}
1206
1207
1211 for (const MSLink* link : edge->getLanes().front()->getLinkCont()) {
1212 if (link->getTLLogic() != nullptr) {
1213 return dynamic_cast<MSRailSignal*>(const_cast<MSTrafficLightLogic*>(link->getTLLogic()));
1214 }
1215 }
1216 }
1217 return nullptr;
1218}
1219
1220bool
1222 if (myVehicleTypes.empty() || myVehicleTypes.count(obj.getVehicleType().getOriginalID()) > 0) {
1223 return true;
1224 } else {
1226 for (auto vTypeDist : vTypeDists) {
1227 if (myVehicleTypes.count(vTypeDist) > 0) {
1228 return true;
1229 }
1230 }
1231 return false;
1232 }
1233}
1234
1235
1236bool
1237MSTriggeredRerouter::affected(const std::set<SUMOTrafficObject::NumericalID>& edgeIndices, const MSEdgeVector& closed) {
1238 for (const MSEdge* const e : closed) {
1239 if (edgeIndices.count(e->getNumericalID()) > 0) {
1240 return true;
1241 }
1242 }
1243 return false;
1244}
1245
1246
1247void
1249 // if a parkingArea is a rerouting target, it should generally have a
1250 // rerouter on its edge or vehicles will be stuck there once it's full.
1251 // The user should receive a Warning in this case
1252 std::set<MSEdge*> parkingRerouterEdges;
1253 std::map<MSParkingArea*, std::string, ComparatorIdLess> targetedParkingArea; // paID -> targetingRerouter
1254 for (const auto& rr : myInstances) {
1255 bool hasParkingReroute = false;
1256 for (const RerouteInterval& interval : rr.second->myIntervals) {
1257 if (interval.parkProbs.getOverallProb() > 0) {
1258 hasParkingReroute = true;
1259 for (const StoppingPlaceVisible& pav : interval.parkProbs.getVals()) {
1260 targetedParkingArea[dynamic_cast<MSParkingArea*>(pav.first)] = rr.first;
1261 }
1262 }
1263 }
1264 if (hasParkingReroute) {
1265 parkingRerouterEdges.insert(rr.second->myEdges.begin(), rr.second->myEdges.end());
1266 }
1267 }
1268 for (const auto& item : targetedParkingArea) {
1269 if (parkingRerouterEdges.count(&item.first->getLane().getEdge()) == 0) {
1270 WRITE_WARNINGF(TL("ParkingArea '%' is targeted by rerouter '%' but doesn't have its own rerouter. This may cause parking search to abort."),
1271 item.first->getID(), item.second);
1272 }
1273 }
1274}
1275
1276
1277void
1279 // getRouterTT without prohibitions removes previous prohibitions
1280 if (o.isVehicle()) {
1281 hasReroutingDevice
1284 } else {
1285 hasReroutingDevice
1288 }
1289}
1290
1291/****************************************************************************/
long long int SUMOTime
Definition GUI.h:36
std::vector< const MSEdge * > ConstMSEdgeVector
Definition MSEdge.h:74
std::vector< MSEdge * > MSEdgeVector
Definition MSEdge.h:73
#define DEBUGCOND(PED)
ConstMSEdgeVector::const_iterator MSRouteIterator
Definition MSRoute.h:57
#define DEFAULT_PRIO_OVERTAKEN
#define DEFAULT_PRIO_OVERTAKER
assume that a faster train has more priority and a slower train doesn't matter
#define WRITE_WARNINGF(...)
Definition MsgHandler.h:287
#define WRITE_WARNING(msg)
Definition MsgHandler.h:286
#define TL(string)
Definition MsgHandler.h:304
#define TLF(string,...)
Definition MsgHandler.h:306
std::shared_ptr< const MSRoute > ConstMSRoutePtr
Definition Route.h:32
SUMOTime string2time(const std::string &r)
convert string to SUMOTime
Definition SUMOTime.cpp:46
std::string time2string(SUMOTime t, bool humanReadable)
convert SUMOTime to string (independently of global format setting)
Definition SUMOTime.cpp:91
#define STEPS2TIME(x)
Definition SUMOTime.h:55
#define SIMSTEP
Definition SUMOTime.h:61
#define SUMOTime_MAX
Definition SUMOTime.h:34
#define SIMTIME
Definition SUMOTime.h:62
#define TIME2STEPS(x)
Definition SUMOTime.h:57
const SVCPermissions SVCAll
all VClasses are allowed
SVCPermissions parseVehicleClasses(const std::string &allowedS)
Parses the given definition of allowed vehicle classes into the given containers Deprecated classes g...
long long int SVCPermissions
bitset where each bit declares whether a certain SVC may use this edge/lane
@ SVC_AUTHORITY
authorities vehicles
@ GIVEN
The arrival position is given.
@ SUMO_TAG_INTERVAL
an aggreagated-output interval
@ SUMO_TAG_CLOSING_REROUTE
reroute of type closing
@ SUMO_TAG_CHARGING_STATION
A Charging Station.
@ SUMO_TAG_CONTAINER_STOP
A container stop.
@ SUMO_TAG_PARKING_AREA_REROUTE
entry for an alternative parking zone
@ SUMO_TAG_BUS_STOP
A bus stop.
@ SUMO_TAG_PARKING_AREA
A parking area.
@ SUMO_TAG_ROUTE_PROB_REROUTE
probability of route of a reroute
@ SUMO_TAG_VIA_PROB_REROUTE
probability of a via reroute
@ SUMO_TAG_TRAIN_STOP
A train stop (alias for bus stop)
@ SUMO_TAG_OVERHEAD_WIRE_SEGMENT
An overhead wire segment.
@ SUMO_TAG_DEST_PROB_REROUTE
probability of destination of a reroute
@ SUMO_TAG_OVERTAKING_REROUTE
decision point for rerouting to be overtaken
@ SUMO_TAG_CLOSING_LANE_REROUTE
lane of a reroute of type closing
@ SUMO_TAG_STATION_REROUTE
decision point for switching trainStop/busStop within a station
@ SUMO_ATTR_DISALLOW
@ SUMO_ATTR_ALLOW
@ SUMO_ATTR_MAIN
@ SUMO_ATTR_BEGIN
weights: time range begin
@ SUMO_ATTR_MINSAVING
@ SUMO_ATTR_END
weights: time range end
@ SUMO_ATTR_PROB
@ SUMO_ATTR_SIDING
@ SUMO_ATTR_ID
@ SUMO_ATTR_VISIBLE
@ SUMO_ATTR_UNTIL
const double INVALID_DOUBLE
invalid double
Definition StdDefs.h:68
T MIN2(T a, T b)
Definition StdDefs.h:80
T MAX2(T a, T b)
Definition StdDefs.h:86
T MAX3(T a, T b, T c)
Definition StdDefs.h:100
std::string toString(const T &t, std::streamsize accuracy=gPrecision)
Definition ToString.h:46
int main(int argc, char *argv[])
bool compute(const E *from, const E *to, const double departPos, const std::string &originStopID, const double arrivalPos, const std::string &stopID, const double speed, const V *const vehicle, const SUMOVTypeParameter &pars, const SVCPermissions modeSet, const SUMOTime msTime, std::vector< TripItem > &into, const double externalFactor=0.)
Builds the route between the given edges using the minimum effort at the given time The definition of...
MESegment * getSegmentForEdge(const MSEdge &e, double pos=0)
Get the segment for a given edge at a given position.
Definition MELoop.cpp:340
void addDetector(MSMoveReminder *data, int queueIndex=-1)
Adds a data collector for a detector to this segment.
The base class for microscopic and mesoscopic vehicles.
double getMaxSpeed() const
Returns the maximum speed (the minimum of desired and technical maximum speed)
bool replaceStop(int nextStopIndex, SUMOVehicleParameter::Stop stop, const std::string &info, bool teleport, std::string &errorMsg)
virtual double getStopDelay() const
Returns the estimated public transport stop (departure) delay in seconds.
const SUMOVehicleParameter & getParameter() const
Returns the vehicle's parameter (including departure definition)
void replaceParameter(const SUMOVehicleParameter *newParameter)
replace the vehicle parameter (deleting the old one)
const MSRouteIterator & getCurrentRouteEdge() const
Returns an iterator pointing to the current edge in this vehicles route.
double getLength() const
Returns the vehicle's length.
const MSEdge * getEdge() const
Returns the edge the vehicle is currently at.
virtual std::pair< double, double > estimateTimeToNextStop() const
return time (s) and distance to the next stop
bool hasStops() const
Returns whether the vehicle has to stop somewhere.
const MSStop & getNextStop() const
virtual double getStopArrivalDelay() const
Returns the estimated public transport stop arrival delay in seconds.
SUMOTime getStopDuration() const
get remaining stop duration or 0 if the vehicle isn't stopped
const MSRoute & getRoute() const
Returns the current route.
virtual bool isOnRoad() const
Returns the information whether the vehicle is on a road (is simulated)
const MSVehicleType & getVehicleType() const
Returns the vehicle's type definition.
bool isStopped() const
Returns whether the vehicle is at a stop.
double getMaxAccel() const
Get the vehicle type's maximum acceleration [m/s^2].
Definition MSCFModel.h:261
A device that performs vehicle rerouting based on current edge speeds.
A road/street connecting two junctions.
Definition MSEdge.h:77
const std::vector< MSLane * > & getLanes() const
Returns this edge's lanes.
Definition MSEdge.h:168
const MSJunction * getToJunction() const
Definition MSEdge.h:426
double getLength() const
return the length of the edge
Definition MSEdge.h:693
double getMinimumTravelTime(const SUMOVehicle *const veh) const
returns the minimum travel time for the given vehicle
Definition MSEdge.h:484
static bool dictionary(const std::string &id, MSEdge *edge)
Inserts edge into the static dictionary Returns true if the key id isn't already in the dictionary....
Definition MSEdge.cpp:1057
double getVehicleMaxSpeed(const SUMOTrafficObject *const veh) const
Returns the maximum speed the vehicle may use on this edge.
Definition MSEdge.cpp:1180
virtual void addEvent(Command *operation, SUMOTime execTimeStep=-1)
Adds an Event.
static bool gUseMesoSim
Definition MSGlobals.h:106
static MELoop * gMesoNet
mesoscopic simulation infrastructure
Definition MSGlobals.h:112
static int gNumSimThreads
how many threads to use for simulation
Definition MSGlobals.h:146
SumoXMLNodeType getType() const
return the type of this Junction
Definition MSJunction.h:133
Representation of a lane in the micro simulation.
Definition MSLane.h:84
static bool dictionary(const std::string &id, MSLane *lane)
Static (sic!) container methods {.
Definition MSLane.cpp:2490
Something on a lane to be noticed about vehicle movement.
Notification
Definition of a vehicle state.
@ NOTIFICATION_LANE_CHANGE
The vehicle changes lanes (micro only)
@ NOTIFICATION_JUNCTION
The vehicle arrived at a junction.
static MSNet * getInstance()
Returns the pointer to the unique instance of MSNet (singleton).
Definition MSNet.cpp:186
MSEventControl * getBeginOfTimestepEvents()
Returns the event control for events executed at the begin of a time step.
Definition MSNet.h:485
MSTransportableRouter & getIntermodalRouter(int rngIndex, const int routingMode=0, const Prohibitions &prohibited={}) const
Definition MSNet.cpp:1627
MSVehicleRouter & getRouterTT(int rngIndex, const Prohibitions &prohibited={}) const
Definition MSNet.cpp:1580
SUMOTime getCurrentTimeStep() const
Returns the current simulation step.
Definition MSNet.h:334
MSStoppingPlace * getStoppingPlace(const std::string &id, const SumoXMLTag category) const
Returns the named stopping place of the given category.
Definition MSNet.cpp:1453
MSVehicleControl & getVehicleControl()
Returns the vehicle control.
Definition MSNet.h:392
A lane area vehicles can halt at.
A signal for rails.
void addConstraint(const std::string &tripId, MSRailSignalConstraint *constraint)
register constraint for signal switching
const ConstMSEdgeVector & getEdges() const
Definition MSRoute.h:125
MSRouteIterator end() const
Returns the end of the list of edges to pass.
Definition MSRoute.cpp:79
bool containsAnyOf(const MSEdgeVector &edgelist) const
Definition MSRoute.cpp:243
static bool dictionary(const std::string &id, ConstMSRoutePtr route)
Adds a route to the dictionary.
Definition MSRoute.cpp:109
static MSVehicleRouter & getRouterTT(const int rngIndex, SUMOVehicleClass svc, const Prohibitions &prohibited={})
return the vehicle router instance
static MSTransportableRouter & getIntermodalRouterTT(const int rngIndex, const Prohibitions &prohibited={})
return the person router instance
std::vector< MSStoppingPlace * > getPlaces() const
return all stoppingPlaces associated with this stop
Definition MSStop.cpp:188
bool joinTriggered
whether coupling another vehicle (train) the vehicle continue
Definition MSStop.h:73
SUMOTime getMinDuration(SUMOTime time) const
return minimum stop duration when starting stop at time
Definition MSStop.cpp:134
bool reached
Information whether the stop has been reached.
Definition MSStop.h:75
MSRouteIterator edge
The edge in the route to stop at.
Definition MSStop.h:48
const SUMOVehicleParameter::Stop pars
The stop parameter.
Definition MSStop.h:65
A lane area vehicles can halt at.
std::vector< const SUMOVehicle * > getStoppedVehicles() const
get list of vehicles waiting at this stop
double getBeginLanePosition() const
Returns the begin position of this stop.
SumoXMLTag getElement() const
return the type of this stopping place
double getEndLanePosition() const
Returns the end position of this stop.
const MSLane & getLane() const
Returns the lane this stop is located at.
std::map< std::string, double > StoppingPlaceParamMap_t
MSStoppingPlace * rerouteStoppingPlace(MSStoppingPlace *destStoppingPlace, const std::vector< StoppingPlaceVisible > &stoppingPlaceCandidates, const std::vector< double > &probs, SUMOVehicle &veh, bool &newDestination, ConstMSEdgeVector &newRoute, StoppingPlaceParamMap_t &scores, const Prohibitions &closedEdges={}, const int insertStopIndex=0, const bool keepCurrentStop=true)
main method to trigger the rerouting to the "best" StoppingPlace according to the custom evaluation f...
std::pair< MSStoppingPlace *, bool > StoppingPlaceVisible
The parent class for traffic light logics.
SUMOTime setPermissions(const SUMOTime currentTime)
Sets the edge permission if there are any defined in the closingEdge.
bool notifyEnter(SUMOTrafficObject &veh, MSMoveReminder::Notification reason, const MSLane *enteredLane=0)
Tries to reroute the vehicle.
int getNumberStoppingPlaceReroutes(SUMOVehicle &veh)
ask how many times already the vehicle has been rerouted to another stopping place
bool notifyMove(SUMOTrafficObject &veh, double oldPos, double newPos, double newSpeed)
Triggers rerouting (once) for vehicles that are already on the edge when the rerouter activates.
static MSRailSignal * findSignal(ConstMSEdgeVector::const_iterator begin, ConstMSEdgeVector::const_iterator end)
find the last downstream signal on the given route
std::map< const MSEdge *, double > Prohibitions
bool notifyLeave(SUMOTrafficObject &veh, double lastPos, MSMoveReminder::Notification reason, const MSLane *enteredLane=0)
Removes the reminder.
MSTriggeredRerouter(const std::string &id, const MSEdgeVector &edges, double prob, bool off, bool optional, SUMOTime timeThreshold, const std::string &vTypes, const Position &pos, const double radius)
Constructor.
double getUserProbability() const
Returns the rerouting probability given by the user.
static const double DEFAULT_MAXDELAY
MSParkingArea * rerouteParkingArea(const MSTriggeredRerouter::RerouteInterval *rerouteDef, SUMOVehicle &veh, bool &newDestination, ConstMSEdgeVector &newRoute)
search for an alternative ParkingArea
bool myHaveParkProbs
whether this rerouter has loaded parkingReroute definitions
virtual void myStartElement(int element, const SUMOSAXAttributes &attrs)
Called on the opening of a tag;.
bool myAmOptional
Information whether the rerouting will only take place on request.
static bool affected(const std::set< SUMOTrafficObject::NumericalID > &edgeIndices, const MSEdgeVector &closed)
void setUserUsageProbability(double prob)
Sets the probability with which a vehicle is rerouted given by the user.
Position myPosition
Where are we located in the network.
std::pair< const SUMOVehicle *, MSRailSignal * > overtakingTrain(const SUMOVehicle &veh, ConstMSEdgeVector::const_iterator mainStart, const OvertakeLocation &oloc, double &netSaving)
determine whether veh should switch from main to siding to be overtaken and return the overtaking veh...
void rememberStoppingPlaceScore(SUMOVehicle &veh, MSStoppingPlace *parkingArea, const std::string &score)
store the score of the ParkingArea in the vehicle
void rememberBlockedStoppingPlace(SUMOVehicle &veh, const MSStoppingPlace *parkingArea, bool blocked)
store the blocked ParkingArea in the vehicle
double getStoppingPlaceOccupancy(MSStoppingPlace *sp)
Return the number of occupied places of the stopping place.
static MSEdge mySpecialDest_terminateRoute
virtual void myEndElement(int element)
Called when a closing tag occurs.
void checkStopSwitch(MSBaseVehicle &veh, const MSTriggeredRerouter::RerouteInterval *def)
consider switching the location of the upcoming stop
void resetClosedEdges(bool hasReroutingDevice, const SUMOTrafficObject &o)
reset router after closing edges
bool triggerRouting(SUMOTrafficObject &veh, MSMoveReminder::Notification reason)
double myRadius
At which distance are we activated.
void resetStoppingPlaceScores(SUMOVehicle &veh)
reset all stored ParkingArea scores for this vehicle
double myProbability
The probability and the user-given probability.
SUMOTime sawBlockedStoppingPlace(SUMOVehicle &veh, MSStoppingPlace *parkingArea, bool local)
get the time the ParkingArea was considered full from this vehicle
virtual ~MSTriggeredRerouter()
Destructor.
bool inUserMode() const
Returns whether the user is setting the rerouting probability.
void setNumberStoppingPlaceReroutes(SUMOVehicle &veh, int value)
update the number of reroutes for the vehicle
std::set< const MSStoppingPlace * > myBlockedStoppingPlaces
double getStoppingPlaceCapacity(MSStoppingPlace *sp)
Return the number of places the stopping place provides.
std::set< std::string > myVehicleTypes
The vehicle types to look for (empty means all)
const RerouteInterval * getCurrentReroute(SUMOTime time, SUMOTrafficObject &obj) const
Returns the rerouting definition valid for the given time and object, nullptr if none.
static void checkParkingRerouteConsistency()
issues warning for incomplete parkingReroute relationships
double getLastStepStoppingPlaceOccupancy(MSStoppingPlace *sp)
Return the number of occupied places of the stopping place from the previous time step.
static std::map< std::string, MSTriggeredRerouter * > myInstances
bool applies(const SUMOTrafficObject &obj) const
Checks whether the detector measures objects of the given type.
bool myAmInUserMode
Information whether the current rerouting probability is the user-given.
static MSRailSignal * getRailSignal(const MSEdge *edge)
return railsignal at that edge or nullptr
const MSEdgeVector myEdges
edges where vehicles are notified
static MSEdge mySpecialDest_keepDestination
special destination values
RerouteInterval myParsedRerouteInterval
used during loading
double getProbability() const
Returns the rerouting probability.
std::vector< RerouteInterval > myIntervals
List of rerouting definition intervals.
void setUserMode(bool val)
Sets whether the process is currently steered by the user.
The class responsible for building and deletion of vehicles.
std::map< std::string, SUMOVehicle * >::const_iterator constVehIt
Definition of the internal vehicles map iterator.
constVehIt loadedVehBegin() const
Returns the begin of the internal vehicle map.
constVehIt loadedVehEnd() const
Returns the end of the internal vehicle map.
const std::set< std::string > getVTypeDistributionMembership(const std::string &id) const
Return the distribution IDs the vehicle type is a member of.
const MSCFModel & getCarFollowModel() const
Returns the vehicle type's car following model definition (const version)
const std::string & getOriginalID() const
Returns the id of the original vehicle type if this is a vehicle specific type, the id otherwise.
Base class for objects which have an id.
Definition Named.h:54
static std::string getIDSecure(const T *obj, const std::string &fallBack="NULL")
get an identifier for Named-like object which may be Null
Definition Named.h:67
const std::string & getID() const
Returns the id.
Definition Named.h:74
static OptionsCont & getOptions()
Retrieves the options.
A point in 2D or 3D with translation and scaling methods.
Definition Position.h:37
static const Position INVALID
used to indicate that a position is valid
Definition Position.h:323
double distanceTo(const Position &p2) const
returns the euclidean distance in 3 dimensions
Definition Position.h:263
static double rand(SumoRNG *rng=nullptr)
Returns a random real number in [0, 1)
Represents a generic random distribution.
double getOverallProb() const
Return the sum of the probabilites assigned to the members.
T get(SumoRNG *which=nullptr) const
Draw a sample of the distribution.
bool add(T val, double prob, bool checkDuplicates=true)
Adds a value with an assigned probability to the distribution.
const std::vector< T > & getVals() const
Returns the members of the distribution.
bool remove(T val)
Removes a value with an assigned probability from the distribution.
const std::vector< double > & getProbs() const
Returns the probabilities assigned to the members of the distribution.
virtual bool compute(const E *from, const E *to, const V *const vehicle, SUMOTime msTime, std::vector< const E * > &into, bool silent=false)=0
Builds the route between the given edges using the minimum effort at the given time The definition of...
virtual double recomputeCosts(const std::vector< const E * > &edges, const V *const v, SUMOTime msTime, double *lengthp=nullptr) const
Encapsulated SAX-Attributes.
T getOpt(int attr, const char *objectid, bool &ok, T defaultValue=T(), bool report=true) const
Tries to read given attribute assuming it is an int.
SUMOTime getOptSUMOTimeReporting(int attr, const char *objectid, bool &ok, SUMOTime defaultValue, bool report=true) const
Tries to read given attribute assuming it is a SUMOTime.
virtual std::string getStringSecure(int id, const std::string &def) const =0
Returns the string-value of the named (by its enum-value) attribute.
T get(int attr, const char *objectid, bool &ok, bool report=true) const
Tries to read given attribute assuming it is an int.
virtual bool hasAttribute(int id) const =0
Returns the information whether the named (by its enum-value) attribute is within the current list.
Representation of a vehicle, person, or container.
virtual bool isVehicle() const
Whether it is a vehicle.
virtual const MSVehicleType & getVehicleType() const =0
Returns the object's "vehicle" type.
virtual const MSLane * getLane() const =0
Returns the lane the object is currently at.
virtual const SUMOVTypeParameter & getVTypeParameter() const =0
Returns the object's "vehicle" type parameter.
virtual int getRNGIndex() const =0
virtual MSDevice * getDevice(const std::type_info &type) const =0
Returns a device of the given type if it exists or nullptr if not.
virtual bool replaceRoute(ConstMSRoutePtr route, const std::string &info, bool onInit=false, int offset=0, bool addStops=true, bool removeStops=true, std::string *msgReturn=nullptr)=0
Replaces the current route by the given one.
virtual SUMOTime getWaitingTime(const bool accumulated=false) const =0
virtual const SUMOVehicleParameter & getParameter() const =0
Returns the vehicle's parameter (including departure definition)
virtual double getMaxSpeed() const =0
Returns the object's maximum speed (minimum of technical and desired maximum speed)
virtual SUMOVehicleClass getVClass() const =0
Returns the object's access class.
virtual SumoRNG * getRNG() const =0
Returns the associated RNG for this object.
virtual Position getPosition(const double offset=0) const =0
Return current position (x/y, cartesian)
double getFloatParam(const std::string &paramName, const bool required=false, const double deflt=INVALID_DOUBLE, bool checkDist=true) const
Retrieve a floating point parameter for the traffic object.
virtual const std::set< NumericalID > getUpcomingEdgeIDs() const =0
returns the numerical IDs of edges to be used (possibly of future stages)
virtual const MSEdge * getEdge() const =0
Returns the edge the object is currently at.
virtual const MSEdge * getRerouteDestination() const =0
Returns the end point for reroutes (usually the last edge of the route)
virtual double getPositionOnLane() const =0
Get the object's position along the lane.
Representation of a vehicle.
Definition SUMOVehicle.h:62
virtual bool reroute(SUMOTime t, const std::string &info, SUMOAbstractRouter< MSEdge, SUMOVehicle > &router, const bool onInit=false, const bool withTaz=false, const bool silent=false, const MSEdge *sink=nullptr)=0
Performs a rerouting using the given router.
virtual SUMOTime sawBlockedParkingArea(const MSStoppingPlace *pa, bool local) const =0
virtual bool replaceRouteEdges(ConstMSEdgeVector &edges, double cost, double savings, const std::string &info, bool onInit=false, bool check=false, bool removeStops=true, std::string *msgReturn=nullptr)=0
Replaces the current route by the given edges.
virtual bool replaceParkingArea(MSParkingArea *parkingArea, std::string &errorMsg)=0
Replaces a stop.
virtual bool hasStops() const =0
Returns whether the vehicle has to stop somewhere.
virtual MSParkingArea * getNextParkingArea()=0
virtual void rememberParkingAreaScore(const MSStoppingPlace *pa, const std::string &score)=0
virtual void rememberBlockedParkingArea(const MSStoppingPlace *pa, bool local)=0
virtual double getLength() const =0
Returns the vehicles's length.
virtual int getNumberParkingReroutes() const =0
virtual const std::vector< MSTransportable * > & getPersons() const =0
retrieve riding persons
virtual void replaceParameter(const SUMOVehicleParameter *newParameter)=0
Replaces the vehicle's parameter.
virtual void resetParkingAreaScores()=0
virtual const MSStop & getNextStop() const =0
virtual void setArrivalPos(double arrivalPos)=0
Sets this vehicle's desired arrivalPos for its current route.
virtual const ConstMSEdgeVector::const_iterator & getCurrentRouteEdge() const =0
Returns an iterator pointing to the current edge in this vehicles route.
virtual void setNumberParkingReroutes(int value)=0
virtual const MSRoute & getRoute() const =0
Returns the current route.
Definition of vehicle stop (position and duration)
std::string lane
The lane to stop at.
std::string parkingarea
(Optional) parking area if one is assigned to the stop
double startPos
The stopping position start.
std::string chargingStation
(Optional) charging station if one is assigned to the stop
std::string overheadWireSegment
(Optional) overhead line segment if one is assigned to the stop
SUMOTime until
The time at which the vehicle may continue its journey.
double endPos
The stopping position end.
std::string busstop
(Optional) bus stop if one is assigned to the stop
std::string containerstop
(Optional) container stop if one is assigned to the stop
SUMOTime arrival
The (expected) time at which the vehicle reaches the stop.
SUMOTime duration
The stopping duration.
Structure representing possible vehicle parameter.
double arrivalPos
(optional) The position the vehicle shall arrive on
ArrivalPosDefinition arrivalPosProcedure
Information how the vehicle shall choose the arrival position.
A scoped lock which only triggers on condition.
std::vector< std::string > getVector()
return vector of strings
A wrapper for a Command function.
double sidingLength
The usable length of the siding.
MSEdgeVector main
The list of main edges (const and non-const for different usage)
double minSaving
The threshold in savings for triggering reroute.
MSEdgeVector siding
The list of siding edges.
MSRailSignal * sidingExit
The rail signal at the end of the siding.
SUMOTime begin
The begin time these definitions are valid.
RandomDistributor< MSStoppingPlaceRerouter::StoppingPlaceVisible > parkProbs
The distributions of new parking areas to use as destinations.
std::vector< MSStoppingPlaceRerouter::StoppingPlaceVisible > stopAlternatives
RandomDistributor< ConstMSRoutePtr > routeProbs
The distributions of new routes to use.
SUMOTime end
The end time these definitions are valid.
RandomDistributor< MSEdge * > edgeProbs
The distributions of new destinations or vias to use.
std::map< MSLane *, SVCPermissions > closedLanes
The list of closed lanes to their permissions.
bool isVia
The edge probs are vias and not destinations.
MSEdgeVector closedLanesAffected
The list of edges that are affected by closed lanes.
bool permissionsAllowAll
The permissions are all SVCAll.
std::map< MSEdge *, std::pair< SVCPermissions, double > > closed
The map of closed edges to their permissions and expected end of closing.
std::vector< OvertakeLocation > overtakeLocations