Line data Source code
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 : /****************************************************************************/
14 : /// @file MELoop.cpp
15 : /// @author Daniel Krajzewicz
16 : /// @date Tue, May 2005
17 : ///
18 : // The main mesocopic simulation loop
19 : /****************************************************************************/
20 : #include <config.h>
21 :
22 : #include <queue>
23 : #include <vector>
24 : #include <map>
25 : #include <cmath>
26 :
27 : #include <microsim/MSNet.h>
28 : #include <microsim/MSEdge.h>
29 : #include <microsim/MSGlobals.h>
30 : #include <microsim/MSLane.h>
31 : #include <microsim/MSVehicle.h>
32 : #include <microsim/MSVehicleControl.h>
33 : #include <utils/options/OptionsCont.h>
34 : #include <utils/common/ToString.h>
35 : #include <utils/common/FileHelpers.h>
36 : #include <utils/common/SUMOTime.h>
37 : #include <utils/common/RandHelper.h>
38 : #include "MELoop.h"
39 : #include "MESegment.h"
40 : #include "MEVehicle.h"
41 :
42 :
43 : // ===========================================================================
44 : // method definitions
45 : // ===========================================================================
46 5860 : MELoop::MELoop(const SUMOTime recheckInterval) : myFullRecheckInterval(recheckInterval), myLinkRecheckInterval(TIME2STEPS(1)) {
47 5860 : }
48 :
49 5762 : MELoop::~MELoop() {
50 291030 : for (std::vector<MESegment*>::const_iterator j = myEdges2FirstSegments.begin(); j != myEdges2FirstSegments.end(); ++j) {
51 914210 : for (MESegment* s = *j; s != nullptr;) {
52 : MESegment* n = s->getNextSegment();
53 628942 : delete s;
54 : s = n;
55 : }
56 : }
57 5762 : }
58 :
59 :
60 : void
61 12100233 : MELoop::simulate(SUMOTime tMax) {
62 43857253 : while (!myLeaderCars.empty()) {
63 42184541 : const SUMOTime time = myLeaderCars.begin()->first;
64 42184541 : std::vector<MEVehicle*> vehs = myLeaderCars[time];
65 : assert(time > tMax - DELTA_T || vehs.size() == 0);
66 42184541 : if (time > tMax) {
67 : return;
68 : }
69 : myLeaderCars.erase(time);
70 65730458 : for (std::vector<MEVehicle*>::const_iterator i = vehs.begin(); i != vehs.end(); ++i) {
71 33973438 : checkCar(*i);
72 : assert(myLeaderCars.empty() || myLeaderCars.begin()->first >= time);
73 : }
74 42184541 : }
75 : }
76 :
77 :
78 : SUMOTime
79 33988796 : MELoop::changeSegment(MEVehicle* veh, SUMOTime leaveTime, MESegment* const toSegment, MSMoveReminder::Notification reason, const bool ignoreLink) const {
80 33988796 : int qIdx = 0;
81 : MESegment* const onSegment = veh->getSegment();
82 : if (MESegment::isInvalid(toSegment)) {
83 663015 : if (veh->isStoppedTriggered()) {
84 2198 : return leaveTime + MAX2(SUMOTime(1), myLinkRecheckInterval);
85 : }
86 660817 : if (onSegment != nullptr) {
87 659211 : onSegment->send(veh, toSegment, qIdx, leaveTime, reason);
88 : } else {
89 4818 : WRITE_WARNINGF(TL("Vehicle '%' teleports beyond arrival edge '%', time=%."),
90 : veh->getID(), veh->getEdge()->getID(), time2string(leaveTime));
91 : }
92 660817 : veh->setSegment(toSegment); // signal arrival
93 660817 : MSNet::getInstance()->getVehicleControl().scheduleVehicleRemoval(veh);
94 660817 : return leaveTime;
95 33394115 : } else if (!MSGlobals::gCheckRoutes && !ignoreLink && !MESegment::isInvalid(onSegment) && &onSegment->getEdge() != &toSegment->getEdge() &&
96 29715 : veh->getEdge()->allowedLanes(*veh->succEdge(1), veh->getVClass()) == nullptr) {
97 26468 : if (veh->isStopped()) {
98 2 : veh->processStop();
99 : }
100 : return SUMOTime_MAX;
101 : }
102 33299313 : const SUMOTime entry = toSegment->hasSpaceFor(veh, leaveTime, qIdx);
103 33299313 : if (entry == leaveTime && (ignoreLink || veh->mayProceed())) {
104 23389785 : if (onSegment != nullptr) {
105 23389136 : if (veh->getQueIndex() == MESegment::PARKING_QUEUE) { // parking or just aborted parking
106 5399 : if (veh->isParking()) {
107 5138 : veh->processStop();
108 : }
109 5399 : veh->getEdge()->getLanes()[0]->removeParking(veh); // TODO for GUI only
110 : } else {
111 43903647 : onSegment->send(veh, toSegment, qIdx, leaveTime, onSegment->getNextSegment() == nullptr ? MSMoveReminder::NOTIFICATION_JUNCTION : MSMoveReminder::NOTIFICATION_SEGMENT);
112 : }
113 23389136 : toSegment->receive(veh, qIdx, leaveTime, false, ignoreLink, &onSegment->getEdge() != &toSegment->getEdge());
114 : } else {
115 1947 : WRITE_WARNINGF(TL("Vehicle '%' ends teleporting on edge '%':%, time=%."),
116 : veh->getID(), toSegment->getEdge().getID(), toSegment->getIndex(), time2string(leaveTime));
117 : // this is not quite correct but suffices for interrogation by
118 : // subsequent methods (veh->getSpeed() needs segment != 0)
119 649 : veh->setSegment(myEdges2FirstSegments[veh->getEdge()->getNumericalID()]);
120 : // clean up detectors (do not add traffic data)
121 : // note: updateDatector is not called if leaveTime == getLastEntryTime()
122 649 : veh->updateDetectors(veh->getLastEntryTime(), veh->getEventTime(), true, MSMoveReminder::NOTIFICATION_TELEPORT);
123 649 : toSegment->receive(veh, qIdx, leaveTime, false, true, true);
124 : }
125 23389785 : return entry;
126 : }
127 9909528 : if (entry == leaveTime && !ignoreLink) { // this is a long way of saying !veh->mayProceed() (which is a costly call)
128 8333580 : return entry + MAX2(SUMOTime(1), myLinkRecheckInterval);
129 : }
130 : return entry;
131 : }
132 :
133 :
134 : void
135 33973438 : MELoop::checkCar(MEVehicle* veh) {
136 : const SUMOTime leaveTime = veh->getEventTime();
137 : MESegment* const onSegment = veh->getSegment();
138 33973438 : MESegment* const toSegment = veh->getQueIndex() == MESegment::PARKING_QUEUE ? onSegment : nextSegment(onSegment, veh);
139 33973438 : const bool teleporting = (onSegment == nullptr); // is the vehicle currently teleporting?
140 : // @note reason is only evaluated if toSegment == nullptr
141 33973438 : const SUMOTime nextEntry = changeSegment(veh, leaveTime, toSegment, MSMoveReminder::NOTIFICATION_ARRIVED, teleporting);
142 33973438 : if (nextEntry == leaveTime) {
143 : return;
144 : }
145 9933104 : const bool r1 = MSGlobals::gTimeToGridlock > 0 && veh->getWaitingTime() > MSGlobals::gTimeToGridlock;
146 9933104 : const bool r3 = MSGlobals::gTimeToTeleportDisconnected >= 0 && veh->getWaitingTime() > MSGlobals::gTimeToTeleportDisconnected;
147 9933104 : if (!veh->isStopped() && (r1 || r3)) {
148 5867 : const bool disconnected = (MSGlobals::gTimeToTeleportDisconnected >= 0
149 1818 : && veh->succEdge(1) != nullptr
150 7685 : && veh->getEdge()->allowedLanes(*veh->succEdge(1), veh->getVClass()) == nullptr);
151 5867 : if ((r1 && !disconnected) || (r3 && disconnected)) {
152 4065 : teleportVehicle(veh, toSegment, disconnected);
153 4065 : return;
154 : }
155 : }
156 9929039 : if (veh->getBlockTime() == SUMOTime_MAX && !veh->isStopped()) {
157 : veh->setBlockTime(leaveTime);
158 : }
159 9929039 : if (nextEntry == SUMOTime_MAX) {
160 : // all usable queues on the next segment are full
161 1313144 : SUMOTime newEventTime = MAX3(toSegment->getEventTime() + 1, leaveTime + 1, leaveTime + myFullRecheckInterval);
162 1313144 : if (MSGlobals::gTimeToGridlock > 0) {
163 : // if teleporting is enabled, make sure we look at the vehicle when the gridlock-time is up
164 841065 : const SUMOTime recheck = MSGlobals::gTimeToTeleportDisconnected >= 0 ? MIN2(MSGlobals::gTimeToGridlock, MSGlobals::gTimeToTeleportDisconnected) : MSGlobals::gTimeToGridlock;
165 841065 : newEventTime = MAX2(MIN2(newEventTime, veh->getBlockTime() + recheck + 1), leaveTime + DELTA_T);
166 : }
167 : veh->setEventTime(newEventTime);
168 : } else {
169 : // receiving segment has recently received another vehicle or the junction is blocked
170 : veh->setEventTime(nextEntry);
171 : }
172 9929039 : addLeaderCar(veh, teleporting ? nullptr : onSegment->getLink(veh));
173 : }
174 :
175 :
176 : void
177 4065 : MELoop::teleportVehicle(MEVehicle* veh, MESegment* const toSegment, bool disconnected) {
178 : const SUMOTime leaveTime = veh->getEventTime();
179 : MESegment* const onSegment = veh->getSegment();
180 4065 : if (MSGlobals::gRemoveGridlocked) {
181 48 : WRITE_WARNINGF(TL("Teleporting vehicle '%'; waited too long, from edge '%':%, time=%."),
182 : veh->getID(), onSegment->getEdge().getID(), onSegment->getIndex(),
183 : time2string(leaveTime));
184 16 : MSNet::getInstance()->getVehicleControl().registerTeleportJam();
185 : int qIdx = 0;
186 16 : onSegment->send(veh, nullptr, qIdx, leaveTime, MSMoveReminder::NOTIFICATION_TELEPORT_ARRIVED);
187 16 : veh->setSegment(nullptr);
188 16 : MSNet::getInstance()->getVehicleControl().scheduleVehicleRemoval(veh);
189 16 : return;
190 : }
191 : const bool teleporting = (onSegment == nullptr); // is the vehicle already teleporting?
192 : // try to find a place on the current edge
193 4049 : MESegment* teleSegment = disconnected ? toSegment : toSegment->getNextSegment();
194 9139 : while (teleSegment != nullptr && changeSegment(veh, leaveTime, teleSegment, MSMoveReminder::NOTIFICATION_TELEPORT, true) != leaveTime) {
195 : // @caution the time to get to the next segment here is ignored XXX
196 : teleSegment = teleSegment->getNextSegment();
197 : }
198 4049 : if (teleSegment != nullptr) {
199 428 : if (!teleporting) {
200 : // we managed to teleport in a single jump
201 838 : const std::string reason = disconnected ? " (disconnected)" : "";
202 1272 : WRITE_WARNINGF(TL("Teleporting vehicle '%'; waited too long%, from edge '%':% to edge '%':%, time=%."),
203 : veh->getID(), reason, onSegment->getEdge().getID(), onSegment->getIndex(),
204 : teleSegment->getEdge().getID(), teleSegment->getIndex(), time2string(leaveTime));
205 424 : MSNet::getInstance()->getVehicleControl().registerTeleportJam();
206 : }
207 : } else {
208 : // teleport across the current edge and try insertion later
209 3621 : if (!teleporting) {
210 : int qIdx = 0;
211 : // announce start of multi-step teleport, arrival will be announced in changeSegment()
212 6801 : WRITE_WARNINGF(TL("Teleporting vehicle '%'; waited too long, from edge '%':%, time=%."),
213 : veh->getID(), onSegment->getEdge().getID(), onSegment->getIndex(), time2string(leaveTime));
214 2267 : MSNet::getInstance()->getVehicleControl().registerTeleportJam();
215 : // remove from current segment
216 2267 : onSegment->send(veh, nullptr, qIdx, leaveTime, MSMoveReminder::NOTIFICATION_TELEPORT);
217 : // mark veh as teleporting
218 2267 : veh->setSegment(nullptr);
219 : }
220 : // @caution microsim uses current travel time teleport duration
221 10863 : const SUMOTime teleArrival = leaveTime + TIME2STEPS(veh->getEdge()->getLength() / MAX2(veh->getEdge()->getSpeedLimit(), NUMERICAL_EPS));
222 3621 : const bool atDest = veh->moveRoutePointer();
223 3621 : if (atDest) {
224 : // teleporting to end of route
225 1606 : changeSegment(veh, teleArrival, nullptr, MSMoveReminder::NOTIFICATION_TELEPORT_ARRIVED, true);
226 : } else {
227 : veh->setEventTime(teleArrival);
228 2015 : addLeaderCar(veh, nullptr);
229 : // teleporting vehicles must react to rerouters
230 2015 : getSegmentForEdge(*veh->getEdge())->addReminders(veh);
231 2015 : veh->activateReminders(MSMoveReminder::NOTIFICATION_JUNCTION);
232 : }
233 : }
234 : }
235 :
236 :
237 : void
238 33981173 : MELoop::addLeaderCar(MEVehicle* veh, MSLink* link) {
239 33981173 : myLeaderCars[veh->getEventTime()].push_back(veh);
240 33981173 : veh->setApproaching(link);
241 33981173 : }
242 :
243 :
244 : void
245 2 : MELoop::clearState() {
246 : myLeaderCars.clear();
247 2 : }
248 :
249 :
250 : bool
251 8570 : MELoop::removeLeaderCar(MEVehicle* v) {
252 8570 : const auto candIt = myLeaderCars.find(v->getEventTime());
253 8570 : if (candIt != myLeaderCars.end()) {
254 2421 : std::vector<MEVehicle*>& cands = candIt->second;
255 2421 : auto it = find(cands.begin(), cands.end(), v);
256 2421 : if (it != cands.end()) {
257 : cands.erase(it);
258 : return true;
259 : }
260 : }
261 : return false;
262 : }
263 :
264 :
265 : void
266 0 : MELoop::vaporizeCar(MEVehicle* v, MSMoveReminder::Notification reason) {
267 : int qIdx = 0;
268 0 : v->getSegment()->send(v, nullptr, qIdx, MSNet::getInstance()->getCurrentTimeStep(), reason);
269 0 : removeLeaderCar(v);
270 0 : }
271 :
272 :
273 : MESegment*
274 33780544 : MELoop::nextSegment(MESegment* s, MEVehicle* v) {
275 33780544 : if (s != nullptr) { // vehicle is not teleporting
276 : MESegment* next = s->getNextSegment();
277 33778539 : if (next != nullptr) {
278 : // ok, the street continues
279 : return next;
280 : }
281 : }
282 : // we have to check the next edge in the vehicle's route
283 12718160 : const MSEdge* nextEdge = v->succEdge(1);
284 12718160 : if (nextEdge == nullptr) {
285 : // end of route
286 : return nullptr;
287 : }
288 12064985 : return myEdges2FirstSegments[nextEdge->getNumericalID()];
289 : }
290 :
291 :
292 : int
293 425052 : MELoop::numSegmentsFor(const double length, const double sLength) {
294 425052 : int no = (int)floor(length / sLength + 0.5);
295 425052 : if (no == 0) { // assure there is at least one segment
296 : return 1;
297 : } else {
298 177573 : return no;
299 : }
300 : }
301 :
302 :
303 : void
304 287926 : MELoop::buildSegmentsFor(const MSEdge& e, const OptionsCont& oc) {
305 287926 : const MESegment::MesoEdgeType& edgeType = MSNet::getInstance()->getMesoType(e.getEdgeType());
306 : const double length = e.getLength();
307 287926 : const int numSegments = numSegmentsFor(length, oc.getFloat("meso-edgelength"));
308 287926 : const double slength = length / (double)numSegments;
309 : MESegment* newSegment = nullptr;
310 : MESegment* nextSegment = nullptr;
311 287926 : const bool laneQueue = oc.getBool("meso-lane-queue");
312 559492 : bool multiQueue = laneQueue || (oc.getBool("meso-multi-queue") && e.getLanes().size() > 1 && e.getNumSuccessors() > 1);
313 921775 : for (int s = numSegments - 1; s >= 0; s--) {
314 1267698 : std::string id = e.getID() + ":" + toString(s);
315 633849 : newSegment = new MESegment(id, e, nextSegment, slength, e.getLanes()[0]->getSpeedLimit(), s, multiQueue, edgeType);
316 : multiQueue = laneQueue;
317 : nextSegment = newSegment;
318 : }
319 575852 : while (e.getNumericalID() >= static_cast<int>(myEdges2FirstSegments.size())) {
320 287926 : myEdges2FirstSegments.push_back(0);
321 : }
322 287926 : myEdges2FirstSegments[e.getNumericalID()] = newSegment;
323 287926 : }
324 :
325 :
326 : void
327 613 : MELoop::updateSegmentsForEdge(const MSEdge& e) {
328 613 : if (e.getNumericalID() < (int)myEdges2FirstSegments.size()) {
329 613 : const MESegment::MesoEdgeType& edgeType = MSNet::getInstance()->getMesoType(e.getEdgeType());
330 613 : MESegment* s = myEdges2FirstSegments[e.getNumericalID()];
331 1691 : while (s != nullptr) {
332 1078 : s->initSegment(edgeType, e, s->getCapacity());
333 : s = s->getNextSegment();
334 : }
335 : }
336 613 : }
337 :
338 :
339 : MESegment*
340 55255551 : MELoop::getSegmentForEdge(const MSEdge& e, double pos) {
341 55255551 : if (e.getNumericalID() >= (int)myEdges2FirstSegments.size()) {
342 : return nullptr;
343 : }
344 55255531 : MESegment* s = myEdges2FirstSegments[e.getNumericalID()];
345 55255531 : if (pos > 0) {
346 : double cpos = 0;
347 833677 : while (s->getNextSegment() != nullptr && cpos + s->getLength() < pos) {
348 : cpos += s->getLength();
349 : s = s->getNextSegment();
350 : }
351 : }
352 : return s;
353 : }
354 :
355 :
356 : bool
357 209402 : MELoop::isEnteringRoundabout(const MSEdge& e) {
358 441432 : for (const MSEdge* succ : e.getSuccessors()) {
359 232042 : if (succ->isRoundabout()) {
360 : return true;
361 : }
362 : }
363 : return false;
364 : }
365 :
366 :
367 : /****************************************************************************/
|
