Eclipse SUMO - Simulation of Urban MObility
Loading...
Searching...
No Matches
MSVehicle.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/****************************************************************************/
31// Representation of a vehicle in the micro simulation
32/****************************************************************************/
33#include <config.h>
34
35#include <iostream>
36#include <cassert>
37#include <cmath>
38#include <cstdlib>
39#include <algorithm>
40#include <map>
41#include <memory>
71#include "MSEdgeControl.h"
72#include "MSVehicleControl.h"
73#include "MSInsertionControl.h"
74#include "MSVehicleTransfer.h"
75#include "MSGlobals.h"
76#include "MSJunctionLogic.h"
77#include "MSStop.h"
78#include "MSStoppingPlace.h"
79#include "MSParkingArea.h"
80#include "MSMoveReminder.h"
81#include "MSLane.h"
82#include "MSJunction.h"
83#include "MSEdge.h"
84#include "MSVehicleType.h"
85#include "MSNet.h"
86#include "MSRoute.h"
87#include "MSLeaderInfo.h"
88#include "MSDriverState.h"
89#include "MSVehicle.h"
90
91
92//#define DEBUG_PLAN_MOVE
93//#define DEBUG_PLAN_MOVE_LEADERINFO
94//#define DEBUG_CHECKREWINDLINKLANES
95//#define DEBUG_EXEC_MOVE
96//#define DEBUG_FURTHER
97//#define DEBUG_SETFURTHER
98//#define DEBUG_TARGET_LANE
99//#define DEBUG_STOPS
100//#define DEBUG_BESTLANES
101//#define DEBUG_IGNORE_RED
102//#define DEBUG_ACTIONSTEPS
103//#define DEBUG_NEXT_TURN
104//#define DEBUG_TRACI
105//#define DEBUG_REVERSE_BIDI
106//#define DEBUG_EXTRAPOLATE_DEPARTPOS
107//#define DEBUG_REMOTECONTROL
108//#define DEBUG_MOVEREMINDERS
109//#define DEBUG_COND (getID() == "ego")
110//#define DEBUG_COND (true)
111#define DEBUG_COND (isSelected())
112//#define DEBUG_COND2(obj) (obj->getID() == "ego")
113#define DEBUG_COND2(obj) (obj->isSelected())
114
115//#define PARALLEL_STOPWATCH
116
117
118#define STOPPING_PLACE_OFFSET 0.5
119
120#define CRLL_LOOK_AHEAD 5
121
122#define JUNCTION_BLOCKAGE_TIME 5 // s
123
124// @todo Calibrate with real-world values / make configurable
125#define DIST_TO_STOPLINE_EXPECT_PRIORITY 1.0
126
127#define NUMERICAL_EPS_SPEED (0.1 * NUMERICAL_EPS * TS)
128
129// ===========================================================================
130// static value definitions
131// ===========================================================================
132std::vector<MSLane*> MSVehicle::myEmptyLaneVector;
133
134
135// ===========================================================================
136// method definitions
137// ===========================================================================
138/* -------------------------------------------------------------------------
139 * methods of MSVehicle::State
140 * ----------------------------------------------------------------------- */
142 myPos = state.myPos;
143 mySpeed = state.mySpeed;
144 myPosLat = state.myPosLat;
145 myBackPos = state.myBackPos;
148}
149
150
153 myPos = state.myPos;
154 mySpeed = state.mySpeed;
155 myPosLat = state.myPosLat;
156 myBackPos = state.myBackPos;
157 myPreviousSpeed = state.myPreviousSpeed;
158 myLastCoveredDist = state.myLastCoveredDist;
159 return *this;
160}
161
162
163bool
165 return (myPos != state.myPos ||
166 mySpeed != state.mySpeed ||
167 myPosLat != state.myPosLat ||
168 myLastCoveredDist != state.myLastCoveredDist ||
169 myPreviousSpeed != state.myPreviousSpeed ||
170 myBackPos != state.myBackPos);
171}
172
173
174MSVehicle::State::State(double pos, double speed, double posLat, double backPos, double previousSpeed) :
175 myPos(pos), mySpeed(speed), myPosLat(posLat), myBackPos(backPos), myPreviousSpeed(previousSpeed), myLastCoveredDist(SPEED2DIST(speed)) {}
176
177
178
179/* -------------------------------------------------------------------------
180 * methods of MSVehicle::WaitingTimeCollector
181 * ----------------------------------------------------------------------- */
183
184
187 assert(memorySpan <= myMemorySize);
188 if (memorySpan == -1) {
189 memorySpan = myMemorySize;
190 }
191 SUMOTime totalWaitingTime = 0;
192 for (const auto& interval : myWaitingIntervals) {
193 if (interval.second >= memorySpan) {
194 if (interval.first >= memorySpan) {
195 break;
196 } else {
197 totalWaitingTime += memorySpan - interval.first;
198 }
199 } else {
200 totalWaitingTime += interval.second - interval.first;
201 }
202 }
203 return totalWaitingTime;
204}
205
206
207void
209 auto i = myWaitingIntervals.begin();
210 const auto end = myWaitingIntervals.end();
211 const bool startNewInterval = i == end || (i->first != 0);
212 while (i != end) {
213 i->first += dt;
214 if (i->first >= myMemorySize) {
215 break;
216 }
217 i->second += dt;
218 i++;
219 }
220
221 // remove intervals beyond memorySize
222 auto d = std::distance(i, end);
223 while (d > 0) {
224 myWaitingIntervals.pop_back();
225 d--;
226 }
227
228 if (!waiting) {
229 return;
230 } else if (!startNewInterval) {
231 myWaitingIntervals.begin()->first = 0;
232 } else {
233 myWaitingIntervals.push_front(std::make_pair(0, dt));
234 }
235 return;
236}
237
238
239const std::string
241 std::ostringstream state;
242 state << myMemorySize << " " << myWaitingIntervals.size();
243 for (const auto& interval : myWaitingIntervals) {
244 state << " " << interval.first << " " << interval.second;
245 }
246 return state.str();
247}
248
249
250void
252 std::istringstream is(state);
253 int numIntervals;
254 SUMOTime begin, end;
255 is >> myMemorySize >> numIntervals;
256 while (numIntervals-- > 0) {
257 is >> begin >> end;
258 myWaitingIntervals.emplace_back(begin, end);
259 }
260}
261
262
263/* -------------------------------------------------------------------------
264 * methods of MSVehicle::Influencer::GapControlState
265 * ----------------------------------------------------------------------- */
266void
268// std::cout << "GapControlVehStateListener::vehicleStateChanged() vehicle=" << vehicle->getID() << ", to=" << to << std::endl;
269 switch (to) {
273 // Vehicle left road
274// Look up reference vehicle in refVehMap and in case deactivate corresponding gap control
275 const MSVehicle* msVeh = static_cast<const MSVehicle*>(vehicle);
276// std::cout << "GapControlVehStateListener::vehicleStateChanged() vehicle=" << vehicle->getID() << " left the road." << std::endl;
277 if (GapControlState::refVehMap.find(msVeh) != end(GapControlState::refVehMap)) {
278// std::cout << "GapControlVehStateListener::deactivating ref vehicle=" << vehicle->getID() << std::endl;
279 GapControlState::refVehMap[msVeh]->deactivate();
280 }
281 }
282 break;
283 default:
284 {};
285 // do nothing, vehicle still on road
286 }
287}
288
289std::map<const MSVehicle*, MSVehicle::Influencer::GapControlState*>
291
293
295 tauOriginal(-1), tauCurrent(-1), tauTarget(-1), addGapCurrent(-1), addGapTarget(-1),
296 remainingDuration(-1), changeRate(-1), maxDecel(-1), referenceVeh(nullptr), active(false), gapAttained(false), prevLeader(nullptr),
297 lastUpdate(-1), timeHeadwayIncrement(0.0), spaceHeadwayIncrement(0.0) {}
298
299
303
304void
306 if (MSNet::hasInstance()) {
307 if (myVehStateListener == nullptr) {
308 //std::cout << "GapControlState::init()" << std::endl;
309 myVehStateListener = new GapControlVehStateListener();
310 MSNet::getInstance()->addVehicleStateListener(myVehStateListener);
311 }
312 } else {
313 WRITE_ERROR("MSVehicle::Influencer::GapControlState::init(): No MSNet instance found!")
314 }
315}
316
317void
319 if (myVehStateListener != nullptr) {
320 MSNet::getInstance()->removeVehicleStateListener(myVehStateListener);
321 delete myVehStateListener;
322 myVehStateListener = nullptr;
323 }
324}
325
326void
327MSVehicle::Influencer::GapControlState::activate(double tauOrig, double tauNew, double additionalGap, double dur, double rate, double decel, const MSVehicle* refVeh) {
329 WRITE_ERROR(TL("No gap control available for meso."))
330 } else {
331 // always deactivate control before activating (triggers clean-up of refVehMap)
332// std::cout << "activate gap control with refVeh=" << (refVeh==nullptr? "NULL" : refVeh->getID()) << std::endl;
333 tauOriginal = tauOrig;
334 tauCurrent = tauOrig;
335 tauTarget = tauNew;
336 addGapCurrent = 0.0;
337 addGapTarget = additionalGap;
338 remainingDuration = dur;
339 changeRate = rate;
340 maxDecel = decel;
341 referenceVeh = refVeh;
342 active = true;
343 gapAttained = false;
344 prevLeader = nullptr;
345 lastUpdate = SIMSTEP - DELTA_T;
346 timeHeadwayIncrement = changeRate * TS * (tauTarget - tauOriginal);
347 spaceHeadwayIncrement = changeRate * TS * addGapTarget;
348
349 if (referenceVeh != nullptr) {
350 // Add refVeh to refVehMap
351 GapControlState::refVehMap[referenceVeh] = this;
352 }
353 }
354}
355
356void
358 active = false;
359 if (referenceVeh != nullptr) {
360 // Remove corresponding refVehMapEntry if appropriate
361 GapControlState::refVehMap.erase(referenceVeh);
362 referenceVeh = nullptr;
363 }
364}
365
366
367/* -------------------------------------------------------------------------
368 * methods of MSVehicle::Influencer
369 * ----------------------------------------------------------------------- */
391
392
394
395void
397 GapControlState::init();
398}
399
400void
402 GapControlState::cleanup();
403}
404
405void
406MSVehicle::Influencer::setSpeedTimeLine(const std::vector<std::pair<SUMOTime, double> >& speedTimeLine) {
407 mySpeedAdaptationStarted = true;
408 mySpeedTimeLine = speedTimeLine;
409}
410
411void
412MSVehicle::Influencer::activateGapController(double originalTau, double newTimeHeadway, double newSpaceHeadway, double duration, double changeRate, double maxDecel, MSVehicle* refVeh) {
413 if (myGapControlState == nullptr) {
414 myGapControlState = std::make_shared<GapControlState>();
415 init(); // only does things on first call
416 }
417 myGapControlState->activate(originalTau, newTimeHeadway, newSpaceHeadway, duration, changeRate, maxDecel, refVeh);
418}
419
420void
422 if (myGapControlState != nullptr && myGapControlState->active) {
423 myGapControlState->deactivate();
424 }
425}
426
427void
428MSVehicle::Influencer::setLaneTimeLine(const std::vector<std::pair<SUMOTime, int> >& laneTimeLine) {
429 myLaneTimeLine = laneTimeLine;
430}
431
432
433void
435 for (auto& item : myLaneTimeLine) {
436 item.second += indexShift;
437 }
438}
439
440
441void
443 myLatDist = latDist;
444}
445
446int
448 return (1 * myConsiderSafeVelocity +
449 2 * myConsiderMaxAcceleration +
450 4 * myConsiderMaxDeceleration +
451 8 * myRespectJunctionPriority +
452 16 * myEmergencyBrakeRedLight +
453 32 * !myRespectJunctionLeaderPriority + // inverted!
454 64 * !myConsiderSpeedLimit // inverted!
455 );
456}
457
458
459int
461 return (1 * myStrategicLC +
462 4 * myCooperativeLC +
463 16 * mySpeedGainLC +
464 64 * myRightDriveLC +
465 256 * myTraciLaneChangePriority +
466 1024 * mySublaneLC);
467}
468
471 SUMOTime duration = -1;
472 for (std::vector<std::pair<SUMOTime, int>>::iterator i = myLaneTimeLine.begin(); i != myLaneTimeLine.end(); ++i) {
473 if (duration < 0) {
474 duration = i->first;
475 } else {
476 duration -= i->first;
477 }
478 }
479 return -duration;
480}
481
484 if (!myLaneTimeLine.empty()) {
485 return myLaneTimeLine.back().first;
486 } else {
487 return -1;
488 }
489}
490
491
492double
493MSVehicle::Influencer::influenceSpeed(SUMOTime currentTime, double speed, double vSafe, double vMin, double vMax) {
494 // remove leading commands which are no longer valid
495 while (mySpeedTimeLine.size() == 1 || (mySpeedTimeLine.size() > 1 && currentTime > mySpeedTimeLine[1].first)) {
496 mySpeedTimeLine.erase(mySpeedTimeLine.begin());
497 }
498
499 if (!(mySpeedTimeLine.size() < 2 || currentTime < mySpeedTimeLine[0].first)) {
500 // Speed advice is active -> compute new speed according to speedTimeLine
501 if (!mySpeedAdaptationStarted) {
502 mySpeedTimeLine[0].second = speed;
503 mySpeedAdaptationStarted = true;
504 }
505 currentTime += DELTA_T;
506 const double td = STEPS2TIME(currentTime - mySpeedTimeLine[0].first) / MAX2(TS, STEPS2TIME(mySpeedTimeLine[1].first - mySpeedTimeLine[0].first));
507
508 speed = mySpeedTimeLine[0].second - (mySpeedTimeLine[0].second - mySpeedTimeLine[1].second) * td;
509 if (myConsiderSafeVelocity) {
510 speed = MIN2(speed, vSafe);
511 }
512 if (myConsiderMaxAcceleration) {
513 speed = MIN2(speed, vMax);
514 }
515 if (myConsiderMaxDeceleration) {
516 speed = MAX2(speed, vMin);
517 }
518 }
519 return speed;
520}
521
522double
523MSVehicle::Influencer::gapControlSpeed(SUMOTime currentTime, const SUMOVehicle* veh, double speed, double vSafe, double vMin, double vMax) {
524#ifdef DEBUG_TRACI
525 if DEBUG_COND2(veh) {
526 std::cout << currentTime << " Influencer::gapControlSpeed(): speed=" << speed
527 << ", vSafe=" << vSafe
528 << ", vMin=" << vMin
529 << ", vMax=" << vMax
530 << std::endl;
531 }
532#endif
533 double gapControlSpeed = speed;
534 if (myGapControlState != nullptr && myGapControlState->active) {
535 // Determine leader and the speed that would be chosen by the gap controller
536 const double currentSpeed = veh->getSpeed();
537 const MSVehicle* msVeh = dynamic_cast<const MSVehicle*>(veh);
538 assert(msVeh != nullptr);
539 const double desiredTargetTimeSpacing = myGapControlState->tauTarget * currentSpeed;
540 std::pair<const MSVehicle*, double> leaderInfo;
541 if (myGapControlState->referenceVeh == nullptr) {
542 // No reference vehicle specified -> use current leader as reference
543 const double brakeGap = msVeh->getBrakeGap(true);
544 leaderInfo = msVeh->getLeader(MAX2(desiredTargetTimeSpacing, myGapControlState->addGapCurrent) + MAX2(brakeGap, 20.0));
545#ifdef DEBUG_TRACI
546 if DEBUG_COND2(veh) {
547 std::cout << " --- no refVeh; myGapControlState->addGapCurrent: " << myGapControlState->addGapCurrent << ", brakeGap: " << brakeGap << " in simstep: " << SIMSTEP << std::endl;
548 }
549#endif
550 } else {
551 // Control gap wrt reference vehicle
552 const MSVehicle* leader = myGapControlState->referenceVeh;
553 double dist = msVeh->getDistanceToPosition(leader->getPositionOnLane(), leader->getLane()) - leader->getLength();
554 if (dist > 100000) {
555 // Reference vehicle was not found downstream the ego's route
556 // Maybe, it is behind the ego vehicle
557 dist = - leader->getDistanceToPosition(msVeh->getPositionOnLane(), msVeh->getLane()) - leader->getLength();
558#ifdef DEBUG_TRACI
559 if DEBUG_COND2(veh) {
560 if (dist < -100000) {
561 // also the ego vehicle is not ahead of the reference vehicle -> no CF-relation
562 std::cout << " Ego and reference vehicle are not in CF relation..." << std::endl;
563 } else {
564 std::cout << " Reference vehicle is behind ego..." << std::endl;
565 }
566 }
567#endif
568 }
569 leaderInfo = std::make_pair(leader, dist - msVeh->getVehicleType().getMinGap());
570 }
571 const double fakeDist = MAX2(0.0, leaderInfo.second - myGapControlState->addGapCurrent);
572#ifdef DEBUG_TRACI
573 if DEBUG_COND2(veh) {
574 const double desiredCurrentSpacing = myGapControlState->tauCurrent * currentSpeed;
575 std::cout << " Gap control active:"
576 << " currentSpeed=" << currentSpeed
577 << ", desiredTargetTimeSpacing=" << desiredTargetTimeSpacing
578 << ", desiredCurrentSpacing=" << desiredCurrentSpacing
579 << ", leader=" << (leaderInfo.first == nullptr ? "NULL" : leaderInfo.first->getID())
580 << ", dist=" << leaderInfo.second
581 << ", fakeDist=" << fakeDist
582 << ",\n tauOriginal=" << myGapControlState->tauOriginal
583 << ", tauTarget=" << myGapControlState->tauTarget
584 << ", tauCurrent=" << myGapControlState->tauCurrent
585 << std::endl;
586 }
587#endif
588 if (leaderInfo.first != nullptr) {
589 if (myGapControlState->prevLeader != nullptr && myGapControlState->prevLeader != leaderInfo.first) {
590 // TODO: The leader changed. What to do?
591 }
592 // Remember leader
593 myGapControlState->prevLeader = leaderInfo.first;
594
595 // Calculate desired following speed assuming the alternative headway time
596 MSCFModel* cfm = (MSCFModel*) & (msVeh->getVehicleType().getCarFollowModel());
597 const double origTau = cfm->getHeadwayTime();
598 cfm->setHeadwayTime(myGapControlState->tauCurrent);
599 gapControlSpeed = MIN2(gapControlSpeed,
600 cfm->followSpeed(msVeh, currentSpeed, fakeDist, leaderInfo.first->getSpeed(), leaderInfo.first->getCurrentApparentDecel(), leaderInfo.first));
601 cfm->setHeadwayTime(origTau);
602#ifdef DEBUG_TRACI
603 if DEBUG_COND2(veh) {
604 std::cout << " -> gapControlSpeed=" << gapControlSpeed;
605 if (myGapControlState->maxDecel > 0) {
606 std::cout << ", with maxDecel bound: " << MAX2(gapControlSpeed, currentSpeed - TS * myGapControlState->maxDecel);
607 }
608 std::cout << std::endl;
609 }
610#endif
611 if (myGapControlState->maxDecel > 0) {
612 gapControlSpeed = MAX2(gapControlSpeed, currentSpeed - TS * myGapControlState->maxDecel);
613 }
614 }
615
616 // Update gap controller
617 // Check (1) if the gap control has established the desired gap,
618 // and (2) if it has maintained active for the given duration afterwards
619 if (myGapControlState->lastUpdate < currentTime) {
620#ifdef DEBUG_TRACI
621 if DEBUG_COND2(veh) {
622 std::cout << " Updating GapControlState." << std::endl;
623 }
624#endif
625 if (myGapControlState->tauCurrent == myGapControlState->tauTarget && myGapControlState->addGapCurrent == myGapControlState->addGapTarget) {
626 if (!myGapControlState->gapAttained) {
627 // Check if the desired gap was established (add the POSITION_EPS to avoid infinite asymptotic behavior without having established the gap)
628 myGapControlState->gapAttained = leaderInfo.first == nullptr || leaderInfo.second > MAX2(desiredTargetTimeSpacing, myGapControlState->addGapTarget) - POSITION_EPS;
629#ifdef DEBUG_TRACI
630 if DEBUG_COND2(veh) {
631 if (myGapControlState->gapAttained) {
632 std::cout << " Target gap was established." << std::endl;
633 }
634 }
635#endif
636 } else {
637 // Count down remaining time if desired gap was established
638 myGapControlState->remainingDuration -= TS;
639#ifdef DEBUG_TRACI
640 if DEBUG_COND2(veh) {
641 std::cout << " Gap control remaining duration: " << myGapControlState->remainingDuration << std::endl;
642 }
643#endif
644 if (myGapControlState->remainingDuration <= 0) {
645#ifdef DEBUG_TRACI
646 if DEBUG_COND2(veh) {
647 std::cout << " Gap control duration expired, deactivating control." << std::endl;
648 }
649#endif
650 // switch off gap control
651 myGapControlState->deactivate();
652 }
653 }
654 } else {
655 // Adjust current headway values
656 myGapControlState->tauCurrent = MIN2(myGapControlState->tauCurrent + myGapControlState->timeHeadwayIncrement, myGapControlState->tauTarget);
657 myGapControlState->addGapCurrent = MIN2(myGapControlState->addGapCurrent + myGapControlState->spaceHeadwayIncrement, myGapControlState->addGapTarget);
658 }
659 }
660 if (myConsiderSafeVelocity) {
661 gapControlSpeed = MIN2(gapControlSpeed, vSafe);
662 }
663 if (myConsiderMaxAcceleration) {
664 gapControlSpeed = MIN2(gapControlSpeed, vMax);
665 }
666 if (myConsiderMaxDeceleration) {
667 gapControlSpeed = MAX2(gapControlSpeed, vMin);
668 }
669 return MIN2(speed, gapControlSpeed);
670 } else {
671 return speed;
672 }
673}
674
675double
677 return myOriginalSpeed;
678}
679
680void
682 myOriginalSpeed = speed;
683}
684
685
686int
687MSVehicle::Influencer::influenceChangeDecision(const SUMOTime currentTime, const MSEdge& currentEdge, const int currentLaneIndex, int state) {
688 // remove leading commands which are no longer valid
689 while (myLaneTimeLine.size() == 1 || (myLaneTimeLine.size() > 1 && currentTime > myLaneTimeLine[1].first)) {
690 myLaneTimeLine.erase(myLaneTimeLine.begin());
691 }
692 ChangeRequest changeRequest = REQUEST_NONE;
693 // do nothing if the time line does not apply for the current time
694 if (myLaneTimeLine.size() >= 2 && currentTime >= myLaneTimeLine[0].first) {
695 const int destinationLaneIndex = myLaneTimeLine[1].second;
696 if (destinationLaneIndex < (int)currentEdge.getLanes().size()) {
697 if (currentLaneIndex > destinationLaneIndex) {
698 changeRequest = REQUEST_RIGHT;
699 } else if (currentLaneIndex < destinationLaneIndex) {
700 changeRequest = REQUEST_LEFT;
701 } else {
702 changeRequest = REQUEST_HOLD;
703 }
704 } else if (currentEdge.getLanes().back()->getOpposite() != nullptr) { // change to opposite direction driving
705 changeRequest = REQUEST_LEFT;
706 state = state | LCA_TRACI;
707 }
708 }
709 // check whether the current reason shall be canceled / overridden
710 if ((state & LCA_WANTS_LANECHANGE_OR_STAY) != 0) {
711 // flags for the current reason
713 if ((state & LCA_TRACI) != 0 && myLatDist != 0) {
714 // security checks
715 if ((myTraciLaneChangePriority == LCP_ALWAYS)
716 || (myTraciLaneChangePriority == LCP_NOOVERLAP && (state & LCA_OVERLAPPING) == 0)) {
717 state &= ~(LCA_BLOCKED | LCA_OVERLAPPING);
718 }
719 // continue sublane change manoeuvre
720 return state;
721 } else if ((state & LCA_STRATEGIC) != 0) {
722 mode = myStrategicLC;
723 } else if ((state & LCA_COOPERATIVE) != 0) {
724 mode = myCooperativeLC;
725 } else if ((state & LCA_SPEEDGAIN) != 0) {
726 mode = mySpeedGainLC;
727 } else if ((state & LCA_KEEPRIGHT) != 0) {
728 mode = myRightDriveLC;
729 } else if ((state & LCA_SUBLANE) != 0) {
730 mode = mySublaneLC;
731 } else if ((state & LCA_TRACI) != 0) {
732 mode = LC_NEVER;
733 } else {
734 WRITE_WARNINGF(TL("Lane change model did not provide a reason for changing (state=%, time=%\n"), toString(state), time2string(currentTime));
735 }
736 if (mode == LC_NEVER) {
737 // cancel all lcModel requests
738 state &= ~LCA_WANTS_LANECHANGE_OR_STAY;
739 state &= ~LCA_URGENT;
740 if (changeRequest == REQUEST_NONE) {
741 // also remove all reasons except TRACI
742 state &= ~LCA_CHANGE_REASONS | LCA_TRACI;
743 }
744 } else if (mode == LC_NOCONFLICT && changeRequest != REQUEST_NONE) {
745 if (
746 ((state & LCA_LEFT) != 0 && changeRequest != REQUEST_LEFT) ||
747 ((state & LCA_RIGHT) != 0 && changeRequest != REQUEST_RIGHT) ||
748 ((state & LCA_STAY) != 0 && changeRequest != REQUEST_HOLD)) {
749 // cancel conflicting lcModel request
750 state &= ~LCA_WANTS_LANECHANGE_OR_STAY;
751 state &= ~LCA_URGENT;
752 }
753 } else if (mode == LC_ALWAYS) {
754 // ignore any TraCI requests
755 return state;
756 }
757 }
758 // apply traci requests
759 if (changeRequest == REQUEST_NONE) {
760 return state;
761 } else {
762 state |= LCA_TRACI;
763 // security checks
764 if ((myTraciLaneChangePriority == LCP_ALWAYS)
765 || (myTraciLaneChangePriority == LCP_NOOVERLAP && (state & LCA_OVERLAPPING) == 0)) {
766 state &= ~(LCA_BLOCKED | LCA_OVERLAPPING);
767 }
768 if (changeRequest != REQUEST_HOLD && myTraciLaneChangePriority != LCP_OPPORTUNISTIC) {
769 state |= LCA_URGENT;
770 }
771 switch (changeRequest) {
772 case REQUEST_HOLD:
773 return state | LCA_STAY;
774 case REQUEST_LEFT:
775 return state | LCA_LEFT;
776 case REQUEST_RIGHT:
777 return state | LCA_RIGHT;
778 default:
779 throw ProcessError(TL("should not happen"));
780 }
781 }
782}
783
784
785double
787 assert(myLaneTimeLine.size() >= 2);
788 assert(currentTime >= myLaneTimeLine[0].first);
789 return STEPS2TIME(myLaneTimeLine[1].first - currentTime);
790}
791
792
793void
795 myConsiderSafeVelocity = ((speedMode & 1) != 0);
796 myConsiderMaxAcceleration = ((speedMode & 2) != 0);
797 myConsiderMaxDeceleration = ((speedMode & 4) != 0);
798 myRespectJunctionPriority = ((speedMode & 8) != 0);
799 myEmergencyBrakeRedLight = ((speedMode & 16) != 0);
800 myRespectJunctionLeaderPriority = ((speedMode & 32) == 0); // inverted!
801 myConsiderSpeedLimit = ((speedMode & 64) == 0); // inverted!
802}
803
804
805void
807 myStrategicLC = (LaneChangeMode)(value & (1 + 2));
808 myCooperativeLC = (LaneChangeMode)((value & (4 + 8)) >> 2);
809 mySpeedGainLC = (LaneChangeMode)((value & (16 + 32)) >> 4);
810 myRightDriveLC = (LaneChangeMode)((value & (64 + 128)) >> 6);
811 myTraciLaneChangePriority = (TraciLaneChangePriority)((value & (256 + 512)) >> 8);
812 mySublaneLC = (LaneChangeMode)((value & (1024 + 2048)) >> 10);
813}
814
815
816void
817MSVehicle::Influencer::setRemoteControlled(Position xyPos, MSLane* l, double pos, double posLat, double angle, int edgeOffset, const ConstMSEdgeVector& route, SUMOTime t) {
818 myRemoteXYPos = xyPos;
819 myRemoteLane = l;
820 myRemotePos = pos;
821 myRemotePosLat = posLat;
822 myRemoteAngle = angle;
823 myRemoteEdgeOffset = edgeOffset;
824 myRemoteRoute = route;
825 myLastRemoteAccess = t;
826}
827
828
829bool
831 return myLastRemoteAccess == MSNet::getInstance()->getCurrentTimeStep();
832}
833
834
835bool
837 return myLastRemoteAccess >= t - TIME2STEPS(10);
838}
839
840
841void
843 if (myRemoteRoute.size() != 0 && myRemoteRoute != v->getRoute().getEdges()) {
844 // only replace route at this time if the vehicle is moving with the flow
845 const bool isForward = v->getLane() != 0 && &v->getLane()->getEdge() == myRemoteRoute[0];
846#ifdef DEBUG_REMOTECONTROL
847 std::cout << SIMSTEP << " updateRemoteControlRoute veh=" << v->getID() << " old=" << toString(v->getRoute().getEdges()) << " new=" << toString(myRemoteRoute) << " fwd=" << isForward << "\n";
848#endif
849 if (isForward) {
850 v->replaceRouteEdges(myRemoteRoute, -1, 0, "traci:moveToXY", true);
851 v->updateBestLanes();
852 }
853 }
854}
855
856
857void
859 const bool wasOnRoad = v->isOnRoad();
860 const bool withinLane = myRemoteLane != nullptr && fabs(myRemotePosLat) < 0.5 * (myRemoteLane->getWidth() + v->getVehicleType().getWidth());
861 const bool keepLane = wasOnRoad && v->getLane() == myRemoteLane;
862 if (v->isOnRoad() && !(keepLane && withinLane)) {
863 if (myRemoteLane != nullptr && &v->getLane()->getEdge() == &myRemoteLane->getEdge()) {
864 // correct odometer which gets incremented via onRemovalFromNet->leaveLane
865 v->myOdometer -= v->getLane()->getLength();
866 }
869 }
870 if (myRemoteRoute.size() != 0 && myRemoteRoute != v->getRoute().getEdges()) {
871 // needed for the insertion step
872#ifdef DEBUG_REMOTECONTROL
873 std::cout << SIMSTEP << " postProcessRemoteControl veh=" << v->getID()
874 << "\n oldLane=" << Named::getIDSecure(v->getLane())
875 << " oldRoute=" << toString(v->getRoute().getEdges())
876 << "\n newLane=" << Named::getIDSecure(myRemoteLane)
877 << " newRoute=" << toString(myRemoteRoute)
878 << " newRouteEdge=" << myRemoteRoute[myRemoteEdgeOffset]->getID()
879 << "\n";
880#endif
881 // clear any prior stops because they cannot apply to the new route
882 const_cast<SUMOVehicleParameter&>(v->getParameter()).stops.clear();
883 v->replaceRouteEdges(myRemoteRoute, -1, 0, "traci:moveToXY", true);
884 myRemoteRoute.clear();
885 }
886 v->myCurrEdge = v->getRoute().begin() + myRemoteEdgeOffset;
887 if (myRemoteLane != nullptr && myRemotePos > myRemoteLane->getLength()) {
888 myRemotePos = myRemoteLane->getLength();
889 }
890 if (myRemoteLane != nullptr && withinLane) {
891 if (keepLane) {
892 // TODO this handles only the case when the new vehicle is completely on the edge
893 const bool needFurtherUpdate = v->myState.myPos < v->getVehicleType().getLength() && myRemotePos >= v->getVehicleType().getLength();
894 v->myState.myPos = myRemotePos;
895 v->myState.myPosLat = myRemotePosLat;
896 if (needFurtherUpdate) {
897 v->myState.myBackPos = v->updateFurtherLanes(v->myFurtherLanes, v->myFurtherLanesPosLat, std::vector<MSLane*>());
898 }
899 } else {
903 if (!v->isOnRoad()) {
904 MSVehicleTransfer::getInstance()->remove(v); // TODO may need optimization, this is linear in the number of vehicles in transfer
905 }
906 myRemoteLane->forceVehicleInsertion(v, myRemotePos, notify, myRemotePosLat);
907 v->updateBestLanes();
908 }
909 if (!wasOnRoad) {
910 v->drawOutsideNetwork(false);
911 }
912 //std::cout << "on road network p=" << myRemoteXYPos << " a=" << myRemoteAngle << " l=" << Named::getIDSecure(myRemoteLane) << " pos=" << myRemotePos << " posLat=" << myRemotePosLat << "\n";
913 myRemoteLane->requireCollisionCheck();
914 } else {
915 if (v->getDeparture() == NOT_YET_DEPARTED) {
916 v->onDepart();
917 }
918 v->drawOutsideNetwork(true);
919 // see updateState
920 double vNext = v->processTraCISpeedControl(
921 v->getMaxSpeed(), v->getSpeed());
922 v->setBrakingSignals(vNext);
924 v->myAcceleration = SPEED2ACCEL(vNext - v->getSpeed());
925 v->myState.mySpeed = vNext;
926 v->updateWaitingTime(vNext);
927 //std::cout << "outside network p=" << myRemoteXYPos << " a=" << myRemoteAngle << " l=" << Named::getIDSecure(myRemoteLane) << "\n";
928 }
929 // ensure that the position is correct (i.e. when the lanePosition is ambiguous at corners)
930 v->setRemoteState(myRemoteXYPos);
931 v->setAngle(GeomHelper::fromNaviDegree(myRemoteAngle));
932}
933
934
935double
937 if (veh->getPosition() == Position::INVALID) {
938 return oldSpeed;
939 }
940 double dist = veh->getPosition().distanceTo2D(myRemoteXYPos);
941 if (myRemoteLane != nullptr) {
942 // if the vehicles is frequently placed on a new edge, the route may
943 // consist only of a single edge. In this case the new edge may not be
944 // on the route so distAlongRoute will be double::max.
945 // In this case we still want a sensible speed value
946 const double distAlongRoute = veh->getDistanceToPosition(myRemotePos, myRemoteLane);
947 if (distAlongRoute != std::numeric_limits<double>::max()) {
948 dist = distAlongRoute;
949 }
950 }
951 //std::cout << SIMTIME << " veh=" << veh->getID() << " oldPos=" << veh->getPosition() << " traciPos=" << myRemoteXYPos << " dist=" << dist << "\n";
952 const double minSpeed = myConsiderMaxDeceleration ?
953 veh->getCarFollowModel().minNextSpeedEmergency(oldSpeed, veh) : 0;
954 const double maxSpeed = (myRemoteLane != nullptr
955 ? myRemoteLane->getVehicleMaxSpeed(veh)
956 : (veh->getLane() != nullptr
957 ? veh->getLane()->getVehicleMaxSpeed(veh)
958 : veh->getMaxSpeed()));
959 return MIN2(maxSpeed, MAX2(minSpeed, DIST2SPEED(dist)));
960}
961
962
963double
965 double dist = 0;
966 if (myRemoteLane == nullptr) {
967 dist = veh->getPosition().distanceTo2D(myRemoteXYPos);
968 } else {
969 // if the vehicles is frequently placed on a new edge, the route may
970 // consist only of a single edge. In this case the new edge may not be
971 // on the route so getDistanceToPosition will return double::max.
972 // In this case we would rather not move the vehicle in executeMove
973 // (updateState) as it would result in emergency braking
974 dist = veh->getDistanceToPosition(myRemotePos, myRemoteLane);
975 }
976 if (dist == std::numeric_limits<double>::max()) {
977 return 0;
978 } else {
979 if (DIST2SPEED(dist) > veh->getMaxSpeed() * 1.1) {
980 WRITE_WARNINGF(TL("Vehicle '%' moved by TraCI from % to % (dist %) with implied speed of % (exceeding maximum speed %). time=%."),
981 veh->getID(), veh->getPosition(), myRemoteXYPos, dist, DIST2SPEED(dist), veh->getMaxSpeed(), time2string(SIMSTEP));
982 // some sanity check here
983 dist = MIN2(dist, SPEED2DIST(veh->getMaxSpeed() * 2));
984 }
985 return dist;
986 }
987}
988
989
990/* -------------------------------------------------------------------------
991 * MSVehicle-methods
992 * ----------------------------------------------------------------------- */
994 MSVehicleType* type, const double speedFactor) :
995 MSBaseVehicle(pars, route, type, speedFactor),
996 myWaitingTime(0),
998 myTimeLoss(0),
999 myState(0, 0, 0, 0, 0),
1000 myDriverState(nullptr),
1001 myActionStep(true),
1003 myLane(nullptr),
1004 myLaneChangeModel(nullptr),
1005 myLastBestLanesEdge(nullptr),
1007 myAcceleration(0),
1008 myNextTurn(0., nullptr),
1009 mySignals(0),
1010 myAmOnNet(false),
1011 myAmIdling(false),
1013 myAngle(0),
1014 myStopDist(std::numeric_limits<double>::max()),
1020 myTimeSinceStartup(TIME2STEPS(3600 * 24)),
1021 myHaveStoppedFor(nullptr),
1022 myInfluencer(nullptr) {
1025}
1026
1027
1037
1038
1039void
1041 for (MSLane* further : myFurtherLanes) {
1042 further->resetPartialOccupation(this);
1043 if (further->getBidiLane() != nullptr
1044 && (!isRailway(getVClass()) || (further->getPermissions() & ~SVC_RAIL_CLASSES) != 0)) {
1045 further->getBidiLane()->resetPartialOccupation(this);
1046 }
1047 }
1048 if (myLaneChangeModel != nullptr) {
1052 // still needed when calling resetPartialOccupation (getShadowLane) and when removing
1053 // approach information from parallel links
1054 }
1055 myFurtherLanes.clear();
1056 myFurtherLanesPosLat.clear();
1057}
1058
1059
1060void
1062#ifdef DEBUG_ACTIONSTEPS
1063 if (DEBUG_COND) {
1064 std::cout << SIMTIME << " Removing vehicle '" << getID() << "' (reason: " << toString(reason) << ")" << std::endl;
1065 }
1066#endif
1069 leaveLane(reason);
1072 }
1073}
1074
1075
1076void
1083
1084
1085// ------------ interaction with the route
1086bool
1088 // note: not a const method because getDepartLane may call updateBestLanes
1089 if (!(*myCurrEdge)->isTazConnector()) {
1091 if ((*myCurrEdge)->getDepartLane(*this) == nullptr) {
1092 msg = "Invalid departlane definition for vehicle '" + getID() + "'.";
1093 if (myParameter->departLane >= (int)(*myCurrEdge)->getLanes().size()) {
1095 } else {
1097 }
1098 return false;
1099 }
1100 } else {
1101 if ((*myCurrEdge)->allowedLanes(getVClass()) == nullptr) {
1102 msg = "Vehicle '" + getID() + "' is not allowed to depart on any lane of edge '" + (*myCurrEdge)->getID() + "'.";
1104 return false;
1105 }
1106 }
1108 msg = "Departure speed for vehicle '" + getID() + "' is too high for the vehicle type '" + myType->getID() + "'.";
1110 return false;
1111 }
1112 }
1114 return true;
1115}
1116
1117
1118bool
1120 return hasArrivedInternal(false);
1121}
1122
1123
1124bool
1125MSVehicle::hasArrivedInternal(bool oppositeTransformed) const {
1126 return ((myCurrEdge == myRoute->end() - 1 || (myParameter->arrivalEdge >= 0 && getRoutePosition() >= myParameter->arrivalEdge))
1127 && (myStops.empty() || myStops.front().edge != myCurrEdge || myStops.front().getSpeed() > 0)
1128 && ((myLaneChangeModel->isOpposite() && !oppositeTransformed) ? myLane->getLength() - myState.myPos : myState.myPos) > MIN2(myLane->getLength(), myArrivalPos) - POSITION_EPS
1129 && !isRemoteControlled());
1130}
1131
1132
1133bool
1134MSVehicle::replaceRoute(ConstMSRoutePtr newRoute, const std::string& info, bool onInit, int offset, bool addRouteStops, bool removeStops, std::string* msgReturn) {
1135 if (MSBaseVehicle::replaceRoute(newRoute, info, onInit, offset, addRouteStops, removeStops, msgReturn)) {
1136 // update best lanes (after stops were added)
1137 myLastBestLanesEdge = nullptr;
1139 updateBestLanes(true, onInit ? (*myCurrEdge)->getLanes().front() : 0);
1140 assert(!removeStops || haveValidStopEdges());
1141 if (myStops.size() == 0) {
1142 myStopDist = std::numeric_limits<double>::max();
1143 }
1144 return true;
1145 }
1146 return false;
1147}
1148
1149
1150// ------------ Interaction with move reminders
1151void
1152MSVehicle::workOnMoveReminders(double oldPos, double newPos, double newSpeed) {
1153 // This erasure-idiom works for all stl-sequence-containers
1154 // See Meyers: Effective STL, Item 9
1155 for (MoveReminderCont::iterator rem = myMoveReminders.begin(); rem != myMoveReminders.end();) {
1156 // XXX: calling notifyMove with newSpeed seems not the best choice. For the ballistic update, the average speed is calculated and used
1157 // although a higher order quadrature-formula might be more adequate.
1158 // For the euler case (where the speed is considered constant for each time step) it is conceivable that
1159 // the current calculations may lead to systematic errors for large time steps (compared to reality). Refs. #2579
1160 if (!rem->first->notifyMove(*this, oldPos + rem->second, newPos + rem->second, MAX2(0., newSpeed))) {
1161#ifdef _DEBUG
1162 if (myTraceMoveReminders) {
1163 traceMoveReminder("notifyMove", rem->first, rem->second, false);
1164 }
1165#endif
1166 rem = myMoveReminders.erase(rem);
1167 } else {
1168#ifdef _DEBUG
1169 if (myTraceMoveReminders) {
1170 traceMoveReminder("notifyMove", rem->first, rem->second, true);
1171 }
1172#endif
1173 ++rem;
1174 }
1175 }
1176 if (myEnergyParams != nullptr) {
1177 // TODO make the vehicle energy params a derived class which is a move reminder
1179 }
1180}
1181
1182
1183void
1185 updateWaitingTime(0.); // cf issue 2233
1186
1187 // vehicle move reminders
1188 for (const auto& rem : myMoveReminders) {
1189 rem.first->notifyIdle(*this);
1190 }
1191
1192 // lane move reminders - for aggregated values
1193 for (MSMoveReminder* rem : getLane()->getMoveReminders()) {
1194 rem->notifyIdle(*this);
1195 }
1196}
1197
1198// XXX: consider renaming...
1199void
1201 // save the old work reminders, patching the position information
1202 // add the information about the new offset to the old lane reminders
1203 const double oldLaneLength = myLane->getLength();
1204 for (auto& rem : myMoveReminders) {
1205 rem.second += oldLaneLength;
1206#ifdef _DEBUG
1207// if (rem->first==0) std::cout << "Null reminder (?!)" << std::endl;
1208// std::cout << "Adapted MoveReminder on lane " << ((rem->first->getLane()==0) ? "NULL" : rem->first->getLane()->getID()) <<" position to " << rem->second << std::endl;
1209 if (myTraceMoveReminders) {
1210 traceMoveReminder("adaptedPos", rem.first, rem.second, true);
1211 }
1212#endif
1213 }
1214 for (MSMoveReminder* const rem : enteredLane.getMoveReminders()) {
1215 addReminder(rem);
1216 }
1217}
1218
1219
1220// ------------ Other getter methods
1221double
1223 if (isParking() && getStops().begin()->parkingarea != nullptr) {
1224 return getStops().begin()->parkingarea->getVehicleSlope(*this);
1225 }
1226 if (myLane == nullptr) {
1227 return 0;
1228 }
1229 const double posLat = myState.myPosLat; // @todo get rid of the '-'
1230 Position p1 = getPosition();
1232 if (p2 == Position::INVALID) {
1233 // Handle special case of vehicle's back reaching out of the network
1234 if (myFurtherLanes.size() > 0) {
1235 p2 = myFurtherLanes.back()->geometryPositionAtOffset(0, -myFurtherLanesPosLat.back());
1236 if (p2 == Position::INVALID) {
1237 // unsuitable lane geometry
1238 p2 = myLane->geometryPositionAtOffset(0, posLat);
1239 }
1240 } else {
1241 p2 = myLane->geometryPositionAtOffset(0, posLat);
1242 }
1243 }
1245}
1246
1247
1249MSVehicle::getPosition(const double offset) const {
1250 if (myLane == nullptr) {
1251 // when called in the context of GUI-Drawing, the simulation step is already incremented
1253 return myCachedPosition;
1254 } else {
1255 return Position::INVALID;
1256 }
1257 }
1258 if (isParking()) {
1259 if (myInfluencer != nullptr && myInfluencer->getLastAccessTimeStep() > getNextStopParameter()->started) {
1260 return myCachedPosition;
1261 }
1262 if (myStops.begin()->parkingarea != nullptr) {
1263 return myStops.begin()->parkingarea->getVehiclePosition(*this);
1264 } else {
1265 // position beside the road
1266 PositionVector shp = myLane->getEdge().getLanes()[0]->getShape();
1269 }
1270 }
1271 const bool changingLanes = myLaneChangeModel->isChangingLanes();
1272 const double posLat = (MSGlobals::gLefthand ? 1 : -1) * getLateralPositionOnLane();
1273 if (offset == 0. && !changingLanes) {
1276 if (MSNet::getInstance()->hasElevation() && MSGlobals::gSublane) {
1278 }
1279 }
1280 return myCachedPosition;
1281 }
1282 Position result = validatePosition(myLane->geometryPositionAtOffset(getPositionOnLane() + offset, posLat), offset);
1283 interpolateLateralZ(result, getPositionOnLane() + offset, posLat);
1284 return result;
1285}
1286
1287
1288void
1289MSVehicle::interpolateLateralZ(Position& pos, double offset, double posLat) const {
1290 const MSLane* shadow = myLaneChangeModel->getShadowLane();
1291 if (shadow != nullptr && pos != Position::INVALID) {
1292 // ignore negative offset
1293 const Position shadowPos = shadow->geometryPositionAtOffset(MAX2(0.0, offset));
1294 if (shadowPos != Position::INVALID && pos.z() != shadowPos.z()) {
1295 const double centerDist = (myLane->getWidth() + shadow->getWidth()) * 0.5;
1296 double relOffset = fabs(posLat) / centerDist;
1297 double newZ = (1 - relOffset) * pos.z() + relOffset * shadowPos.z();
1298 pos.setz(newZ);
1299 }
1300 }
1301}
1302
1303
1304double
1306 double result = getLength() - getPositionOnLane();
1307 if (myLane->isNormal()) {
1308 return MAX2(0.0, result);
1309 }
1310 const MSLane* lane = myLane;
1311 while (lane->isInternal()) {
1312 result += lane->getLength();
1313 lane = lane->getCanonicalSuccessorLane();
1314 }
1315 return result;
1316}
1317
1318
1322 if (!isOnRoad()) {
1323 return Position::INVALID;
1324 }
1325 const std::vector<MSLane*>& bestLanes = getBestLanesContinuation();
1326 auto nextBestLane = bestLanes.begin();
1327 const bool opposite = myLaneChangeModel->isOpposite();
1328 double pos = opposite ? myLane->getLength() - myState.myPos : myState.myPos;
1329 const MSLane* lane = opposite ? myLane->getParallelOpposite() : getLane();
1330 assert(lane != 0);
1331 bool success = true;
1332
1333 while (offset > 0) {
1334 // take into account lengths along internal lanes
1335 while (lane->isInternal() && offset > 0) {
1336 if (offset > lane->getLength() - pos) {
1337 offset -= lane->getLength() - pos;
1338 lane = lane->getLinkCont()[0]->getViaLaneOrLane();
1339 pos = 0.;
1340 if (lane == nullptr) {
1341 success = false;
1342 offset = 0.;
1343 }
1344 } else {
1345 pos += offset;
1346 offset = 0;
1347 }
1348 }
1349 // set nextBestLane to next non-internal lane
1350 while (nextBestLane != bestLanes.end() && *nextBestLane == nullptr) {
1351 ++nextBestLane;
1352 }
1353 if (offset > 0) {
1354 assert(!lane->isInternal());
1355 assert(lane == *nextBestLane);
1356 if (offset > lane->getLength() - pos) {
1357 offset -= lane->getLength() - pos;
1358 ++nextBestLane;
1359 assert(nextBestLane == bestLanes.end() || *nextBestLane != 0);
1360 if (nextBestLane == bestLanes.end()) {
1361 success = false;
1362 offset = 0.;
1363 } else {
1364 const MSLink* link = lane->getLinkTo(*nextBestLane);
1365 assert(link != nullptr);
1366 lane = link->getViaLaneOrLane();
1367 pos = 0.;
1368 }
1369 } else {
1370 pos += offset;
1371 offset = 0;
1372 }
1373 }
1374
1375 }
1376
1377 if (success) {
1379 } else {
1380 return Position::INVALID;
1381 }
1382}
1383
1384
1385double
1387 if (myLane != nullptr) {
1388 return myLane->getVehicleMaxSpeed(this);
1389 }
1390 return myType->getMaxSpeed();
1391}
1392
1393
1395MSVehicle::validatePosition(Position result, double offset) const {
1396 int furtherIndex = 0;
1397 double lastLength = getPositionOnLane();
1398 while (result == Position::INVALID) {
1399 if (furtherIndex >= (int)myFurtherLanes.size()) {
1400 //WRITE_WARNINGF(TL("Could not compute position for vehicle '%', time=%."), getID(), time2string(MSNet::getInstance()->getCurrentTimeStep()));
1401 break;
1402 }
1403 //std::cout << SIMTIME << " veh=" << getID() << " lane=" << myLane->getID() << " pos=" << getPositionOnLane() << " posLat=" << getLateralPositionOnLane() << " offset=" << offset << " result=" << result << " i=" << furtherIndex << " further=" << myFurtherLanes.size() << "\n";
1404 MSLane* further = myFurtherLanes[furtherIndex];
1405 offset += lastLength;
1406 result = further->geometryPositionAtOffset(further->getLength() + offset, -getLateralPositionOnLane());
1407 lastLength = further->getLength();
1408 furtherIndex++;
1409 //std::cout << SIMTIME << " newResult=" << result << "\n";
1410 }
1411 return result;
1412}
1413
1414
1415ConstMSEdgeVector::const_iterator
1417 // too close to the next junction, so avoid an emergency brake here
1418 if (myLane != nullptr && (myCurrEdge + 1) != myRoute->end() && !isRailway(getVClass())) {
1419 if (myLane->isInternal()) {
1420 return myCurrEdge + 1;
1421 }
1422 if (myState.myPos > myLane->getLength() - getCarFollowModel().brakeGap(myState.mySpeed, getCarFollowModel().getMaxDecel(), 0.)) {
1423 return myCurrEdge + 1;
1424 }
1426 return myCurrEdge + 1;
1427 }
1428 }
1429 return myCurrEdge;
1430}
1431
1432void
1433MSVehicle::setAngle(double angle, bool straightenFurther) {
1434#ifdef DEBUG_FURTHER
1435 if (DEBUG_COND) {
1436 std::cout << SIMTIME << " veh '" << getID() << " setAngle(" << angle << ") straightenFurther=" << straightenFurther << std::endl;
1437 }
1438#endif
1439 myAngle = angle;
1440 MSLane* next = myLane;
1441 if (straightenFurther && myFurtherLanesPosLat.size() > 0) {
1442 for (int i = 0; i < (int)myFurtherLanes.size(); i++) {
1443 MSLane* further = myFurtherLanes[i];
1444 const MSLink* link = further->getLinkTo(next);
1445 if (link != nullptr) {
1447 next = further;
1448 } else {
1449 break;
1450 }
1451 }
1452 }
1453}
1454
1455
1456void
1457MSVehicle::setActionStepLength(double actionStepLength, bool resetOffset) {
1458 SUMOTime actionStepLengthMillisecs = SUMOVehicleParserHelper::processActionStepLength(actionStepLength);
1459 SUMOTime previousActionStepLength = getActionStepLength();
1460 const bool newActionStepLength = actionStepLengthMillisecs != previousActionStepLength;
1461 if (newActionStepLength) {
1462 getSingularType().setActionStepLength(actionStepLengthMillisecs, resetOffset);
1463 if (!resetOffset) {
1464 updateActionOffset(previousActionStepLength, actionStepLengthMillisecs);
1465 }
1466 }
1467 if (resetOffset) {
1469 }
1470}
1471
1472
1473bool
1475 return myState.mySpeed < (60.0 / 3.6) || myLane->getSpeedLimit() < (60.1 / 3.6);
1476}
1477
1478
1479double
1481 Position p1;
1482 const double posLat = -myState.myPosLat; // @todo get rid of the '-'
1483 const double lefthandSign = (MSGlobals::gLefthand ? -1 : 1);
1484
1485 // if parking manoeuvre is happening then rotate vehicle on each step
1488 }
1489
1490 if (isParking()) {
1491 if (myStops.begin()->parkingarea != nullptr) {
1492 return myStops.begin()->parkingarea->getVehicleAngle(*this);
1493 } else {
1495 }
1496 }
1498 // cannot use getPosition() because it already includes the offset to the side and thus messes up the angle
1499 p1 = myLane->geometryPositionAtOffset(myState.myPos, lefthandSign * posLat);
1500 if (p1 == Position::INVALID && myLane->getShape().length2D() == 0. && myLane->isInternal()) {
1501 // workaround: extrapolate the preceding lane shape
1502 MSLane* predecessorLane = myLane->getCanonicalPredecessorLane();
1503 p1 = predecessorLane->geometryPositionAtOffset(predecessorLane->getLength() + myState.myPos, lefthandSign * posLat);
1504 }
1505 } else {
1506 p1 = getPosition();
1507 }
1508
1509 Position p2;
1510 if (getVehicleType().getParameter().locomotiveLength > 0) {
1511 // articulated vehicle should use the heading of the first part
1512 const double locoLength = MIN2(getVehicleType().getParameter().locomotiveLength, getLength());
1513 p2 = getPosition(-locoLength);
1514 } else {
1515 p2 = getBackPosition();
1516 }
1517 if (p2 == Position::INVALID) {
1518 // Handle special case of vehicle's back reaching out of the network
1519 if (myFurtherLanes.size() > 0) {
1520 p2 = myFurtherLanes.back()->geometryPositionAtOffset(0, -myFurtherLanesPosLat.back());
1521 if (p2 == Position::INVALID) {
1522 // unsuitable lane geometry
1523 p2 = myLane->geometryPositionAtOffset(0, posLat);
1524 }
1525 } else {
1526 p2 = myLane->geometryPositionAtOffset(0, posLat);
1527 }
1528 }
1529 double result = (p1 != p2 ? p2.angleTo2D(p1) :
1531
1532 result += lefthandSign * myLaneChangeModel->calcAngleOffset();
1533
1534#ifdef DEBUG_FURTHER
1535 if (DEBUG_COND) {
1536 std::cout << SIMTIME << " computeAngle veh=" << getID() << " p1=" << p1 << " p2=" << p2 << " angle=" << RAD2DEG(result) << " naviDegree=" << GeomHelper::naviDegree(result) << "\n";
1537 }
1538#endif
1539 return result;
1540}
1541
1542
1543const Position
1545 const double posLat = MSGlobals::gLefthand ? myState.myPosLat : -myState.myPosLat;
1546 Position result;
1547 if (myState.myPos >= myType->getLength()) {
1548 // vehicle is fully on the new lane
1550 } else {
1552 // special case where the target lane has no predecessor
1553#ifdef DEBUG_FURTHER
1554 if (DEBUG_COND) {
1555 std::cout << " getBackPosition veh=" << getID() << " specialCase using myLane=" << myLane->getID() << " pos=0 posLat=" << myState.myPosLat << " result=" << myLane->geometryPositionAtOffset(0, posLat) << "\n";
1556 }
1557#endif
1558 result = myLane->geometryPositionAtOffset(0, posLat);
1559 } else {
1560#ifdef DEBUG_FURTHER
1561 if (DEBUG_COND) {
1562 std::cout << " getBackPosition veh=" << getID() << " myLane=" << myLane->getID() << " further=" << toString(myFurtherLanes) << " myFurtherLanesPosLat=" << toString(myFurtherLanesPosLat) << "\n";
1563 }
1564#endif
1565 if (myFurtherLanes.size() > 0 && !myLaneChangeModel->isChangingLanes()) {
1566 // truncate to 0 if vehicle starts on an edge that is shorter than its length
1567 const double backPos = MAX2(0.0, getBackPositionOnLane(myFurtherLanes.back()));
1568 result = myFurtherLanes.back()->geometryPositionAtOffset(backPos, -myFurtherLanesPosLat.back() * (MSGlobals::gLefthand ? -1 : 1));
1569 } else {
1570 result = myLane->geometryPositionAtOffset(0, posLat);
1571 }
1572 }
1573 }
1575 interpolateLateralZ(result, myState.myPos - myType->getLength(), posLat);
1576 }
1577 return result;
1578}
1579
1580
1581bool
1583 return !isStopped() && !myStops.empty() && myLane != nullptr && &myStops.front().lane->getEdge() == &myLane->getEdge();
1584}
1585
1586bool
1588 return isStopped() && myStops.front().lane == myLane;
1589}
1590
1591bool
1592MSVehicle::keepStopping(bool afterProcessing) const {
1593 if (isStopped()) {
1594 // when coming out of vehicleTransfer we must shift the time forward
1595 return (myStops.front().duration - (afterProcessing ? DELTA_T : 0) > 0 || isStoppedTriggered() || myStops.front().pars.collision
1596 || myStops.front().pars.breakDown || (myStops.front().getSpeed() > 0
1597 && (myState.myPos < MIN2(myStops.front().pars.endPos, myStops.front().lane->getLength() - POSITION_EPS))
1598 && (myStops.front().pars.parking == ParkingType::ONROAD || getSpeed() >= SUMO_const_haltingSpeed)));
1599 } else {
1600 return false;
1601 }
1602}
1603
1604
1607 if (isStopped()) {
1608 return myStops.front().duration;
1609 }
1610 return 0;
1611}
1612
1613
1616 return (myStops.empty() || !myStops.front().pars.collision) ? myCollisionImmunity : MAX2((SUMOTime)0, myStops.front().duration);
1617}
1618
1619
1620bool
1622 return isStopped() && !myStops.empty() && myStops.front().pars.breakDown;
1623}
1624
1625
1626bool
1628 return myCollisionImmunity > 0;
1629}
1630
1631
1632double
1633MSVehicle::processNextStop(double currentVelocity) {
1634 if (myStops.empty()) {
1635 // no stops; pass
1636 return currentVelocity;
1637 }
1638
1639#ifdef DEBUG_STOPS
1640 if (DEBUG_COND) {
1641 std::cout << "\nPROCESS_NEXT_STOP\n" << SIMTIME << " vehicle '" << getID() << "'" << std::endl;
1642 }
1643#endif
1644
1645 MSStop& stop = myStops.front();
1647 if (stop.reached) {
1648 stop.duration -= getActionStepLength();
1649
1650#ifdef DEBUG_STOPS
1651 if (DEBUG_COND) {
1652 std::cout << SIMTIME << " vehicle '" << getID() << "' reached stop.\n"
1653 << "Remaining duration: " << STEPS2TIME(stop.duration) << std::endl;
1654 if (stop.getSpeed() > 0) {
1655 std::cout << " waypointSpeed=" << stop.getSpeed() << " vehPos=" << myState.myPos << " endPos=" << stop.pars.endPos << "\n";
1656 }
1657 }
1658#endif
1659 if (stop.duration <= 0 && stop.pars.join != "") {
1660 // join this train (part) to another one
1661 MSVehicle* joinVeh = dynamic_cast<MSVehicle*>(MSNet::getInstance()->getVehicleControl().getVehicle(stop.pars.join));
1662 if (joinVeh && joinVeh->hasDeparted() && (joinVeh->joinTrainPart(this) || joinVeh->joinTrainPartFront(this))) {
1663 stop.joinTriggered = false;
1667 }
1668 // avoid collision warning before this vehicle is removed (joinVeh was already made longer)
1670 // mark this vehicle as arrived
1672 const_cast<SUMOVehicleParameter*>(myParameter)->arrivalEdge = getRoutePosition();
1673 // handle transportables that want to continue in the other vehicle
1674 if (myPersonDevice != nullptr) {
1676 }
1677 if (myContainerDevice != nullptr) {
1679 }
1680 }
1681 }
1682 boardTransportables(stop);
1683 if (time > stop.endBoarding) {
1684 // for taxi: cancel customers
1685 MSDevice_Taxi* taxiDevice = static_cast<MSDevice_Taxi*>(getDevice(typeid(MSDevice_Taxi)));
1686 if (taxiDevice != nullptr) {
1687 // may invalidate stops including the current reference
1688 taxiDevice->cancelCurrentCustomers();
1690 return currentVelocity;
1691 }
1692 }
1693 if (!keepStopping() && isOnRoad()) {
1694#ifdef DEBUG_STOPS
1695 if (DEBUG_COND) {
1696 std::cout << SIMTIME << " vehicle '" << getID() << "' resumes from stopping." << std::endl;
1697 }
1698#endif
1700 if (isRail() && hasStops()) {
1701 // stay on the current lane in case of a double stop
1702 const MSStop& nextStop = getNextStop();
1703 if (nextStop.edge == myCurrEdge) {
1704 const double stopSpeed = getCarFollowModel().stopSpeed(this, getSpeed(), nextStop.pars.endPos - myState.myPos);
1705 //std::cout << SIMTIME << " veh=" << getID() << " resumedFromStopping currentVelocity=" << currentVelocity << " stopSpeed=" << stopSpeed << "\n";
1706 return stopSpeed;
1707 }
1708 }
1709 } else {
1710 if (stop.triggered) {
1711 if (getVehicleType().getPersonCapacity() == getPersonNumber()) {
1712 WRITE_WARNINGF(TL("Vehicle '%' ignores triggered stop on lane '%' due to capacity constraints."), getID(), stop.lane->getID());
1713 stop.triggered = false;
1714 } else if (!myAmRegisteredAsWaiting && stop.duration <= DELTA_T) {
1715 // we can only register after waiting for one step. otherwise we might falsely signal a deadlock
1718#ifdef DEBUG_STOPS
1719 if (DEBUG_COND) {
1720 std::cout << SIMTIME << " vehicle '" << getID() << "' registers as waiting for person." << std::endl;
1721 }
1722#endif
1723 }
1724 }
1725 if (stop.containerTriggered) {
1726 if (getVehicleType().getContainerCapacity() == getContainerNumber()) {
1727 WRITE_WARNINGF(TL("Vehicle '%' ignores container triggered stop on lane '%' due to capacity constraints."), getID(), stop.lane->getID());
1728 stop.containerTriggered = false;
1729 } else if (stop.containerTriggered && !myAmRegisteredAsWaiting && stop.duration <= DELTA_T) {
1730 // we can only register after waiting for one step. otherwise we might falsely signal a deadlock
1733#ifdef DEBUG_STOPS
1734 if (DEBUG_COND) {
1735 std::cout << SIMTIME << " vehicle '" << getID() << "' registers as waiting for container." << std::endl;
1736 }
1737#endif
1738 }
1739 }
1740 // joining only takes place after stop duration is over
1742 && stop.duration <= (stop.pars.extension >= 0 ? -stop.pars.extension : 0)) {
1743 if (stop.pars.extension >= 0) {
1744 WRITE_WARNINGF(TL("Vehicle '%' aborts joining after extension of %s at time %."), getID(), STEPS2TIME(stop.pars.extension), time2string(SIMSTEP));
1745 stop.joinTriggered = false;
1746 } else {
1747 // keep stopping indefinitely but ensure that simulation terminates
1750 }
1751 }
1752 if (stop.getSpeed() > 0) {
1753 //waypoint mode
1754 if (stop.duration == 0) {
1755 return stop.getSpeed();
1756 } else {
1757 // stop for 'until' (computed in planMove)
1758 return currentVelocity;
1759 }
1760 } else {
1761 // brake
1763 return 0;
1764 } else {
1765 // ballistic:
1766 return getSpeed() - getCarFollowModel().getMaxDecel();
1767 }
1768 }
1769 }
1770 } else {
1771
1772#ifdef DEBUG_STOPS
1773 if (DEBUG_COND) {
1774 std::cout << SIMTIME << " vehicle '" << getID() << "' hasn't reached next stop." << std::endl;
1775 }
1776#endif
1777 //std::cout << SIMTIME << " myStopDist=" << myStopDist << " bGap=" << getBrakeGap(myLane->getVehicleMaxSpeed(this)) << "\n";
1778 if (stop.pars.onDemand && !stop.skipOnDemand && myStopDist <= getCarFollowModel().brakeGap(myLane->getVehicleMaxSpeed(this))) {
1779 MSNet* const net = MSNet::getInstance();
1780 const bool noExits = ((myPersonDevice == nullptr || !myPersonDevice->anyLeavingAtStop(stop))
1781 && (myContainerDevice == nullptr || !myContainerDevice->anyLeavingAtStop(stop)));
1782 const bool noEntries = ((!net->hasPersons() || !net->getPersonControl().hasAnyWaiting(stop.getEdge(), this))
1783 && (!net->hasContainers() || !net->getContainerControl().hasAnyWaiting(stop.getEdge(), this)));
1784 if (noExits && noEntries) {
1785 //std::cout << " skipOnDemand\n";
1786 stop.skipOnDemand = true;
1787 }
1788 }
1789 // is the next stop on the current lane?
1790 if (stop.edge == myCurrEdge) {
1791 // get the stopping position
1792 bool useStoppingPlace = stop.busstop != nullptr || stop.containerstop != nullptr || stop.parkingarea != nullptr;
1793 bool fitsOnStoppingPlace = true;
1794 if (!stop.skipOnDemand) { // no need to check available space if we skip it anyway
1795 if (stop.busstop != nullptr) {
1796 fitsOnStoppingPlace &= stop.busstop->fits(myState.myPos, *this);
1797 }
1798 if (stop.containerstop != nullptr) {
1799 fitsOnStoppingPlace &= stop.containerstop->fits(myState.myPos, *this);
1800 }
1801 // if the stop is a parking area we check if there is a free position on the area
1802 if (stop.parkingarea != nullptr) {
1803 fitsOnStoppingPlace &= myState.myPos > stop.parkingarea->getBeginLanePosition();
1804 if (stop.parkingarea->getOccupancy() >= stop.parkingarea->getCapacity()) {
1805 fitsOnStoppingPlace = false;
1806 // trigger potential parkingZoneReroute
1807 MSParkingArea* oldParkingArea = stop.parkingarea;
1808 for (MSMoveReminder* rem : myLane->getMoveReminders()) {
1809 if (rem->isParkingRerouter()) {
1810 rem->notifyEnter(*this, MSMoveReminder::NOTIFICATION_PARKING_REROUTE, myLane);
1811 }
1812 }
1813 if (myStops.empty() || myStops.front().parkingarea != oldParkingArea) {
1814 // rerouted, keep driving
1815 return currentVelocity;
1816 }
1817 } else if (stop.parkingarea->getOccupancyIncludingReservations(this) >= stop.parkingarea->getCapacity()) {
1818 fitsOnStoppingPlace = false;
1819 } else if (stop.parkingarea->parkOnRoad() && stop.parkingarea->getLotIndex(this) < 0) {
1820 fitsOnStoppingPlace = false;
1821 }
1822 }
1823 }
1824 const double targetPos = myState.myPos + myStopDist + (stop.getSpeed() > 0 ? (stop.pars.startPos - stop.pars.endPos) : 0);
1825 const double reachedThreshold = (useStoppingPlace ? targetPos - STOPPING_PLACE_OFFSET : stop.getReachedThreshold()) - NUMERICAL_EPS;
1826#ifdef DEBUG_STOPS
1827 if (DEBUG_COND) {
1828 std::cout << " pos=" << myState.pos() << " speed=" << currentVelocity << " targetPos=" << targetPos << " fits=" << fitsOnStoppingPlace
1829 << " reachedThresh=" << reachedThreshold
1830 << " myLane=" << Named::getIDSecure(myLane)
1831 << " stopLane=" << Named::getIDSecure(stop.lane)
1832 << "\n";
1833 }
1834#endif
1835 const bool posReached = myState.pos() >= reachedThreshold && currentVelocity <= stop.getSpeed() + SUMO_const_haltingSpeed && myLane == stop.lane;
1836 if (posReached && !fitsOnStoppingPlace && MSStopOut::active()) {
1837 MSStopOut::getInstance()->stopBlocked(this, time);
1838 }
1839 if (fitsOnStoppingPlace && posReached && (!MSGlobals::gModelParkingManoeuver || myManoeuvre.entryManoeuvreIsComplete(this))) {
1840 // ok, we may stop (have reached the stop) and either we are not modelling maneuvering or have completed entry
1841 stop.reached = true;
1842 if (!stop.startedFromState) {
1843 stop.pars.started = time;
1844 }
1845#ifdef DEBUG_STOPS
1846 if (DEBUG_COND) {
1847 std::cout << SIMTIME << " vehicle '" << getID() << "' reached next stop." << std::endl;
1848 }
1849#endif
1850 if (MSStopOut::active()) {
1852 }
1853 myLane->getEdge().addWaiting(this);
1856 // compute stopping time
1857 stop.duration = stop.getMinDuration(time);
1858 stop.endBoarding = stop.pars.extension >= 0 ? time + stop.duration + stop.pars.extension : SUMOTime_MAX;
1859 MSDevice_Taxi* taxiDevice = static_cast<MSDevice_Taxi*>(getDevice(typeid(MSDevice_Taxi)));
1860 if (taxiDevice != nullptr && stop.pars.extension >= 0) {
1861 // earliestPickupTime is set with waitUntil
1862 stop.endBoarding = MAX2(time, stop.pars.waitUntil) + stop.pars.extension;
1863 }
1864 if (stop.getSpeed() > 0) {
1865 // ignore duration parameter in waypoint mode unless 'until' or 'ended' are set
1866 if (stop.getUntil() > time) {
1867 stop.duration = stop.getUntil() - time;
1868 } else {
1869 stop.duration = 0;
1870 }
1871 }
1872 if (stop.busstop != nullptr) {
1873 // let the bus stop know the vehicle
1874 stop.busstop->enter(this, stop.pars.parking == ParkingType::OFFROAD);
1875 }
1876 if (stop.containerstop != nullptr) {
1877 // let the container stop know the vehicle
1879 }
1880 if (stop.parkingarea != nullptr && stop.getSpeed() <= 0) {
1881 // let the parking area know the vehicle
1882 stop.parkingarea->enter(this);
1883 }
1884 if (stop.chargingStation != nullptr) {
1885 // let the container stop know the vehicle
1887 }
1888
1889 if (stop.pars.tripId != "") {
1890 ((SUMOVehicleParameter&)getParameter()).setParameter("tripId", stop.pars.tripId);
1891 }
1892 if (stop.pars.line != "") {
1893 ((SUMOVehicleParameter&)getParameter()).line = stop.pars.line;
1894 }
1895 if (stop.pars.split != "") {
1896 // split the train
1897 MSVehicle* splitVeh = dynamic_cast<MSVehicle*>(MSNet::getInstance()->getVehicleControl().getVehicle(stop.pars.split));
1898 if (splitVeh == nullptr) {
1899 WRITE_WARNINGF(TL("Vehicle '%' to split from vehicle '%' is not known. time=%."), stop.pars.split, getID(), SIMTIME)
1900 } else {
1902 splitVeh->getRoute().getEdges()[0]->removeWaiting(splitVeh);
1904 const double newLength = MAX2(myType->getLength() - splitVeh->getVehicleType().getLength(),
1906 getSingularType().setLength(newLength);
1907 // handle transportables that want to continue in the split part
1908 if (myPersonDevice != nullptr) {
1910 }
1911 if (myContainerDevice != nullptr) {
1913 }
1915 const double backShift = splitVeh->getLength() + getVehicleType().getMinGap();
1916 myState.myPos -= backShift;
1917 myState.myBackPos -= backShift;
1918 }
1919 }
1920 }
1921
1922 boardTransportables(stop);
1923 if (stop.pars.posLat != INVALID_DOUBLE) {
1924 myState.myPosLat = stop.pars.posLat;
1925 }
1926 }
1927 }
1928 }
1929 return currentVelocity;
1930}
1931
1932
1933void
1935 if (stop.skipOnDemand) {
1936 return;
1937 }
1938 // we have reached the stop
1939 // any waiting persons may board now
1941 MSNet* const net = MSNet::getInstance();
1942 const bool boarded = (time <= stop.endBoarding
1943 && net->hasPersons()
1945 && stop.numExpectedPerson == 0);
1946 // load containers
1947 const bool loaded = (time <= stop.endBoarding
1948 && net->hasContainers()
1950 && stop.numExpectedContainer == 0);
1951
1952 bool unregister = false;
1953 if (time > stop.endBoarding) {
1954 stop.triggered = false;
1955 stop.containerTriggered = false;
1957 unregister = true;
1959 }
1960 }
1961 if (boarded) {
1962 // the triggering condition has been fulfilled. Maybe we want to wait a bit longer for additional riders (car pooling)
1964 unregister = true;
1965 }
1966 stop.triggered = false;
1968 }
1969 if (loaded) {
1970 // the triggering condition has been fulfilled
1972 unregister = true;
1973 }
1974 stop.containerTriggered = false;
1976 }
1977
1978 if (unregister) {
1980#ifdef DEBUG_STOPS
1981 if (DEBUG_COND) {
1982 std::cout << SIMTIME << " vehicle '" << getID() << "' unregisters as waiting for transportable." << std::endl;
1983 }
1984#endif
1985 }
1986}
1987
1988bool
1990 // check if veh is close enough to be joined to the rear of this vehicle
1991 MSLane* backLane = myFurtherLanes.size() == 0 ? myLane : myFurtherLanes.back();
1992 double gap = getBackPositionOnLane() - veh->getPositionOnLane();
1993 if (isStopped() && myStops.begin()->duration <= DELTA_T && myStops.begin()->joinTriggered && backLane == veh->getLane()
1994 && gap >= 0 && gap <= getVehicleType().getMinGap() + 1) {
1995 const double newLength = myType->getLength() + veh->getVehicleType().getLength();
1996 getSingularType().setLength(newLength);
1997 myStops.begin()->joinTriggered = false;
2001 }
2002 return true;
2003 } else {
2004 return false;
2005 }
2006}
2007
2008
2009bool
2011 // check if veh is close enough to be joined to the front of this vehicle
2012 MSLane* backLane = veh->myFurtherLanes.size() == 0 ? veh->myLane : veh->myFurtherLanes.back();
2013 double gap = veh->getBackPositionOnLane(backLane) - getPositionOnLane();
2014 if (isStopped() && myStops.begin()->duration <= DELTA_T && myStops.begin()->joinTriggered && backLane == getLane()
2015 && gap >= 0 && gap <= getVehicleType().getMinGap() + 1) {
2016 double skippedLaneLengths = 0;
2017 if (veh->myFurtherLanes.size() > 0) {
2018 skippedLaneLengths += getLane()->getLength();
2019 // this vehicle must be moved to the lane of veh
2020 // ensure that lane and furtherLanes of veh match our route
2021 int routeIndex = getRoutePosition();
2022 if (myLane->isInternal()) {
2023 routeIndex++;
2024 }
2025 for (int i = (int)veh->myFurtherLanes.size() - 1; i >= 0; i--) {
2026 MSEdge* edge = &veh->myFurtherLanes[i]->getEdge();
2027 if (edge->isInternal()) {
2028 continue;
2029 }
2030 if (!edge->isInternal() && edge != myRoute->getEdges()[routeIndex]) {
2031 std::string warn = TL("Cannot join vehicle '%' to vehicle '%' due to incompatible routes. time=%.");
2032 WRITE_WARNINGF(warn, veh->getID(), getID(), time2string(SIMSTEP));
2033 return false;
2034 }
2035 routeIndex++;
2036 }
2037 if (veh->getCurrentEdge()->getNormalSuccessor() != myRoute->getEdges()[routeIndex]) {
2038 std::string warn = TL("Cannot join vehicle '%' to vehicle '%' due to incompatible routes. time=%.");
2039 WRITE_WARNINGF(warn, veh->getID(), getID(), time2string(SIMSTEP));
2040 return false;
2041 }
2042 for (int i = (int)veh->myFurtherLanes.size() - 2; i >= 0; i--) {
2043 skippedLaneLengths += veh->myFurtherLanes[i]->getLength();
2044 }
2045 }
2046
2047 const double newLength = myType->getLength() + veh->getVehicleType().getLength();
2048 getSingularType().setLength(newLength);
2049 // lane will be advanced just as for regular movement
2050 myState.myPos = skippedLaneLengths + veh->getPositionOnLane();
2051 myStops.begin()->joinTriggered = false;
2055 }
2056 return true;
2057 } else {
2058 return false;
2059 }
2060}
2061
2062double
2063MSVehicle::getBrakeGap(bool delayed) const {
2064 return getCarFollowModel().brakeGap(getSpeed(), getCarFollowModel().getMaxDecel(), delayed ? getCarFollowModel().getHeadwayTime() : 0);
2065}
2066
2067
2068bool
2071 if (myActionStep) {
2072 myLastActionTime = t;
2073 }
2074 return myActionStep;
2075}
2076
2077
2078void
2079MSVehicle::resetActionOffset(const SUMOTime timeUntilNextAction) {
2080 myLastActionTime = MSNet::getInstance()->getCurrentTimeStep() + timeUntilNextAction;
2081}
2082
2083
2084void
2085MSVehicle::updateActionOffset(const SUMOTime oldActionStepLength, const SUMOTime newActionStepLength) {
2087 SUMOTime timeSinceLastAction = now - myLastActionTime;
2088 if (timeSinceLastAction == 0) {
2089 // Action was scheduled now, may be delayed be new action step length
2090 timeSinceLastAction = oldActionStepLength;
2091 }
2092 if (timeSinceLastAction >= newActionStepLength) {
2093 // Action point required in this step
2094 myLastActionTime = now;
2095 } else {
2096 SUMOTime timeUntilNextAction = newActionStepLength - timeSinceLastAction;
2097 resetActionOffset(timeUntilNextAction);
2098 }
2099}
2100
2101
2102
2103void
2104MSVehicle::planMove(const SUMOTime t, const MSLeaderInfo& ahead, const double lengthsInFront) {
2105#ifdef DEBUG_PLAN_MOVE
2106 if (DEBUG_COND) {
2107 std::cout
2108 << "\nPLAN_MOVE\n"
2109 << SIMTIME
2110 << std::setprecision(gPrecision)
2111 << " veh=" << getID()
2112 << " lane=" << myLane->getID()
2113 << " pos=" << getPositionOnLane()
2114 << " posLat=" << getLateralPositionOnLane()
2115 << " speed=" << getSpeed()
2116 << "\n";
2117 }
2118#endif
2119 // Update the driver state
2120 if (hasDriverState()) {
2122 setActionStepLength(myDriverState->getDriverState()->getActionStepLength(), false);
2123 }
2124
2125 if (!checkActionStep(t)) {
2126#ifdef DEBUG_ACTIONSTEPS
2127 if (DEBUG_COND) {
2128 std::cout << STEPS2TIME(t) << " vehicle '" << getID() << "' skips action." << std::endl;
2129 }
2130#endif
2131 // During non-action passed drive items still need to be removed
2132 // @todo rather work with updating myCurrentDriveItem (refs #3714)
2134 return;
2135 } else {
2136#ifdef DEBUG_ACTIONSTEPS
2137 if (DEBUG_COND) {
2138 std::cout << STEPS2TIME(t) << " vehicle = '" << getID() << "' takes action." << std::endl;
2139 }
2140#endif
2142 if (myInfluencer != nullptr) {
2144 }
2146#ifdef DEBUG_PLAN_MOVE
2147 if (DEBUG_COND) {
2148 DriveItemVector::iterator i;
2149 for (i = myLFLinkLanes.begin(); i != myLFLinkLanes.end(); ++i) {
2150 std::cout
2151 << " vPass=" << (*i).myVLinkPass
2152 << " vWait=" << (*i).myVLinkWait
2153 << " linkLane=" << ((*i).myLink == 0 ? "NULL" : (*i).myLink->getViaLaneOrLane()->getID())
2154 << " request=" << (*i).mySetRequest
2155 << "\n";
2156 }
2157 }
2158#endif
2159 checkRewindLinkLanes(lengthsInFront, myLFLinkLanes);
2161 // ideally would only do this with the call inside planMoveInternal - but that needs a const method
2162 // so this is a kludge here - nuisance as it adds an extra check in a busy loop
2166 }
2167 }
2168 }
2170}
2171
2172
2173bool
2174MSVehicle::brakeForOverlap(const MSLink* link, const MSLane* lane) const {
2175 // @review needed
2176 //const double futurePosLat = getLateralPositionOnLane() + link->getLateralShift();
2177 //const double overlap = getLateralOverlap(futurePosLat, link->getViaLaneOrLane());
2178 //const double edgeWidth = link->getViaLaneOrLane()->getEdge().getWidth();
2179 const double futurePosLat = getLateralPositionOnLane() + (
2180 lane != myLane && lane->isInternal() ? lane->getIncomingLanes()[0].viaLink->getLateralShift() : 0);
2181 const double overlap = getLateralOverlap(futurePosLat, lane);
2182 const double edgeWidth = lane->getEdge().getWidth();
2183 const bool result = (overlap > POSITION_EPS
2184 // do not get stuck on narrow edges
2185 && getVehicleType().getWidth() <= edgeWidth
2186 && link->getViaLane() == nullptr
2187 // this is the exit link of a junction. The normal edge should support the shadow
2188 && ((myLaneChangeModel->getShadowLane(link->getLane()) == nullptr)
2189 // the internal lane after an internal junction has no parallel lane. make sure there is no shadow before continuing
2190 || (lane->getEdge().isInternal() && lane->getIncomingLanes()[0].lane->getEdge().isInternal()))
2191 // ignore situations where the shadow lane is part of a double-connection with the current lane
2192 && (myLaneChangeModel->getShadowLane() == nullptr
2193 || myLaneChangeModel->getShadowLane()->getLinkCont().size() == 0
2194 || myLaneChangeModel->getShadowLane()->getLinkCont().front()->getLane() != link->getLane()));
2195
2196#ifdef DEBUG_PLAN_MOVE
2197 if (DEBUG_COND) {
2198 std::cout << SIMTIME << " veh=" << getID() << " link=" << link->getDescription() << " lane=" << lane->getID()
2199 << " shift=" << link->getLateralShift()
2200 << " fpLat=" << futurePosLat << " overlap=" << overlap << " w=" << getVehicleType().getWidth() << " result=" << result << "\n";
2201 }
2202#endif
2203 return result;
2204}
2205
2206
2207
2208void
2209MSVehicle::planMoveInternal(const SUMOTime t, MSLeaderInfo ahead, DriveItemVector& lfLinks, double& newStopDist, std::pair<double, const MSLink*>& nextTurn) const {
2210 lfLinks.clear();
2211 newStopDist = std::numeric_limits<double>::max();
2212 //
2213 const MSCFModel& cfModel = getCarFollowModel();
2214 const double vehicleLength = getVehicleType().getLength();
2215 const double maxV = cfModel.maxNextSpeed(myState.mySpeed, this);
2216 const double maxVD = MAX2(getMaxSpeed(), MIN2(maxV, getDesiredMaxSpeed()));
2217 const bool opposite = myLaneChangeModel->isOpposite();
2218 // maxVD is possibly higher than vType-maxSpeed and in this case laneMaxV may be higher as well
2219 double laneMaxV = myLane->getVehicleMaxSpeed(this, maxVD);
2220 const double vMinComfortable = cfModel.minNextSpeed(getSpeed(), this);
2221 double lateralShift = 0;
2222 if (isRail()) {
2223 // speed limits must hold for the whole length of the train
2224 for (MSLane* l : myFurtherLanes) {
2225 laneMaxV = MIN2(laneMaxV, l->getVehicleMaxSpeed(this, maxVD));
2226#ifdef DEBUG_PLAN_MOVE
2227 if (DEBUG_COND) {
2228 std::cout << " laneMaxV=" << laneMaxV << " lane=" << l->getID() << "\n";
2229 }
2230#endif
2231 }
2232 }
2233 // speed limits are not emergencies (e.g. when the limit changes suddenly due to TraCI or a variableSpeedSignal)
2234 laneMaxV = MAX2(laneMaxV, vMinComfortable);
2236 laneMaxV = std::numeric_limits<double>::max();
2237 }
2238 // v is the initial maximum velocity of this vehicle in this step
2239 double v = cfModel.maximumLaneSpeedCF(this, maxV, laneMaxV);
2240 // if we are modelling parking then we dawdle until the manoeuvre is complete - by setting a very low max speed
2241 // in practice this only applies to exit manoeuvre because entry manoeuvre just delays setting stop.reached - when the vehicle is virtually stopped
2244 }
2245
2246 if (myInfluencer != nullptr) {
2247 const double vMin = MAX2(0., cfModel.minNextSpeed(myState.mySpeed, this));
2248#ifdef DEBUG_TRACI
2249 if (DEBUG_COND) {
2250 std::cout << SIMTIME << " veh=" << getID() << " speedBeforeTraci=" << v;
2251 }
2252#endif
2253 v = myInfluencer->influenceSpeed(t, v, v, vMin, maxV);
2254#ifdef DEBUG_TRACI
2255 if (DEBUG_COND) {
2256 std::cout << " influencedSpeed=" << v;
2257 }
2258#endif
2259 v = myInfluencer->gapControlSpeed(t, this, v, v, vMin, maxV);
2260#ifdef DEBUG_TRACI
2261 if (DEBUG_COND) {
2262 std::cout << " gapControlSpeed=" << v << "\n";
2263 }
2264#endif
2265 }
2266 // all links within dist are taken into account (potentially)
2267 const double dist = SPEED2DIST(maxV) + cfModel.brakeGap(maxV);
2268
2269 const std::vector<MSLane*>& bestLaneConts = getBestLanesContinuation();
2270#ifdef DEBUG_PLAN_MOVE
2271 if (DEBUG_COND) {
2272 std::cout << " dist=" << dist << " bestLaneConts=" << toString(bestLaneConts)
2273 << "\n maxV=" << maxV << " laneMaxV=" << laneMaxV << " v=" << v << "\n";
2274 }
2275#endif
2276 assert(bestLaneConts.size() > 0);
2277 bool hadNonInternal = false;
2278 // the distance already "seen"; in the following always up to the end of the current "lane"
2279 double seen = opposite ? myState.myPos : myLane->getLength() - myState.myPos;
2280 nextTurn.first = seen;
2281 nextTurn.second = nullptr;
2282 bool encounteredTurn = (MSGlobals::gLateralResolution <= 0); // next turn is only needed for sublane
2283 double seenNonInternal = 0;
2284 double seenInternal = myLane->isInternal() ? seen : 0;
2285 double vLinkPass = MIN2(cfModel.estimateSpeedAfterDistance(seen, v, cfModel.getMaxAccel()), laneMaxV); // upper bound
2286 int view = 0;
2287 DriveProcessItem* lastLink = nullptr;
2288 bool slowedDownForMinor = false; // whether the vehicle already had to slow down on approach to a minor link
2289 double mustSeeBeforeReversal = 0;
2290 // iterator over subsequent lanes and fill lfLinks until stopping distance or stopped
2291 const MSLane* lane = opposite ? myLane->getParallelOpposite() : myLane;
2292 assert(lane != 0);
2293 const MSLane* leaderLane = myLane;
2294 bool foundRailSignal = !isRail();
2295 bool planningToStop = false;
2296#ifdef PARALLEL_STOPWATCH
2297 myLane->getStopWatch()[0].start();
2298#endif
2299
2300 // optionally slow down to match arrival time
2301 const double sfp = getVehicleType().getParameter().speedFactorPremature;
2302 if (v > vMinComfortable && hasStops() && myStops.front().pars.arrival >= 0 && sfp > 0
2303 && v > myLane->getSpeedLimit() * sfp
2304 && !myStops.front().reached) {
2305 const double vSlowDown = slowDownForSchedule(vMinComfortable);
2306 v = MIN2(v, vSlowDown);
2307 }
2308 auto stopIt = myStops.begin();
2309 while (true) {
2310 // check leader on lane
2311 // leader is given for the first edge only
2312 if (opposite &&
2313 (leaderLane->getVehicleNumberWithPartials() > 1
2314 || (leaderLane != myLane && leaderLane->getVehicleNumber() > 0))) {
2315 ahead.clear();
2316 // find opposite-driving leader that must be respected on the currently looked at lane
2317 // (only looking at one lane at a time)
2318 const double backOffset = leaderLane == myLane ? getPositionOnLane() : leaderLane->getLength();
2319 const double gapOffset = leaderLane == myLane ? 0 : seen - leaderLane->getLength();
2320 const MSLeaderDistanceInfo cands = leaderLane->getFollowersOnConsecutive(this, backOffset, true, backOffset, MSLane::MinorLinkMode::FOLLOW_NEVER);
2321 MSLeaderDistanceInfo oppositeLeaders(leaderLane->getWidth(), this, 0.);
2322 const double minTimeToLeaveLane = MSGlobals::gSublane ? MAX2(TS, (0.5 * myLane->getWidth() - getLateralPositionOnLane()) / getVehicleType().getMaxSpeedLat()) : TS;
2323 for (int i = 0; i < cands.numSublanes(); i++) {
2324 CLeaderDist cand = cands[i];
2325 if (cand.first != 0) {
2326 if ((cand.first->myLaneChangeModel->isOpposite() && cand.first->getLaneChangeModel().getShadowLane() != leaderLane)
2327 || (!cand.first->myLaneChangeModel->isOpposite() && cand.first->getLaneChangeModel().getShadowLane() == leaderLane)) {
2328 // respect leaders that also drive in the opposite direction (fully or with some overlap)
2329 oppositeLeaders.addLeader(cand.first, cand.second + gapOffset - getVehicleType().getMinGap() + cand.first->getVehicleType().getMinGap() - cand.first->getVehicleType().getLength());
2330 } else {
2331 // avoid frontal collision
2332 const bool assumeStopped = cand.first->isStopped() || cand.first->getWaitingSeconds() > 1;
2333 const double predMaxDist = cand.first->getSpeed() + (assumeStopped ? 0 : cand.first->getCarFollowModel().getMaxAccel()) * minTimeToLeaveLane;
2334 if (cand.second >= 0 && (cand.second - v * minTimeToLeaveLane - predMaxDist < 0 || assumeStopped)) {
2335 oppositeLeaders.addLeader(cand.first, cand.second + gapOffset - predMaxDist - getVehicleType().getMinGap());
2336 }
2337 }
2338 }
2339 }
2340#ifdef DEBUG_PLAN_MOVE
2341 if (DEBUG_COND) {
2342 std::cout << " leaderLane=" << leaderLane->getID() << " gapOffset=" << gapOffset << " minTimeToLeaveLane=" << minTimeToLeaveLane
2343 << " cands=" << cands.toString() << " oppositeLeaders=" << oppositeLeaders.toString() << "\n";
2344 }
2345#endif
2346 adaptToLeaderDistance(oppositeLeaders, 0, seen, lastLink, v, vLinkPass);
2347 } else {
2349 const double rightOL = getRightSideOnLane(lane) + lateralShift;
2350 const double leftOL = getLeftSideOnLane(lane) + lateralShift;
2351 const bool outsideLeft = leftOL > lane->getWidth();
2352#ifdef DEBUG_PLAN_MOVE
2353 if (DEBUG_COND) {
2354 std::cout << SIMTIME << " veh=" << getID() << " lane=" << lane->getID() << " rightOL=" << rightOL << " leftOL=" << leftOL << "\n";
2355 }
2356#endif
2357 if (rightOL < 0 || outsideLeft) {
2358 MSLeaderInfo outsideLeaders(lane->getWidth());
2359 // if ego is driving outside lane bounds we must consider
2360 // potential leaders that are also outside bounds
2361 int sublaneOffset = 0;
2362 if (outsideLeft) {
2363 sublaneOffset = MIN2(-1, -(int)ceil((leftOL - lane->getWidth()) / MSGlobals::gLateralResolution));
2364 } else {
2365 sublaneOffset = MAX2(1, (int)ceil(-rightOL / MSGlobals::gLateralResolution));
2366 }
2367 outsideLeaders.setSublaneOffset(sublaneOffset);
2368#ifdef DEBUG_PLAN_MOVE
2369 if (DEBUG_COND) {
2370 std::cout << SIMTIME << " veh=" << getID() << " lane=" << lane->getID() << " sublaneOffset=" << sublaneOffset << " outsideLeft=" << outsideLeft << "\n";
2371 }
2372#endif
2373 for (const MSVehicle* cand : lane->getVehiclesSecure()) {
2374 if ((lane != myLane || cand->getPositionOnLane() > getPositionOnLane())
2375 && ((!outsideLeft && cand->getLeftSideOnEdge() < 0)
2376 || (outsideLeft && cand->getLeftSideOnEdge() > lane->getEdge().getWidth()))) {
2377 outsideLeaders.addLeader(cand, true);
2378#ifdef DEBUG_PLAN_MOVE
2379 if (DEBUG_COND) {
2380 std::cout << " outsideLeader=" << cand->getID() << " ahead=" << outsideLeaders.toString() << "\n";
2381 }
2382#endif
2383 }
2384 }
2385 lane->releaseVehicles();
2386 if (outsideLeaders.hasVehicles()) {
2387 adaptToLeaders(outsideLeaders, lateralShift, seen, lastLink, leaderLane, v, vLinkPass);
2388 }
2389 }
2390 }
2391 adaptToLeaders(ahead, lateralShift, seen, lastLink, leaderLane, v, vLinkPass);
2392 }
2393 if (lastLink != nullptr) {
2394 lastLink->myVLinkWait = MIN2(lastLink->myVLinkWait, v);
2395 }
2396#ifdef DEBUG_PLAN_MOVE
2397 if (DEBUG_COND) {
2398 std::cout << "\nv = " << v << "\n";
2399
2400 }
2401#endif
2402 // XXX efficiently adapt to shadow leaders using neighAhead by iteration over the whole edge in parallel (lanechanger-style)
2403 if (myLaneChangeModel->getShadowLane() != nullptr) {
2404 // also slow down for leaders on the shadowLane relative to the current lane
2405 const MSLane* shadowLane = myLaneChangeModel->getShadowLane(leaderLane);
2406 if (shadowLane != nullptr
2407 && (MSGlobals::gLateralResolution > 0 || getLateralOverlap() > POSITION_EPS
2408 // continous lane change cannot be stopped so we must adapt to the leader on the target lane
2410 if ((&shadowLane->getEdge() == &leaderLane->getEdge() || myLaneChangeModel->isOpposite())) {
2413 // ego posLat is added when retrieving sublanes but it
2414 // should be negated (subtract twice to compensate)
2415 latOffset = ((myLane->getWidth() + shadowLane->getWidth()) * 0.5
2416 - 2 * getLateralPositionOnLane());
2417
2418 }
2419 MSLeaderInfo shadowLeaders = shadowLane->getLastVehicleInformation(this, latOffset, lane->getLength() - seen);
2420#ifdef DEBUG_PLAN_MOVE
2422 std::cout << SIMTIME << " opposite veh=" << getID() << " shadowLane=" << shadowLane->getID() << " latOffset=" << latOffset << " shadowLeaders=" << shadowLeaders.toString() << "\n";
2423 }
2424#endif
2426 // ignore oncoming vehicles on the shadow lane
2427 shadowLeaders.removeOpposite(shadowLane);
2428 }
2429 const double turningDifference = MAX2(0.0, leaderLane->getLength() - shadowLane->getLength());
2430 adaptToLeaders(shadowLeaders, latOffset, seen - turningDifference, lastLink, shadowLane, v, vLinkPass);
2431 } else if (shadowLane == myLaneChangeModel->getShadowLane() && leaderLane == myLane) {
2432 // check for leader vehicles driving in the opposite direction on the opposite-direction shadow lane
2433 // (and thus in the same direction as ego)
2434 MSLeaderDistanceInfo shadowLeaders = shadowLane->getFollowersOnConsecutive(this, myLane->getOppositePos(getPositionOnLane()), true);
2435 const double latOffset = 0;
2436#ifdef DEBUG_PLAN_MOVE
2437 if (DEBUG_COND) {
2438 std::cout << SIMTIME << " opposite shadows veh=" << getID() << " shadowLane=" << shadowLane->getID()
2439 << " latOffset=" << latOffset << " shadowLeaders=" << shadowLeaders.toString() << "\n";
2440 }
2441#endif
2442 shadowLeaders.fixOppositeGaps(true);
2443#ifdef DEBUG_PLAN_MOVE
2444 if (DEBUG_COND) {
2445 std::cout << " shadowLeadersFixed=" << shadowLeaders.toString() << "\n";
2446 }
2447#endif
2448 adaptToLeaderDistance(shadowLeaders, latOffset, seen, lastLink, v, vLinkPass);
2449 }
2450 }
2451 }
2452 // adapt to pedestrians on the same lane
2453 if (lane->getEdge().getPersons().size() > 0 && lane->hasPedestrians()) {
2454 const double relativePos = lane->getLength() - seen;
2455#ifdef DEBUG_PLAN_MOVE
2456 if (DEBUG_COND) {
2457 std::cout << SIMTIME << " adapt to pedestrians on lane=" << lane->getID() << " relPos=" << relativePos << "\n";
2458 }
2459#endif
2460 const double stopTime = MAX2(1.0, ceil(getSpeed() / cfModel.getMaxDecel()));
2461 PersonDist leader = lane->nextBlocking(relativePos,
2462 getRightSideOnLane(lane), getRightSideOnLane(lane) + getVehicleType().getWidth(), stopTime);
2463 if (leader.first != 0) {
2464 const double stopSpeed = cfModel.stopSpeed(this, getSpeed(), leader.second - getVehicleType().getMinGap());
2465 v = MIN2(v, stopSpeed);
2466#ifdef DEBUG_PLAN_MOVE
2467 if (DEBUG_COND) {
2468 std::cout << SIMTIME << " pedLeader=" << leader.first->getID() << " dist=" << leader.second << " v=" << v << "\n";
2469 }
2470#endif
2471 }
2472 }
2473 if (lane->getBidiLane() != nullptr) {
2474 // adapt to pedestrians on the bidi lane
2475 const MSLane* bidiLane = lane->getBidiLane();
2476 if (bidiLane->getEdge().getPersons().size() > 0 && bidiLane->hasPedestrians()) {
2477 const double relativePos = seen;
2478#ifdef DEBUG_PLAN_MOVE
2479 if (DEBUG_COND) {
2480 std::cout << SIMTIME << " adapt to pedestrians on lane=" << lane->getID() << " relPos=" << relativePos << "\n";
2481 }
2482#endif
2483 const double stopTime = ceil(getSpeed() / cfModel.getMaxDecel());
2484 const double leftSideOnLane = bidiLane->getWidth() - getRightSideOnLane(lane);
2485 PersonDist leader = bidiLane->nextBlocking(relativePos,
2486 leftSideOnLane - getVehicleType().getWidth(), leftSideOnLane, stopTime, true);
2487 if (leader.first != 0) {
2488 const double stopSpeed = cfModel.stopSpeed(this, getSpeed(), leader.second - getVehicleType().getMinGap());
2489 v = MIN2(v, stopSpeed);
2490#ifdef DEBUG_PLAN_MOVE
2491 if (DEBUG_COND) {
2492 std::cout << SIMTIME << " pedLeader=" << leader.first->getID() << " dist=" << leader.second << " v=" << v << "\n";
2493 }
2494#endif
2495 }
2496 }
2497 }
2498 // adapt to vehicles blocked from (urgent) lane-changing
2499 if (!opposite && lane->getEdge().hasLaneChanger()) {
2500 v = MIN2(v, myLaneChangeModel->getCooperativeHelpSpeed(lane, seen));
2501 }
2502
2503 // process all stops and waypoints on the current edge
2504 bool foundRealStop = false;
2505 while (stopIt != myStops.end()
2506 && ((&stopIt->lane->getEdge() == &lane->getEdge())
2507 || (stopIt->isOpposite && stopIt->lane->getEdge().getOppositeEdge() == &lane->getEdge()))
2508 // ignore stops that occur later in a looped route
2509 && stopIt->edge == myCurrEdge + view) {
2510 double stopDist = std::numeric_limits<double>::max();
2511 const MSStop& stop = *stopIt;
2512 const bool isFirstStop = stopIt == myStops.begin();
2513 stopIt++;
2514 if (!stop.reached || (stop.getSpeed() > 0 && keepStopping())) {
2515 // we are approaching a stop on the edge; must not drive further
2516 bool isWaypoint = stop.getSpeed() > 0;
2517 double endPos = stop.getEndPos(*this) + NUMERICAL_EPS;
2518 if (stop.parkingarea != nullptr) {
2519 // leave enough space so parking vehicles can exit
2520 const double brakePos = getBrakeGap() + lane->getLength() - seen;
2521 endPos = stop.parkingarea->getLastFreePosWithReservation(t, *this, brakePos);
2522 } else if (isWaypoint && !stop.reached) {
2523 endPos = stop.pars.startPos;
2524 }
2525 stopDist = seen + endPos - lane->getLength();
2526#ifdef DEBUG_STOPS
2527 if (DEBUG_COND) {
2528 std::cout << SIMTIME << " veh=" << getID() << " stopDist=" << stopDist << " stopLane=" << stop.lane->getID() << " stopEndPos=" << endPos << "\n";
2529 }
2530#endif
2531 // regular stops are not emergencies
2532 double stopSpeed = laneMaxV;
2533 if (isWaypoint) {
2534 bool waypointWithStop = false;
2535 if (stop.getUntil() > t) {
2536 // check if we have to slow down or even stop
2537 SUMOTime time2end = 0;
2538 if (stop.reached) {
2539 time2end = TIME2STEPS((stop.pars.endPos - myState.myPos) / stop.getSpeed());
2540 } else {
2541 time2end = TIME2STEPS(
2542 // time to reach waypoint start
2543 stopDist / ((getSpeed() + stop.getSpeed()) / 2)
2544 // time to reach waypoint end
2545 + (stop.pars.endPos - stop.pars.startPos) / stop.getSpeed());
2546 }
2547 if (stop.getUntil() > t + time2end) {
2548 // we need to stop
2549 double distToEnd = stopDist;
2550 if (!stop.reached) {
2551 distToEnd += stop.pars.endPos - stop.pars.startPos;
2552 }
2553 stopSpeed = MAX2(cfModel.stopSpeed(this, getSpeed(), distToEnd), vMinComfortable);
2554 waypointWithStop = true;
2555 }
2556 }
2557 if (stop.reached) {
2558 stopSpeed = MIN2(stop.getSpeed(), stopSpeed);
2559 if (myState.myPos >= stop.pars.endPos && !waypointWithStop) {
2560 stopDist = std::numeric_limits<double>::max();
2561 }
2562 } else {
2563 stopSpeed = MIN2(MAX2(cfModel.freeSpeed(this, getSpeed(), stopDist, stop.getSpeed()), vMinComfortable), stopSpeed);
2564 if (!stop.reached) {
2565 stopDist += stop.pars.endPos - stop.pars.startPos;
2566 }
2567 if (lastLink != nullptr) {
2568 lastLink->adaptLeaveSpeed(cfModel.freeSpeed(this, vLinkPass, endPos, stop.getSpeed(), false, MSCFModel::CalcReason::FUTURE));
2569 }
2570 }
2571 } else {
2572 stopSpeed = MAX2(cfModel.stopSpeed(this, getSpeed(), stopDist), vMinComfortable);
2573 if (lastLink != nullptr) {
2574 lastLink->adaptLeaveSpeed(cfModel.stopSpeed(this, vLinkPass, endPos, MSCFModel::CalcReason::FUTURE));
2575 }
2576 }
2577 v = MIN2(v, stopSpeed);
2578 if (lane->isInternal()) {
2579 std::vector<MSLink*>::const_iterator exitLink = MSLane::succLinkSec(*this, view + 1, *lane, bestLaneConts);
2580 assert(!lane->isLinkEnd(exitLink));
2581 bool dummySetRequest;
2582 double dummyVLinkWait;
2583 checkLinkLeaderCurrentAndParallel(*exitLink, lane, seen, lastLink, v, vLinkPass, dummyVLinkWait, dummySetRequest);
2584 }
2585
2586#ifdef DEBUG_PLAN_MOVE
2587 if (DEBUG_COND) {
2588 std::cout << "\n" << SIMTIME << " next stop: distance = " << stopDist << " requires stopSpeed = " << stopSpeed << "\n";
2589
2590 }
2591#endif
2592 if (isFirstStop) {
2593 newStopDist = stopDist;
2594 // if the vehicle is going to stop we don't need to look further
2595 // (except for trains that make use of further link-approach registration for safety purposes)
2596 if (!isWaypoint) {
2597 planningToStop = true;
2598 if (!isRail()) {
2599 lfLinks.emplace_back(v, stopDist);
2600 foundRealStop = true;
2601 break;
2602 }
2603 }
2604 }
2605 }
2606 }
2607 if (foundRealStop) {
2608 break;
2609 }
2610
2611 // move to next lane
2612 // get the next link used
2613 std::vector<MSLink*>::const_iterator link = MSLane::succLinkSec(*this, view + 1, *lane, bestLaneConts);
2614
2615 // Check whether this is a turn (to save info about the next upcoming turn)
2616 if (!encounteredTurn) {
2617 if (!lane->isLinkEnd(link) && lane->getLinkCont().size() > 1) {
2618 LinkDirection linkDir = (*link)->getDirection();
2619 switch (linkDir) {
2622 break;
2623 default:
2624 nextTurn.first = seen;
2625 nextTurn.second = *link;
2626 encounteredTurn = true;
2627#ifdef DEBUG_NEXT_TURN
2628 if (DEBUG_COND) {
2629 std::cout << SIMTIME << " veh '" << getID() << "' nextTurn: " << toString(linkDir)
2630 << " at " << nextTurn.first << "m." << std::endl;
2631 }
2632#endif
2633 }
2634 }
2635 }
2636
2637 // check whether the vehicle is on its final edge
2638 if (myCurrEdge + view + 1 == myRoute->end()
2639 || (myParameter->arrivalEdge >= 0 && getRoutePosition() + view == myParameter->arrivalEdge)) {
2640 const double arrivalSpeed = (myParameter->arrivalSpeedProcedure == ArrivalSpeedDefinition::GIVEN ?
2641 myParameter->arrivalSpeed : laneMaxV);
2642 // subtract the arrival speed from the remaining distance so we get one additional driving step with arrival speed
2643 // XXX: This does not work for ballistic update refs #2579
2644 const double distToArrival = seen + myArrivalPos - lane->getLength() - SPEED2DIST(arrivalSpeed);
2645 const double va = MAX2(NUMERICAL_EPS, cfModel.freeSpeed(this, getSpeed(), distToArrival, arrivalSpeed));
2646 v = MIN2(v, va);
2647 if (lastLink != nullptr) {
2648 lastLink->adaptLeaveSpeed(va);
2649 }
2650 lfLinks.push_back(DriveProcessItem(v, seen, lane->getEdge().isFringe() ? 1000 : 0));
2651 break;
2652 }
2653 // check whether the lane or the shadowLane is a dead end (allow some leeway on intersections)
2654 if (lane->isLinkEnd(link)
2655 || (MSGlobals::gSublane && brakeForOverlap(*link, lane))
2656 || (opposite && (*link)->getViaLaneOrLane()->getParallelOpposite() == nullptr
2658 double va = cfModel.stopSpeed(this, getSpeed(), seen);
2659 if (lastLink != nullptr) {
2660 lastLink->adaptLeaveSpeed(va);
2661 }
2664 } else {
2665 v = MIN2(va, v);
2666 }
2667#ifdef DEBUG_PLAN_MOVE
2668 if (DEBUG_COND) {
2669 std::cout << " braking for link end lane=" << lane->getID() << " seen=" << seen
2670 << " overlap=" << getLateralOverlap() << " va=" << va << " committed=" << myLaneChangeModel->getCommittedSpeed() << " v=" << v << "\n";
2671
2672 }
2673#endif
2674 if (lane->isLinkEnd(link)) {
2675 lfLinks.emplace_back(v, seen);
2676 break;
2677 }
2678 }
2679 lateralShift += (*link)->getLateralShift();
2680 const bool yellowOrRed = (*link)->haveRed() || (*link)->haveYellow();
2681 // We distinguish 3 cases when determining the point at which a vehicle stops:
2682 // - allway_stop: the vehicle should stop close to the stop line but may stop at larger distance
2683 // - red/yellow light: here the vehicle 'knows' that it will have priority eventually and does not need to stop on a precise spot
2684 // - other types of minor links: the vehicle needs to stop as close to the junction as necessary
2685 // to minimize the time window for passing the junction. If the
2686 // vehicle 'decides' to accelerate and cannot enter the junction in
2687 // the next step, new foes may appear and cause a collision (see #1096)
2688 // - major links: stopping point is irrelevant
2689 double laneStopOffset;
2690 const double majorStopOffset = MAX2(getVehicleType().getParameter().getJMParam(SUMO_ATTR_JM_STOPLINE_GAP, DIST_TO_STOPLINE_EXPECT_PRIORITY), lane->getVehicleStopOffset(this));
2691 // override low desired decel at yellow and red
2692 const double stopDecel = yellowOrRed && !isRail() ? MAX2(MIN2(MSGlobals::gTLSYellowMinDecel, cfModel.getEmergencyDecel()), cfModel.getMaxDecel()) : cfModel.getMaxDecel();
2693 const double brakeDist = cfModel.brakeGap(myState.mySpeed, stopDecel, 0);
2694 const bool canBrakeBeforeLaneEnd = seen >= brakeDist;
2695 const bool canBrakeBeforeStopLine = seen - lane->getVehicleStopOffset(this) >= brakeDist;
2696 if (yellowOrRed) {
2697 // Wait at red traffic light with full distance if possible
2698 laneStopOffset = majorStopOffset;
2699 } else if ((*link)->havePriority()) {
2700 // On priority link, we should never stop below visibility distance
2701 laneStopOffset = MIN2((*link)->getFoeVisibilityDistance() - POSITION_EPS, majorStopOffset);
2702 } else {
2703 double minorStopOffset = MAX2(lane->getVehicleStopOffset(this),
2704 getVehicleType().getParameter().getJMParam(SUMO_ATTR_JM_STOPLINE_CROSSING_GAP, MSPModel::SAFETY_GAP) - (*link)->getDistToFoePedCrossing());
2705#ifdef DEBUG_PLAN_MOVE
2706 if (DEBUG_COND) {
2707 std::cout << " minorStopOffset=" << minorStopOffset << " distToFoePedCrossing=" << (*link)->getDistToFoePedCrossing() << "\n";
2708 }
2709#endif
2710 if ((*link)->getState() == LINKSTATE_ALLWAY_STOP) {
2711 minorStopOffset = MAX2(minorStopOffset, getVehicleType().getParameter().getJMParam(SUMO_ATTR_JM_STOPLINE_GAP, 0));
2712 } else {
2713 minorStopOffset = MAX2(minorStopOffset, getVehicleType().getParameter().getJMParam(SUMO_ATTR_JM_STOPLINE_GAP_MINOR, 0));
2714 }
2715 // On minor link, we should likewise never stop below visibility distance
2716 laneStopOffset = MIN2((*link)->getFoeVisibilityDistance() - POSITION_EPS, minorStopOffset);
2717 }
2718#ifdef DEBUG_PLAN_MOVE
2719 if (DEBUG_COND) {
2720 std::cout << SIMTIME << " veh=" << getID() << " desired stopOffset on lane '" << lane->getID() << "' is " << laneStopOffset << "\n";
2721 }
2722#endif
2723 if (canBrakeBeforeLaneEnd) {
2724 // avoid emergency braking if possible
2725 laneStopOffset = MIN2(laneStopOffset, seen - brakeDist);
2726 }
2727 laneStopOffset = MAX2(POSITION_EPS, laneStopOffset);
2728 double stopDist = MAX2(0., seen - laneStopOffset);
2729 if (yellowOrRed && getDevice(typeid(MSDevice_GLOSA)) != nullptr
2730 && static_cast<MSDevice_GLOSA*>(getDevice(typeid(MSDevice_GLOSA)))->getOverrideSafety()
2731 && static_cast<MSDevice_GLOSA*>(getDevice(typeid(MSDevice_GLOSA)))->isSpeedAdviceActive()) {
2732 stopDist = std::numeric_limits<double>::max();
2733 }
2734 if (newStopDist != std::numeric_limits<double>::max()) {
2735 stopDist = MAX2(stopDist, newStopDist);
2736 }
2737#ifdef DEBUG_PLAN_MOVE
2738 if (DEBUG_COND) {
2739 std::cout << SIMTIME << " veh=" << getID() << " effective stopOffset on lane '" << lane->getID()
2740 << "' is " << laneStopOffset << " (-> stopDist=" << stopDist << ")" << std::endl;
2741 }
2742#endif
2743 if (isRail()
2744 && !lane->isInternal()) {
2745 // check for train direction reversal
2746 if (lane->getBidiLane() != nullptr
2747 && (*link)->getLane()->getBidiLane() == lane) {
2748 double vMustReverse = getCarFollowModel().stopSpeed(this, getSpeed(), seen - POSITION_EPS);
2749 if (seen < 1) {
2750 mustSeeBeforeReversal = 2 * seen + getLength();
2751 }
2752 v = MIN2(v, vMustReverse);
2753 }
2754 // signal that is passed in the current step does not count
2755 foundRailSignal |= ((*link)->getTLLogic() != nullptr
2756 && (*link)->getTLLogic()->getLogicType() == TrafficLightType::RAIL_SIGNAL
2757 && seen > SPEED2DIST(v));
2758 }
2759
2760 bool canReverseEventually = false;
2761 const double vReverse = checkReversal(canReverseEventually, laneMaxV, seen);
2762 v = MIN2(v, vReverse);
2763#ifdef DEBUG_PLAN_MOVE
2764 if (DEBUG_COND) {
2765 std::cout << SIMTIME << " veh=" << getID() << " canReverseEventually=" << canReverseEventually << " v=" << v << "\n";
2766 }
2767#endif
2768
2769 // check whether we need to slow down in order to finish a continuous lane change
2771 if ( // slow down to finish lane change before a turn lane
2772 ((*link)->getDirection() == LinkDirection::LEFT || (*link)->getDirection() == LinkDirection::RIGHT) ||
2773 // slow down to finish lane change before the shadow lane ends
2774 (myLaneChangeModel->getShadowLane() != nullptr &&
2775 (*link)->getViaLaneOrLane()->getParallelLane(myLaneChangeModel->getShadowDirection()) == nullptr)) {
2776 // XXX maybe this is too harsh. Vehicles could cut some corners here
2777 const double timeRemaining = STEPS2TIME(myLaneChangeModel->remainingTime());
2778 assert(timeRemaining != 0);
2779 // XXX: Euler-logic (#860), but I couldn't identify problems from this yet (Leo). Refs. #2575
2780 const double va = MAX2(cfModel.stopSpeed(this, getSpeed(), seen - POSITION_EPS),
2781 (seen - POSITION_EPS) / timeRemaining);
2782#ifdef DEBUG_PLAN_MOVE
2783 if (DEBUG_COND) {
2784 std::cout << SIMTIME << " veh=" << getID() << " slowing down to finish continuous change before"
2785 << " link=" << (*link)->getViaLaneOrLane()->getID()
2786 << " timeRemaining=" << timeRemaining
2787 << " v=" << v
2788 << " va=" << va
2789 << std::endl;
2790 }
2791#endif
2792 v = MIN2(va, v);
2793 }
2794 }
2795
2796 // - always issue a request to leave the intersection we are currently on
2797 const bool leavingCurrentIntersection = myLane->getEdge().isInternal() && lastLink == nullptr;
2798 // - do not issue a request to enter an intersection after we already slowed down for an earlier one
2799 const bool abortRequestAfterMinor = slowedDownForMinor && (*link)->getInternalLaneBefore() == nullptr;
2800 // - even if red, if we cannot break we should issue a request
2801 bool setRequest = (v > NUMERICAL_EPS_SPEED && !abortRequestAfterMinor) || (leavingCurrentIntersection);
2802
2803 double stopSpeed = cfModel.stopSpeed(this, getSpeed(), stopDist, stopDecel, MSCFModel::CalcReason::CURRENT_WAIT);
2804 double vLinkWait = MIN2(v, stopSpeed);
2805#ifdef DEBUG_PLAN_MOVE
2806 if (DEBUG_COND) {
2807 std::cout
2808 << " stopDist=" << stopDist
2809 << " stopDecel=" << stopDecel
2810 << " vLinkWait=" << vLinkWait
2811 << " brakeDist=" << brakeDist
2812 << " seen=" << seen
2813 << " leaveIntersection=" << leavingCurrentIntersection
2814 << " setRequest=" << setRequest
2815 //<< std::setprecision(16)
2816 //<< " v=" << v
2817 //<< " speedEps=" << NUMERICAL_EPS_SPEED
2818 //<< std::setprecision(gPrecision)
2819 << "\n";
2820 }
2821#endif
2822
2823 if (yellowOrRed && canBrakeBeforeStopLine && !ignoreRed(*link, canBrakeBeforeStopLine) && seen >= mustSeeBeforeReversal) {
2824 if (lane->isInternal()) {
2825 checkLinkLeaderCurrentAndParallel(*link, lane, seen, lastLink, v, vLinkPass, vLinkWait, setRequest);
2826 }
2827 // arrivalSpeed / arrivalTime when braking for red light is only relevent for rail signal switching
2828 const SUMOTime arrivalTime = getArrivalTime(t, seen, v, vLinkPass);
2829 // the vehicle is able to brake in front of a yellow/red traffic light
2830 lfLinks.push_back(DriveProcessItem(*link, v, vLinkWait, false, arrivalTime, vLinkWait, 0, seen, -1));
2831 //lfLinks.push_back(DriveProcessItem(0, vLinkWait, vLinkWait, false, 0, 0, stopDist));
2832 break;
2833 }
2834
2835 const MSLink* entryLink = (*link)->getCorrespondingEntryLink();
2836 if (entryLink->haveRed() && ignoreRed(*link, canBrakeBeforeStopLine) && STEPS2TIME(t - entryLink->getLastStateChange()) > 2) {
2837 // restrict speed when ignoring a red light
2838 const double redSpeed = MIN2(v, getVehicleType().getParameter().getJMParam(SUMO_ATTR_JM_DRIVE_RED_SPEED, v));
2839 const double va = MAX2(redSpeed, cfModel.freeSpeed(this, getSpeed(), seen, redSpeed));
2840 v = MIN2(va, v);
2841#ifdef DEBUG_PLAN_MOVE
2842 if (DEBUG_COND) std::cout
2843 << " ignoreRed spent=" << STEPS2TIME(t - (*link)->getLastStateChange())
2844 << " redSpeed=" << redSpeed
2845 << " va=" << va
2846 << " v=" << v
2847 << "\n";
2848#endif
2849 }
2850
2851 checkLinkLeaderCurrentAndParallel(*link, lane, seen, lastLink, v, vLinkPass, vLinkWait, setRequest);
2852
2853 if (lastLink != nullptr) {
2854 lastLink->adaptLeaveSpeed(laneMaxV);
2855 }
2856 double arrivalSpeed = vLinkPass;
2857 // vehicles should decelerate when approaching a minor link
2858 // - unless they are close enough to have clear visibility of all relevant foe lanes and may start to accelerate again
2859 // - and unless they are so close that stopping is impossible (i.e. when a green light turns to yellow when close to the junction)
2860
2861 // whether the vehicle/driver is close enough to the link to see all possible foes #2123
2862 const double visibilityDistance = (*link)->getFoeVisibilityDistance();
2863 const double determinedFoePresence = seen <= visibilityDistance;
2864// // VARIANT: account for time needed to recognize whether relevant vehicles are on the foe lanes. (Leo)
2865// double foeRecognitionTime = 0.0;
2866// double determinedFoePresence = seen < visibilityDistance - myState.mySpeed*foeRecognitionTime;
2867
2868#ifdef DEBUG_PLAN_MOVE
2869 if (DEBUG_COND) {
2870 std::cout << " approaching link=" << (*link)->getViaLaneOrLane()->getID() << " prio=" << (*link)->havePriority() << " seen=" << seen << " visibilityDistance=" << visibilityDistance << " brakeDist=" << brakeDist << "\n";
2871 }
2872#endif
2873
2874 const bool couldBrakeForMinor = !(*link)->havePriority() && brakeDist < seen && !(*link)->lastWasContMajor();
2875 if (couldBrakeForMinor && !determinedFoePresence) {
2876 // vehicle decelerates just enough to be able to stop if necessary and then accelerates
2877 double maxSpeedAtVisibilityDist = cfModel.maximumSafeStopSpeed(visibilityDistance, cfModel.getMaxDecel(), myState.mySpeed, false, 0., false);
2878 // XXX: estimateSpeedAfterDistance does not use euler-logic (thus returns a lower value than possible here...)
2879 double maxArrivalSpeed = cfModel.estimateSpeedAfterDistance(visibilityDistance, maxSpeedAtVisibilityDist, cfModel.getMaxAccel());
2880 arrivalSpeed = MIN2(vLinkPass, maxArrivalSpeed);
2881 slowedDownForMinor = true;
2882#ifdef DEBUG_PLAN_MOVE
2883 if (DEBUG_COND) {
2884 std::cout << " slowedDownForMinor maxSpeedAtVisDist=" << maxSpeedAtVisibilityDist << " maxArrivalSpeed=" << maxArrivalSpeed << " arrivalSpeed=" << arrivalSpeed << "\n";
2885 }
2886#endif
2887 } else if ((*link)->getState() == LINKSTATE_EQUAL && myWaitingTime > 0) {
2888 // check for deadlock (circular yielding)
2889 //std::cout << SIMTIME << " veh=" << getID() << " check rbl-deadlock\n";
2890 std::pair<const SUMOVehicle*, const MSLink*> blocker = (*link)->getFirstApproachingFoe(*link);
2891 //std::cout << " blocker=" << Named::getIDSecure(blocker.first) << "\n";
2892 int n = 100;
2893 while (blocker.second != nullptr && blocker.second != *link && n > 0) {
2894 blocker = blocker.second->getFirstApproachingFoe(*link);
2895 n--;
2896 //std::cout << " blocker=" << Named::getIDSecure(blocker.first) << "\n";
2897 }
2898 if (n == 0) {
2899 WRITE_WARNINGF(TL("Suspicious right_before_left junction '%'."), lane->getEdge().getToJunction()->getID());
2900 }
2901 //std::cout << " blockerLink=" << blocker.second << " link=" << *link << "\n";
2902 if (blocker.second == *link) {
2903 const double threshold = (*link)->getDirection() == LinkDirection::STRAIGHT ? 0.25 : 0.75;
2904 if (RandHelper::rand(getRNG()) < threshold) {
2905 //std::cout << " abort request, threshold=" << threshold << "\n";
2906 setRequest = false;
2907 }
2908 }
2909 }
2910
2911 const SUMOTime arrivalTime = getArrivalTime(t, seen, v, arrivalSpeed);
2912 if (couldBrakeForMinor && determinedFoePresence && (*link)->getLane()->getEdge().isRoundabout()) {
2913 const bool wasOpened = (*link)->opened(arrivalTime, arrivalSpeed, arrivalSpeed,
2915 getCarFollowModel().getMaxDecel(),
2917 nullptr, false, this);
2918 if (!wasOpened) {
2919 slowedDownForMinor = true;
2920 }
2921#ifdef DEBUG_PLAN_MOVE
2922 if (DEBUG_COND) {
2923 std::cout << " slowedDownForMinor at roundabout=" << (!wasOpened) << "\n";
2924 }
2925#endif
2926 }
2927
2928 // compute arrival speed and arrival time if vehicle starts braking now
2929 // if stopping is possible, arrivalTime can be arbitrarily large. A small value keeps fractional times (impatience) meaningful
2930 double arrivalSpeedBraking = 0;
2931 const double bGap = cfModel.brakeGap(v);
2932 if (seen < bGap && !isStopped() && !planningToStop) { // XXX: should this use the current speed (at least for the ballistic case)? (Leo) Refs. #2575
2933 // vehicle cannot come to a complete stop in time
2935 arrivalSpeedBraking = cfModel.getMinimalArrivalSpeedEuler(seen, v);
2936 // due to discrete/continuous mismatch (when using Euler update) we have to ensure that braking actually helps
2937 arrivalSpeedBraking = MIN2(arrivalSpeedBraking, arrivalSpeed);
2938 } else {
2939 arrivalSpeedBraking = cfModel.getMinimalArrivalSpeed(seen, myState.mySpeed);
2940 }
2941 }
2942
2943 // estimate leave speed for passing time computation
2944 // l=linkLength, a=accel, t=continuousTime, v=vLeave
2945 // l=v*t + 0.5*a*t^2, solve for t and multiply with a, then add v
2946 const double estimatedLeaveSpeed = MIN2((*link)->getViaLaneOrLane()->getVehicleMaxSpeed(this, maxVD),
2947 getCarFollowModel().estimateSpeedAfterDistance((*link)->getLength(), arrivalSpeed, getVehicleType().getCarFollowModel().getMaxAccel()));
2948 lfLinks.push_back(DriveProcessItem(*link, v, vLinkWait, setRequest,
2949 arrivalTime, arrivalSpeed,
2950 arrivalSpeedBraking,
2951 seen, estimatedLeaveSpeed));
2952 if ((*link)->getViaLane() == nullptr) {
2953 hadNonInternal = true;
2954 ++view;
2955 }
2956#ifdef DEBUG_PLAN_MOVE
2957 if (DEBUG_COND) {
2958 std::cout << " checkAbort setRequest=" << setRequest << " v=" << v << " seen=" << seen << " dist=" << dist
2959 << " seenNonInternal=" << seenNonInternal
2960 << " seenInternal=" << seenInternal << " length=" << vehicleLength << "\n";
2961 }
2962#endif
2963 // we need to look ahead far enough to see available space for checkRewindLinkLanes
2964 if ((!setRequest || v <= 0 || seen > dist) && hadNonInternal && seenNonInternal > MAX2(vehicleLength * CRLL_LOOK_AHEAD, vehicleLength + seenInternal) && foundRailSignal) {
2965 break;
2966 }
2967 // get the following lane
2968 lane = (*link)->getViaLaneOrLane();
2969 laneMaxV = lane->getVehicleMaxSpeed(this, maxVD);
2971 laneMaxV = std::numeric_limits<double>::max();
2972 }
2973 // the link was passed
2974 // compute the velocity to use when the link is not blocked by other vehicles
2975 // the vehicle shall be not faster when reaching the next lane than allowed
2976 // speed limits are not emergencies (e.g. when the limit changes suddenly due to TraCI or a variableSpeedSignal)
2977 const double va = MAX2(cfModel.freeSpeed(this, getSpeed(), seen, laneMaxV), vMinComfortable);
2978 v = MIN2(va, v);
2979#ifdef DEBUG_PLAN_MOVE
2980 if (DEBUG_COND) {
2981 std::cout << " laneMaxV=" << laneMaxV << " freeSpeed=" << va << " v=" << v << "\n";
2982 }
2983#endif
2984 if (lane->getEdge().isInternal()) {
2985 seenInternal += lane->getLength();
2986 } else {
2987 seenNonInternal += lane->getLength();
2988 }
2989 // do not restrict results to the current vehicle to allow caching for the current time step
2990 leaderLane = opposite ? lane->getParallelOpposite() : lane;
2991 if (leaderLane == nullptr) {
2992
2993 break;
2994 }
2995 ahead = opposite ? MSLeaderInfo(leaderLane->getWidth()) : leaderLane->getLastVehicleInformation(nullptr, 0);
2996 seen += lane->getLength();
2997 vLinkPass = MIN2(cfModel.estimateSpeedAfterDistance(lane->getLength(), v, cfModel.getMaxAccel()), laneMaxV); // upper bound
2998 lastLink = &lfLinks.back();
2999 }
3000
3001//#ifdef DEBUG_PLAN_MOVE
3002// if(DEBUG_COND){
3003// std::cout << "planMoveInternal found safe speed v = " << v << std::endl;
3004// }
3005//#endif
3006
3007#ifdef PARALLEL_STOPWATCH
3008 myLane->getStopWatch()[0].stop();
3009#endif
3010}
3011
3012
3013double
3014MSVehicle::slowDownForSchedule(double vMinComfortable) const {
3015 const double sfp = getVehicleType().getParameter().speedFactorPremature;
3016 const MSStop& stop = myStops.front();
3017 std::pair<double, double> timeDist = estimateTimeToNextStop();
3018 double arrivalDelay = SIMTIME + timeDist.first - STEPS2TIME(stop.pars.arrival);
3019 double t = STEPS2TIME(stop.pars.arrival - SIMSTEP);
3022 arrivalDelay += STEPS2TIME(stop.pars.arrival - flexStart);
3023 t = STEPS2TIME(flexStart - SIMSTEP);
3024 } else if (stop.pars.started >= 0 && MSGlobals::gUseStopStarted) {
3025 arrivalDelay += STEPS2TIME(stop.pars.arrival - stop.pars.started);
3026 t = STEPS2TIME(stop.pars.started - SIMSTEP);
3027 }
3028 if (arrivalDelay < 0 && sfp < getChosenSpeedFactor()) {
3029 // we can slow down to better match the schedule (and increase energy efficiency)
3030 const double vSlowDownMin = MAX2(myLane->getSpeedLimit() * sfp, vMinComfortable);
3031 const double s = timeDist.second;
3032 const double b = getCarFollowModel().getMaxDecel();
3033 // x = speed for arriving in t seconds
3034 // u = time at full speed
3035 // u * x + (t - u) * 0.5 * x = s
3036 // t - u = x / b
3037 // eliminate u, solve x
3038 const double radicand = 4 * t * t * b * b - 8 * s * b;
3039 const double x = radicand >= 0 ? t * b - sqrt(radicand) * 0.5 : vSlowDownMin;
3040 double vSlowDown = x < vSlowDownMin ? vSlowDownMin : x;
3041#ifdef DEBUG_PLAN_MOVE
3042 if (DEBUG_COND) {
3043 std::cout << SIMTIME << " veh=" << getID() << " ad=" << arrivalDelay << " t=" << t << " vsm=" << vSlowDownMin
3044 << " r=" << radicand << " vs=" << vSlowDown << "\n";
3045 }
3046#endif
3047 return vSlowDown;
3048 } else if (arrivalDelay > 0 && sfp > getChosenSpeedFactor()) {
3049 // in principle we could up to catch up with the schedule
3050 // but at this point we can only lower the speed, the
3051 // information would have to be used when computing getVehicleMaxSpeed
3052 }
3053 return getMaxSpeed();
3054}
3055
3057MSVehicle::getArrivalTime(SUMOTime t, double seen, double v, double arrivalSpeed) const {
3058 const MSCFModel& cfModel = getCarFollowModel();
3059 SUMOTime arrivalTime;
3061 // @note intuitively it would make sense to compare arrivalSpeed with getSpeed() instead of v
3062 // however, due to the current position update rule (ticket #860) the vehicle moves with v in this step
3063 // subtract DELTA_T because t is the time at the end of this step and the movement is not carried out yet
3064 arrivalTime = t - DELTA_T + cfModel.getMinimalArrivalTime(seen, v, arrivalSpeed);
3065 } else {
3066 arrivalTime = t - DELTA_T + cfModel.getMinimalArrivalTime(seen, myState.mySpeed, arrivalSpeed);
3067 }
3068 if (isStopped()) {
3069 arrivalTime += MAX2((SUMOTime)0, myStops.front().duration);
3070 }
3071 return arrivalTime;
3072}
3073
3074
3075void
3076MSVehicle::adaptToLeaders(const MSLeaderInfo& ahead, double latOffset,
3077 const double seen, DriveProcessItem* const lastLink,
3078 const MSLane* const lane, double& v, double& vLinkPass) const {
3079 int rightmost;
3080 int leftmost;
3081 ahead.getSubLanes(this, latOffset, rightmost, leftmost);
3082#ifdef DEBUG_PLAN_MOVE
3083 if (DEBUG_COND) std::cout << SIMTIME
3084 << "\nADAPT_TO_LEADERS\nveh=" << getID()
3085 << " lane=" << lane->getID()
3086 << " latOffset=" << latOffset
3087 << " rm=" << rightmost
3088 << " lm=" << leftmost
3089 << " shift=" << ahead.getSublaneOffset()
3090 << " ahead=" << ahead.toString()
3091 << "\n";
3092#endif
3093 /*
3094 if (myLaneChangeModel->getCommittedSpeed() > 0) {
3095 v = MIN2(v, myLaneChangeModel->getCommittedSpeed());
3096 vLinkPass = MIN2(vLinkPass, myLaneChangeModel->getCommittedSpeed());
3097 #ifdef DEBUG_PLAN_MOVE
3098 if (DEBUG_COND) std::cout << " hasCommitted=" << myLaneChangeModel->getCommittedSpeed() << "\n";
3099 #endif
3100 return;
3101 }
3102 */
3103 for (int sublane = rightmost; sublane <= leftmost; ++sublane) {
3104 const MSVehicle* pred = ahead[sublane];
3105 if (pred != nullptr && pred != this) {
3106 // @todo avoid multiple adaptations to the same leader
3107 const double predBack = pred->getBackPositionOnLane(lane);
3108 double gap = (lastLink == nullptr
3109 ? predBack - myState.myPos - getVehicleType().getMinGap()
3110 : predBack + seen - lane->getLength() - getVehicleType().getMinGap());
3111 bool oncoming = false;
3113 if (pred->getLaneChangeModel().isOpposite() || lane == pred->getLaneChangeModel().getShadowLane()) {
3114 // ego might and leader are driving against lane
3115 gap = (lastLink == nullptr
3116 ? myState.myPos - predBack - getVehicleType().getMinGap()
3117 : predBack + seen - lane->getLength() - getVehicleType().getMinGap());
3118 } else {
3119 // ego and leader are driving in the same direction as lane (shadowlane for ego)
3120 gap = (lastLink == nullptr
3121 ? predBack - (myLane->getLength() - myState.myPos) - getVehicleType().getMinGap()
3122 : predBack + seen - lane->getLength() - getVehicleType().getMinGap());
3123 }
3124 } else if (pred->getLaneChangeModel().isOpposite() && pred->getLaneChangeModel().getShadowLane() != lane) {
3125 // must react to stopped / dangerous oncoming vehicles
3126 gap += -pred->getVehicleType().getLength() + getVehicleType().getMinGap() - MAX2(getVehicleType().getMinGap(), pred->getVehicleType().getMinGap());
3127 // try to avoid collision in the next second
3128 const double predMaxDist = pred->getSpeed() + pred->getCarFollowModel().getMaxAccel();
3129#ifdef DEBUG_PLAN_MOVE
3130 if (DEBUG_COND) {
3131 std::cout << " fixedGap=" << gap << " predMaxDist=" << predMaxDist << "\n";
3132 }
3133#endif
3134 if (gap < predMaxDist + getSpeed() || pred->getLane() == lane->getBidiLane()) {
3135 gap -= predMaxDist;
3136 }
3137 } else if (pred->getLane() == lane->getBidiLane()) {
3138 gap -= pred->getVehicleType().getLengthWithGap();
3139 oncoming = true;
3140 }
3141#ifdef DEBUG_PLAN_MOVE
3142 if (DEBUG_COND) {
3143 std::cout << " pred=" << pred->getID() << " predLane=" << pred->getLane()->getID() << " predPos=" << pred->getPositionOnLane() << " gap=" << gap << " predBack=" << predBack << " seen=" << seen << " lane=" << lane->getID() << " myLane=" << myLane->getID() << " lastLink=" << (lastLink == nullptr ? "NULL" : lastLink->myLink->getDescription()) << " oncoming=" << oncoming << "\n";
3144 }
3145#endif
3146 if (oncoming && gap >= 0) {
3147 adaptToOncomingLeader(std::make_pair(pred, gap), lastLink, v, vLinkPass);
3148 } else {
3149 adaptToLeader(std::make_pair(pred, gap), seen, lastLink, v, vLinkPass);
3150 }
3151 }
3152 }
3153}
3154
3155void
3157 double seen,
3158 DriveProcessItem* const lastLink,
3159 double& v, double& vLinkPass) const {
3160 int rightmost;
3161 int leftmost;
3162 ahead.getSubLanes(this, latOffset, rightmost, leftmost);
3163#ifdef DEBUG_PLAN_MOVE
3164 if (DEBUG_COND) std::cout << SIMTIME
3165 << "\nADAPT_TO_LEADERS_DISTANCE\nveh=" << getID()
3166 << " latOffset=" << latOffset
3167 << " rm=" << rightmost
3168 << " lm=" << leftmost
3169 << " ahead=" << ahead.toString()
3170 << "\n";
3171#endif
3172 for (int sublane = rightmost; sublane <= leftmost; ++sublane) {
3173 CLeaderDist predDist = ahead[sublane];
3174 const MSVehicle* pred = predDist.first;
3175 if (pred != nullptr && pred != this) {
3176#ifdef DEBUG_PLAN_MOVE
3177 if (DEBUG_COND) {
3178 std::cout << " pred=" << pred->getID() << " predLane=" << pred->getLane()->getID() << " predPos=" << pred->getPositionOnLane() << " gap=" << predDist.second << "\n";
3179 }
3180#endif
3181 adaptToLeader(predDist, seen, lastLink, v, vLinkPass);
3182 }
3183 }
3184}
3185
3186
3187void
3188MSVehicle::adaptToLeader(const std::pair<const MSVehicle*, double> leaderInfo,
3189 double seen,
3190 DriveProcessItem* const lastLink,
3191 double& v, double& vLinkPass) const {
3192 if (leaderInfo.first != 0) {
3193 if (ignoreFoe(leaderInfo.first)) {
3194#ifdef DEBUG_PLAN_MOVE_LEADERINFO
3195 if (DEBUG_COND) {
3196 std::cout << " foe ignored\n";
3197 }
3198#endif
3199 return;
3200 }
3201 const MSCFModel& cfModel = getCarFollowModel();
3202 double vsafeLeader = 0;
3204 vsafeLeader = -std::numeric_limits<double>::max();
3205 }
3206 bool backOnRoute = true;
3207 if (leaderInfo.second < 0 && lastLink != nullptr && lastLink->myLink != nullptr) {
3208 backOnRoute = false;
3209 // this can either be
3210 // a) a merging situation (leader back is is not our route) or
3211 // b) a minGap violation / collision
3212 MSLane* current = lastLink->myLink->getViaLaneOrLane();
3213 if (leaderInfo.first->getBackLane() == current) {
3214 backOnRoute = true;
3215 } else {
3216 for (MSLane* lane : getBestLanesContinuation()) {
3217 if (lane == current) {
3218 break;
3219 }
3220 if (leaderInfo.first->getBackLane() == lane) {
3221 backOnRoute = true;
3222 }
3223 }
3224 }
3225#ifdef DEBUG_PLAN_MOVE
3226 if (DEBUG_COND) {
3227 std::cout << SIMTIME << " current=" << current->getID() << " leaderBackLane=" << leaderInfo.first->getBackLane()->getID() << " backOnRoute=" << backOnRoute << "\n";
3228 }
3229#endif
3230 if (!backOnRoute) {
3231 double stopDist = seen - current->getLength() - POSITION_EPS;
3232 if (lastLink->myLink->getInternalLaneBefore() != nullptr) {
3233 // do not drive onto the junction conflict area
3234 stopDist -= lastLink->myLink->getInternalLaneBefore()->getLength();
3235 }
3236 vsafeLeader = cfModel.stopSpeed(this, getSpeed(), stopDist);
3237 }
3238 }
3239 if (backOnRoute) {
3240 vsafeLeader = cfModel.followSpeed(this, getSpeed(), leaderInfo.second, leaderInfo.first->getSpeed(), leaderInfo.first->getCurrentApparentDecel(), leaderInfo.first);
3241 }
3242 if (lastLink != nullptr) {
3243 const double futureVSafe = cfModel.followSpeed(this, lastLink->accelV, leaderInfo.second, leaderInfo.first->getSpeed(), leaderInfo.first->getCurrentApparentDecel(), leaderInfo.first, MSCFModel::CalcReason::FUTURE);
3244 lastLink->adaptLeaveSpeed(futureVSafe);
3245#ifdef DEBUG_PLAN_MOVE
3246 if (DEBUG_COND) {
3247 std::cout << " vlinkpass=" << lastLink->myVLinkPass << " futureVSafe=" << futureVSafe << "\n";
3248 }
3249#endif
3250 }
3251 v = MIN2(v, vsafeLeader);
3252 vLinkPass = MIN2(vLinkPass, vsafeLeader);
3253#ifdef DEBUG_PLAN_MOVE
3254 if (DEBUG_COND) std::cout
3255 << SIMTIME
3256 //std::cout << std::setprecision(10);
3257 << " veh=" << getID()
3258 << " lead=" << leaderInfo.first->getID()
3259 << " leadSpeed=" << leaderInfo.first->getSpeed()
3260 << " gap=" << leaderInfo.second
3261 << " leadLane=" << leaderInfo.first->getLane()->getID()
3262 << " predPos=" << leaderInfo.first->getPositionOnLane()
3263 << " myLane=" << myLane->getID()
3264 << " v=" << v
3265 << " vSafeLeader=" << vsafeLeader
3266 << " vLinkPass=" << vLinkPass
3267 << "\n";
3268#endif
3269 }
3270}
3271
3272
3273void
3274MSVehicle::adaptToJunctionLeader(const std::pair<const MSVehicle*, double> leaderInfo,
3275 const double seen, DriveProcessItem* const lastLink,
3276 const MSLane* const lane, double& v, double& vLinkPass,
3277 double distToCrossing) const {
3278 if (leaderInfo.first != 0) {
3279 if (ignoreFoe(leaderInfo.first)) {
3280#ifdef DEBUG_PLAN_MOVE_LEADERINFO
3281 if (DEBUG_COND) {
3282 std::cout << " junction foe ignored\n";
3283 }
3284#endif
3285 return;
3286 }
3287 const MSCFModel& cfModel = getCarFollowModel();
3288 double vsafeLeader = 0;
3290 vsafeLeader = -std::numeric_limits<double>::max();
3291 }
3292 if (leaderInfo.second >= 0) {
3293 if (hasDeparted()) {
3294 vsafeLeader = cfModel.followSpeed(this, getSpeed(), leaderInfo.second, leaderInfo.first->getSpeed(), leaderInfo.first->getCurrentApparentDecel(), leaderInfo.first);
3295 } else {
3296 // called in the context of MSLane::isInsertionSuccess
3297 vsafeLeader = cfModel.insertionFollowSpeed(this, getSpeed(), leaderInfo.second, leaderInfo.first->getSpeed(), leaderInfo.first->getCurrentApparentDecel(), leaderInfo.first);
3298 }
3299 } else if (leaderInfo.first != this) {
3300 // the leading, in-lapping vehicle is occupying the complete next lane
3301 // stop before entering this lane
3302 vsafeLeader = cfModel.stopSpeed(this, getSpeed(), seen - lane->getLength() - POSITION_EPS);
3303#ifdef DEBUG_PLAN_MOVE_LEADERINFO
3304 if (DEBUG_COND) {
3305 std::cout << SIMTIME << " veh=" << getID() << " stopping before junction: lane=" << lane->getID() << " seen=" << seen
3306 << " laneLength=" << lane->getLength()
3307 << " stopDist=" << seen - lane->getLength() - POSITION_EPS
3308 << " vsafeLeader=" << vsafeLeader
3309 << " distToCrossing=" << distToCrossing
3310 << "\n";
3311 }
3312#endif
3313 }
3314 if (distToCrossing >= 0) {
3315 // can the leader still stop in the way?
3316 const double vStop = cfModel.stopSpeed(this, getSpeed(), distToCrossing - getVehicleType().getMinGap());
3317 if (leaderInfo.first == this) {
3318 // braking for pedestrian
3319 const double vStopCrossing = cfModel.stopSpeed(this, getSpeed(), distToCrossing);
3320 vsafeLeader = vStopCrossing;
3321#ifdef DEBUG_PLAN_MOVE_LEADERINFO
3322 if (DEBUG_COND) {
3323 std::cout << " breaking for pedestrian distToCrossing=" << distToCrossing << " vStopCrossing=" << vStopCrossing << "\n";
3324 }
3325#endif
3326 if (lastLink != nullptr) {
3327 lastLink->adaptStopSpeed(vsafeLeader);
3328 }
3329 } else if (leaderInfo.second == -std::numeric_limits<double>::max()) {
3330 // drive up to the crossing point and stop
3331#ifdef DEBUG_PLAN_MOVE_LEADERINFO
3332 if (DEBUG_COND) {
3333 std::cout << " stop at crossing point for critical leader vStop=" << vStop << "\n";
3334 };
3335#endif
3336 vsafeLeader = MAX2(vsafeLeader, vStop);
3337 } else {
3338 const double leaderDistToCrossing = distToCrossing - leaderInfo.second;
3339 // estimate the time at which the leader has gone past the crossing point
3340 const double leaderPastCPTime = leaderDistToCrossing / MAX2(leaderInfo.first->getSpeed(), SUMO_const_haltingSpeed);
3341 // reach distToCrossing after that time
3342 // avgSpeed * leaderPastCPTime = distToCrossing
3343 // ballistic: avgSpeed = (getSpeed + vFinal) / 2
3344 const double vFinal = MAX2(getSpeed(), 2 * (distToCrossing - getVehicleType().getMinGap()) / leaderPastCPTime - getSpeed());
3345 const double v2 = getSpeed() + ACCEL2SPEED((vFinal - getSpeed()) / leaderPastCPTime);
3346 vsafeLeader = MAX2(vsafeLeader, MIN2(v2, vStop));
3347#ifdef DEBUG_PLAN_MOVE_LEADERINFO
3348 if (DEBUG_COND) {
3349 std::cout << " driving up to the crossing point (distToCrossing=" << distToCrossing << ")"
3350 << " leaderPastCPTime=" << leaderPastCPTime
3351 << " vFinal=" << vFinal
3352 << " v2=" << v2
3353 << " vStop=" << vStop
3354 << " vsafeLeader=" << vsafeLeader << "\n";
3355 }
3356#endif
3357 }
3358 }
3359 if (lastLink != nullptr) {
3360 lastLink->adaptLeaveSpeed(vsafeLeader);
3361 }
3362 v = MIN2(v, vsafeLeader);
3363 vLinkPass = MIN2(vLinkPass, vsafeLeader);
3364#ifdef DEBUG_PLAN_MOVE
3365 if (DEBUG_COND) std::cout
3366 << SIMTIME
3367 //std::cout << std::setprecision(10);
3368 << " veh=" << getID()
3369 << " lead=" << leaderInfo.first->getID()
3370 << " leadSpeed=" << leaderInfo.first->getSpeed()
3371 << " gap=" << leaderInfo.second
3372 << " leadLane=" << leaderInfo.first->getLane()->getID()
3373 << " predPos=" << leaderInfo.first->getPositionOnLane()
3374 << " seen=" << seen
3375 << " lane=" << lane->getID()
3376 << " myLane=" << myLane->getID()
3377 << " dTC=" << distToCrossing
3378 << " v=" << v
3379 << " vSafeLeader=" << vsafeLeader
3380 << " vLinkPass=" << vLinkPass
3381 << "\n";
3382#endif
3383 }
3384}
3385
3386
3387void
3388MSVehicle::adaptToOncomingLeader(const std::pair<const MSVehicle*, double> leaderInfo,
3389 DriveProcessItem* const lastLink,
3390 double& v, double& vLinkPass) const {
3391 if (leaderInfo.first != 0) {
3392 if (ignoreFoe(leaderInfo.first)) {
3393#ifdef DEBUG_PLAN_MOVE_LEADERINFO
3394 if (DEBUG_COND) {
3395 std::cout << " oncoming foe ignored\n";
3396 }
3397#endif
3398 return;
3399 }
3400 const MSCFModel& cfModel = getCarFollowModel();
3401 const MSVehicle* lead = leaderInfo.first;
3402 const MSCFModel& cfModelL = lead->getCarFollowModel();
3403 // assume the leader reacts symmetrically (neither stopping instantly nor ignoring ego)
3404 const double leaderBrakeGap = cfModelL.brakeGap(lead->getSpeed(), cfModelL.getMaxDecel(), 0);
3405 const double egoBrakeGap = cfModel.brakeGap(getSpeed(), cfModel.getMaxDecel(), 0);
3406 const double gapSum = leaderBrakeGap + egoBrakeGap;
3407 // ensure that both vehicles can leave an intersection if they are currently on it
3408 double egoExit = getDistanceToLeaveJunction();
3409 const double leaderExit = lead->getDistanceToLeaveJunction();
3410 double gap = leaderInfo.second;
3411 if (egoExit + leaderExit < gap) {
3412 gap -= egoExit + leaderExit;
3413 } else {
3414 egoExit = 0;
3415 }
3416 // split any distance in excess of brakeGaps evenly
3417 const double freeGap = MAX2(0.0, gap - gapSum);
3418 const double splitGap = MIN2(gap, gapSum);
3419 // assume remaining distance is allocated in proportion to braking distance
3420 const double gapRatio = gapSum > 0 ? egoBrakeGap / gapSum : 0.5;
3421 const double vsafeLeader = cfModel.stopSpeed(this, getSpeed(), splitGap * gapRatio + egoExit + 0.5 * freeGap);
3422 if (lastLink != nullptr) {
3423 const double futureVSafe = cfModel.stopSpeed(this, lastLink->accelV, leaderInfo.second, MSCFModel::CalcReason::FUTURE);
3424 lastLink->adaptLeaveSpeed(futureVSafe);
3425#ifdef DEBUG_PLAN_MOVE
3426 if (DEBUG_COND) {
3427 std::cout << " vlinkpass=" << lastLink->myVLinkPass << " futureVSafe=" << futureVSafe << "\n";
3428 }
3429#endif
3430 }
3431 v = MIN2(v, vsafeLeader);
3432 vLinkPass = MIN2(vLinkPass, vsafeLeader);
3433#ifdef DEBUG_PLAN_MOVE
3434 if (DEBUG_COND) std::cout
3435 << SIMTIME
3436 //std::cout << std::setprecision(10);
3437 << " veh=" << getID()
3438 << " oncomingLead=" << lead->getID()
3439 << " leadSpeed=" << lead->getSpeed()
3440 << " gap=" << leaderInfo.second
3441 << " gap2=" << gap
3442 << " gapRatio=" << gapRatio
3443 << " leadLane=" << lead->getLane()->getID()
3444 << " predPos=" << lead->getPositionOnLane()
3445 << " myLane=" << myLane->getID()
3446 << " v=" << v
3447 << " vSafeLeader=" << vsafeLeader
3448 << " vLinkPass=" << vLinkPass
3449 << "\n";
3450#endif
3451 }
3452}
3453
3454
3455void
3456MSVehicle::checkLinkLeaderCurrentAndParallel(const MSLink* link, const MSLane* lane, double seen,
3457 DriveProcessItem* const lastLink, double& v, double& vLinkPass, double& vLinkWait, bool& setRequest) const {
3459 // we want to pass the link but need to check for foes on internal lanes
3460 checkLinkLeader(link, lane, seen, lastLink, v, vLinkPass, vLinkWait, setRequest);
3461 if (myLaneChangeModel->getShadowLane() != nullptr) {
3462 const MSLink* const parallelLink = link->getParallelLink(myLaneChangeModel->getShadowDirection());
3463 if (parallelLink != nullptr) {
3464 checkLinkLeader(parallelLink, lane, seen, lastLink, v, vLinkPass, vLinkWait, setRequest, true);
3465 }
3466 }
3467 }
3468
3469}
3470
3471void
3472MSVehicle::checkLinkLeader(const MSLink* link, const MSLane* lane, double seen,
3473 DriveProcessItem* const lastLink, double& v, double& vLinkPass, double& vLinkWait, bool& setRequest,
3474 bool isShadowLink) const {
3475#ifdef DEBUG_PLAN_MOVE_LEADERINFO
3476 if (DEBUG_COND) {
3477 gDebugFlag1 = true; // See MSLink::getLeaderInfo
3478 }
3479#endif
3480 const MSLink::LinkLeaders linkLeaders = link->getLeaderInfo(this, seen, nullptr, isShadowLink);
3481#ifdef DEBUG_PLAN_MOVE_LEADERINFO
3482 if (DEBUG_COND) {
3483 gDebugFlag1 = false; // See MSLink::getLeaderInfo
3484 }
3485#endif
3486 for (MSLink::LinkLeaders::const_iterator it = linkLeaders.begin(); it != linkLeaders.end(); ++it) {
3487 // the vehicle to enter the junction first has priority
3488 const MSVehicle* leader = (*it).vehAndGap.first;
3489 if (leader == nullptr) {
3490 // leader is a pedestrian. Passing 'this' as a dummy.
3491#ifdef DEBUG_PLAN_MOVE_LEADERINFO
3492 if (DEBUG_COND) {
3493 std::cout << SIMTIME << " veh=" << getID() << " is blocked on link to " << link->getViaLaneOrLane()->getID() << " by pedestrian. dist=" << it->distToCrossing << "\n";
3494 }
3495#endif
3498#ifdef DEBUG_PLAN_MOVE
3499 if (DEBUG_COND) {
3500 std::cout << SIMTIME << " veh=" << getID() << " is ignoring pedestrian (jmIgnoreJunctionFoeProb)\n";
3501 }
3502#endif
3503 continue;
3504 }
3505 adaptToJunctionLeader(std::make_pair(this, -1), seen, lastLink, lane, v, vLinkPass, it->distToCrossing);
3506 // if blocked by a pedestrian for too long we must yield our request
3508 setRequest = false;
3509#ifdef DEBUG_PLAN_MOVE_LEADERINFO
3510 if (DEBUG_COND) {
3511 std::cout << " aborting request\n";
3512 }
3513#endif
3514 }
3515 } else if (isLeader(link, leader, (*it).vehAndGap.second) || (*it).inTheWay()) {
3518#ifdef DEBUG_PLAN_MOVE
3519 if (DEBUG_COND) {
3520 std::cout << SIMTIME << " veh=" << getID() << " is ignoring linkLeader=" << leader->getID() << " (jmIgnoreJunctionFoeProb)\n";
3521 }
3522#endif
3523 continue;
3524 }
3526 // sibling link (XXX: could also be partial occupator where this check fails)
3527 &leader->getLane()->getEdge() == &lane->getEdge()) {
3528 // check for sublane obstruction (trivial for sibling link leaders)
3529 const MSLane* conflictLane = link->getInternalLaneBefore();
3530 MSLeaderInfo linkLeadersAhead = MSLeaderInfo(conflictLane->getWidth());
3531 linkLeadersAhead.addLeader(leader, false, 0); // assume sibling lane has the same geometry as the leader lane
3532 const double latOffset = isShadowLink ? (getLane()->getRightSideOnEdge() - myLaneChangeModel->getShadowLane()->getRightSideOnEdge()) : 0;
3533 // leader is neither on lane nor conflictLane (the conflict is only established geometrically)
3534 adaptToLeaders(linkLeadersAhead, latOffset, seen, lastLink, leader->getLane(), v, vLinkPass);
3535#ifdef DEBUG_PLAN_MOVE
3536 if (DEBUG_COND) {
3537 std::cout << SIMTIME << " veh=" << getID()
3538 << " siblingFoe link=" << link->getViaLaneOrLane()->getID()
3539 << " isShadowLink=" << isShadowLink
3540 << " lane=" << lane->getID()
3541 << " foe=" << leader->getID()
3542 << " foeLane=" << leader->getLane()->getID()
3543 << " latOffset=" << latOffset
3544 << " latOffsetFoe=" << leader->getLatOffset(lane)
3545 << " linkLeadersAhead=" << linkLeadersAhead.toString()
3546 << "\n";
3547 }
3548#endif
3549 } else {
3550#ifdef DEBUG_PLAN_MOVE
3551 if (DEBUG_COND) {
3552 std::cout << SIMTIME << " veh=" << getID() << " linkLeader=" << leader->getID() << " gap=" << it->vehAndGap.second
3553 << " ET=" << myJunctionEntryTime << " lET=" << leader->myJunctionEntryTime
3554 << " ETN=" << myJunctionEntryTimeNeverYield << " lETN=" << leader->myJunctionEntryTimeNeverYield
3555 << " CET=" << myJunctionConflictEntryTime << " lCET=" << leader->myJunctionConflictEntryTime
3556 << "\n";
3557 }
3558#endif
3559 adaptToJunctionLeader(it->vehAndGap, seen, lastLink, lane, v, vLinkPass, it->distToCrossing);
3560 }
3561 if (lastLink != nullptr) {
3562 // we are not yet on the junction with this linkLeader.
3563 // at least we can drive up to the previous link and stop there
3564 v = MAX2(v, lastLink->myVLinkWait);
3565 }
3566 // if blocked by a leader from the same or next lane we must yield our request
3567 // also, if blocked by a stopped or blocked leader
3569 //&& leader->getSpeed() < SUMO_const_haltingSpeed
3571 || leader->getLane()->getLogicalPredecessorLane() == myLane
3572 || leader->isStopped()
3574 setRequest = false;
3575#ifdef DEBUG_PLAN_MOVE_LEADERINFO
3576 if (DEBUG_COND) {
3577 std::cout << " aborting request\n";
3578 }
3579#endif
3580 if (lastLink != nullptr && leader->getLane()->getLogicalPredecessorLane() == myLane) {
3581 // we are not yet on the junction so must abort that request as well
3582 // (or maybe we are already on the junction and the leader is a partial occupator beyond)
3583 lastLink->mySetRequest = false;
3584#ifdef DEBUG_PLAN_MOVE_LEADERINFO
3585 if (DEBUG_COND) {
3586 std::cout << " aborting previous request\n";
3587 }
3588#endif
3589 }
3590 }
3591 }
3592#ifdef DEBUG_PLAN_MOVE_LEADERINFO
3593 else {
3594 if (DEBUG_COND) {
3595 std::cout << SIMTIME << " veh=" << getID() << " ignoring leader " << leader->getID() << " gap=" << (*it).vehAndGap.second << " dtC=" << (*it).distToCrossing
3596 << " ET=" << myJunctionEntryTime << " lET=" << leader->myJunctionEntryTime
3597 << " ETN=" << myJunctionEntryTimeNeverYield << " lETN=" << leader->myJunctionEntryTimeNeverYield
3598 << " CET=" << myJunctionConflictEntryTime << " lCET=" << leader->myJunctionConflictEntryTime
3599 << "\n";
3600 }
3601 }
3602#endif
3603 }
3604 // if this is the link between two internal lanes we may have to slow down for pedestrians
3605 vLinkWait = MIN2(vLinkWait, v);
3606}
3607
3608
3609double
3610MSVehicle::getDeltaPos(const double accel) const {
3611 double vNext = myState.mySpeed + ACCEL2SPEED(accel);
3613 // apply implicit Euler positional update
3614 return SPEED2DIST(MAX2(vNext, 0.));
3615 } else {
3616 // apply ballistic update
3617 if (vNext >= 0) {
3618 // assume constant acceleration during this time step
3619 return SPEED2DIST(myState.mySpeed + 0.5 * ACCEL2SPEED(accel));
3620 } else {
3621 // negative vNext indicates a stop within the middle of time step
3622 // The corresponding stop time is s = mySpeed/deceleration \in [0,dt], and the
3623 // covered distance is therefore deltaPos = mySpeed*s - 0.5*deceleration*s^2.
3624 // Here, deceleration = (myState.mySpeed - vNext)/dt is the constant deceleration
3625 // until the vehicle stops.
3626 return -SPEED2DIST(0.5 * myState.mySpeed * myState.mySpeed / ACCEL2SPEED(accel));
3627 }
3628 }
3629}
3630
3631void
3632MSVehicle::processLinkApproaches(double& vSafe, double& vSafeMin, double& vSafeMinDist) {
3633
3634 // Speed limit due to zipper merging
3635 double vSafeZipper = std::numeric_limits<double>::max();
3636
3637 myHaveToWaitOnNextLink = false;
3638 bool canBrakeVSafeMin = false;
3639
3640 // Get safe velocities from DriveProcessItems.
3641 assert(myLFLinkLanes.size() != 0 || isRemoteControlled());
3642 for (const DriveProcessItem& dpi : myLFLinkLanes) {
3643 MSLink* const link = dpi.myLink;
3644
3645#ifdef DEBUG_EXEC_MOVE
3646 if (DEBUG_COND) {
3647 std::cout
3648 << SIMTIME
3649 << " veh=" << getID()
3650 << " link=" << (link == 0 ? "NULL" : link->getViaLaneOrLane()->getID())
3651 << " req=" << dpi.mySetRequest
3652 << " vP=" << dpi.myVLinkPass
3653 << " vW=" << dpi.myVLinkWait
3654 << " d=" << dpi.myDistance
3655 << "\n";
3656 gDebugFlag1 = true; // See MSLink_DEBUG_OPENED
3657 }
3658#endif
3659
3660 // the vehicle must change the lane on one of the next lanes (XXX: refs to code further below???, Leo)
3661 if (link != nullptr && dpi.mySetRequest) {
3662
3663 const LinkState ls = link->getState();
3664 // vehicles should brake when running onto a yellow light if the distance allows to halt in front
3665 const bool yellow = link->haveYellow();
3666 const bool canBrake = (dpi.myDistance > getCarFollowModel().brakeGap(myState.mySpeed, getCarFollowModel().getMaxDecel(), 0.)
3668 assert(link->getLaneBefore() != nullptr);
3669 const bool beyondStopLine = dpi.myDistance < link->getLaneBefore()->getVehicleStopOffset(this);
3670 const bool ignoreRedLink = ignoreRed(link, canBrake) || beyondStopLine;
3671 if (yellow && canBrake && !ignoreRedLink) {
3672 vSafe = dpi.myVLinkWait;
3674#ifdef DEBUG_CHECKREWINDLINKLANES
3675 if (DEBUG_COND) {
3676 std::cout << SIMTIME << " veh=" << getID() << " haveToWait (yellow)\n";
3677 }
3678#endif
3679 break;
3680 }
3681 const bool influencerPrio = (myInfluencer != nullptr && !myInfluencer->getRespectJunctionPriority());
3682 MSLink::BlockingFoes collectFoes;
3683 bool opened = (yellow || influencerPrio
3684 || link->opened(dpi.myArrivalTime, dpi.myArrivalSpeed, dpi.getLeaveSpeed(),
3686 canBrake ? getImpatience() : 1,
3689 ls == LINKSTATE_ZIPPER ? &collectFoes : nullptr,
3690 ignoreRedLink, this, dpi.myDistance));
3691 if (opened && myLaneChangeModel->getShadowLane() != nullptr) {
3692 const MSLink* const parallelLink = dpi.myLink->getParallelLink(myLaneChangeModel->getShadowDirection());
3693 if (parallelLink != nullptr) {
3694 const double shadowLatPos = getLateralPositionOnLane() - myLaneChangeModel->getShadowDirection() * 0.5 * (
3696 opened = yellow || influencerPrio || (opened && parallelLink->opened(dpi.myArrivalTime, dpi.myArrivalSpeed, dpi.getLeaveSpeed(),
3699 getWaitingTimeFor(link), shadowLatPos, nullptr,
3700 ignoreRedLink, this, dpi.myDistance));
3701#ifdef DEBUG_EXEC_MOVE
3702 if (DEBUG_COND) {
3703 std::cout << SIMTIME
3704 << " veh=" << getID()
3705 << " shadowLane=" << myLaneChangeModel->getShadowLane()->getID()
3706 << " shadowDir=" << myLaneChangeModel->getShadowDirection()
3707 << " parallelLink=" << (parallelLink == 0 ? "NULL" : parallelLink->getViaLaneOrLane()->getID())
3708 << " opened=" << opened
3709 << "\n";
3710 }
3711#endif
3712 }
3713 }
3714 // vehicles should decelerate when approaching a minor link
3715#ifdef DEBUG_EXEC_MOVE
3716 if (DEBUG_COND) {
3717 std::cout << SIMTIME
3718 << " opened=" << opened
3719 << " influencerPrio=" << influencerPrio
3720 << " linkPrio=" << link->havePriority()
3721 << " lastContMajor=" << link->lastWasContMajor()
3722 << " isCont=" << link->isCont()
3723 << " ignoreRed=" << ignoreRedLink
3724 << "\n";
3725 }
3726#endif
3727 double visibilityDistance = link->getFoeVisibilityDistance();
3728 bool determinedFoePresence = dpi.myDistance <= visibilityDistance;
3729 if (opened && !influencerPrio && !link->havePriority() && !link->lastWasContMajor() && !link->isCont() && !ignoreRedLink) {
3730 if (!determinedFoePresence && (canBrake || !yellow)) {
3731 vSafe = dpi.myVLinkWait;
3733#ifdef DEBUG_CHECKREWINDLINKLANES
3734 if (DEBUG_COND) {
3735 std::cout << SIMTIME << " veh=" << getID() << " haveToWait (minor)\n";
3736 }
3737#endif
3738 break;
3739 } else {
3740 // past the point of no return. we need to drive fast enough
3741 // to make it across the link. However, minor slowdowns
3742 // should be permissible to follow leading traffic safely
3743 // basically, this code prevents dawdling
3744 // (it's harder to do this later using
3745 // SUMO_ATTR_JM_SIGMA_MINOR because we don't know whether the
3746 // vehicle is already too close to stop at that part of the code)
3747 //
3748 // XXX: There is a problem in subsecond simulation: If we cannot
3749 // make it across the minor link in one step, new traffic
3750 // could appear on a major foe link and cause a collision. Refs. #1845, #2123
3751 vSafeMinDist = dpi.myDistance; // distance that must be covered
3753 vSafeMin = MIN3((double)DIST2SPEED(vSafeMinDist + POSITION_EPS), dpi.myVLinkPass, getCarFollowModel().maxNextSafeMin(getSpeed(), this));
3754 } else {
3755 vSafeMin = MIN3((double)DIST2SPEED(2 * vSafeMinDist + NUMERICAL_EPS) - getSpeed(), dpi.myVLinkPass, getCarFollowModel().maxNextSafeMin(getSpeed(), this));
3756 }
3757 canBrakeVSafeMin = canBrake;
3758#ifdef DEBUG_EXEC_MOVE
3759 if (DEBUG_COND) {
3760 std::cout << " vSafeMin=" << vSafeMin << " vSafeMinDist=" << vSafeMinDist << " canBrake=" << canBrake << "\n";
3761 }
3762#endif
3763 }
3764 }
3765 // have waited; may pass if opened...
3766 if (opened) {
3767 vSafe = dpi.myVLinkPass;
3768 if (vSafe < getCarFollowModel().getMaxDecel() && vSafe <= dpi.myVLinkWait && vSafe < getCarFollowModel().maxNextSpeed(getSpeed(), this)) {
3769 // this vehicle is probably not gonna drive across the next junction (heuristic)
3771#ifdef DEBUG_CHECKREWINDLINKLANES
3772 if (DEBUG_COND) {
3773 std::cout << SIMTIME << " veh=" << getID() << " haveToWait (very slow)\n";
3774 }
3775#endif
3776 }
3777 if (link->mustStop() && determinedFoePresence && myHaveStoppedFor == nullptr) {
3778 myHaveStoppedFor = link;
3779 }
3780 } else if (link->getState() == LINKSTATE_ZIPPER) {
3781 vSafeZipper = MIN2(vSafeZipper,
3782 link->getZipperSpeed(this, dpi.myDistance, dpi.myVLinkPass, dpi.myArrivalTime, &collectFoes));
3783 } else if (!canBrake
3784 // always brake hard for traffic lights (since an emergency stop is necessary anyway)
3785 && link->getTLLogic() == nullptr
3786 // cannot brake even with emergency deceleration
3787 && dpi.myDistance < getCarFollowModel().brakeGap(myState.mySpeed, getCarFollowModel().getEmergencyDecel(), 0.)) {
3788#ifdef DEBUG_EXEC_MOVE
3789 if (DEBUG_COND) {
3790 std::cout << SIMTIME << " too fast to brake for closed link\n";
3791 }
3792#endif
3793 vSafe = dpi.myVLinkPass;
3794 } else {
3795 vSafe = dpi.myVLinkWait;
3797#ifdef DEBUG_CHECKREWINDLINKLANES
3798 if (DEBUG_COND) {
3799 std::cout << SIMTIME << " veh=" << getID() << " haveToWait (closed)\n";
3800 }
3801#endif
3802#ifdef DEBUG_EXEC_MOVE
3803 if (DEBUG_COND) {
3804 std::cout << SIMTIME << " braking for closed link=" << link->getViaLaneOrLane()->getID() << "\n";
3805 }
3806#endif
3807 break;
3808 }
3809 } else {
3810 if (link != nullptr && link->getInternalLaneBefore() != nullptr && myLane->isInternal() && link->getJunction() == myLane->getEdge().getToJunction()) {
3811 // blocked on the junction. yield request so other vehicles may
3812 // become junction leader
3813#ifdef DEBUG_EXEC_MOVE
3814 if (DEBUG_COND) {
3815 std::cout << SIMTIME << " resetting junctionEntryTime at junction '" << link->getJunction()->getID() << "' beause of non-request exitLink\n";
3816 }
3817#endif
3820 }
3821 // we have: i->link == 0 || !i->setRequest
3822 vSafe = dpi.myVLinkWait;
3823 if (vSafe < getSpeed()) {
3825#ifdef DEBUG_CHECKREWINDLINKLANES
3826 if (DEBUG_COND) {
3827 std::cout << SIMTIME << " veh=" << getID() << " haveToWait (no request, braking) vSafe=" << vSafe << "\n";
3828 }
3829#endif
3830 } else if (vSafe < SUMO_const_haltingSpeed) {
3832#ifdef DEBUG_CHECKREWINDLINKLANES
3833 if (DEBUG_COND) {
3834 std::cout << SIMTIME << " veh=" << getID() << " haveToWait (no request, stopping)\n";
3835 }
3836#endif
3837 }
3838 if (link == nullptr && myLFLinkLanes.size() == 1
3839 && getBestLanesContinuation().size() > 1
3840 && getBestLanesContinuation()[1]->hadPermissionChanges()
3841 && myLane->getFirstAnyVehicle() == this) {
3842 // temporal lane closing without notification, visible to the
3843 // vehicle at the front of the queue
3844 updateBestLanes(true);
3845 //std::cout << SIMTIME << " veh=" << getID() << " updated bestLanes=" << toString(getBestLanesContinuation()) << "\n";
3846 }
3847 break;
3848 }
3849 }
3850
3851//#ifdef DEBUG_EXEC_MOVE
3852// if (DEBUG_COND) {
3853// std::cout << "\nvCurrent = " << toString(getSpeed(), 24) << "" << std::endl;
3854// std::cout << "vSafe = " << toString(vSafe, 24) << "" << std::endl;
3855// std::cout << "vSafeMin = " << toString(vSafeMin, 24) << "" << std::endl;
3856// std::cout << "vSafeMinDist = " << toString(vSafeMinDist, 24) << "" << std::endl;
3857//
3858// double gap = getLeader().second;
3859// std::cout << "gap = " << toString(gap, 24) << std::endl;
3860// std::cout << "vSafeStoppedLeader = " << toString(getCarFollowModel().stopSpeed(this, getSpeed(), gap, MSCFModel::CalcReason::FUTURE), 24)
3861// << "\n" << std::endl;
3862// }
3863//#endif
3864
3865 if ((MSGlobals::gSemiImplicitEulerUpdate && vSafe + NUMERICAL_EPS < vSafeMin)
3866 || (!MSGlobals::gSemiImplicitEulerUpdate && (vSafe + NUMERICAL_EPS < vSafeMin && vSafeMin != 0))) { // this might be good for the euler case as well
3867 // XXX: (Leo) This often called stopSpeed with vSafeMinDist==0 (for the ballistic update), since vSafe can become negative
3868 // For the Euler update the term '+ NUMERICAL_EPS' prevented a call here... Recheck, consider of -INVALID_SPEED instead of 0 to indicate absence of vSafeMin restrictions. Refs. #2577
3869#ifdef DEBUG_EXEC_MOVE
3870 if (DEBUG_COND) {
3871 std::cout << "vSafeMin Problem? vSafe=" << vSafe << " vSafeMin=" << vSafeMin << " vSafeMinDist=" << vSafeMinDist << std::endl;
3872 }
3873#endif
3874 if (canBrakeVSafeMin && vSafe < getSpeed()) {
3875 // cannot drive across a link so we need to stop before it
3876 vSafe = MIN2(vSafe, MAX2(getCarFollowModel().minNextSpeed(getSpeed(), this),
3877 getCarFollowModel().stopSpeed(this, getSpeed(), vSafeMinDist)));
3878 vSafeMin = 0;
3880#ifdef DEBUG_CHECKREWINDLINKLANES
3881 if (DEBUG_COND) {
3882 std::cout << SIMTIME << " veh=" << getID() << " haveToWait (vSafe=" << vSafe << " < vSafeMin=" << vSafeMin << ")\n";
3883 }
3884#endif
3885 } else {
3886 // if the link is yellow or visibility distance is large
3887 // then we might not make it across the link in one step anyway..
3888 // Possibly, the lane after the intersection has a lower speed limit so
3889 // we really need to drive slower already
3890 // -> keep driving without dawdling
3891 vSafeMin = vSafe;
3892 }
3893 }
3894
3895 // vehicles inside a roundabout should maintain their requests
3896 if (myLane->getEdge().isRoundabout()) {
3897 myHaveToWaitOnNextLink = false;
3898 }
3899
3900 vSafe = MIN2(vSafe, vSafeZipper);
3901}
3902
3903
3904double
3905MSVehicle::processTraCISpeedControl(double vSafe, double vNext) {
3906 if (myInfluencer != nullptr) {
3908#ifdef DEBUG_TRACI
3909 if DEBUG_COND2(this) {
3910 std::cout << SIMTIME << " MSVehicle::processTraCISpeedControl() for vehicle '" << getID() << "'"
3911 << " vSafe=" << vSafe << " (init)vNext=" << vNext << " keepStopping=" << keepStopping();
3912 }
3913#endif
3916 }
3917 const double vMax = getVehicleType().getCarFollowModel().maxNextSpeed(myState.mySpeed, this);
3920 vMin = MAX2(0., vMin);
3921 }
3922 vNext = myInfluencer->influenceSpeed(MSNet::getInstance()->getCurrentTimeStep(), vNext, vSafe, vMin, vMax);
3923 if (keepStopping() && myStops.front().getSpeed() == 0) {
3924 // avoid driving while stopped (unless it's actually a waypoint
3925 vNext = myInfluencer->getOriginalSpeed();
3926 }
3927#ifdef DEBUG_TRACI
3928 if DEBUG_COND2(this) {
3929 std::cout << " (processed)vNext=" << vNext << std::endl;
3930 }
3931#endif
3932 }
3933 return vNext;
3934}
3935
3936
3937void
3939#ifdef DEBUG_ACTIONSTEPS
3940 if (DEBUG_COND) {
3941 std::cout << SIMTIME << " veh=" << getID() << " removePassedDriveItems()\n"
3942 << " Current items: ";
3943 for (auto& j : myLFLinkLanes) {
3944 if (j.myLink == 0) {
3945 std::cout << "\n Stop at distance " << j.myDistance;
3946 } else {
3947 const MSLane* to = j.myLink->getViaLaneOrLane();
3948 const MSLane* from = j.myLink->getLaneBefore();
3949 std::cout << "\n Link at distance " << j.myDistance << ": '"
3950 << (from == 0 ? "NONE" : from->getID()) << "' -> '" << (to == 0 ? "NONE" : to->getID()) << "'";
3951 }
3952 }
3953 std::cout << "\n myNextDriveItem: ";
3954 if (myLFLinkLanes.size() != 0) {
3955 if (myNextDriveItem->myLink == 0) {
3956 std::cout << "\n Stop at distance " << myNextDriveItem->myDistance;
3957 } else {
3958 const MSLane* to = myNextDriveItem->myLink->getViaLaneOrLane();
3959 const MSLane* from = myNextDriveItem->myLink->getLaneBefore();
3960 std::cout << "\n Link at distance " << myNextDriveItem->myDistance << ": '"
3961 << (from == 0 ? "NONE" : from->getID()) << "' -> '" << (to == 0 ? "NONE" : to->getID()) << "'";
3962 }
3963 }
3964 std::cout << std::endl;
3965 }
3966#endif
3967 for (auto j = myLFLinkLanes.begin(); j != myNextDriveItem; ++j) {
3968#ifdef DEBUG_ACTIONSTEPS
3969 if (DEBUG_COND) {
3970 std::cout << " Removing item: ";
3971 if (j->myLink == 0) {
3972 std::cout << "Stop at distance " << j->myDistance;
3973 } else {
3974 const MSLane* to = j->myLink->getViaLaneOrLane();
3975 const MSLane* from = j->myLink->getLaneBefore();
3976 std::cout << "Link at distance " << j->myDistance << ": '"
3977 << (from == 0 ? "NONE" : from->getID()) << "' -> '" << (to == 0 ? "NONE" : to->getID()) << "'";
3978 }
3979 std::cout << std::endl;
3980 }
3981#endif
3982 if (j->myLink != nullptr) {
3983 j->myLink->removeApproaching(this);
3984 }
3985 }
3988}
3989
3990
3991void
3993#ifdef DEBUG_ACTIONSTEPS
3994 if (DEBUG_COND) {
3995 std::cout << SIMTIME << " updateDriveItems(), veh='" << getID() << "' (lane: '" << getLane()->getID() << "')\nCurrent drive items:" << std::endl;
3996 for (const auto& dpi : myLFLinkLanes) {
3997 std::cout
3998 << " vPass=" << dpi.myVLinkPass
3999 << " vWait=" << dpi.myVLinkWait
4000 << " linkLane=" << (dpi.myLink == 0 ? "NULL" : dpi.myLink->getViaLaneOrLane()->getID())
4001 << " request=" << dpi.mySetRequest
4002 << "\n";
4003 }
4004 std::cout << " myNextDriveItem's linked lane: " << (myNextDriveItem->myLink == 0 ? "NULL" : myNextDriveItem->myLink->getViaLaneOrLane()->getID()) << std::endl;
4005 }
4006#endif
4007 if (myLFLinkLanes.size() == 0) {
4008 // nothing to update
4009 return;
4010 }
4011 const MSLink* nextPlannedLink = nullptr;
4012// auto i = myLFLinkLanes.begin();
4013 auto i = myNextDriveItem;
4014 while (i != myLFLinkLanes.end() && nextPlannedLink == nullptr) {
4015 nextPlannedLink = i->myLink;
4016 ++i;
4017 }
4018
4019 if (nextPlannedLink == nullptr) {
4020 // No link for upcoming item -> no need for an update
4021#ifdef DEBUG_ACTIONSTEPS
4022 if (DEBUG_COND) {
4023 std::cout << "Found no link-related drive item." << std::endl;
4024 }
4025#endif
4026 return;
4027 }
4028
4029 if (getLane() == nextPlannedLink->getLaneBefore()) {
4030 // Current lane approaches the stored next link, i.e. no LC happend and no update is required.
4031#ifdef DEBUG_ACTIONSTEPS
4032 if (DEBUG_COND) {
4033 std::cout << "Continuing on planned lane sequence, no update required." << std::endl;
4034 }
4035#endif
4036 return;
4037 }
4038 // Lane must have been changed, determine the change direction
4039 const MSLink* parallelLink = nextPlannedLink->getParallelLink(1);
4040 if (parallelLink != nullptr && parallelLink->getLaneBefore() == getLane()) {
4041 // lcDir = 1;
4042 } else {
4043 parallelLink = nextPlannedLink->getParallelLink(-1);
4044 if (parallelLink != nullptr && parallelLink->getLaneBefore() == getLane()) {
4045 // lcDir = -1;
4046 } else {
4047 // If the vehicle's current lane is not the approaching lane for the next
4048 // drive process item's link, it is expected to lead to a parallel link,
4049 // XXX: What if the lc was an overtaking maneuver and there is no upcoming link?
4050 // Then a stop item should be scheduled! -> TODO!
4051 //assert(false);
4052 return;
4053 }
4054 }
4055#ifdef DEBUG_ACTIONSTEPS
4056 if (DEBUG_COND) {
4057 std::cout << "Changed lane. Drive items will be updated along the current lane continuation." << std::endl;
4058 }
4059#endif
4060 // Trace link sequence along current best lanes and transfer drive items to the corresponding links
4061// DriveItemVector::iterator driveItemIt = myLFLinkLanes.begin();
4062 DriveItemVector::iterator driveItemIt = myNextDriveItem;
4063 // In the loop below, lane holds the currently considered lane on the vehicles continuation (including internal lanes)
4064 const MSLane* lane = myLane;
4065 assert(myLane == parallelLink->getLaneBefore());
4066 // *lit is a pointer to the next lane in best continuations for the current lane (always non-internal)
4067 std::vector<MSLane*>::const_iterator bestLaneIt = getBestLanesContinuation().begin() + 1;
4068 // Pointer to the new link for the current drive process item
4069 MSLink* newLink = nullptr;
4070 while (driveItemIt != myLFLinkLanes.end()) {
4071 if (driveItemIt->myLink == nullptr) {
4072 // Items not related to a specific link are not updated
4073 // (XXX: when a stop item corresponded to a dead end, which is overcome by the LC that made
4074 // the update necessary, this may slow down the vehicle's continuation on the new lane...)
4075 ++driveItemIt;
4076 continue;
4077 }
4078 // Continuation links for current best lanes are less than for the former drive items (myLFLinkLanes)
4079 // We just remove the leftover link-items, as they cannot be mapped to new links.
4080 if (bestLaneIt == getBestLanesContinuation().end()) {
4081#ifdef DEBUG_ACTIONSTEPS
4082 if (DEBUG_COND) {
4083 std::cout << "Reached end of the new continuation sequence. Erasing leftover link-items." << std::endl;
4084 }
4085#endif
4086 while (driveItemIt != myLFLinkLanes.end()) {
4087 if (driveItemIt->myLink == nullptr) {
4088 ++driveItemIt;
4089 continue;
4090 } else {
4091 driveItemIt->myLink->removeApproaching(this);
4092 driveItemIt = myLFLinkLanes.erase(driveItemIt);
4093 }
4094 }
4095 break;
4096 }
4097 // Do the actual link-remapping for the item. And un/register approaching information on the corresponding links
4098 const MSLane* const target = *bestLaneIt;
4099 assert(!target->isInternal());
4100 newLink = nullptr;
4101 for (MSLink* const link : lane->getLinkCont()) {
4102 if (link->getLane() == target) {
4103 newLink = link;
4104 break;
4105 }
4106 }
4107
4108 if (newLink == driveItemIt->myLink) {
4109 // new continuation merged into previous - stop update
4110#ifdef DEBUG_ACTIONSTEPS
4111 if (DEBUG_COND) {
4112 std::cout << "Old and new continuation sequences merge at link\n"
4113 << "'" << newLink->getLaneBefore()->getID() << "'->'" << newLink->getViaLaneOrLane()->getID() << "'"
4114 << "\nNo update beyond merge required." << std::endl;
4115 }
4116#endif
4117 break;
4118 }
4119
4120#ifdef DEBUG_ACTIONSTEPS
4121 if (DEBUG_COND) {
4122 std::cout << "lane=" << lane->getID() << "\nUpdating link\n '" << driveItemIt->myLink->getLaneBefore()->getID() << "'->'" << driveItemIt->myLink->getViaLaneOrLane()->getID() << "'"
4123 << "==> " << "'" << newLink->getLaneBefore()->getID() << "'->'" << newLink->getViaLaneOrLane()->getID() << "'" << std::endl;
4124 }
4125#endif
4126 newLink->setApproaching(this, driveItemIt->myLink->getApproaching(this));
4127 driveItemIt->myLink->removeApproaching(this);
4128 driveItemIt->myLink = newLink;
4129 lane = newLink->getViaLaneOrLane();
4130 ++driveItemIt;
4131 if (!lane->isInternal()) {
4132 ++bestLaneIt;
4133 }
4134 }
4135#ifdef DEBUG_ACTIONSTEPS
4136 if (DEBUG_COND) {
4137 std::cout << "Updated drive items:" << std::endl;
4138 for (const auto& dpi : myLFLinkLanes) {
4139 std::cout
4140 << " vPass=" << dpi.myVLinkPass
4141 << " vWait=" << dpi.myVLinkWait
4142 << " linkLane=" << (dpi.myLink == 0 ? "NULL" : dpi.myLink->getViaLaneOrLane()->getID())
4143 << " request=" << dpi.mySetRequest
4144 << "\n";
4145 }
4146 }
4147#endif
4148}
4149
4150
4151void
4153 // To avoid casual blinking brake lights at high speeds due to dawdling of the
4154 // leading vehicle, we don't show brake lights when the deceleration could be caused
4155 // by frictional forces and air resistance (i.e. proportional to v^2, coefficient could be adapted further)
4156 double pseudoFriction = (0.05 + 0.005 * getSpeed()) * getSpeed();
4157 bool brakelightsOn = vNext < getSpeed() - ACCEL2SPEED(pseudoFriction);
4158
4159 if (vNext <= SUMO_const_haltingSpeed) {
4160 brakelightsOn = true;
4161 }
4162 if (brakelightsOn && !isStopped()) {
4164 } else {
4166 }
4167}
4168
4169
4170void
4175 } else {
4176 myWaitingTime = 0;
4178 if (hasInfluencer()) {
4180 }
4181 }
4182}
4183
4184
4185void
4187 // update time loss (depends on the updated edge)
4188 if (!isStopped()) {
4189 const double vmax = myLane->getVehicleMaxSpeed(this);
4190 if (vmax > 0) {
4191 myTimeLoss += TS * (vmax - vNext) / vmax;
4192 }
4193 }
4194}
4195
4196
4197double
4198MSVehicle::checkReversal(bool& canReverse, double speedThreshold, double seen) const {
4199 const bool stopOk = (myStops.empty() || myStops.front().edge != myCurrEdge
4200 || (myStops.front().getSpeed() > 0 && myState.myPos > myStops.front().pars.endPos - 2 * POSITION_EPS));
4201#ifdef DEBUG_REVERSE_BIDI
4202 if (DEBUG_COND) std::cout << SIMTIME << " checkReversal lane=" << myLane->getID()
4203 << " pos=" << myState.myPos
4204 << " speed=" << std::setprecision(6) << getPreviousSpeed() << std::setprecision(gPrecision)
4205 << " speedThreshold=" << speedThreshold
4206 << " seen=" << seen
4207 << " isRail=" << isRail()
4208 << " speedOk=" << (getPreviousSpeed() <= speedThreshold)
4209 << " posOK=" << (myState.myPos <= myLane->getLength())
4210 << " normal=" << !myLane->isInternal()
4211 << " routeOK=" << ((myCurrEdge + 1) != myRoute->end())
4212 << " bidi=" << (myLane->getEdge().getBidiEdge() == *(myCurrEdge + 1))
4213 << " stopOk=" << stopOk
4214 << "\n";
4215#endif
4216 if ((getVClass() & SVC_RAIL_CLASSES) != 0
4217 && getPreviousSpeed() <= speedThreshold
4218 && myState.myPos <= myLane->getLength()
4219 && !myLane->isInternal()
4220 && (myCurrEdge + 1) != myRoute->end()
4221 && myLane->getEdge().getBidiEdge() == *(myCurrEdge + 1)
4222 // ensure there are no further stops on this edge
4223 && stopOk
4224 ) {
4225 //if (isSelected()) std::cout << " check1 passed\n";
4226
4227 // ensure that the vehicle is fully on bidi edges that allow reversal
4228 const int neededFutureRoute = 1 + (int)(MSGlobals::gUsingInternalLanes
4229 ? myFurtherLanes.size()
4230 : ceil((double)myFurtherLanes.size() / 2.0));
4231 const int remainingRoute = int(myRoute->end() - myCurrEdge) - 1;
4232 if (remainingRoute < neededFutureRoute) {
4233#ifdef DEBUG_REVERSE_BIDI
4234 if (DEBUG_COND) {
4235 std::cout << " fail: remainingEdges=" << ((int)(myRoute->end() - myCurrEdge)) << " further=" << myFurtherLanes.size() << "\n";
4236 }
4237#endif
4238 return getMaxSpeed();
4239 }
4240 //if (isSelected()) std::cout << " check2 passed\n";
4241
4242 // ensure that the turn-around connection exists from the current edge to its bidi-edge
4243 const MSEdgeVector& succ = myLane->getEdge().getSuccessors();
4244 if (std::find(succ.begin(), succ.end(), myLane->getEdge().getBidiEdge()) == succ.end()) {
4245#ifdef DEBUG_REVERSE_BIDI
4246 if (DEBUG_COND) {
4247 std::cout << " noTurn (bidi=" << myLane->getEdge().getBidiEdge()->getID() << " succ=" << toString(succ) << "\n";
4248 }
4249#endif
4250 return getMaxSpeed();
4251 }
4252 //if (isSelected()) std::cout << " check3 passed\n";
4253
4254 // ensure that the vehicle front will not move past a stop on the bidi edge of the current edge
4255 if (!myStops.empty() && myStops.front().edge == (myCurrEdge + 1)) {
4256 const double stopPos = myStops.front().getEndPos(*this);
4257 const double brakeDist = getCarFollowModel().brakeGap(getSpeed(), getCarFollowModel().getMaxDecel(), 0);
4258 const double newPos = myLane->getLength() - (getBackPositionOnLane() + brakeDist);
4259 if (newPos > stopPos) {
4260#ifdef DEBUG_REVERSE_BIDI
4261 if (DEBUG_COND) {
4262 std::cout << " reversal would go past stop on " << myLane->getBidiLane()->getID() << "\n";
4263 }
4264#endif
4265 if (seen > MAX2(brakeDist, 1.0)) {
4266 return getMaxSpeed();
4267 } else {
4268#ifdef DEBUG_REVERSE_BIDI
4269 if (DEBUG_COND) {
4270 std::cout << " train is too long, skipping stop at " << stopPos << " cannot be avoided\n";
4271 }
4272#endif
4273 }
4274 }
4275 }
4276 //if (isSelected()) std::cout << " check4 passed\n";
4277
4278 // ensure that bidi-edges exist for all further edges
4279 // and that no stops will be skipped when reversing
4280 // and that the train will not be on top of a red rail signal after reversal
4281 const MSLane* bidi = myLane->getBidiLane();
4282 int view = 2;
4283 for (MSLane* further : myFurtherLanes) {
4284 if (!further->getEdge().isInternal()) {
4285 if (further->getEdge().getBidiEdge() != *(myCurrEdge + view)) {
4286#ifdef DEBUG_REVERSE_BIDI
4287 if (DEBUG_COND) {
4288 std::cout << " noBidi view=" << view << " further=" << further->getID() << " furtherBidi=" << Named::getIDSecure(further->getEdge().getBidiEdge()) << " future=" << (*(myCurrEdge + view))->getID() << "\n";
4289 }
4290#endif
4291 return getMaxSpeed();
4292 }
4293 const MSLane* nextBidi = further->getBidiLane();
4294 const MSLink* toNext = bidi->getLinkTo(nextBidi);
4295 if (toNext == nullptr) {
4296 // can only happen if the route is invalid
4297 return getMaxSpeed();
4298 }
4299 if (toNext->haveRed()) {
4300#ifdef DEBUG_REVERSE_BIDI
4301 if (DEBUG_COND) {
4302 std::cout << " do not reverse on a red signal\n";
4303 }
4304#endif
4305 return getMaxSpeed();
4306 }
4307 bidi = nextBidi;
4308 if (!myStops.empty() && myStops.front().edge == (myCurrEdge + view)) {
4309 const double brakeDist = getCarFollowModel().brakeGap(getSpeed(), getCarFollowModel().getMaxDecel(), 0);
4310 const double stopPos = myStops.front().getEndPos(*this);
4311 const double newPos = further->getLength() - (getBackPositionOnLane(further) + brakeDist);
4312 if (newPos > stopPos) {
4313#ifdef DEBUG_REVERSE_BIDI
4314 if (DEBUG_COND) {
4315 std::cout << " reversal would go past stop on further-opposite lane " << further->getBidiLane()->getID() << "\n";
4316 }
4317#endif
4318 if (seen > MAX2(brakeDist, 1.0)) {
4319 canReverse = false;
4320 return getMaxSpeed();
4321 } else {
4322#ifdef DEBUG_REVERSE_BIDI
4323 if (DEBUG_COND) {
4324 std::cout << " train is too long, skipping stop at " << stopPos << " cannot be avoided\n";
4325 }
4326#endif
4327 }
4328 }
4329 }
4330 view++;
4331 }
4332 }
4333 // reverse as soon as comfortably possible
4334 const double vMinComfortable = getCarFollowModel().minNextSpeed(getSpeed(), this);
4335#ifdef DEBUG_REVERSE_BIDI
4336 if (DEBUG_COND) {
4337 std::cout << SIMTIME << " seen=" << seen << " vReverseOK=" << vMinComfortable << "\n";
4338 }
4339#endif
4340 canReverse = true;
4341 return vMinComfortable;
4342 }
4343 return getMaxSpeed();
4344}
4345
4346
4347void
4348MSVehicle::processLaneAdvances(std::vector<MSLane*>& passedLanes, std::string& emergencyReason) {
4349 for (std::vector<MSLane*>::reverse_iterator i = myFurtherLanes.rbegin(); i != myFurtherLanes.rend(); ++i) {
4350 passedLanes.push_back(*i);
4351 }
4352 if (passedLanes.size() == 0 || passedLanes.back() != myLane) {
4353 passedLanes.push_back(myLane);
4354 }
4355 // let trains reverse direction
4356 bool reverseTrain = false;
4357 checkReversal(reverseTrain);
4358 if (reverseTrain) {
4359 // Train is 'reversing' so toggle the logical state
4361 // add some slack to ensure that the back of train does appear looped
4362 myState.myPos += 2 * (myLane->getLength() - myState.myPos) + myType->getLength() + NUMERICAL_EPS;
4363 myState.mySpeed = 0;
4364#ifdef DEBUG_REVERSE_BIDI
4365 if (DEBUG_COND) {
4366 std::cout << SIMTIME << " reversing train=" << getID() << " newPos=" << myState.myPos << "\n";
4367 }
4368#endif
4369 }
4370 // move on lane(s)
4371 if (myState.myPos > myLane->getLength()) {
4372 // The vehicle has moved at least to the next lane (maybe it passed even more than one)
4373 if (myCurrEdge != myRoute->end() - 1) {
4374 MSLane* approachedLane = myLane;
4375 // move the vehicle forward
4377 while (myNextDriveItem != myLFLinkLanes.end() && approachedLane != nullptr && myState.myPos > approachedLane->getLength()) {
4378 const MSLink* link = myNextDriveItem->myLink;
4379 const double linkDist = myNextDriveItem->myDistance;
4381 // check whether the vehicle was allowed to enter lane
4382 // otherwise it is decelerated and we do not need to test for it's
4383 // approach on the following lanes when a lane changing is performed
4384 // proceed to the next lane
4385 if (approachedLane->mustCheckJunctionCollisions()) {
4386 // vehicle moves past approachedLane within a single step, collision checking must still be done
4388 }
4389 if (link != nullptr) {
4390 if ((getVClass() & SVC_RAIL_CLASSES) != 0
4391 && !myLane->isInternal()
4392 && myLane->getBidiLane() != nullptr
4393 && link->getLane()->getBidiLane() == myLane
4394 && !reverseTrain) {
4395 emergencyReason = " because it must reverse direction";
4396 approachedLane = nullptr;
4397 break;
4398 }
4399 if ((getVClass() & SVC_RAIL_CLASSES) != 0
4400 && myState.myPos < myLane->getLength() + NUMERICAL_EPS
4401 && hasStops() && getNextStop().edge == myCurrEdge) {
4402 // avoid skipping stop due to numerical instability
4403 // this is a special case for rail vehicles because they
4404 // continue myLFLinkLanes past stops
4405 approachedLane = myLane;
4407 break;
4408 }
4409 approachedLane = link->getViaLaneOrLane();
4411 bool beyondStopLine = linkDist < link->getLaneBefore()->getVehicleStopOffset(this);
4412 if (link->haveRed() && !ignoreRed(link, false) && !beyondStopLine && !reverseTrain) {
4413 emergencyReason = " because of a red traffic light";
4414 break;
4415 }
4416 }
4417 if (reverseTrain && approachedLane->isInternal()) {
4418 // avoid getting stuck on a slow turn-around internal lane
4419 myState.myPos += approachedLane->getLength();
4420 }
4421 } else if (myState.myPos < myLane->getLength() + NUMERICAL_EPS) {
4422 // avoid warning due to numerical instability
4423 approachedLane = myLane;
4425 } else if (reverseTrain) {
4426 approachedLane = (*(myCurrEdge + 1))->getLanes()[0];
4427 link = myLane->getLinkTo(approachedLane);
4428 assert(link != 0);
4429 while (link->getViaLane() != nullptr) {
4430 link = link->getViaLane()->getLinkCont()[0];
4431 }
4433 } else {
4434 emergencyReason = " because there is no connection to the next edge";
4435 approachedLane = nullptr;
4436 break;
4437 }
4438 if (approachedLane != myLane && approachedLane != nullptr) {
4441 assert(myState.myPos > 0);
4442 enterLaneAtMove(approachedLane);
4443 if (link->isEntryLink()) {
4446 myHaveStoppedFor = nullptr;
4447 }
4448 if (link->isConflictEntryLink()) {
4450 // renew yielded request
4452 }
4453 if (link->isExitLink()) {
4454 // passed junction, reset for approaching the next one
4458 }
4459#ifdef DEBUG_PLAN_MOVE_LEADERINFO
4460 if (DEBUG_COND) {
4461 std::cout << "Update junctionTimes link=" << link->getViaLaneOrLane()->getID()
4462 << " entry=" << link->isEntryLink() << " conflict=" << link->isConflictEntryLink() << " exit=" << link->isExitLink()
4463 << " ET=" << myJunctionEntryTime
4464 << " ETN=" << myJunctionEntryTimeNeverYield
4465 << " CET=" << myJunctionConflictEntryTime
4466 << "\n";
4467 }
4468#endif
4469 if (hasArrivedInternal()) {
4470 break;
4471 }
4474 // abort lane change
4475 WRITE_WARNING("Vehicle '" + getID() + "' could not finish continuous lane change (turn lane) time=" +
4476 time2string(MSNet::getInstance()->getCurrentTimeStep()) + ".");
4478 }
4479 }
4480 if (approachedLane->getEdge().isVaporizing()) {
4482 break;
4483 }
4484 passedLanes.push_back(approachedLane);
4485 }
4486 }
4487 // NOTE: Passed drive items will be erased in the next simstep's planMove()
4488
4489#ifdef DEBUG_ACTIONSTEPS
4490 if (DEBUG_COND && myNextDriveItem != myLFLinkLanes.begin()) {
4491 std::cout << "Updated drive items:" << std::endl;
4492 for (DriveItemVector::iterator i = myLFLinkLanes.begin(); i != myLFLinkLanes.end(); ++i) {
4493 std::cout
4494 << " vPass=" << (*i).myVLinkPass
4495 << " vWait=" << (*i).myVLinkWait
4496 << " linkLane=" << ((*i).myLink == 0 ? "NULL" : (*i).myLink->getViaLaneOrLane()->getID())
4497 << " request=" << (*i).mySetRequest
4498 << "\n";
4499 }
4500 }
4501#endif
4502 } else if (!hasArrivedInternal() && myState.myPos < myLane->getLength() + NUMERICAL_EPS) {
4503 // avoid warning due to numerical instability when stopping at the end of the route
4505 }
4506
4507 }
4508}
4509
4510
4511
4512bool
4514#ifdef DEBUG_EXEC_MOVE
4515 if (DEBUG_COND) {
4516 std::cout << "\nEXECUTE_MOVE\n"
4517 << SIMTIME
4518 << " veh=" << getID()
4519 << " speed=" << getSpeed() // toString(getSpeed(), 24)
4520 << std::endl;
4521 }
4522#endif
4523
4524
4525 // Maximum safe velocity
4526 double vSafe = std::numeric_limits<double>::max();
4527 // Minimum safe velocity (lower bound).
4528 double vSafeMin = -std::numeric_limits<double>::max();
4529 // The distance to a link, which should either be crossed this step
4530 // or in front of which we need to stop.
4531 double vSafeMinDist = 0;
4532
4533 if (myActionStep) {
4534 // Actuate control (i.e. choose bounds for safe speed in current simstep (euler), resp. after current sim step (ballistic))
4535 processLinkApproaches(vSafe, vSafeMin, vSafeMinDist);
4536#ifdef DEBUG_ACTIONSTEPS
4537 if (DEBUG_COND) {
4538 std::cout << SIMTIME << " vehicle '" << getID() << "'\n"
4539 " vsafe from processLinkApproaches(): vsafe " << vSafe << std::endl;
4540 }
4541#endif
4542 } else {
4543 // Continue with current acceleration
4544 vSafe = getSpeed() + ACCEL2SPEED(myAcceleration);
4545#ifdef DEBUG_ACTIONSTEPS
4546 if (DEBUG_COND) {
4547 std::cout << SIMTIME << " vehicle '" << getID() << "' skips processLinkApproaches()\n"
4548 " continues with constant accel " << myAcceleration << "...\n"
4549 << "speed: " << getSpeed() << " -> " << vSafe << std::endl;
4550 }
4551#endif
4552 }
4553
4554
4555//#ifdef DEBUG_EXEC_MOVE
4556// if (DEBUG_COND) {
4557// std::cout << "vSafe = " << toString(vSafe,12) << "\n" << std::endl;
4558// }
4559//#endif
4560
4561 // Determine vNext = speed after current sim step (ballistic), resp. in current simstep (euler)
4562 // Call to finalizeSpeed applies speed reduction due to dawdling / lane changing but ensures minimum safe speed
4563 double vNext = vSafe;
4564 const double rawAccel = SPEED2ACCEL(MAX2(vNext, 0.) - myState.mySpeed);
4565 if (vNext <= SUMO_const_haltingSpeed * TS && myWaitingTime > MSGlobals::gStartupWaitThreshold && rawAccel <= accelThresholdForWaiting() && myActionStep) {
4567 } else if (isStopped()) {
4568 // do not apply startupDelay for waypoints
4569 if (getCarFollowModel().startupDelayStopped() && getNextStop().pars.speed <= 0) {
4571 } else {
4572 // do not apply startupDelay but signal that a stop has taken place
4574 }
4575 } else {
4576 // identify potential startup (before other effects reduce the speed again)
4578 }
4579 if (myActionStep) {
4580 vNext = getCarFollowModel().finalizeSpeed(this, vSafe);
4581 if (vNext > 0) {
4582 vNext = MAX2(vNext, vSafeMin);
4583 }
4584 }
4585 // (Leo) to avoid tiny oscillations (< 1e-10) of vNext in a standing vehicle column (observed for ballistic update), we cap off vNext
4586 // (We assure to do this only for vNext<<NUMERICAL_EPS since otherwise this would nullify the workaround for #2995
4587 // (Jakob) We also need to make sure to reach a stop at the start of the next edge
4588 if (fabs(vNext) < NUMERICAL_EPS_SPEED && (myStopDist > POSITION_EPS || (hasStops() && myCurrEdge == getNextStop().edge))) {
4589 vNext = 0.;
4590 }
4591#ifdef DEBUG_EXEC_MOVE
4592 if (DEBUG_COND) {
4593 std::cout << SIMTIME << " finalizeSpeed vSafe=" << vSafe << " vSafeMin=" << (vSafeMin == -std::numeric_limits<double>::max() ? "-Inf" : toString(vSafeMin))
4594 << " vNext=" << vNext << " (i.e. accel=" << SPEED2ACCEL(vNext - getSpeed()) << ")" << std::endl;
4595 }
4596#endif
4597
4598 // vNext may be higher than vSafe without implying a bug:
4599 // - when approaching a green light that suddenly switches to yellow
4600 // - when using unregulated junctions
4601 // - when using tau < step-size
4602 // - when using unsafe car following models
4603 // - when using TraCI and some speedMode / laneChangeMode settings
4604 //if (vNext > vSafe + NUMERICAL_EPS) {
4605 // WRITE_WARNING("vehicle '" + getID() + "' cannot brake hard enough to reach safe speed "
4606 // + toString(vSafe, 4) + ", moving at " + toString(vNext, 4) + " instead. time="
4607 // + time2string(MSNet::getInstance()->getCurrentTimeStep()) + ".");
4608 //}
4609
4611 vNext = MAX2(vNext, 0.);
4612 } else {
4613 // (Leo) Ballistic: negative vNext can be used to indicate a stop within next step.
4614 }
4615
4616 // Check for speed advices from the traci client
4617 vNext = processTraCISpeedControl(vSafe, vNext);
4618
4619 // the acceleration of a vehicle equipped with the elecHybrid device is restricted by the maximal power of the electric drive as well
4620 MSDevice_ElecHybrid* elecHybridOfVehicle = dynamic_cast<MSDevice_ElecHybrid*>(getDevice(typeid(MSDevice_ElecHybrid)));
4621 if (elecHybridOfVehicle != nullptr) {
4622 // this is the consumption given by the car following model-computed acceleration
4623 elecHybridOfVehicle->setConsum(elecHybridOfVehicle->consumption(*this, (vNext - this->getSpeed()) / TS, vNext));
4624 // but the maximum power of the electric motor may be lower
4625 // it needs to be converted from [W] to [Wh/s] (3600s / 1h) so that TS can be taken into account
4626 double maxPower = getEmissionParameters()->getDoubleOptional(SUMO_ATTR_MAXIMUMPOWER, 100000.) / 3600;
4627 if (elecHybridOfVehicle->getConsum() / TS > maxPower) {
4628 // no, we cannot accelerate that fast, recompute the maximum possible acceleration
4629 double accel = elecHybridOfVehicle->acceleration(*this, maxPower, this->getSpeed());
4630 // and update the speed of the vehicle
4631 vNext = MIN2(vNext, this->getSpeed() + accel * TS);
4632 vNext = MAX2(vNext, 0.);
4633 // and set the vehicle consumption to reflect this
4634 elecHybridOfVehicle->setConsum(elecHybridOfVehicle->consumption(*this, (vNext - this->getSpeed()) / TS, vNext));
4635 }
4636 }
4637
4638 setBrakingSignals(vNext);
4639
4640 // update position and speed
4641 int oldLaneOffset = myLane->getEdge().getNumLanes() - myLane->getIndex();
4642 const MSLane* oldLaneMaybeOpposite = myLane;
4644 // transform to the forward-direction lane, move and then transform back
4647 }
4648 updateState(vNext);
4649 updateWaitingTime(vNext);
4650
4651 // Lanes, which the vehicle touched at some moment of the executed simstep
4652 std::vector<MSLane*> passedLanes;
4653 // remember previous lane (myLane is updated in processLaneAdvances)
4654 const MSLane* oldLane = myLane;
4655 // Reason for a possible emergency stop
4656 std::string emergencyReason;
4657 processLaneAdvances(passedLanes, emergencyReason);
4658
4659 updateTimeLoss(vNext);
4661
4663 if (myState.myPos > myLane->getLength()) {
4664 if (emergencyReason == "") {
4665 emergencyReason = TL(" for unknown reasons");
4666 }
4667 WRITE_WARNINGF(TL("Vehicle '%' performs emergency stop at the end of lane '%'% (decel=%, offset=%), time=%."),
4668 getID(), myLane->getID(), emergencyReason, myAcceleration - myState.mySpeed,
4673 myState.mySpeed = 0;
4674 myAcceleration = 0;
4675 }
4676 const MSLane* oldBackLane = getBackLane();
4678 passedLanes.clear(); // ignore back occupation
4679 }
4680#ifdef DEBUG_ACTIONSTEPS
4681 if (DEBUG_COND) {
4682 std::cout << SIMTIME << " veh '" << getID() << "' updates further lanes." << std::endl;
4683 }
4684#endif
4686 if (passedLanes.size() > 1 && isRail()) {
4687 for (auto pi = passedLanes.rbegin(); pi != passedLanes.rend(); ++pi) {
4688 MSLane* pLane = *pi;
4689 if (pLane != myLane && std::find(myFurtherLanes.begin(), myFurtherLanes.end(), pLane) == myFurtherLanes.end()) {
4691 }
4692 }
4693 }
4694 // bestLanes need to be updated before lane changing starts. NOTE: This call is also a presumption for updateDriveItems()
4696 if (myLane != oldLane || oldBackLane != getBackLane()) {
4697 if (myLaneChangeModel->getShadowLane() != nullptr || getLateralOverlap() > POSITION_EPS) {
4698 // shadow lane must be updated if the front or back lane changed
4699 // either if we already have a shadowLane or if there is lateral overlap
4701 }
4703 // The vehicles target lane must be also be updated if the front or back lane changed
4705 }
4706 }
4707 setBlinkerInformation(); // needs updated bestLanes
4708 //change the blue light only for emergency vehicles SUMOVehicleClass
4710 setEmergencyBlueLight(MSNet::getInstance()->getCurrentTimeStep());
4711 }
4712 // must be done before angle computation
4713 // State needs to be reset for all vehicles before the next call to MSEdgeControl::changeLanes
4714 if (myActionStep) {
4715 // check (#2681): Can this be skipped?
4717 } else {
4719#ifdef DEBUG_ACTIONSTEPS
4720 if (DEBUG_COND) {
4721 std::cout << SIMTIME << " veh '" << getID() << "' skips LCM->prepareStep()." << std::endl;
4722 }
4723#endif
4724 }
4727 }
4728
4729#ifdef DEBUG_EXEC_MOVE
4730 if (DEBUG_COND) {
4731 std::cout << SIMTIME << " executeMove finished veh=" << getID() << " lane=" << myLane->getID() << " myPos=" << getPositionOnLane() << " myPosLat=" << getLateralPositionOnLane() << "\n";
4732 gDebugFlag1 = false; // See MSLink_DEBUG_OPENED
4733 }
4734#endif
4736 // transform back to the opposite-direction lane
4737 MSLane* newOpposite = nullptr;
4738 const MSEdge* newOppositeEdge = myLane->getEdge().getOppositeEdge();
4739 if (newOppositeEdge != nullptr) {
4740 newOpposite = newOppositeEdge->getLanes()[newOppositeEdge->getNumLanes() - MAX2(1, oldLaneOffset)];
4741#ifdef DEBUG_EXEC_MOVE
4742 if (DEBUG_COND) {
4743 std::cout << SIMTIME << " newOppositeEdge=" << newOppositeEdge->getID() << " oldLaneOffset=" << oldLaneOffset << " leftMost=" << newOppositeEdge->getNumLanes() - 1 << " newOpposite=" << Named::getIDSecure(newOpposite) << "\n";
4744 }
4745#endif
4746 }
4747 if (newOpposite == nullptr) {
4749 // unusual overtaking at junctions is ok for emergency vehicles
4750 WRITE_WARNINGF(TL("Unexpected end of opposite lane for vehicle '%' at lane '%', time=%."),
4752 }
4754 if (myState.myPos < getLength()) {
4755 // further lanes is always cleared during opposite driving
4756 MSLane* oldOpposite = oldLane->getOpposite();
4757 if (oldOpposite != nullptr) {
4758 myFurtherLanes.push_back(oldOpposite);
4759 myFurtherLanesPosLat.push_back(0);
4760 // small value since the lane is going in the other direction
4763 } else {
4764 SOFT_ASSERT(false);
4765 }
4766 }
4767 } else {
4769 myLane = newOpposite;
4770 oldLane = oldLaneMaybeOpposite;
4771 //std::cout << SIMTIME << " updated myLane=" << Named::getIDSecure(myLane) << " oldLane=" << oldLane->getID() << "\n";
4774 }
4775 }
4777 // Return whether the vehicle did move to another lane
4778 return myLane != oldLane;
4779}
4780
4781void
4783 myState.myPos += dist;
4786
4787 const std::vector<const MSLane*> lanes = getUpcomingLanesUntil(dist);
4789 for (int i = 0; i < (int)lanes.size(); i++) {
4790 MSLink* link = nullptr;
4791 if (i + 1 < (int)lanes.size()) {
4792 const MSLane* const to = lanes[i + 1];
4793 const bool internal = to->isInternal();
4794 for (MSLink* const l : lanes[i]->getLinkCont()) {
4795 if ((internal && l->getViaLane() == to) || (!internal && l->getLane() == to)) {
4796 link = l;
4797 break;
4798 }
4799 }
4800 }
4801 myLFLinkLanes.emplace_back(link, getSpeed(), getSpeed(), true, t, getSpeed(), 0, 0, dist);
4802 }
4803 // minimum execute move:
4804 std::vector<MSLane*> passedLanes;
4805 // Reason for a possible emergency stop
4806 if (lanes.size() > 1) {
4808 }
4809 std::string emergencyReason;
4810 processLaneAdvances(passedLanes, emergencyReason);
4811#ifdef DEBUG_EXTRAPOLATE_DEPARTPOS
4812 if (DEBUG_COND) {
4813 std::cout << SIMTIME << " veh=" << getID() << " executeFractionalMove dist=" << dist
4814 << " passedLanes=" << toString(passedLanes) << " lanes=" << toString(lanes)
4815 << " finalPos=" << myState.myPos
4816 << " speed=" << getSpeed()
4817 << " myFurtherLanes=" << toString(myFurtherLanes)
4818 << "\n";
4819 }
4820#endif
4822 if (lanes.size() > 1) {
4823 for (std::vector<MSLane*>::iterator i = myFurtherLanes.begin(); i != myFurtherLanes.end(); ++i) {
4824#ifdef DEBUG_FURTHER
4825 if (DEBUG_COND) {
4826 std::cout << SIMTIME << " leaveLane \n";
4827 }
4828#endif
4829 (*i)->resetPartialOccupation(this);
4830 }
4831 myFurtherLanes.clear();
4832 myFurtherLanesPosLat.clear();
4834 }
4835}
4836
4837
4838void
4839MSVehicle::updateState(double vNext, bool parking) {
4840 // update position and speed
4841 double deltaPos; // positional change
4843 // euler
4844 deltaPos = SPEED2DIST(vNext);
4845 } else {
4846 // ballistic
4847 deltaPos = getDeltaPos(SPEED2ACCEL(vNext - myState.mySpeed));
4848 }
4849
4850 // the *mean* acceleration during the next step (probably most appropriate for emission calculation)
4851 // NOTE: for the ballistic update vNext may be negative, indicating a stop.
4853
4854#ifdef DEBUG_EXEC_MOVE
4855 if (DEBUG_COND) {
4856 std::cout << SIMTIME << " updateState() for veh '" << getID() << "': deltaPos=" << deltaPos
4857 << " pos=" << myState.myPos << " newPos=" << myState.myPos + deltaPos << std::endl;
4858 }
4859#endif
4860 double decelPlus = -myAcceleration - getCarFollowModel().getMaxDecel() - NUMERICAL_EPS;
4861 if (decelPlus > 0) {
4862 const double previousAcceleration = SPEED2ACCEL(myState.mySpeed - myState.myPreviousSpeed);
4863 if (myAcceleration + NUMERICAL_EPS < previousAcceleration) {
4864 // vehicle brakes beyond wished maximum deceleration (only warn at the start of the braking manoeuvre)
4865 decelPlus += 2 * NUMERICAL_EPS;
4866 const double emergencyFraction = decelPlus / MAX2(NUMERICAL_EPS, getCarFollowModel().getEmergencyDecel() - getCarFollowModel().getMaxDecel());
4867 if (emergencyFraction >= MSGlobals::gEmergencyDecelWarningThreshold) {
4868 WRITE_WARNINGF(TL("Vehicle '%' performs emergency braking on lane '%' with decel=%, wished=%, severity=%, time=%."),
4869 //+ " decelPlus=" + toString(decelPlus)
4870 //+ " prevAccel=" + toString(previousAcceleration)
4871 //+ " reserve=" + toString(MAX2(NUMERICAL_EPS, getCarFollowModel().getEmergencyDecel() - getCarFollowModel().getMaxDecel()))
4872 getID(), myLane->getID(), -myAcceleration, getCarFollowModel().getMaxDecel(), emergencyFraction, time2string(SIMSTEP));
4874 }
4875 }
4876 }
4877
4879 myState.mySpeed = MAX2(vNext, 0.);
4880
4881 if (isRemoteControlled()) {
4882 deltaPos = myInfluencer->implicitDeltaPosRemote(this);
4883 }
4884
4885 myState.myPos += deltaPos;
4886 myState.myLastCoveredDist = deltaPos;
4887 myNextTurn.first -= deltaPos;
4888
4889 if (!parking) {
4891 }
4892}
4893
4894void
4896 updateState(0, true);
4897 // deboard while parked
4898 if (myPersonDevice != nullptr) {
4900 }
4901 if (myContainerDevice != nullptr) {
4903 }
4904 for (MSVehicleDevice* const dev : myDevices) {
4905 dev->notifyParking();
4906 }
4907}
4908
4909
4910void
4916
4917
4918const MSLane*
4920 if (myFurtherLanes.size() > 0) {
4921 return myFurtherLanes.back();
4922 } else {
4923 return myLane;
4924 }
4925}
4926
4927
4928double
4929MSVehicle::updateFurtherLanes(std::vector<MSLane*>& furtherLanes, std::vector<double>& furtherLanesPosLat,
4930 const std::vector<MSLane*>& passedLanes) {
4931#ifdef DEBUG_SETFURTHER
4932 if (DEBUG_COND) std::cout << SIMTIME << " veh=" << getID()
4933 << " updateFurtherLanes oldFurther=" << toString(furtherLanes)
4934 << " oldFurtherPosLat=" << toString(furtherLanesPosLat)
4935 << " passed=" << toString(passedLanes)
4936 << "\n";
4937#endif
4938 for (MSLane* further : furtherLanes) {
4939 further->resetPartialOccupation(this);
4940 if (further->getBidiLane() != nullptr
4941 && (!isRailway(getVClass()) || (further->getPermissions() & ~SVC_RAIL_CLASSES) != 0)) {
4942 further->getBidiLane()->resetPartialOccupation(this);
4943 }
4944 }
4945
4946 std::vector<MSLane*> newFurther;
4947 std::vector<double> newFurtherPosLat;
4948 double backPosOnPreviousLane = myState.myPos - getLength();
4949 bool widthShift = myFurtherLanesPosLat.size() > myFurtherLanes.size();
4950 if (passedLanes.size() > 1) {
4951 // There are candidates for further lanes. (passedLanes[-1] is the current lane, or current shadow lane in context of updateShadowLanes())
4952 std::vector<MSLane*>::const_iterator fi = furtherLanes.begin();
4953 std::vector<double>::const_iterator fpi = furtherLanesPosLat.begin();
4954 for (auto pi = passedLanes.rbegin() + 1; pi != passedLanes.rend() && backPosOnPreviousLane < 0; ++pi) {
4955 // As long as vehicle back reaches into passed lane, add it to the further lanes
4956 MSLane* further = *pi;
4957 newFurther.push_back(further);
4958 backPosOnPreviousLane += further->setPartialOccupation(this);
4959 if (further->getBidiLane() != nullptr
4960 && (!isRailway(getVClass()) || (further->getPermissions() & ~SVC_RAIL_CLASSES) != 0)) {
4961 further->getBidiLane()->setPartialOccupation(this);
4962 }
4963 if (fi != furtherLanes.end() && further == *fi) {
4964 // Lateral position on this lane is already known. Assume constant and use old value.
4965 newFurtherPosLat.push_back(*fpi);
4966 ++fi;
4967 ++fpi;
4968 } else {
4969 // The lane *pi was not in furtherLanes before.
4970 // If it is downstream, we assume as lateral position the current position
4971 // If it is a new lane upstream (can appear as shadow further in case of LC-maneuvering, e.g.)
4972 // we assign the last known lateral position.
4973 if (newFurtherPosLat.size() == 0) {
4974 if (widthShift) {
4975 newFurtherPosLat.push_back(myFurtherLanesPosLat.back());
4976 } else {
4977 newFurtherPosLat.push_back(myState.myPosLat);
4978 }
4979 } else {
4980 newFurtherPosLat.push_back(newFurtherPosLat.back());
4981 }
4982 }
4983#ifdef DEBUG_SETFURTHER
4984 if (DEBUG_COND) {
4985 std::cout << SIMTIME << " updateFurtherLanes \n"
4986 << " further lane '" << further->getID() << "' backPosOnPreviousLane=" << backPosOnPreviousLane
4987 << std::endl;
4988 }
4989#endif
4990 }
4991 furtherLanes = newFurther;
4992 furtherLanesPosLat = newFurtherPosLat;
4993 } else {
4994 furtherLanes.clear();
4995 furtherLanesPosLat.clear();
4996 }
4997#ifdef DEBUG_SETFURTHER
4998 if (DEBUG_COND) std::cout
4999 << " newFurther=" << toString(furtherLanes)
5000 << " newFurtherPosLat=" << toString(furtherLanesPosLat)
5001 << " newBackPos=" << backPosOnPreviousLane
5002 << "\n";
5003#endif
5004 return backPosOnPreviousLane;
5005}
5006
5007
5008double
5009MSVehicle::getBackPositionOnLane(const MSLane* lane, bool calledByGetPosition) const {
5010#ifdef DEBUG_FURTHER
5011 if (DEBUG_COND) {
5012 std::cout << SIMTIME
5013 << " getBackPositionOnLane veh=" << getID()
5014 << " lane=" << Named::getIDSecure(lane)
5015 << " cbgP=" << calledByGetPosition
5016 << " pos=" << myState.myPos
5017 << " backPos=" << myState.myBackPos
5018 << " myLane=" << myLane->getID()
5019 << " myLaneBidi=" << Named::getIDSecure(myLane->getBidiLane())
5020 << " further=" << toString(myFurtherLanes)
5021 << " furtherPosLat=" << toString(myFurtherLanesPosLat)
5022 << "\n shadowLane=" << Named::getIDSecure(myLaneChangeModel->getShadowLane())
5023 << " shadowFurther=" << toString(myLaneChangeModel->getShadowFurtherLanes())
5024 << " shadowFurtherPosLat=" << toString(myLaneChangeModel->getShadowFurtherLanesPosLat())
5025 << "\n targetLane=" << Named::getIDSecure(myLaneChangeModel->getTargetLane())
5026 << " furtherTargets=" << toString(myLaneChangeModel->getFurtherTargetLanes())
5027 << std::endl;
5028 }
5029#endif
5030 if (lane == myLane
5031 || lane == myLaneChangeModel->getShadowLane()
5032 || lane == myLaneChangeModel->getTargetLane()) {
5034 if (lane == myLaneChangeModel->getShadowLane()) {
5035 return lane->getLength() - myState.myPos - myType->getLength();
5036 } else {
5037 return myState.myPos + (calledByGetPosition ? -1 : 1) * myType->getLength();
5038 }
5039 } else if (&lane->getEdge() != &myLane->getEdge()) {
5040 return lane->getLength() - myState.myPos + (calledByGetPosition ? -1 : 1) * myType->getLength();
5041 } else {
5042 // account for parallel lanes of different lengths in the most conservative manner (i.e. while turning)
5043 return myState.myPos - myType->getLength() + MIN2(0.0, lane->getLength() - myLane->getLength());
5044 }
5045 } else if (lane == myLane->getBidiLane()) {
5046 return lane->getLength() - myState.myPos + myType->getLength() * (calledByGetPosition ? -1 : 1);
5047 } else if (myFurtherLanes.size() > 0 && lane == myFurtherLanes.back()) {
5048 return myState.myBackPos;
5049 } else if ((myLaneChangeModel->getShadowFurtherLanes().size() > 0 && lane == myLaneChangeModel->getShadowFurtherLanes().back())
5050 || (myLaneChangeModel->getFurtherTargetLanes().size() > 0 && lane == myLaneChangeModel->getFurtherTargetLanes().back())) {
5051 assert(myFurtherLanes.size() > 0);
5052 if (lane->getLength() == myFurtherLanes.back()->getLength()) {
5053 return myState.myBackPos;
5054 } else {
5055 // interpolate
5056 //if (DEBUG_COND) {
5057 //if (myFurtherLanes.back()->getLength() != lane->getLength()) {
5058 // std::cout << SIMTIME << " veh=" << getID() << " lane=" << lane->getID() << " further=" << myFurtherLanes.back()->getID()
5059 // << " len=" << lane->getLength() << " fLen=" << myFurtherLanes.back()->getLength()
5060 // << " backPos=" << myState.myBackPos << " result=" << myState.myBackPos / myFurtherLanes.back()->getLength() * lane->getLength() << "\n";
5061 //}
5062 return myState.myBackPos / myFurtherLanes.back()->getLength() * lane->getLength();
5063 }
5064 } else {
5065 //if (DEBUG_COND) std::cout << SIMTIME << " veh=" << getID() << " myFurtherLanes=" << toString(myFurtherLanes) << "\n";
5066 double leftLength = myType->getLength() - myState.myPos;
5067
5068 std::vector<MSLane*>::const_iterator i = myFurtherLanes.begin();
5069 while (leftLength > 0 && i != myFurtherLanes.end()) {
5070 leftLength -= (*i)->getLength();
5071 //if (DEBUG_COND) std::cout << " comparing i=" << (*i)->getID() << " lane=" << lane->getID() << "\n";
5072 if (*i == lane) {
5073 return -leftLength;
5074 } else if (*i == lane->getBidiLane()) {
5075 return lane->getLength() + leftLength - (calledByGetPosition ? 2 * myType->getLength() : 0);
5076 }
5077 ++i;
5078 }
5079 //if (DEBUG_COND) std::cout << SIMTIME << " veh=" << getID() << " myShadowFurtherLanes=" << toString(myLaneChangeModel->getShadowFurtherLanes()) << "\n";
5080 leftLength = myType->getLength() - myState.myPos;
5082 while (leftLength > 0 && i != myLaneChangeModel->getShadowFurtherLanes().end()) {
5083 leftLength -= (*i)->getLength();
5084 //if (DEBUG_COND) std::cout << " comparing i=" << (*i)->getID() << " lane=" << lane->getID() << "\n";
5085 if (*i == lane) {
5086 return -leftLength;
5087 }
5088 ++i;
5089 }
5090 //if (DEBUG_COND) std::cout << SIMTIME << " veh=" << getID() << " myFurtherTargetLanes=" << toString(myLaneChangeModel->getFurtherTargetLanes()) << "\n";
5091 leftLength = myType->getLength() - myState.myPos;
5092 i = getFurtherLanes().begin();
5093 const std::vector<MSLane*> furtherTargetLanes = myLaneChangeModel->getFurtherTargetLanes();
5094 auto j = furtherTargetLanes.begin();
5095 while (leftLength > 0 && j != furtherTargetLanes.end()) {
5096 leftLength -= (*i)->getLength();
5097 // if (DEBUG_COND) std::cout << " comparing i=" << (*i)->getID() << " lane=" << lane->getID() << "\n";
5098 if (*j == lane) {
5099 return -leftLength;
5100 }
5101 ++i;
5102 ++j;
5103 }
5104 WRITE_WARNING("Request backPos of vehicle '" + getID() + "' for invalid lane '" + Named::getIDSecure(lane)
5105 + "' time=" + time2string(MSNet::getInstance()->getCurrentTimeStep()) + ".")
5106 SOFT_ASSERT(false);
5107 return myState.myBackPos;
5108 }
5109}
5110
5111
5112double
5114 return getBackPositionOnLane(lane, true) + myType->getLength();
5115}
5116
5117
5118bool
5120 return lane == myLane || lane == myLaneChangeModel->getShadowLane() || lane == myLane->getBidiLane();
5121}
5122
5123
5124void
5125MSVehicle::checkRewindLinkLanes(const double lengthsInFront, DriveItemVector& lfLinks) const {
5127 double seenSpace = -lengthsInFront;
5128#ifdef DEBUG_CHECKREWINDLINKLANES
5129 if (DEBUG_COND) {
5130 std::cout << "\nCHECK_REWIND_LINKLANES\n" << " veh=" << getID() << " lengthsInFront=" << lengthsInFront << "\n";
5131 };
5132#endif
5133 bool foundStopped = false;
5134 // compute available space until a stopped vehicle is found
5135 // this is the sum of non-interal lane length minus in-between vehicle lengths
5136 for (int i = 0; i < (int)lfLinks.size(); ++i) {
5137 // skip unset links
5138 DriveProcessItem& item = lfLinks[i];
5139#ifdef DEBUG_CHECKREWINDLINKLANES
5140 if (DEBUG_COND) std::cout << SIMTIME
5141 << " link=" << (item.myLink == 0 ? "NULL" : item.myLink->getViaLaneOrLane()->getID())
5142 << " foundStopped=" << foundStopped;
5143#endif
5144 if (item.myLink == nullptr || foundStopped) {
5145 if (!foundStopped) {
5146 item.availableSpace += seenSpace;
5147 } else {
5148 item.availableSpace = seenSpace;
5149 }
5150#ifdef DEBUG_CHECKREWINDLINKLANES
5151 if (DEBUG_COND) {
5152 std::cout << " avail=" << item.availableSpace << "\n";
5153 }
5154#endif
5155 continue;
5156 }
5157 // get the next lane, determine whether it is an internal lane
5158 const MSLane* approachedLane = item.myLink->getViaLane();
5159 if (approachedLane != nullptr) {
5160 if (keepClear(item.myLink)) {
5161 seenSpace = seenSpace - approachedLane->getBruttoVehLenSum();
5162 if (approachedLane == myLane) {
5163 seenSpace += getVehicleType().getLengthWithGap();
5164 }
5165 } else {
5166 seenSpace = seenSpace + approachedLane->getSpaceTillLastStanding(this, foundStopped);// - approachedLane->getBruttoVehLenSum() + approachedLane->getLength();
5167 }
5168 item.availableSpace = seenSpace;
5169#ifdef DEBUG_CHECKREWINDLINKLANES
5170 if (DEBUG_COND) std::cout
5171 << " approached=" << approachedLane->getID()
5172 << " approachedBrutto=" << approachedLane->getBruttoVehLenSum()
5173 << " avail=" << item.availableSpace
5174 << " seenSpace=" << seenSpace
5175 << " hadStoppedVehicle=" << item.hadStoppedVehicle
5176 << " lengthsInFront=" << lengthsInFront
5177 << "\n";
5178#endif
5179 continue;
5180 }
5181 approachedLane = item.myLink->getLane();
5182 const MSVehicle* last = approachedLane->getLastAnyVehicle();
5183 if (last == nullptr || last == this) {
5184 if (approachedLane->getLength() > getVehicleType().getLength()
5185 || keepClear(item.myLink)) {
5186 seenSpace += approachedLane->getLength();
5187 }
5188 item.availableSpace = seenSpace;
5189#ifdef DEBUG_CHECKREWINDLINKLANES
5190 if (DEBUG_COND) {
5191 std::cout << " last=" << Named::getIDSecure(last) << " laneLength=" << approachedLane->getLength() << " avail=" << item.availableSpace << "\n";
5192 }
5193#endif
5194 } else {
5195 bool foundStopped2 = false;
5196 double spaceTillLastStanding = approachedLane->getSpaceTillLastStanding(this, foundStopped2);
5197 if (approachedLane->getBidiLane() != nullptr) {
5198 const MSVehicle* oncomingVeh = approachedLane->getBidiLane()->getFirstFullVehicle();
5199 if (oncomingVeh) {
5200 const double oncomingGap = approachedLane->getLength() - oncomingVeh->getPositionOnLane();
5201 const double oncomingBGap = oncomingVeh->getBrakeGap(true);
5202 // oncoming movement until ego enters the junction
5203 const double oncomingMove = STEPS2TIME(item.myArrivalTime - SIMSTEP) * oncomingVeh->getSpeed();
5204 const double spaceTillOncoming = oncomingGap - oncomingBGap - oncomingMove;
5205 spaceTillLastStanding = MIN2(spaceTillLastStanding, spaceTillOncoming);
5206 if (spaceTillOncoming <= getVehicleType().getLengthWithGap()) {
5207 foundStopped = true;
5208 }
5209#ifdef DEBUG_CHECKREWINDLINKLANES
5210 if (DEBUG_COND) {
5211 std::cout << " oVeh=" << oncomingVeh->getID()
5212 << " oGap=" << oncomingGap
5213 << " bGap=" << oncomingBGap
5214 << " mGap=" << oncomingMove
5215 << " sto=" << spaceTillOncoming;
5216 }
5217#endif
5218 }
5219 }
5220 seenSpace += spaceTillLastStanding;
5221 if (foundStopped2) {
5222 foundStopped = true;
5223 item.hadStoppedVehicle = true;
5224 }
5225 item.availableSpace = seenSpace;
5226 if (last->myHaveToWaitOnNextLink || last->isStopped()) {
5227 foundStopped = true;
5228 item.hadStoppedVehicle = true;
5229 }
5230#ifdef DEBUG_CHECKREWINDLINKLANES
5231 if (DEBUG_COND) std::cout
5232 << " approached=" << approachedLane->getID()
5233 << " last=" << last->getID()
5234 << " lastHasToWait=" << last->myHaveToWaitOnNextLink
5235 << " lastBrakeLight=" << last->signalSet(VEH_SIGNAL_BRAKELIGHT)
5236 << " lastBrakeGap=" << last->getCarFollowModel().brakeGap(last->getSpeed())
5237 << " lastGap=" << (last->getBackPositionOnLane(approachedLane) + last->getCarFollowModel().brakeGap(last->getSpeed()) - last->getSpeed() * last->getCarFollowModel().getHeadwayTime()
5238 // gap of last up to the next intersection
5239 - last->getVehicleType().getMinGap())
5240 << " stls=" << spaceTillLastStanding
5241 << " avail=" << item.availableSpace
5242 << " seenSpace=" << seenSpace
5243 << " foundStopped=" << foundStopped
5244 << " foundStopped2=" << foundStopped2
5245 << "\n";
5246#endif
5247 }
5248 }
5249
5250 // check which links allow continuation and add pass available to the previous item
5251 for (int i = ((int)lfLinks.size() - 1); i > 0; --i) {
5252 DriveProcessItem& item = lfLinks[i - 1];
5253 DriveProcessItem& nextItem = lfLinks[i];
5254 const bool canLeaveJunction = item.myLink->getViaLane() == nullptr || nextItem.myLink == nullptr || nextItem.mySetRequest;
5255 const bool opened = (item.myLink != nullptr
5256 && (canLeaveJunction || (
5257 // indirect bicycle turn
5258 nextItem.myLink != nullptr && nextItem.myLink->isInternalJunctionLink() && nextItem.myLink->haveRed()))
5259 && (
5260 item.myLink->havePriority()
5261 || i == 1 // the upcoming link (item 0) is checked in executeMove anyway. No need to use outdata approachData here
5263 || item.myLink->opened(item.myArrivalTime, item.myArrivalSpeed,
5266 bool allowsContinuation = (item.myLink == nullptr || item.myLink->isCont() || opened) && !item.hadStoppedVehicle;
5267#ifdef DEBUG_CHECKREWINDLINKLANES
5268 if (DEBUG_COND) std::cout
5269 << " link=" << (item.myLink == 0 ? "NULL" : item.myLink->getViaLaneOrLane()->getID())
5270 << " canLeave=" << canLeaveJunction
5271 << " opened=" << opened
5272 << " allowsContinuation=" << allowsContinuation
5273 << " foundStopped=" << foundStopped
5274 << "\n";
5275#endif
5276 if (!opened && item.myLink != nullptr) {
5277 foundStopped = true;
5278 if (i > 1) {
5279 DriveProcessItem& item2 = lfLinks[i - 2];
5280 if (item2.myLink != nullptr && item2.myLink->isCont()) {
5281 allowsContinuation = true;
5282 }
5283 }
5284 }
5285 if (allowsContinuation) {
5286 item.availableSpace = nextItem.availableSpace;
5287#ifdef DEBUG_CHECKREWINDLINKLANES
5288 if (DEBUG_COND) std::cout
5289 << " link=" << (item.myLink == nullptr ? "NULL" : item.myLink->getViaLaneOrLane()->getID())
5290 << " copy nextAvail=" << nextItem.availableSpace
5291 << "\n";
5292#endif
5293 }
5294 }
5295
5296 // find removalBegin
5297 int removalBegin = -1;
5298 for (int i = 0; foundStopped && i < (int)lfLinks.size() && removalBegin < 0; ++i) {
5299 // skip unset links
5300 const DriveProcessItem& item = lfLinks[i];
5301 if (item.myLink == nullptr) {
5302 continue;
5303 }
5304 /*
5305 double impatienceCorrection = MAX2(0., double(double(myWaitingTime)));
5306 if (seenSpace<getVehicleType().getLengthWithGap()-impatienceCorrection/10.&&nextSeenNonInternal!=0) {
5307 removalBegin = lastLinkToInternal;
5308 }
5309 */
5310
5311 const double leftSpace = item.availableSpace - getVehicleType().getLengthWithGap();
5312#ifdef DEBUG_CHECKREWINDLINKLANES
5313 if (DEBUG_COND) std::cout
5314 << SIMTIME
5315 << " veh=" << getID()
5316 << " link=" << (item.myLink == 0 ? "NULL" : item.myLink->getViaLaneOrLane()->getID())
5317 << " avail=" << item.availableSpace
5318 << " leftSpace=" << leftSpace
5319 << "\n";
5320#endif
5321 if (leftSpace < 0/* && item.myLink->willHaveBlockedFoe()*/) {
5322 double impatienceCorrection = 0;
5323 /*
5324 if(item.myLink->getState()==LINKSTATE_MINOR) {
5325 impatienceCorrection = MAX2(0., STEPS2TIME(myWaitingTime));
5326 }
5327 */
5328 // may ignore keepClear rules
5329 if (leftSpace < -impatienceCorrection / 10. && keepClear(item.myLink)) {
5330 removalBegin = i;
5331 }
5332 //removalBegin = i;
5333 }
5334 }
5335 // abort requests
5336 if (removalBegin != -1 && !(removalBegin == 0 && myLane->getEdge().isInternal())) {
5337 const double brakeGap = getCarFollowModel().brakeGap(myState.mySpeed, getCarFollowModel().getMaxDecel(), 0.);
5338 while (removalBegin < (int)(lfLinks.size())) {
5339 DriveProcessItem& dpi = lfLinks[removalBegin];
5340 if (dpi.myLink == nullptr) {
5341 break;
5342 }
5343 dpi.myVLinkPass = dpi.myVLinkWait;
5344#ifdef DEBUG_CHECKREWINDLINKLANES
5345 if (DEBUG_COND) {
5346 std::cout << " removalBegin=" << removalBegin << " brakeGap=" << brakeGap << " dist=" << dpi.myDistance << " speed=" << myState.mySpeed << " a2s=" << ACCEL2SPEED(getCarFollowModel().getMaxDecel()) << "\n";
5347 }
5348#endif
5349 if (dpi.myDistance >= brakeGap + POSITION_EPS) {
5350 // always leave junctions after requesting to enter
5351 if (!dpi.myLink->isExitLink() || !lfLinks[removalBegin - 1].mySetRequest) {
5352 dpi.mySetRequest = false;
5353 }
5354 }
5355 ++removalBegin;
5356 }
5357 }
5358 }
5359}
5360
5361
5362void
5364 if (!myActionStep) {
5365 return;
5366 }
5368 for (DriveProcessItem& dpi : myLFLinkLanes) {
5369 if (dpi.myLink != nullptr) {
5370 if (dpi.myLink->getState() == LINKSTATE_ALLWAY_STOP) {
5371 dpi.myArrivalTime += (SUMOTime)RandHelper::rand((int)2, getRNG()); // tie braker
5372 }
5373 dpi.myLink->setApproaching(this, dpi.myArrivalTime, dpi.myArrivalSpeed, dpi.getLeaveSpeed(),
5374 dpi.mySetRequest, dpi.myArrivalSpeedBraking, getWaitingTimeFor(dpi.myLink), dpi.myDistance, getLateralPositionOnLane());
5375 }
5376 }
5377 if (isRail()) {
5378 for (DriveProcessItem& dpi : myLFLinkLanes) {
5379 if (dpi.myLink != nullptr && dpi.myLink->getTLLogic() != nullptr && dpi.myLink->getTLLogic()->getLogicType() == TrafficLightType::RAIL_SIGNAL) {
5381 }
5382 }
5383 }
5384 if (myLaneChangeModel->getShadowLane() != nullptr) {
5385 // register on all shadow links
5386 for (const DriveProcessItem& dpi : myLFLinkLanes) {
5387 if (dpi.myLink != nullptr) {
5388 MSLink* parallelLink = dpi.myLink->getParallelLink(myLaneChangeModel->getShadowDirection());
5389 if (parallelLink == nullptr && getLaneChangeModel().isOpposite() && dpi.myLink->isEntryLink()) {
5390 // register on opposite direction entry link to warn foes at minor side road
5391 parallelLink = dpi.myLink->getOppositeDirectionLink();
5392 }
5393 if (parallelLink != nullptr) {
5394 const double latOffset = getLane()->getRightSideOnEdge() - myLaneChangeModel->getShadowLane()->getRightSideOnEdge();
5395 parallelLink->setApproaching(this, dpi.myArrivalTime, dpi.myArrivalSpeed, dpi.getLeaveSpeed(),
5396 dpi.mySetRequest, dpi.myArrivalSpeedBraking, getWaitingTimeFor(dpi.myLink), dpi.myDistance,
5397 latOffset);
5399 }
5400 }
5401 }
5402 }
5403#ifdef DEBUG_PLAN_MOVE
5404 if (DEBUG_COND) {
5405 std::cout << SIMTIME
5406 << " veh=" << getID()
5407 << " after checkRewindLinkLanes\n";
5408 for (DriveProcessItem& dpi : myLFLinkLanes) {
5409 std::cout
5410 << " vPass=" << dpi.myVLinkPass
5411 << " vWait=" << dpi.myVLinkWait
5412 << " linkLane=" << (dpi.myLink == 0 ? "NULL" : dpi.myLink->getViaLaneOrLane()->getID())
5413 << " request=" << dpi.mySetRequest
5414 << " atime=" << dpi.myArrivalTime
5415 << "\n";
5416 }
5417 }
5418#endif
5419}
5420
5421
5422void
5424 DriveProcessItem dpi(0, dist);
5425 dpi.myLink = link;
5426 const double arrivalSpeedBraking = getCarFollowModel().getMinimalArrivalSpeedEuler(dist, getSpeed());
5427 link->setApproaching(this, SUMOTime_MAX, 0, 0, false, arrivalSpeedBraking, 0, dpi.myDistance, 0);
5428 // ensure cleanup in the next step
5429 myLFLinkLanes.push_back(dpi);
5431}
5432
5433
5434void
5435MSVehicle::enterLaneAtMove(MSLane* enteredLane, bool onTeleporting) {
5436 myAmOnNet = !onTeleporting;
5437 // vaporizing edge?
5438 /*
5439 if (enteredLane->getEdge().isVaporizing()) {
5440 // yep, let's do the vaporization...
5441 myLane = enteredLane;
5442 return true;
5443 }
5444 */
5445 // Adjust MoveReminder offset to the next lane
5446 adaptLaneEntering2MoveReminder(*enteredLane);
5447 // set the entered lane as the current lane
5448 MSLane* oldLane = myLane;
5449 myLane = enteredLane;
5450 myLastBestLanesEdge = nullptr;
5451
5452 // internal edges are not a part of the route...
5453 if (!enteredLane->getEdge().isInternal()) {
5454 ++myCurrEdge;
5456 }
5457 if (myInfluencer != nullptr) {
5459 }
5460 if (!onTeleporting) {
5463 // transform lateral position when the lane width changes
5464 assert(oldLane != nullptr);
5465 const MSLink* const link = oldLane->getLinkTo(myLane);
5466 if (link != nullptr) {
5468 myState.myPosLat += link->getLateralShift();
5469 }
5470 } else if (fabs(myState.myPosLat) > NUMERICAL_EPS) {
5471 const double overlap = MAX2(0.0, getLateralOverlap(myState.myPosLat, oldLane));
5472 const double range = (oldLane->getWidth() - getVehicleType().getWidth()) * 0.5 + overlap;
5473 const double range2 = (myLane->getWidth() - getVehicleType().getWidth()) * 0.5 + overlap;
5474 myState.myPosLat *= range2 / range;
5475 }
5476 if (myLane->getBidiLane() != nullptr && (!isRailway(getVClass()) || (myLane->getPermissions() & ~SVC_RAIL_CLASSES) != 0)) {
5477 // railways don't need to "see" each other when moving in opposite directions on the same track (efficiency)
5478 // (unless the lane is shared with cars)
5480 }
5481 } else {
5482 // normal move() isn't called so reset position here. must be done
5483 // before calling reminders
5484 myState.myPos = 0;
5487 }
5488 // update via
5489 if (myParameter->via.size() > 0 && myLane->getEdge().getID() == myParameter->via.front()) {
5490 myParameter->via.erase(myParameter->via.begin());
5491 }
5492}
5493
5494
5495void
5497 myAmOnNet = true;
5498 myLane = enteredLane;
5500 // need to update myCurrentLaneInBestLanes
5502 // switch to and activate the new lane's reminders
5503 // keep OldLaneReminders
5504 for (std::vector< MSMoveReminder* >::const_iterator rem = enteredLane->getMoveReminders().begin(); rem != enteredLane->getMoveReminders().end(); ++rem) {
5505 addReminder(*rem);
5506 }
5508 MSLane* lane = myLane;
5509 double leftLength = getVehicleType().getLength() - myState.myPos;
5510 int deleteFurther = 0;
5511#ifdef DEBUG_SETFURTHER
5512 if (DEBUG_COND) {
5513 std::cout << SIMTIME << " enterLaneAtLaneChange entered=" << Named::getIDSecure(enteredLane) << " oldFurther=" << toString(myFurtherLanes) << "\n";
5514 }
5515#endif
5516 if (myLane->getBidiLane() != nullptr && (!isRailway(getVClass()) || (myLane->getPermissions() & ~SVC_RAIL_CLASSES) != 0)) {
5517 // railways don't need to "see" each other when moving in opposite directions on the same track (efficiency)
5518 // (unless the lane is shared with cars)
5520 }
5521 for (int i = 0; i < (int)myFurtherLanes.size(); i++) {
5522 if (lane != nullptr) {
5524 }
5525#ifdef DEBUG_SETFURTHER
5526 if (DEBUG_COND) {
5527 std::cout << " enterLaneAtLaneChange i=" << i << " lane=" << Named::getIDSecure(lane) << " leftLength=" << leftLength << "\n";
5528 }
5529#endif
5530 if (leftLength > 0) {
5531 if (lane != nullptr) {
5533 if (myFurtherLanes[i]->getBidiLane() != nullptr
5534 && (!isRailway(getVClass()) || (myFurtherLanes[i]->getPermissions() & ~SVC_RAIL_CLASSES) != 0)) {
5535 myFurtherLanes[i]->getBidiLane()->resetPartialOccupation(this);
5536 }
5537 // lane changing onto longer lanes may reduce the number of
5538 // remaining further lanes
5539 myFurtherLanes[i] = lane;
5541 leftLength -= lane->setPartialOccupation(this);
5542 if (lane->getBidiLane() != nullptr
5543 && (!isRailway(getVClass()) || (lane->getPermissions() & ~SVC_RAIL_CLASSES) != 0)) {
5544 lane->getBidiLane()->setPartialOccupation(this);
5545 }
5546 myState.myBackPos = -leftLength;
5547#ifdef DEBUG_SETFURTHER
5548 if (DEBUG_COND) {
5549 std::cout << SIMTIME << " newBackPos=" << myState.myBackPos << "\n";
5550 }
5551#endif
5552 } else {
5553 // keep the old values, but ensure there is no shadow
5556 }
5557 if (myState.myBackPos < 0) {
5558 myState.myBackPos += myFurtherLanes[i]->getLength();
5559 }
5560#ifdef DEBUG_SETFURTHER
5561 if (DEBUG_COND) {
5562 std::cout << SIMTIME << " i=" << i << " further=" << myFurtherLanes[i]->getID() << " newBackPos=" << myState.myBackPos << "\n";
5563 }
5564#endif
5565 }
5566 } else {
5567 myFurtherLanes[i]->resetPartialOccupation(this);
5568 if (myFurtherLanes[i]->getBidiLane() != nullptr
5569 && (!isRailway(getVClass()) || (myFurtherLanes[i]->getPermissions() & ~SVC_RAIL_CLASSES) != 0)) {
5570 myFurtherLanes[i]->getBidiLane()->resetPartialOccupation(this);
5571 }
5572 deleteFurther++;
5573 }
5574 }
5575 if (deleteFurther > 0) {
5576#ifdef DEBUG_SETFURTHER
5577 if (DEBUG_COND) {
5578 std::cout << SIMTIME << " veh=" << getID() << " shortening myFurtherLanes by " << deleteFurther << "\n";
5579 }
5580#endif
5581 myFurtherLanes.erase(myFurtherLanes.end() - deleteFurther, myFurtherLanes.end());
5582 myFurtherLanesPosLat.erase(myFurtherLanesPosLat.end() - deleteFurther, myFurtherLanesPosLat.end());
5583 }
5584#ifdef DEBUG_SETFURTHER
5585 if (DEBUG_COND) {
5586 std::cout << SIMTIME << " enterLaneAtLaneChange new furtherLanes=" << toString(myFurtherLanes)
5587 << " furterLanesPosLat=" << toString(myFurtherLanesPosLat) << "\n";
5588 }
5589#endif
5591}
5592
5593
5594void
5595MSVehicle::computeFurtherLanes(MSLane* enteredLane, double pos, bool collision) {
5596 // build the list of lanes the vehicle is lapping into
5597 if (!myLaneChangeModel->isOpposite()) {
5598 double leftLength = myType->getLength() - pos;
5599 MSLane* clane = enteredLane;
5600 int routeIndex = getRoutePosition();
5601 while (leftLength > 0) {
5602 if (routeIndex > 0 && clane->getEdge().isNormal()) {
5603 // get predecessor lane that corresponds to prior route
5604 routeIndex--;
5605 const MSEdge* fromRouteEdge = myRoute->getEdges()[routeIndex];
5606 MSLane* target = clane;
5607 clane = nullptr;
5608 for (auto ili : target->getIncomingLanes()) {
5609 if (ili.lane->getEdge().getNormalBefore() == fromRouteEdge) {
5610 clane = ili.lane;
5611 break;
5612 }
5613 }
5614 } else {
5615 clane = clane->getLogicalPredecessorLane();
5616 }
5617 if (clane == nullptr || clane == myLane || clane == myLane->getBidiLane()
5618 || (clane->isInternal() && (
5619 clane->getLinkCont()[0]->getDirection() == LinkDirection::TURN
5620 || clane->getLinkCont()[0]->getDirection() == LinkDirection::TURN_LEFTHAND))) {
5621 break;
5622 }
5623 if (!collision || std::find(myFurtherLanes.begin(), myFurtherLanes.end(), clane) == myFurtherLanes.end()) {
5624 myFurtherLanes.push_back(clane);
5626 clane->setPartialOccupation(this);
5627 if (clane->getBidiLane() != nullptr
5628 && (!isRailway(getVClass()) || (clane->getPermissions() & ~SVC_RAIL_CLASSES) != 0)) {
5629 clane->getBidiLane()->setPartialOccupation(this);
5630 }
5631 }
5632 leftLength -= clane->getLength();
5633 }
5634 myState.myBackPos = -leftLength;
5635#ifdef DEBUG_SETFURTHER
5636 if (DEBUG_COND) {
5637 std::cout << SIMTIME << " computeFurtherLanes veh=" << getID() << " pos=" << pos << " myFurtherLanes=" << toString(myFurtherLanes) << " backPos=" << myState.myBackPos << "\n";
5638 }
5639#endif
5640 } else {
5641 // clear partial occupation
5642 for (MSLane* further : myFurtherLanes) {
5643#ifdef DEBUG_SETFURTHER
5644 if (DEBUG_COND) {
5645 std::cout << SIMTIME << " opposite: resetPartialOccupation " << further->getID() << " \n";
5646 }
5647#endif
5648 further->resetPartialOccupation(this);
5649 if (further->getBidiLane() != nullptr
5650 && (!isRailway(getVClass()) || (further->getPermissions() & ~SVC_RAIL_CLASSES) != 0)) {
5651 further->getBidiLane()->resetPartialOccupation(this);
5652 }
5653 }
5654 myFurtherLanes.clear();
5655 myFurtherLanesPosLat.clear();
5656 }
5657}
5658
5659
5660void
5661MSVehicle::enterLaneAtInsertion(MSLane* enteredLane, double pos, double speed, double posLat, MSMoveReminder::Notification notification) {
5662 myState = State(pos, speed, posLat, pos - getVehicleType().getLength(), hasDeparted() ? myState.myPreviousSpeed : speed);
5664 onDepart();
5665 }
5667 assert(myState.myPos >= 0);
5668 assert(myState.mySpeed >= 0);
5669 myLane = enteredLane;
5670 myAmOnNet = true;
5671 // schedule action for the next timestep
5673 if (notification != MSMoveReminder::NOTIFICATION_TELEPORT) {
5674 if (notification == MSMoveReminder::NOTIFICATION_PARKING && myInfluencer != nullptr) {
5675 drawOutsideNetwork(false);
5676 }
5677 // set and activate the new lane's reminders, teleports already did that at enterLaneAtMove
5678 for (std::vector< MSMoveReminder* >::const_iterator rem = enteredLane->getMoveReminders().begin(); rem != enteredLane->getMoveReminders().end(); ++rem) {
5679 addReminder(*rem);
5680 }
5681 activateReminders(notification, enteredLane);
5682 } else {
5683 myLastBestLanesEdge = nullptr;
5686 while (!myStops.empty() && myStops.front().edge == myCurrEdge && &myStops.front().lane->getEdge() == &myLane->getEdge()
5687 && myStops.front().pars.endPos < pos) {
5688 WRITE_WARNINGF(TL("Vehicle '%' skips stop on lane '%' time=%."), getID(), myStops.front().lane->getID(),
5689 time2string(MSNet::getInstance()->getCurrentTimeStep()));
5690 myStops.pop_front();
5691 }
5692
5693 }
5694 computeFurtherLanes(enteredLane, pos);
5698 } else if (MSGlobals::gLaneChangeDuration > 0) {
5700 }
5701 if (notification != MSMoveReminder::NOTIFICATION_LOAD_STATE) {
5704 myAngle += M_PI;
5705 }
5706 }
5707 if (MSNet::getInstance()->hasPersons()) {
5708 for (MSLane* further : myFurtherLanes) {
5709 if (further->mustCheckJunctionCollisions()) {
5711 }
5712 }
5713 }
5714}
5715
5716
5717void
5718MSVehicle::leaveLane(const MSMoveReminder::Notification reason, const MSLane* approachedLane) {
5719 for (MoveReminderCont::iterator rem = myMoveReminders.begin(); rem != myMoveReminders.end();) {
5720 if (rem->first->notifyLeave(*this, myState.myPos + rem->second, reason, approachedLane)) {
5721#ifdef _DEBUG
5722 if (myTraceMoveReminders) {
5723 traceMoveReminder("notifyLeave", rem->first, rem->second, true);
5724 }
5725#endif
5726 ++rem;
5727 } else {
5728#ifdef _DEBUG
5729 if (myTraceMoveReminders) {
5730 traceMoveReminder("notifyLeave", rem->first, rem->second, false);
5731 }
5732#endif
5733 rem = myMoveReminders.erase(rem);
5734 }
5735 }
5739 && myLane != nullptr) {
5741 }
5742 if (myLane != nullptr && myLane->getBidiLane() != nullptr && myAmOnNet
5743 && (!isRailway(getVClass()) || (myLane->getPermissions() & ~SVC_RAIL_CLASSES) != 0)) {
5745 }
5747 // @note. In case of lane change, myFurtherLanes and partial occupation
5748 // are handled in enterLaneAtLaneChange()
5749 for (MSLane* further : myFurtherLanes) {
5750#ifdef DEBUG_FURTHER
5751 if (DEBUG_COND) {
5752 std::cout << SIMTIME << " leaveLane \n";
5753 }
5754#endif
5755 further->resetPartialOccupation(this);
5756 if (further->getBidiLane() != nullptr
5757 && (!isRailway(getVClass()) || (further->getPermissions() & ~SVC_RAIL_CLASSES) != 0)) {
5758 further->getBidiLane()->resetPartialOccupation(this);
5759 }
5760 }
5761 myFurtherLanes.clear();
5762 myFurtherLanesPosLat.clear();
5763 }
5765 myAmOnNet = false;
5766 myWaitingTime = 0;
5767 }
5769 myStopDist = std::numeric_limits<double>::max();
5770 if (myPastStops.back().speed <= 0) {
5771 WRITE_WARNINGF(TL("Vehicle '%' aborts stop."), getID());
5772 }
5773 }
5775 while (!myStops.empty() && myStops.front().edge == myCurrEdge && &myStops.front().lane->getEdge() == &myLane->getEdge()) {
5776 if (myStops.front().getSpeed() <= 0) {
5777 WRITE_WARNINGF(TL("Vehicle '%' skips stop on lane '%' time=%."), getID(), myStops.front().lane->getID(),
5778 time2string(MSNet::getInstance()->getCurrentTimeStep()))
5779 if (MSStopOut::active()) {
5780 // clean up if stopBlocked was called
5782 }
5783 myStops.pop_front();
5784 } else {
5785 MSStop& stop = myStops.front();
5786 // passed waypoint at the end of the lane
5787 if (!stop.reached) {
5788 if (MSStopOut::active()) {
5790 }
5791 stop.reached = true;
5792 // enter stopping place so leaveFrom works as expected
5793 if (stop.busstop != nullptr) {
5794 // let the bus stop know the vehicle
5795 stop.busstop->enter(this, stop.pars.parking == ParkingType::OFFROAD);
5796 }
5797 if (stop.containerstop != nullptr) {
5798 // let the container stop know the vehicle
5800 }
5801 // do not enter parkingarea!
5802 if (stop.chargingStation != nullptr) {
5803 // let the container stop know the vehicle
5805 }
5806 }
5808 }
5809 myStopDist = std::numeric_limits<double>::max();
5810 }
5811 }
5812}
5813
5814
5815void
5817 for (MoveReminderCont::iterator rem = myMoveReminders.begin(); rem != myMoveReminders.end();) {
5818 if (rem->first->notifyLeaveBack(*this, reason, leftLane)) {
5819#ifdef _DEBUG
5820 if (myTraceMoveReminders) {
5821 traceMoveReminder("notifyLeaveBack", rem->first, rem->second, true);
5822 }
5823#endif
5824 ++rem;
5825 } else {
5826#ifdef _DEBUG
5827 if (myTraceMoveReminders) {
5828 traceMoveReminder("notifyLeaveBack", rem->first, rem->second, false);
5829 }
5830#endif
5831 rem = myMoveReminders.erase(rem);
5832 }
5833 }
5834#ifdef DEBUG_MOVEREMINDERS
5835 if (DEBUG_COND) {
5836 std::cout << SIMTIME << " veh=" << getID() << " myReminders:";
5837 for (auto rem : myMoveReminders) {
5838 std::cout << rem.first->getDescription() << " ";
5839 }
5840 std::cout << "\n";
5841 }
5842#endif
5843}
5844
5845
5850
5851
5856
5857bool
5859 return (lane->isInternal()
5860 ? & (lane->getLinkCont()[0]->getLane()->getEdge()) != *(myCurrEdge + 1)
5861 : &lane->getEdge() != *myCurrEdge);
5862}
5863
5864const std::vector<MSVehicle::LaneQ>&
5866 return *myBestLanes.begin();
5867}
5868
5869
5870void
5871MSVehicle::updateBestLanes(bool forceRebuild, const MSLane* startLane) {
5872#ifdef DEBUG_BESTLANES
5873 if (DEBUG_COND) {
5874 std::cout << SIMTIME << " updateBestLanes veh=" << getID() << " force=" << forceRebuild << " startLane1=" << Named::getIDSecure(startLane) << " myLane=" << Named::getIDSecure(myLane) << "\n";
5875 }
5876#endif
5877 if (startLane == nullptr) {
5878 startLane = myLane;
5879 }
5880 assert(startLane != 0);
5882 // depending on the calling context, startLane might be the forward lane
5883 // or the reverse-direction lane. In the latter case we need to
5884 // transform it to the forward lane.
5885 if (isOppositeLane(startLane)) {
5886 // use leftmost lane of forward edge
5887 startLane = startLane->getEdge().getOppositeEdge()->getLanes().back();
5888 assert(startLane != 0);
5889#ifdef DEBUG_BESTLANES
5890 if (DEBUG_COND) {
5891 std::cout << " startLaneIsOpposite newStartLane=" << startLane->getID() << "\n";
5892 }
5893#endif
5894 }
5895 }
5896 if (forceRebuild) {
5897 myLastBestLanesEdge = nullptr;
5899 }
5900 if (myBestLanes.size() > 0 && !forceRebuild && myLastBestLanesEdge == &startLane->getEdge()) {
5902#ifdef DEBUG_BESTLANES
5903 if (DEBUG_COND) {
5904 std::cout << " only updateOccupancyAndCurrentBestLane\n";
5905 }
5906#endif
5907 return;
5908 }
5909 if (startLane->getEdge().isInternal()) {
5910 if (myBestLanes.size() == 0 || forceRebuild) {
5911 // rebuilt from previous non-internal lane (may backtrack twice if behind an internal junction)
5912 updateBestLanes(true, startLane->getLogicalPredecessorLane());
5913 }
5914 if (myLastBestLanesInternalLane == startLane && !forceRebuild) {
5915#ifdef DEBUG_BESTLANES
5916 if (DEBUG_COND) {
5917 std::cout << " nothing to do on internal\n";
5918 }
5919#endif
5920 return;
5921 }
5922 // adapt best lanes to fit the current internal edge:
5923 // keep the entries that are reachable from this edge
5924 const MSEdge* nextEdge = startLane->getNextNormal();
5925 assert(!nextEdge->isInternal());
5926 for (std::vector<std::vector<LaneQ> >::iterator it = myBestLanes.begin(); it != myBestLanes.end();) {
5927 std::vector<LaneQ>& lanes = *it;
5928 assert(lanes.size() > 0);
5929 if (&(lanes[0].lane->getEdge()) == nextEdge) {
5930 // keep those lanes which are successors of internal lanes from the edge of startLane
5931 std::vector<LaneQ> oldLanes = lanes;
5932 lanes.clear();
5933 const std::vector<MSLane*>& sourceLanes = startLane->getEdge().getLanes();
5934 for (std::vector<MSLane*>::const_iterator it_source = sourceLanes.begin(); it_source != sourceLanes.end(); ++it_source) {
5935 for (std::vector<LaneQ>::iterator it_lane = oldLanes.begin(); it_lane != oldLanes.end(); ++it_lane) {
5936 if ((*it_source)->getLinkCont()[0]->getLane() == (*it_lane).lane) {
5937 lanes.push_back(*it_lane);
5938 break;
5939 }
5940 }
5941 }
5942 assert(lanes.size() == startLane->getEdge().getLanes().size());
5943 // patch invalid bestLaneOffset and updated myCurrentLaneInBestLanes
5944 for (int i = 0; i < (int)lanes.size(); ++i) {
5945 if (i + lanes[i].bestLaneOffset < 0) {
5946 lanes[i].bestLaneOffset = -i;
5947 }
5948 if (i + lanes[i].bestLaneOffset >= (int)lanes.size()) {
5949 lanes[i].bestLaneOffset = (int)lanes.size() - i - 1;
5950 }
5951 assert(i + lanes[i].bestLaneOffset >= 0);
5952 assert(i + lanes[i].bestLaneOffset < (int)lanes.size());
5953 if (lanes[i].bestContinuations[0] != 0) {
5954 // patch length of bestContinuation to match expectations (only once)
5955 lanes[i].bestContinuations.insert(lanes[i].bestContinuations.begin(), (MSLane*)nullptr);
5956 }
5957 if (startLane->getLinkCont()[0]->getLane() == lanes[i].lane) {
5958 myCurrentLaneInBestLanes = lanes.begin() + i;
5959 }
5960 assert(&(lanes[i].lane->getEdge()) == nextEdge);
5961 }
5962 myLastBestLanesInternalLane = startLane;
5964#ifdef DEBUG_BESTLANES
5965 if (DEBUG_COND) {
5966 std::cout << " updated for internal\n";
5967 }
5968#endif
5969 return;
5970 } else {
5971 // remove passed edges
5972 it = myBestLanes.erase(it);
5973 }
5974 }
5975 assert(false); // should always find the next edge
5976 }
5977 // start rebuilding
5979 myLastBestLanesEdge = &startLane->getEdge();
5981
5982 // get information about the next stop
5983 MSRouteIterator nextStopEdge = myRoute->end();
5984 const MSLane* nextStopLane = nullptr;
5985 double nextStopPos = 0;
5986 bool nextStopIsWaypoint = false;
5987 if (!myStops.empty()) {
5988 const MSStop& nextStop = myStops.front();
5989 nextStopLane = nextStop.lane;
5990 if (nextStop.isOpposite) {
5991 // target leftmost lane in forward direction
5992 nextStopLane = nextStopLane->getEdge().getOppositeEdge()->getLanes().back();
5993 }
5994 nextStopEdge = nextStop.edge;
5995 nextStopPos = nextStop.pars.startPos;
5996 nextStopIsWaypoint = nextStop.getSpeed() > 0;
5997 }
5998 // myArrivalTime = -1 in the context of validating departSpeed with departLane=best
5999 if (myParameter->arrivalLaneProcedure >= ArrivalLaneDefinition::GIVEN && nextStopEdge == myRoute->end() && myArrivalLane >= 0) {
6000 nextStopEdge = (myRoute->end() - 1);
6001 nextStopLane = (*nextStopEdge)->getLanes()[myArrivalLane];
6002 nextStopPos = myArrivalPos;
6003 }
6004 if (nextStopEdge != myRoute->end()) {
6005 // make sure that the "wrong" lanes get a penalty. (penalty needs to be
6006 // large enough to overcome a magic threshold in MSLaneChangeModel::DK2004.cpp:383)
6007 nextStopPos = MAX2(POSITION_EPS, MIN2((double)nextStopPos, (double)(nextStopLane->getLength() - 2 * POSITION_EPS)));
6008 if (nextStopLane->isInternal()) {
6009 // switch to the correct lane before entering the intersection
6010 nextStopPos = (*nextStopEdge)->getLength();
6011 }
6012 }
6013
6014 // go forward along the next lanes;
6015 // trains do not have to deal with lane-changing for stops but their best
6016 // lanes lookahead is needed for rail signal control
6017 const bool continueAfterStop = nextStopIsWaypoint || isRailway(getVClass());
6018 int seen = 0;
6019 double seenLength = 0;
6020 bool progress = true;
6021 // bestLanes must cover the braking distance even when at the very end of the current lane to avoid unecessary slow down
6022 const double maxBrakeDist = startLane->getLength() + getCarFollowModel().getHeadwayTime() * getMaxSpeed() + getCarFollowModel().brakeGap(getMaxSpeed()) + getVehicleType().getMinGap();
6023 const double lookahead = getLaneChangeModel().getStrategicLookahead();
6024 for (MSRouteIterator ce = myCurrEdge; progress;) {
6025 std::vector<LaneQ> currentLanes;
6026 const std::vector<MSLane*>* allowed = nullptr;
6027 const MSEdge* nextEdge = nullptr;
6028 if (ce != myRoute->end() && ce + 1 != myRoute->end()) {
6029 nextEdge = *(ce + 1);
6030 allowed = (*ce)->allowedLanes(*nextEdge, myType->getVehicleClass());
6031 }
6032 const std::vector<MSLane*>& lanes = (*ce)->getLanes();
6033 for (std::vector<MSLane*>::const_iterator i = lanes.begin(); i != lanes.end(); ++i) {
6034 LaneQ q;
6035 MSLane* cl = *i;
6036 q.lane = cl;
6037 q.bestContinuations.push_back(cl);
6038 q.bestLaneOffset = 0;
6039 q.length = cl->allowsVehicleClass(myType->getVehicleClass()) ? (*ce)->getLength() : 0;
6040 q.currentLength = q.length;
6041 // if all lanes are forbidden (i.e. due to a dynamic closing) we want to express no preference
6042 q.allowsContinuation = allowed == nullptr || std::find(allowed->begin(), allowed->end(), cl) != allowed->end();
6043 q.occupation = 0;
6044 q.nextOccupation = 0;
6045 currentLanes.push_back(q);
6046 }
6047 //
6048 if (nextStopEdge == ce
6049 // already past the stop edge
6050 && !(ce == myCurrEdge && myLane != nullptr && myLane->isInternal())) {
6051 if (!nextStopLane->isInternal() && !continueAfterStop) {
6052 progress = false;
6053 }
6054 const MSLane* normalStopLane = nextStopLane->getNormalPredecessorLane();
6055 for (std::vector<LaneQ>::iterator q = currentLanes.begin(); q != currentLanes.end(); ++q) {
6056 if (nextStopLane != nullptr && normalStopLane != (*q).lane) {
6057 (*q).allowsContinuation = false;
6058 (*q).length = nextStopPos;
6059 (*q).currentLength = (*q).length;
6060 }
6061 }
6062 }
6063
6064 myBestLanes.push_back(currentLanes);
6065 ++seen;
6066 seenLength += currentLanes[0].lane->getLength();
6067 ++ce;
6068 if (lookahead >= 0) {
6069 progress &= (seen <= 2 || seenLength < lookahead); // custom (but we need to look at least one edge ahead)
6070 } else {
6071 progress &= (seen <= 4 || seenLength < MAX2(maxBrakeDist, 3000.0)); // motorway
6072 progress &= (seen <= 8 || seenLength < MAX2(maxBrakeDist, 200.0) || isRailway(getVClass())); // urban
6073 }
6074 progress &= ce != myRoute->end();
6075 /*
6076 if(progress) {
6077 progress &= (currentLanes.size()!=1||(*ce)->getLanes().size()!=1);
6078 }
6079 */
6080 }
6081
6082 // we are examining the last lane explicitly
6083 if (myBestLanes.size() != 0) {
6084 double bestLength = -1;
6085 // minimum and maximum lane index with best length
6086 int bestThisIndex = 0;
6087 int bestThisMaxIndex = 0;
6088 int index = 0;
6089 std::vector<LaneQ>& last = myBestLanes.back();
6090 for (std::vector<LaneQ>::iterator j = last.begin(); j != last.end(); ++j, ++index) {
6091 if ((*j).length > bestLength) {
6092 bestLength = (*j).length;
6093 bestThisIndex = index;
6094 bestThisMaxIndex = index;
6095 } else if ((*j).length == bestLength) {
6096 bestThisMaxIndex = index;
6097 }
6098 }
6099 index = 0;
6100 bool requiredChangeRightForbidden = false;
6101 int requireChangeToLeftForbidden = -1;
6102 for (std::vector<LaneQ>::iterator j = last.begin(); j != last.end(); ++j, ++index) {
6103 if ((*j).length < bestLength) {
6104 if (abs(bestThisIndex - index) < abs(bestThisMaxIndex - index)) {
6105 (*j).bestLaneOffset = bestThisIndex - index;
6106 } else {
6107 (*j).bestLaneOffset = bestThisMaxIndex - index;
6108 }
6109 if ((*j).bestLaneOffset < 0 && (!(*j).lane->allowsChangingRight(getVClass())
6110 || !(*j).lane->getParallelLane(-1, false)->allowsVehicleClass(getVClass())
6111 || requiredChangeRightForbidden)) {
6112 // this lane and all further lanes to the left cannot be used
6113 requiredChangeRightForbidden = true;
6114 (*j).length = 0;
6115 } else if ((*j).bestLaneOffset > 0 && (!(*j).lane->allowsChangingLeft(getVClass())
6116 || !(*j).lane->getParallelLane(1, false)->allowsVehicleClass(getVClass()))) {
6117 // this lane and all previous lanes to the right cannot be used
6118 requireChangeToLeftForbidden = (*j).lane->getIndex();
6119 }
6120 }
6121 }
6122 for (int i = requireChangeToLeftForbidden; i >= 0; i--) {
6123 if (last[i].bestLaneOffset > 0) {
6124 last[i].length = 0;
6125 }
6126 }
6127#ifdef DEBUG_BESTLANES
6128 if (DEBUG_COND) {
6129 std::cout << " last edge=" << last.front().lane->getEdge().getID() << " (bestIndex=" << bestThisIndex << " bestMaxIndex=" << bestThisMaxIndex << "):\n";
6130 std::vector<LaneQ>& laneQs = myBestLanes.back();
6131 for (std::vector<LaneQ>::iterator j = laneQs.begin(); j != laneQs.end(); ++j) {
6132 std::cout << " lane=" << (*j).lane->getID() << " length=" << (*j).length << " bestOffset=" << (*j).bestLaneOffset << "\n";
6133 }
6134 }
6135#endif
6136 }
6137 // go backward through the lanes
6138 // track back best lane and compute the best prior lane(s)
6139 for (std::vector<std::vector<LaneQ> >::reverse_iterator i = myBestLanes.rbegin() + 1; i != myBestLanes.rend(); ++i) {
6140 std::vector<LaneQ>& nextLanes = (*(i - 1));
6141 std::vector<LaneQ>& clanes = (*i);
6142 MSEdge* const cE = &clanes[0].lane->getEdge();
6143 int index = 0;
6144 double bestConnectedLength = -1;
6145 double bestLength = -1;
6146 for (const LaneQ& j : nextLanes) {
6147 if (j.lane->isApproachedFrom(cE) && bestConnectedLength < j.length) {
6148 bestConnectedLength = j.length;
6149 }
6150 if (bestLength < j.length) {
6151 bestLength = j.length;
6152 }
6153 }
6154 // compute index of the best lane (highest length and least offset from the best next lane)
6155 int bestThisIndex = 0;
6156 int bestThisMaxIndex = 0;
6157 if (bestConnectedLength > 0) {
6158 index = 0;
6159 for (LaneQ& j : clanes) {
6160 const LaneQ* bestConnectedNext = nullptr;
6161 if (j.allowsContinuation) {
6162 for (const LaneQ& m : nextLanes) {
6163 if ((m.lane->allowsVehicleClass(getVClass()) || m.lane->hadPermissionChanges())
6164 && m.lane->isApproachedFrom(cE, j.lane)) {
6165 if (betterContinuation(bestConnectedNext, m)) {
6166 bestConnectedNext = &m;
6167 }
6168 }
6169 }
6170 if (bestConnectedNext != nullptr) {
6171 if (bestConnectedNext->length == bestConnectedLength && abs(bestConnectedNext->bestLaneOffset) < 2) {
6172 j.length += bestLength;
6173 } else {
6174 j.length += bestConnectedNext->length;
6175 }
6176 j.bestLaneOffset = bestConnectedNext->bestLaneOffset;
6177 }
6178 }
6179 if (bestConnectedNext != nullptr && (bestConnectedNext->allowsContinuation || bestConnectedNext->length > 0)) {
6180 copy(bestConnectedNext->bestContinuations.begin(), bestConnectedNext->bestContinuations.end(), back_inserter(j.bestContinuations));
6181 } else {
6182 j.allowsContinuation = false;
6183 }
6184 if (clanes[bestThisIndex].length < j.length
6185 || (clanes[bestThisIndex].length == j.length && abs(clanes[bestThisIndex].bestLaneOffset) > abs(j.bestLaneOffset))
6186 || (clanes[bestThisIndex].length == j.length && abs(clanes[bestThisIndex].bestLaneOffset) == abs(j.bestLaneOffset) &&
6187 nextLinkPriority(clanes[bestThisIndex].bestContinuations) < nextLinkPriority(j.bestContinuations))
6188 ) {
6189 bestThisIndex = index;
6190 bestThisMaxIndex = index;
6191 } else if (clanes[bestThisIndex].length == j.length
6192 && abs(clanes[bestThisIndex].bestLaneOffset) == abs(j.bestLaneOffset)
6193 && nextLinkPriority(clanes[bestThisIndex].bestContinuations) == nextLinkPriority(j.bestContinuations)) {
6194 bestThisMaxIndex = index;
6195 }
6196 index++;
6197 }
6198
6199 //vehicle with elecHybrid device prefers running under an overhead wire
6200 if (getDevice(typeid(MSDevice_ElecHybrid)) != nullptr) {
6201 index = 0;
6202 for (const LaneQ& j : clanes) {
6203 std::string overheadWireSegmentID = MSNet::getInstance()->getStoppingPlaceID(j.lane, j.currentLength / 2., SUMO_TAG_OVERHEAD_WIRE_SEGMENT);
6204 if (overheadWireSegmentID != "") {
6205 bestThisIndex = index;
6206 bestThisMaxIndex = index;
6207 }
6208 index++;
6209 }
6210 }
6211
6212 } else {
6213 // only needed in case of disconnected routes
6214 int bestNextIndex = 0;
6215 int bestDistToNeeded = (int) clanes.size();
6216 index = 0;
6217 for (std::vector<LaneQ>::iterator j = clanes.begin(); j != clanes.end(); ++j, ++index) {
6218 if ((*j).allowsContinuation) {
6219 int nextIndex = 0;
6220 for (std::vector<LaneQ>::const_iterator m = nextLanes.begin(); m != nextLanes.end(); ++m, ++nextIndex) {
6221 if ((*m).lane->isApproachedFrom(cE, (*j).lane)) {
6222 if (bestDistToNeeded > abs((*m).bestLaneOffset)) {
6223 bestDistToNeeded = abs((*m).bestLaneOffset);
6224 bestThisIndex = index;
6225 bestThisMaxIndex = index;
6226 bestNextIndex = nextIndex;
6227 }
6228 }
6229 }
6230 }
6231 }
6232 clanes[bestThisIndex].length += nextLanes[bestNextIndex].length;
6233 copy(nextLanes[bestNextIndex].bestContinuations.begin(), nextLanes[bestNextIndex].bestContinuations.end(), back_inserter(clanes[bestThisIndex].bestContinuations));
6234
6235 }
6236 // set bestLaneOffset for all lanes
6237 index = 0;
6238 bool requiredChangeRightForbidden = false;
6239 int requireChangeToLeftForbidden = -1;
6240 for (std::vector<LaneQ>::iterator j = clanes.begin(); j != clanes.end(); ++j, ++index) {
6241 if ((*j).length < clanes[bestThisIndex].length
6242 || ((*j).length == clanes[bestThisIndex].length && abs((*j).bestLaneOffset) > abs(clanes[bestThisIndex].bestLaneOffset))
6243 || (nextLinkPriority((*j).bestContinuations)) < nextLinkPriority(clanes[bestThisIndex].bestContinuations)
6244 ) {
6245 if (abs(bestThisIndex - index) < abs(bestThisMaxIndex - index)) {
6246 (*j).bestLaneOffset = bestThisIndex - index;
6247 } else {
6248 (*j).bestLaneOffset = bestThisMaxIndex - index;
6249 }
6250 if ((nextLinkPriority((*j).bestContinuations)) < nextLinkPriority(clanes[bestThisIndex].bestContinuations)) {
6251 // try to move away from the lower-priority lane before it ends
6252 (*j).length = (*j).currentLength;
6253 }
6254 if ((*j).bestLaneOffset < 0 && (!(*j).lane->allowsChangingRight(getVClass())
6255 || !(*j).lane->getParallelLane(-1, false)->allowsVehicleClass(getVClass())
6256 || requiredChangeRightForbidden)) {
6257 // this lane and all further lanes to the left cannot be used
6258 requiredChangeRightForbidden = true;
6259 if ((*j).length == (*j).currentLength) {
6260 (*j).length = 0;
6261 }
6262 } else if ((*j).bestLaneOffset > 0 && (!(*j).lane->allowsChangingLeft(getVClass())
6263 || !(*j).lane->getParallelLane(1, false)->allowsVehicleClass(getVClass()))) {
6264 // this lane and all previous lanes to the right cannot be used
6265 requireChangeToLeftForbidden = (*j).lane->getIndex();
6266 }
6267 } else {
6268 (*j).bestLaneOffset = 0;
6269 }
6270 }
6271 for (int idx = requireChangeToLeftForbidden; idx >= 0; idx--) {
6272 if (clanes[idx].length == clanes[idx].currentLength) {
6273 clanes[idx].length = 0;
6274 };
6275 }
6276
6277 //vehicle with elecHybrid device prefers running under an overhead wire
6278 if (static_cast<MSDevice_ElecHybrid*>(getDevice(typeid(MSDevice_ElecHybrid))) != 0) {
6279 index = 0;
6280 std::string overheadWireID = MSNet::getInstance()->getStoppingPlaceID(clanes[bestThisIndex].lane, (clanes[bestThisIndex].currentLength) / 2, SUMO_TAG_OVERHEAD_WIRE_SEGMENT);
6281 if (overheadWireID != "") {
6282 for (std::vector<LaneQ>::iterator j = clanes.begin(); j != clanes.end(); ++j, ++index) {
6283 (*j).bestLaneOffset = bestThisIndex - index;
6284 }
6285 }
6286 }
6287
6288#ifdef DEBUG_BESTLANES
6289 if (DEBUG_COND) {
6290 std::cout << " edge=" << cE->getID() << " (bestIndex=" << bestThisIndex << " bestMaxIndex=" << bestThisMaxIndex << "):\n";
6291 std::vector<LaneQ>& laneQs = clanes;
6292 for (std::vector<LaneQ>::iterator j = laneQs.begin(); j != laneQs.end(); ++j) {
6293 std::cout << " lane=" << (*j).lane->getID() << " length=" << (*j).length << " bestOffset=" << (*j).bestLaneOffset << " allowCont=" << (*j).allowsContinuation << "\n";
6294 }
6295 }
6296#endif
6297
6298 }
6300#ifdef DEBUG_BESTLANES
6301 if (DEBUG_COND) {
6302 std::cout << SIMTIME << " veh=" << getID() << " bestCont=" << toString(getBestLanesContinuation()) << "\n";
6303 }
6304#endif
6305}
6306
6307void
6309 if (myLane != nullptr) {
6311 }
6312}
6313
6314bool
6315MSVehicle::betterContinuation(const LaneQ* bestConnectedNext, const LaneQ& m) const {
6316 if (bestConnectedNext == nullptr) {
6317 return true;
6318 } else if (m.lane->getBidiLane() != nullptr && bestConnectedNext->lane->getBidiLane() == nullptr) {
6319 return false;
6320 } else if (bestConnectedNext->lane->getBidiLane() != nullptr && m.lane->getBidiLane() == nullptr) {
6321 return true;
6322 } else if (bestConnectedNext->length < m.length) {
6323 return true;
6324 } else if (bestConnectedNext->length == m.length) {
6325 if (abs(bestConnectedNext->bestLaneOffset) > abs(m.bestLaneOffset)) {
6326 return true;
6327 }
6328 const double contRight = getVehicleType().getParameter().getLCParam(SUMO_ATTR_LCA_CONTRIGHT, 1);
6329 if (contRight < 1
6330 // if we don't check for adjacency, the rightmost line will get
6331 // multiple chances to be better which leads to an uninituitve distribution
6332 && (m.lane->getIndex() - bestConnectedNext->lane->getIndex()) == 1
6333 && RandHelper::rand(getRNG()) > contRight) {
6334 return true;
6335 }
6336 }
6337 return false;
6338}
6339
6340
6341int
6342MSVehicle::nextLinkPriority(const std::vector<MSLane*>& conts) {
6343 if (conts.size() < 2) {
6344 return -1;
6345 } else {
6346 const MSLink* const link = conts[0]->getLinkTo(conts[1]);
6347 if (link != nullptr) {
6348 return link->havePriority() ? 1 : 0;
6349 } else {
6350 // disconnected route
6351 return -1;
6352 }
6353 }
6354}
6355
6356
6357void
6359 std::vector<LaneQ>& currLanes = *myBestLanes.begin();
6360 std::vector<LaneQ>::iterator i;
6361 for (i = currLanes.begin(); i != currLanes.end(); ++i) {
6362 double nextOccupation = 0;
6363 for (std::vector<MSLane*>::const_iterator j = (*i).bestContinuations.begin() + 1; j != (*i).bestContinuations.end(); ++j) {
6364 nextOccupation += (*j)->getBruttoVehLenSum();
6365 }
6366 (*i).nextOccupation = nextOccupation;
6367#ifdef DEBUG_BESTLANES
6368 if (DEBUG_COND) {
6369 std::cout << " lane=" << (*i).lane->getID() << " nextOccupation=" << nextOccupation << "\n";
6370 }
6371#endif
6372 if ((*i).lane == startLane) {
6374 }
6375 }
6376}
6377
6378
6379const std::vector<MSLane*>&
6381 if (myBestLanes.empty() || myBestLanes[0].empty()) {
6382 return myEmptyLaneVector;
6383 }
6384 return (*myCurrentLaneInBestLanes).bestContinuations;
6385}
6386
6387
6388const std::vector<MSLane*>&
6390 const MSLane* lane = l;
6391 // XXX: shouldn't this be a "while" to cover more than one internal lane? (Leo) Refs. #2575
6392 if (lane->getEdge().isInternal()) {
6393 // internal edges are not kept inside the bestLanes structure
6394 lane = lane->getLinkCont()[0]->getLane();
6395 }
6396 if (myBestLanes.size() == 0) {
6397 return myEmptyLaneVector;
6398 }
6399 for (std::vector<LaneQ>::const_iterator i = myBestLanes[0].begin(); i != myBestLanes[0].end(); ++i) {
6400 if ((*i).lane == lane) {
6401 return (*i).bestContinuations;
6402 }
6403 }
6404 return myEmptyLaneVector;
6405}
6406
6407const std::vector<const MSLane*>
6408MSVehicle::getUpcomingLanesUntil(double distance) const {
6409 std::vector<const MSLane*> lanes;
6410
6411 if (distance <= 0. || hasArrived()) {
6412 // WRITE_WARNINGF(TL("MSVehicle::getUpcomingLanesUntil(): distance ('%') should be greater than 0."), distance);
6413 return lanes;
6414 }
6415
6416 if (!myLaneChangeModel->isOpposite()) {
6417 distance += getPositionOnLane();
6418 } else {
6419 distance += myLane->getOppositePos(getPositionOnLane());
6420 }
6422 while (lane->isInternal() && (distance > 0.)) { // include initial internal lanes
6423 lanes.insert(lanes.end(), lane);
6424 distance -= lane->getLength();
6425 lane = lane->getLinkCont().front()->getViaLaneOrLane();
6426 }
6427
6428 const std::vector<MSLane*>& contLanes = getBestLanesContinuation();
6429 if (contLanes.empty()) {
6430 return lanes;
6431 }
6432 auto contLanesIt = contLanes.begin();
6433 MSRouteIterator routeIt = myCurrEdge; // keep track of covered edges in myRoute
6434 while (distance > 0.) {
6435 MSLane* l = nullptr;
6436 if (contLanesIt != contLanes.end()) {
6437 l = *contLanesIt;
6438 if (l != nullptr) {
6439 assert(l->getEdge().getID() == (*routeIt)->getLanes().front()->getEdge().getID());
6440 }
6441 ++contLanesIt;
6442 if (l != nullptr || myLane->isInternal()) {
6443 ++routeIt;
6444 }
6445 if (l == nullptr) {
6446 continue;
6447 }
6448 } else if (routeIt != myRoute->end()) { // bestLanes didn't get us far enough
6449 // choose left-most lane as default (avoid sidewalks, bike lanes etc)
6450 l = (*routeIt)->getLanes().back();
6451 ++routeIt;
6452 } else { // the search distance goes beyond our route
6453 break;
6454 }
6455
6456 assert(l != nullptr);
6457
6458 // insert internal lanes if applicable
6459 const MSLane* internalLane = lanes.size() > 0 ? lanes.back()->getInternalFollowingLane(l) : nullptr;
6460 while ((internalLane != nullptr) && internalLane->isInternal() && (distance > 0.)) {
6461 lanes.insert(lanes.end(), internalLane);
6462 distance -= internalLane->getLength();
6463 internalLane = internalLane->getLinkCont().front()->getViaLaneOrLane();
6464 }
6465 if (distance <= 0.) {
6466 break;
6467 }
6468
6469 lanes.insert(lanes.end(), l);
6470 distance -= l->getLength();
6471 }
6472
6473 return lanes;
6474}
6475
6476const std::vector<const MSLane*>
6477MSVehicle::getPastLanesUntil(double distance) const {
6478 std::vector<const MSLane*> lanes;
6479
6480 if (distance <= 0.) {
6481 // WRITE_WARNINGF(TL("MSVehicle::getPastLanesUntil(): distance ('%') should be greater than 0."), distance);
6482 return lanes;
6483 }
6484
6485 MSRouteIterator routeIt = myCurrEdge;
6486 if (!myLaneChangeModel->isOpposite()) {
6487 distance += myLane->getLength() - getPositionOnLane();
6488 } else {
6490 }
6492 while (lane->isInternal() && (distance > 0.)) { // include initial internal lanes
6493 lanes.insert(lanes.end(), lane);
6494 distance -= lane->getLength();
6495 lane = lane->getLogicalPredecessorLane();
6496 }
6497
6498 while (distance > 0.) {
6499 // choose left-most lane as default (avoid sidewalks, bike lanes etc)
6500 MSLane* l = (*routeIt)->getLanes().back();
6501
6502 // insert internal lanes if applicable
6503 const MSEdge* internalEdge = lanes.size() > 0 ? (*routeIt)->getInternalFollowingEdge(&(lanes.back()->getEdge()), getVClass()) : nullptr;
6504 const MSLane* internalLane = internalEdge != nullptr ? internalEdge->getLanes().front() : nullptr;
6505 std::vector<const MSLane*> internalLanes;
6506 while ((internalLane != nullptr) && internalLane->isInternal()) { // collect all internal successor lanes
6507 internalLanes.insert(internalLanes.begin(), internalLane);
6508 internalLane = internalLane->getLinkCont().front()->getViaLaneOrLane();
6509 }
6510 for (auto it = internalLanes.begin(); (it != internalLanes.end()) && (distance > 0.); ++it) { // check remaining distance in correct order
6511 lanes.insert(lanes.end(), *it);
6512 distance -= (*it)->getLength();
6513 }
6514 if (distance <= 0.) {
6515 break;
6516 }
6517
6518 lanes.insert(lanes.end(), l);
6519 distance -= l->getLength();
6520
6521 // NOTE: we're going backwards with the (bi-directional) Iterator
6522 // TODO: consider make reverse_iterator() when moving on to C++14 or later
6523 if (routeIt != myRoute->begin()) {
6524 --routeIt;
6525 } else { // we went backwards to begin() and already processed the first and final element
6526 break;
6527 }
6528 }
6529
6530 return lanes;
6531}
6532
6533
6534const std::vector<MSLane*>
6536 const std::vector<const MSLane*> routeLanes = getPastLanesUntil(myLane->getMaximumBrakeDist());
6537 std::vector<MSLane*> result;
6538 for (const MSLane* lane : routeLanes) {
6539 MSLane* opposite = lane->getOpposite();
6540 if (opposite != nullptr) {
6541 result.push_back(opposite);
6542 } else {
6543 break;
6544 }
6545 }
6546 return result;
6547}
6548
6549
6550int
6552 if (myBestLanes.empty() || myBestLanes[0].empty()) {
6553 return 0;
6554 } else {
6555 return (*myCurrentLaneInBestLanes).bestLaneOffset;
6556 }
6557}
6558
6559double
6561 if (myBestLanes.empty() || myBestLanes[0].empty()) {
6562 return -1;
6563 } else {
6564 return (*myCurrentLaneInBestLanes).length;
6565 }
6566}
6567
6568
6569
6570void
6571MSVehicle::adaptBestLanesOccupation(int laneIndex, double density) {
6572 std::vector<MSVehicle::LaneQ>& preb = myBestLanes.front();
6573 assert(laneIndex < (int)preb.size());
6574 preb[laneIndex].occupation = density + preb[laneIndex].nextOccupation;
6575}
6576
6577
6578void
6584
6585std::pair<const MSLane*, double>
6586MSVehicle::getLanePosAfterDist(double distance) const {
6587 if (distance == 0) {
6588 return std::make_pair(myLane, getPositionOnLane());
6589 }
6590 const std::vector<const MSLane*> lanes = getUpcomingLanesUntil(distance);
6591 distance += getPositionOnLane();
6592 for (const MSLane* lane : lanes) {
6593 if (lane->getLength() > distance) {
6594 return std::make_pair(lane, distance);
6595 }
6596 distance -= lane->getLength();
6597 }
6598 return std::make_pair(nullptr, -1);
6599}
6600
6601
6602double
6603MSVehicle::getDistanceToPosition(double destPos, const MSLane* destLane) const {
6604 if (isOnRoad() && destLane != nullptr) {
6605 return myRoute->getDistanceBetween(getPositionOnLane(), destPos, myLane, destLane);
6606 }
6607 return std::numeric_limits<double>::max();
6608}
6609
6610
6611std::pair<const MSVehicle* const, double>
6612MSVehicle::getLeader(double dist, bool considerCrossingFoes) const {
6613 if (myLane == nullptr) {
6614 return std::make_pair(static_cast<const MSVehicle*>(nullptr), -1);
6615 }
6616 if (dist == 0) {
6618 }
6619 const MSVehicle* lead = nullptr;
6620 const MSLane* lane = myLane; // ensure lane does not change between getVehiclesSecure and releaseVehicles;
6621 const MSLane::VehCont& vehs = lane->getVehiclesSecure();
6622 // vehicle might be outside the road network
6623 MSLane::VehCont::const_iterator it = std::find(vehs.begin(), vehs.end(), this);
6624 if (it != vehs.end() && it + 1 != vehs.end()) {
6625 lead = *(it + 1);
6626 }
6627 if (lead != nullptr) {
6628 std::pair<const MSVehicle* const, double> result(
6629 lead, lead->getBackPositionOnLane(myLane) - getPositionOnLane() - getVehicleType().getMinGap());
6630 lane->releaseVehicles();
6631 return result;
6632 }
6633 const double seen = myLane->getLength() - getPositionOnLane();
6634 const std::vector<MSLane*>& bestLaneConts = getBestLanesContinuation(myLane);
6635 std::pair<const MSVehicle* const, double> result = myLane->getLeaderOnConsecutive(dist, seen, getSpeed(), *this, bestLaneConts, considerCrossingFoes);
6636 lane->releaseVehicles();
6637 return result;
6638}
6639
6640
6641std::pair<const MSVehicle* const, double>
6642MSVehicle::getFollower(double dist) const {
6643 if (myLane == nullptr) {
6644 return std::make_pair(static_cast<const MSVehicle*>(nullptr), -1);
6645 }
6646 if (dist == 0) {
6647 dist = getCarFollowModel().brakeGap(myLane->getEdge().getSpeedLimit() * 2, 4.5, 0);
6648 }
6650}
6651
6652
6653double
6655 // calling getLeader with 0 would induce a dist calculation but we only want to look for the leaders on the current lane
6656 std::pair<const MSVehicle* const, double> leaderInfo = getLeader(-1);
6657 if (leaderInfo.first == nullptr || getSpeed() == 0) {
6658 return -1;
6659 }
6660 return (leaderInfo.second + getVehicleType().getMinGap()) / getSpeed();
6661}
6662
6663
6664void
6666 MSBaseVehicle::addTransportable(transportable);
6667 if (myStops.size() > 0 && myStops.front().reached) {
6668 if (transportable->isPerson()) {
6669 if (myStops.front().triggered && myStops.front().numExpectedPerson > 0) {
6670 myStops.front().numExpectedPerson -= (int)myStops.front().pars.awaitedPersons.count(transportable->getID());
6671 }
6672 } else {
6673 if (myStops.front().pars.containerTriggered && myStops.front().numExpectedContainer > 0) {
6674 myStops.front().numExpectedContainer -= (int)myStops.front().pars.awaitedContainers.count(transportable->getID());
6675 }
6676 }
6677 }
6678}
6679
6680
6681void
6684 int state = myLaneChangeModel->getOwnState();
6685 // do not set blinker for sublane changes or when blocked from changing to the right
6686 const bool blinkerManoeuvre = (((state & LCA_SUBLANE) == 0) && (
6687 (state & LCA_KEEPRIGHT) == 0 || (state & LCA_BLOCKED) == 0));
6691 // lane indices increase from left to right
6692 std::swap(left, right);
6693 }
6694 if ((state & LCA_LEFT) != 0 && blinkerManoeuvre) {
6695 switchOnSignal(left);
6696 } else if ((state & LCA_RIGHT) != 0 && blinkerManoeuvre) {
6697 switchOnSignal(right);
6698 } else if (myLaneChangeModel->isChangingLanes()) {
6700 switchOnSignal(left);
6701 } else {
6702 switchOnSignal(right);
6703 }
6704 } else {
6705 const MSLane* lane = getLane();
6706 std::vector<MSLink*>::const_iterator link = MSLane::succLinkSec(*this, 1, *lane, getBestLanesContinuation());
6707 if (link != lane->getLinkCont().end() && lane->getLength() - getPositionOnLane() < lane->getVehicleMaxSpeed(this) * (double) 7.) {
6708 switch ((*link)->getDirection()) {
6713 break;
6717 break;
6718 default:
6719 break;
6720 }
6721 }
6722 }
6723 // stopping related signals
6724 if (hasStops()
6725 && (myStops.begin()->reached ||
6727 && myStopDist < getCarFollowModel().brakeGap(myLane->getVehicleMaxSpeed(this), getCarFollowModel().getMaxDecel(), 3)))) {
6728 if (myStops.begin()->lane->getIndex() > 0 && myStops.begin()->lane->getParallelLane(-1)->allowsVehicleClass(getVClass())) {
6729 // not stopping on the right. Activate emergency blinkers
6731 } else if (!myStops.begin()->reached && (myStops.begin()->pars.parking == ParkingType::OFFROAD)) {
6732 // signal upcoming parking stop on the current lane when within braking distance (~2 seconds before braking)
6734 }
6735 }
6736 if (myInfluencer != nullptr && myInfluencer->getSignals() >= 0) {
6738 myInfluencer->setSignals(-1); // overwrite computed signals only once
6739 }
6740}
6741
6742void
6744
6745 //TODO look if timestep ist SIMSTEP
6746 if (currentTime % 1000 == 0) {
6749 } else {
6751 }
6752 }
6753}
6754
6755
6756int
6758 return myLane == nullptr ? -1 : myLane->getIndex();
6759}
6760
6761
6762void
6763MSVehicle::setTentativeLaneAndPosition(MSLane* lane, double pos, double posLat) {
6764 myLane = lane;
6765 myState.myPos = pos;
6766 myState.myPosLat = posLat;
6768}
6769
6770
6771double
6773 return myState.myPosLat + 0.5 * myLane->getWidth() - 0.5 * getVehicleType().getWidth();
6774}
6775
6776
6777double
6779 return myState.myPosLat + 0.5 * myLane->getWidth() + 0.5 * getVehicleType().getWidth();
6780}
6781
6782
6783double
6785 return myState.myPosLat + 0.5 * lane->getWidth() - 0.5 * getVehicleType().getWidth();
6786}
6787
6788
6789double
6791 return myState.myPosLat + 0.5 * lane->getWidth() + 0.5 * getVehicleType().getWidth();
6792}
6793
6794
6795double
6797 return getCenterOnEdge(lane) - 0.5 * getVehicleType().getWidth();
6798}
6799
6800
6801double
6803 return getCenterOnEdge(lane) + 0.5 * getVehicleType().getWidth();
6804}
6805
6806
6807double
6809 if (lane == nullptr || &lane->getEdge() == &myLane->getEdge()) {
6811 } else if (lane == myLaneChangeModel->getShadowLane()) {
6812 if (myLaneChangeModel->isOpposite() && &lane->getEdge() != &myLane->getEdge()) {
6813 return lane->getRightSideOnEdge() + lane->getWidth() - myState.myPosLat + 0.5 * myLane->getWidth();
6814 }
6816 return lane->getRightSideOnEdge() + lane->getWidth() + myState.myPosLat + 0.5 * myLane->getWidth();
6817 } else {
6818 return lane->getRightSideOnEdge() - myLane->getWidth() + myState.myPosLat + 0.5 * myLane->getWidth();
6819 }
6820 } else if (lane == myLane->getBidiLane()) {
6821 return lane->getRightSideOnEdge() - myState.myPosLat + 0.5 * lane->getWidth();
6822 } else {
6823 assert(myFurtherLanes.size() == myFurtherLanesPosLat.size());
6824 for (int i = 0; i < (int)myFurtherLanes.size(); ++i) {
6825 if (myFurtherLanes[i] == lane) {
6826#ifdef DEBUG_FURTHER
6827 if (DEBUG_COND) std::cout << " getCenterOnEdge veh=" << getID() << " lane=" << lane->getID() << " i=" << i << " furtherLat=" << myFurtherLanesPosLat[i]
6828 << " result=" << lane->getRightSideOnEdge() + myFurtherLanesPosLat[i] + 0.5 * lane->getWidth()
6829 << "\n";
6830#endif
6831 return lane->getRightSideOnEdge() + myFurtherLanesPosLat[i] + 0.5 * lane->getWidth();
6832 } else if (myFurtherLanes[i]->getBidiLane() == lane) {
6833#ifdef DEBUG_FURTHER
6834 if (DEBUG_COND) std::cout << " getCenterOnEdge veh=" << getID() << " lane=" << lane->getID() << " i=" << i << " furtherLat(bidi)=" << myFurtherLanesPosLat[i]
6835 << " result=" << lane->getRightSideOnEdge() + myFurtherLanesPosLat[i] + 0.5 * lane->getWidth()
6836 << "\n";
6837#endif
6838 return lane->getRightSideOnEdge() - myFurtherLanesPosLat[i] + 0.5 * lane->getWidth();
6839 }
6840 }
6841 //if (DEBUG_COND) std::cout << SIMTIME << " veh=" << getID() << " myShadowFurtherLanes=" << toString(myLaneChangeModel->getShadowFurtherLanes()) << "\n";
6842 const std::vector<MSLane*>& shadowFurther = myLaneChangeModel->getShadowFurtherLanes();
6843 for (int i = 0; i < (int)shadowFurther.size(); ++i) {
6844 //if (DEBUG_COND) std::cout << " comparing i=" << (*i)->getID() << " lane=" << lane->getID() << "\n";
6845 if (shadowFurther[i] == lane) {
6846 assert(myLaneChangeModel->getShadowLane() != 0);
6847 return (lane->getRightSideOnEdge() + myLaneChangeModel->getShadowFurtherLanesPosLat()[i] + 0.5 * lane->getWidth()
6849 }
6850 }
6851 assert(false);
6852 throw ProcessError("Request lateral pos of vehicle '" + getID() + "' for invalid lane '" + Named::getIDSecure(lane) + "'");
6853 }
6854}
6855
6856
6857double
6859 assert(lane != 0);
6860 if (&lane->getEdge() == &myLane->getEdge()) {
6861 return myLane->getRightSideOnEdge() - lane->getRightSideOnEdge();
6862 } else if (myLane->getParallelOpposite() == lane) {
6863 return (myLane->getWidth() + lane->getWidth()) * 0.5 - 2 * getLateralPositionOnLane();
6864 } else if (myLane->getBidiLane() == lane) {
6865 return -2 * getLateralPositionOnLane();
6866 } else {
6867 // Check whether the lane is a further lane for the vehicle
6868 for (int i = 0; i < (int)myFurtherLanes.size(); ++i) {
6869 if (myFurtherLanes[i] == lane) {
6870#ifdef DEBUG_FURTHER
6871 if (DEBUG_COND) {
6872 std::cout << " getLatOffset veh=" << getID() << " lane=" << lane->getID() << " i=" << i << " posLat=" << myState.myPosLat << " furtherLat=" << myFurtherLanesPosLat[i] << "\n";
6873 }
6874#endif
6876 } else if (myFurtherLanes[i]->getBidiLane() == lane) {
6877#ifdef DEBUG_FURTHER
6878 if (DEBUG_COND) {
6879 std::cout << " getLatOffset veh=" << getID() << " lane=" << lane->getID() << " i=" << i << " posLat=" << myState.myPosLat << " furtherBidiLat=" << myFurtherLanesPosLat[i] << "\n";
6880 }
6881#endif
6882 return -2 * (myFurtherLanesPosLat[i] - myState.myPosLat);
6883 }
6884 }
6885#ifdef DEBUG_FURTHER
6886 if (DEBUG_COND) {
6887 std::cout << SIMTIME << " veh=" << getID() << " myShadowFurtherLanes=" << toString(myLaneChangeModel->getShadowFurtherLanes()) << "\n";
6888 }
6889#endif
6890 // Check whether the lane is a "shadow further lane" for the vehicle
6891 const std::vector<MSLane*>& shadowFurther = myLaneChangeModel->getShadowFurtherLanes();
6892 for (int i = 0; i < (int)shadowFurther.size(); ++i) {
6893 if (shadowFurther[i] == lane) {
6894#ifdef DEBUG_FURTHER
6895 if (DEBUG_COND) std::cout << " getLatOffset veh=" << getID()
6896 << " shadowLane=" << Named::getIDSecure(myLaneChangeModel->getShadowLane())
6897 << " lane=" << lane->getID()
6898 << " i=" << i
6899 << " posLat=" << myState.myPosLat
6900 << " shadowPosLat=" << getLatOffset(myLaneChangeModel->getShadowLane())
6901 << " shadowFurtherLat=" << myLaneChangeModel->getShadowFurtherLanesPosLat()[i]
6902 << "\n";
6903#endif
6905 }
6906 }
6907 // Check whether the vehicle issued a maneuverReservation on the lane.
6908 const std::vector<MSLane*>& furtherTargets = myLaneChangeModel->getFurtherTargetLanes();
6909 for (int i = 0; i < (int)myFurtherLanes.size(); ++i) {
6910 // Further target lanes are just neighboring lanes of the vehicle's further lanes, @see MSAbstractLaneChangeModel::updateTargetLane()
6911 MSLane* targetLane = furtherTargets[i];
6912 if (targetLane == lane) {
6913 const double targetDir = myLaneChangeModel->getManeuverDist() < 0 ? -1. : 1.;
6914 const double latOffset = myFurtherLanesPosLat[i] - myState.myPosLat + targetDir * 0.5 * (myFurtherLanes[i]->getWidth() + targetLane->getWidth());
6915#ifdef DEBUG_TARGET_LANE
6916 if (DEBUG_COND) {
6917 std::cout << " getLatOffset veh=" << getID()
6918 << " wrt targetLane=" << Named::getIDSecure(myLaneChangeModel->getTargetLane())
6919 << "\n i=" << i
6920 << " posLat=" << myState.myPosLat
6921 << " furtherPosLat=" << myFurtherLanesPosLat[i]
6922 << " maneuverDist=" << myLaneChangeModel->getManeuverDist()
6923 << " targetDir=" << targetDir
6924 << " latOffset=" << latOffset
6925 << std::endl;
6926 }
6927#endif
6928 return latOffset;
6929 }
6930 }
6931 assert(false);
6932 throw ProcessError("Request lateral offset of vehicle '" + getID() + "' for invalid lane '" + Named::getIDSecure(lane) + "'");
6933 }
6934}
6935
6936
6937double
6938MSVehicle::lateralDistanceToLane(const int offset) const {
6939 // compute the distance when changing to the neighboring lane
6940 // (ensure we do not lap into the line behind neighLane since there might be unseen blockers)
6941 assert(offset == 0 || offset == 1 || offset == -1);
6942 assert(myLane != nullptr);
6943 assert(myLane->getParallelLane(offset) != nullptr || myLane->getParallelOpposite() != nullptr);
6944 const double halfCurrentLaneWidth = 0.5 * myLane->getWidth();
6945 const double halfVehWidth = 0.5 * (getWidth() + NUMERICAL_EPS);
6946 const double latPos = getLateralPositionOnLane();
6947 const double oppositeSign = getLaneChangeModel().isOpposite() ? -1 : 1;
6948 double leftLimit = halfCurrentLaneWidth - halfVehWidth - oppositeSign * latPos;
6949 double rightLimit = -halfCurrentLaneWidth + halfVehWidth - oppositeSign * latPos;
6950 double latLaneDist = 0; // minimum distance to move the vehicle fully onto the new lane
6951 if (offset == 0) {
6952 if (latPos + halfVehWidth > halfCurrentLaneWidth) {
6953 // correct overlapping left
6954 latLaneDist = halfCurrentLaneWidth - latPos - halfVehWidth;
6955 } else if (latPos - halfVehWidth < -halfCurrentLaneWidth) {
6956 // correct overlapping right
6957 latLaneDist = -halfCurrentLaneWidth - latPos + halfVehWidth;
6958 }
6959 latLaneDist *= oppositeSign;
6960 } else if (offset == -1) {
6961 latLaneDist = rightLimit - (getWidth() + NUMERICAL_EPS);
6962 } else if (offset == 1) {
6963 latLaneDist = leftLimit + (getWidth() + NUMERICAL_EPS);
6964 }
6965#ifdef DEBUG_ACTIONSTEPS
6966 if (DEBUG_COND) {
6967 std::cout << SIMTIME
6968 << " veh=" << getID()
6969 << " halfCurrentLaneWidth=" << halfCurrentLaneWidth
6970 << " halfVehWidth=" << halfVehWidth
6971 << " latPos=" << latPos
6972 << " latLaneDist=" << latLaneDist
6973 << " leftLimit=" << leftLimit
6974 << " rightLimit=" << rightLimit
6975 << "\n";
6976 }
6977#endif
6978 return latLaneDist;
6979}
6980
6981
6982double
6983MSVehicle::getLateralOverlap(double posLat, const MSLane* lane) const {
6984 return (fabs(posLat) + 0.5 * getVehicleType().getWidth()
6985 - 0.5 * lane->getWidth());
6986}
6987
6988double
6992
6993double
6997
6998
6999void
7001 for (const DriveProcessItem& dpi : lfLinks) {
7002 if (dpi.myLink != nullptr) {
7003 dpi.myLink->removeApproaching(this);
7004 }
7005 }
7006 // unregister on all shadow links
7008}
7009
7010
7011bool
7012MSVehicle::unsafeLinkAhead(const MSLane* lane, double zipperDist) const {
7013 // the following links are unsafe:
7014 // - zipper links if they are close enough and have approaching vehicles in the relevant time range
7015 // - unprioritized links if the vehicle is currently approaching a prioritzed link and unable to stop in time
7016 double seen = myLane->getLength() - getPositionOnLane();
7017 const double dist = MAX2(zipperDist, getCarFollowModel().brakeGap(getSpeed(), getCarFollowModel().getMaxDecel(), 0));
7018 if (seen < dist) {
7019 const std::vector<MSLane*>& bestLaneConts = getBestLanesContinuation(lane);
7020 int view = 1;
7021 std::vector<MSLink*>::const_iterator link = MSLane::succLinkSec(*this, view, *lane, bestLaneConts);
7022 DriveItemVector::const_iterator di = myLFLinkLanes.begin();
7023 while (!lane->isLinkEnd(link) && seen <= dist) {
7024 if ((!lane->isInternal()
7025 && (((*link)->getState() == LINKSTATE_ZIPPER && seen < (*link)->getFoeVisibilityDistance())
7026 || !(*link)->havePriority()))
7027 || (lane->isInternal() && zipperDist > 0)) {
7028 // find the drive item corresponding to this link
7029 bool found = false;
7030 while (di != myLFLinkLanes.end() && !found) {
7031 if ((*di).myLink != nullptr) {
7032 const MSLane* diPredLane = (*di).myLink->getLaneBefore();
7033 if (diPredLane != nullptr) {
7034 if (&diPredLane->getEdge() == &lane->getEdge()) {
7035 found = true;
7036 }
7037 }
7038 }
7039 if (!found) {
7040 di++;
7041 }
7042 }
7043 if (found) {
7044 const SUMOTime leaveTime = (*link)->getLeaveTime((*di).myArrivalTime, (*di).myArrivalSpeed,
7045 (*di).getLeaveSpeed(), getVehicleType().getLength());
7046 const MSLink* entry = (*link)->getCorrespondingEntryLink();
7047 //if (DEBUG_COND) {
7048 // std::cout << SIMTIME << " veh=" << getID() << " changeTo=" << Named::getIDSecure(bestLaneConts.front()) << " linkState=" << toString((*link)->getState()) << " seen=" << seen << " dist=" << dist << " zipperDist=" << zipperDist << " aT=" << STEPS2TIME((*di).myArrivalTime) << " lT=" << STEPS2TIME(leaveTime) << "\n";
7049 //}
7050 if (entry->hasApproachingFoe((*di).myArrivalTime, leaveTime, (*di).myArrivalSpeed, getCarFollowModel().getMaxDecel())) {
7051 //std::cout << SIMTIME << " veh=" << getID() << " aborting changeTo=" << Named::getIDSecure(bestLaneConts.front()) << " linkState=" << toString((*link)->getState()) << " seen=" << seen << " dist=" << dist << "\n";
7052 return true;
7053 }
7054 }
7055 // no drive item is found if the vehicle aborts its request within dist
7056 }
7057 lane = (*link)->getViaLaneOrLane();
7058 if (!lane->getEdge().isInternal()) {
7059 view++;
7060 }
7061 seen += lane->getLength();
7062 link = MSLane::succLinkSec(*this, view, *lane, bestLaneConts);
7063 }
7064 }
7065 return false;
7066}
7067
7068
7070MSVehicle::getBoundingBox(double offset) const {
7071 PositionVector centerLine;
7072 Position pos = getPosition();
7073 centerLine.push_back(pos);
7074 switch (myType->getGuiShape()) {
7081 for (MSLane* lane : myFurtherLanes) {
7082 centerLine.push_back(lane->getShape().back());
7083 }
7084 break;
7085 }
7086 default:
7087 break;
7088 }
7089 double l = getLength();
7090 Position backPos = getBackPosition();
7091 if (pos.distanceTo2D(backPos) > l + NUMERICAL_EPS) {
7092 // getBackPosition may not match the visual back in networks without internal lanes
7093 double a = getAngle() + M_PI; // angle pointing backwards
7094 backPos = pos + Position(l * cos(a), l * sin(a));
7095 }
7096 centerLine.push_back(backPos);
7097 if (offset != 0) {
7098 centerLine.extrapolate2D(offset);
7099 }
7100 PositionVector result = centerLine;
7101 result.move2side(MAX2(0.0, 0.5 * myType->getWidth() + offset));
7102 centerLine.move2side(MIN2(0.0, -0.5 * myType->getWidth() - offset));
7103 result.append(centerLine.reverse(), POSITION_EPS);
7104 return result;
7105}
7106
7107
7109MSVehicle::getBoundingPoly(double offset) const {
7110 switch (myType->getGuiShape()) {
7116 // box with corners cut off
7117 PositionVector result;
7118 PositionVector centerLine;
7119 centerLine.push_back(getPosition());
7120 centerLine.push_back(getBackPosition());
7121 if (offset != 0) {
7122 centerLine.extrapolate2D(offset);
7123 }
7124 PositionVector line1 = centerLine;
7125 PositionVector line2 = centerLine;
7126 line1.move2side(MAX2(0.0, 0.3 * myType->getWidth() + offset));
7127 line2.move2side(MAX2(0.0, 0.5 * myType->getWidth() + offset));
7128 line2.scaleRelative(0.8);
7129 result.push_back(line1[0]);
7130 result.push_back(line2[0]);
7131 result.push_back(line2[1]);
7132 result.push_back(line1[1]);
7133 line1.move2side(MIN2(0.0, -0.6 * myType->getWidth() - offset));
7134 line2.move2side(MIN2(0.0, -1.0 * myType->getWidth() - offset));
7135 result.push_back(line1[1]);
7136 result.push_back(line2[1]);
7137 result.push_back(line2[0]);
7138 result.push_back(line1[0]);
7139 return result;
7140 }
7141 default:
7142 return getBoundingBox();
7143 }
7144}
7145
7146
7147bool
7149 for (std::vector<MSLane*>::const_iterator i = myFurtherLanes.begin(); i != myFurtherLanes.end(); ++i) {
7150 if (&(*i)->getEdge() == edge) {
7151 return true;
7152 }
7153 }
7154 return false;
7155}
7156
7157
7158bool
7159MSVehicle::isBidiOn(const MSLane* lane) const {
7160 return lane->getBidiLane() != nullptr && (
7161 myLane == lane->getBidiLane()
7162 || onFurtherEdge(&lane->getBidiLane()->getEdge()));
7163}
7164
7165
7166bool
7167MSVehicle::rerouteParkingArea(const std::string& parkingAreaID, std::string& errorMsg) {
7168 // this function is based on MSTriggeredRerouter::rerouteParkingArea in order to keep
7169 // consistency in the behaviour.
7170
7171 // get vehicle params
7172 MSParkingArea* destParkArea = getNextParkingArea();
7173 const MSRoute& route = getRoute();
7174 const MSEdge* lastEdge = route.getLastEdge();
7175
7176 if (destParkArea == nullptr) {
7177 // not driving towards a parking area
7178 errorMsg = "Vehicle " + getID() + " is not driving to a parking area so it cannot be rerouted.";
7179 return false;
7180 }
7181
7182 // if the current route ends at the parking area, the new route will also and at the new area
7183 bool newDestination = (&destParkArea->getLane().getEdge() == route.getLastEdge()
7184 && getArrivalPos() >= destParkArea->getBeginLanePosition()
7185 && getArrivalPos() <= destParkArea->getEndLanePosition());
7186
7187 // retrieve info on the new parking area
7189 parkingAreaID, SumoXMLTag::SUMO_TAG_PARKING_AREA);
7190
7191 if (newParkingArea == nullptr) {
7192 errorMsg = "Parking area ID " + toString(parkingAreaID) + " not found in the network.";
7193 return false;
7194 }
7195
7196 const MSEdge* newEdge = &(newParkingArea->getLane().getEdge());
7198
7199 // Compute the route from the current edge to the parking area edge
7200 ConstMSEdgeVector edgesToPark;
7201 router.compute(getEdge(), newEdge, this, MSNet::getInstance()->getCurrentTimeStep(), edgesToPark);
7202
7203 // Compute the route from the parking area edge to the end of the route
7204 ConstMSEdgeVector edgesFromPark;
7205 if (!newDestination) {
7206 router.compute(newEdge, lastEdge, this, MSNet::getInstance()->getCurrentTimeStep(), edgesFromPark);
7207 } else {
7208 // adapt plans of any riders
7209 for (MSTransportable* p : getPersons()) {
7210 p->rerouteParkingArea(getNextParkingArea(), newParkingArea);
7211 }
7212 }
7213
7214 // we have a new destination, let's replace the vehicle route
7215 ConstMSEdgeVector edges = edgesToPark;
7216 if (edgesFromPark.size() > 0) {
7217 edges.insert(edges.end(), edgesFromPark.begin() + 1, edgesFromPark.end());
7218 }
7219
7220 if (newDestination) {
7221 SUMOVehicleParameter* newParameter = new SUMOVehicleParameter();
7222 *newParameter = getParameter();
7224 newParameter->arrivalPos = newParkingArea->getEndLanePosition();
7225 replaceParameter(newParameter);
7226 }
7227 const double routeCost = router.recomputeCosts(edges, this, MSNet::getInstance()->getCurrentTimeStep());
7228 ConstMSEdgeVector prevEdges(myCurrEdge, myRoute->end());
7229 const double savings = router.recomputeCosts(prevEdges, this, MSNet::getInstance()->getCurrentTimeStep());
7230 if (replaceParkingArea(newParkingArea, errorMsg)) {
7231 const bool onInit = myLane == nullptr;
7232 replaceRouteEdges(edges, routeCost, savings, "TraCI:" + toString(SUMO_TAG_PARKING_AREA_REROUTE), onInit, false, false);
7233 } else {
7234 WRITE_WARNING("Vehicle '" + getID() + "' could not reroute to new parkingArea '" + newParkingArea->getID()
7235 + "' reason=" + errorMsg + ", time=" + time2string(MSNet::getInstance()->getCurrentTimeStep()) + ".");
7236 return false;
7237 }
7238 return true;
7239}
7240
7241
7242bool
7244 const int numStops = (int)myStops.size();
7245 const bool result = MSBaseVehicle::addTraciStop(stop, errorMsg);
7246 if (myLane != nullptr && numStops != (int)myStops.size()) {
7247 updateBestLanes(true);
7248 }
7249 return result;
7250}
7251
7252
7253bool
7254MSVehicle::handleCollisionStop(MSStop& stop, const double distToStop) {
7255 if (myCurrEdge == stop.edge && distToStop + POSITION_EPS < getCarFollowModel().brakeGap(myState.mySpeed, getCarFollowModel().getMaxDecel(), 0)) {
7256 if (distToStop < getCarFollowModel().brakeGap(myState.mySpeed, getCarFollowModel().getEmergencyDecel(), 0)) {
7257 double vNew = getCarFollowModel().maximumSafeStopSpeed(distToStop, getCarFollowModel().getMaxDecel(), getSpeed(), false, 0);
7258 //std::cout << SIMTIME << " veh=" << getID() << " v=" << myState.mySpeed << " distToStop=" << distToStop
7259 // << " vMinNex=" << getCarFollowModel().minNextSpeed(getSpeed(), this)
7260 // << " bg1=" << getCarFollowModel().brakeGap(myState.mySpeed)
7261 // << " bg2=" << getCarFollowModel().brakeGap(myState.mySpeed, getCarFollowModel().getEmergencyDecel(), 0)
7262 // << " vNew=" << vNew
7263 // << "\n";
7264 myState.mySpeed = MIN2(myState.mySpeed, vNew + ACCEL2SPEED(getCarFollowModel().getEmergencyDecel()));
7267 if (myState.myPos < myType->getLength()) {
7271 myAngle += M_PI;
7272 }
7273 }
7274 }
7275 }
7276 return true;
7277}
7278
7279
7280bool
7282 if (isStopped()) {
7286 }
7287 MSStop& stop = myStops.front();
7288 // we have waited long enough and fulfilled any passenger-requirements
7289 if (stop.busstop != nullptr) {
7290 // inform bus stop about leaving it
7291 stop.busstop->leaveFrom(this);
7292 }
7293 // we have waited long enough and fulfilled any container-requirements
7294 if (stop.containerstop != nullptr) {
7295 // inform container stop about leaving it
7296 stop.containerstop->leaveFrom(this);
7297 }
7298 if (stop.parkingarea != nullptr && stop.getSpeed() <= 0) {
7299 // inform parking area about leaving it
7300 stop.parkingarea->leaveFrom(this);
7301 }
7302 if (stop.chargingStation != nullptr) {
7303 // inform charging station about leaving it
7304 stop.chargingStation->leaveFrom(this);
7305 }
7306 // the current stop is no longer valid
7307 myLane->getEdge().removeWaiting(this);
7308 // MSStopOut needs to know whether the stop had a loaded 'ended' value so we call this before replacing the value
7309 if (stop.pars.started == -1) {
7310 // waypoint edge was passed in a single step
7312 }
7313 if (MSStopOut::active()) {
7314 MSStopOut::getInstance()->stopEnded(this, stop.pars, stop.lane->getID());
7315 }
7317 for (const auto& rem : myMoveReminders) {
7318 rem.first->notifyStopEnded();
7319 }
7321 myCollisionImmunity = TIME2STEPS(5); // leave the conflict area
7322 }
7324 // reset lateral position to default
7325 myState.myPosLat = 0;
7326 }
7327 myPastStops.push_back(stop.pars);
7328 myPastStops.back().routeIndex = (int)(stop.edge - myRoute->begin());
7329 myStops.pop_front();
7330 myStopDist = std::numeric_limits<double>::max();
7331 // do not count the stopping time towards gridlock time.
7332 // Other outputs use an independent counter and are not affected.
7333 myWaitingTime = 0;
7334 // maybe the next stop is on the same edge; let's rebuild best lanes
7335 updateBestLanes(true);
7336 // continue as wished...
7339 return true;
7340 }
7341 return false;
7342}
7343
7344
7347 if (myInfluencer == nullptr) {
7348 myInfluencer = new Influencer();
7349 }
7350 return *myInfluencer;
7351}
7352
7357
7358
7361 return myInfluencer;
7362}
7363
7366 return myInfluencer;
7367}
7368
7369
7370double
7372 if (myInfluencer != nullptr && myInfluencer->getOriginalSpeed() >= 0) {
7373 // influencer original speed is -1 on initialization
7375 }
7376 return myState.mySpeed;
7377}
7378
7379
7380int
7382 if (hasInfluencer()) {
7384 MSNet::getInstance()->getCurrentTimeStep(),
7385 myLane->getEdge(),
7386 getLaneIndex(),
7387 state);
7388 }
7389 return state;
7390}
7391
7392
7393void
7397
7398
7399bool
7403
7404
7405bool
7409
7410
7411bool
7412MSVehicle::keepClear(const MSLink* link) const {
7413 if (link->hasFoes() && link->keepClear() /* && item.myLink->willHaveBlockedFoe()*/) {
7414 const double keepClearTime = getVehicleType().getParameter().getJMParam(SUMO_ATTR_JM_IGNORE_KEEPCLEAR_TIME, -1);
7415 //std::cout << SIMTIME << " veh=" << getID() << " keepClearTime=" << keepClearTime << " accWait=" << getAccumulatedWaitingSeconds() << " keepClear=" << (keepClearTime < 0 || getAccumulatedWaitingSeconds() < keepClearTime) << "\n";
7416 return keepClearTime < 0 || getAccumulatedWaitingSeconds() < keepClearTime;
7417 } else {
7418 return false;
7419 }
7420}
7421
7422
7423bool
7424MSVehicle::ignoreRed(const MSLink* link, bool canBrake) const {
7425 if ((myInfluencer != nullptr && !myInfluencer->getEmergencyBrakeRedLight())) {
7426 return true;
7427 }
7428 const double ignoreRedTime = getVehicleType().getParameter().getJMParam(SUMO_ATTR_JM_DRIVE_AFTER_RED_TIME, -1);
7429#ifdef DEBUG_IGNORE_RED
7430 if (DEBUG_COND) {
7431 std::cout << SIMTIME << " veh=" << getID() << " link=" << link->getViaLaneOrLane()->getID() << " state=" << toString(link->getState()) << "\n";
7432 }
7433#endif
7434 if (ignoreRedTime < 0) {
7435 const double ignoreYellowTime = getVehicleType().getParameter().getJMParam(SUMO_ATTR_JM_DRIVE_AFTER_YELLOW_TIME, 0);
7436 if (ignoreYellowTime > 0 && link->haveYellow()) {
7437 assert(link->getTLLogic() != 0);
7438 const double yellowDuration = STEPS2TIME(MSNet::getInstance()->getCurrentTimeStep() - link->getLastStateChange());
7439 // when activating ignoreYellow behavior, vehicles will drive if they cannot brake
7440 return !canBrake || ignoreYellowTime > yellowDuration;
7441 } else {
7442 return false;
7443 }
7444 } else if (link->haveYellow()) {
7445 // always drive at yellow when ignoring red
7446 return true;
7447 } else if (link->haveRed()) {
7448 assert(link->getTLLogic() != 0);
7449 const double redDuration = STEPS2TIME(MSNet::getInstance()->getCurrentTimeStep() - link->getLastStateChange());
7450#ifdef DEBUG_IGNORE_RED
7451 if (DEBUG_COND) {
7452 std::cout
7453 // << SIMTIME << " veh=" << getID() << " link=" << link->getViaLaneOrLane()->getID()
7454 << " ignoreRedTime=" << ignoreRedTime
7455 << " spentRed=" << redDuration
7456 << " canBrake=" << canBrake << "\n";
7457 }
7458#endif
7459 // when activating ignoreRed behavior, vehicles will always drive if they cannot brake
7460 return !canBrake || ignoreRedTime > redDuration;
7461 } else {
7462 return false;
7463 }
7464}
7465
7466bool
7469 return false;
7470 }
7471 for (const std::string& typeID : StringTokenizer(getParameter().getParameter(toString(SUMO_ATTR_CF_IGNORE_TYPES), "")).getVector()) {
7472 if (typeID == foe->getVehicleType().getID()) {
7473 return true;
7474 }
7475 }
7476 for (const std::string& id : StringTokenizer(getParameter().getParameter(toString(SUMO_ATTR_CF_IGNORE_IDS), "")).getVector()) {
7477 if (id == foe->getID()) {
7478 return true;
7479 }
7480 }
7481 return false;
7482}
7483
7484bool
7486 // either on an internal lane that was entered via minor link
7487 // or on approach to minor link below visibility distance
7488 if (myLane == nullptr) {
7489 return false;
7490 }
7491 if (myLane->getEdge().isInternal()) {
7492 return !myLane->getIncomingLanes().front().viaLink->havePriority();
7493 } else if (myLFLinkLanes.size() > 0 && myLFLinkLanes.front().myLink != nullptr) {
7494 MSLink* link = myLFLinkLanes.front().myLink;
7495 return !link->havePriority() && myLFLinkLanes.front().myDistance <= link->getFoeVisibilityDistance();
7496 }
7497 return false;
7498}
7499
7500bool
7501MSVehicle::isLeader(const MSLink* link, const MSVehicle* veh, const double gap) const {
7502 assert(link->fromInternalLane());
7503 if (veh == nullptr) {
7504 return false;
7505 }
7506 if (!myLane->isInternal() || myLane->getEdge().getToJunction() != link->getJunction()) {
7507 // if this vehicle is not yet on the junction, every vehicle is a leader
7508 return true;
7509 }
7510 if (veh->getLaneChangeModel().hasBlueLight()) {
7511 // blue light device automatically gets right of way
7512 return true;
7513 }
7514 const MSLane* foeLane = veh->getLane();
7515 if (foeLane->isInternal()) {
7516 if (foeLane->getEdge().getFromJunction() == link->getJunction()) {
7518 SUMOTime foeET = veh->myJunctionEntryTime;
7519 // check relationship between link and foeLane
7521 // we are entering the junction from the same lane
7523 foeET = veh->myJunctionEntryTimeNeverYield;
7526 }
7527 } else {
7528 const MSLink* foeLink = foeLane->getIncomingLanes()[0].viaLink;
7529 const MSJunctionLogic* logic = link->getJunction()->getLogic();
7530 assert(logic != nullptr);
7531 // determine who has right of way
7532 bool response; // ego response to foe
7533 bool response2; // foe response to ego
7534 // attempt 1: tlLinkState
7535 const MSLink* entry = link->getCorrespondingEntryLink();
7536 const MSLink* foeEntry = foeLink->getCorrespondingEntryLink();
7537 if (entry->haveRed() || foeEntry->haveRed()) {
7538 // ensure that vehicles which are stuck on the intersection may exit
7539 if (!foeEntry->haveRed() && veh->getSpeed() > SUMO_const_haltingSpeed && gap < 0) {
7540 // foe might be oncoming, don't drive unless foe can still brake safely
7541 const double foeNextSpeed = veh->getSpeed() + ACCEL2SPEED(veh->getCarFollowModel().getMaxAccel());
7542 const double foeBrakeGap = veh->getCarFollowModel().brakeGap(
7543 foeNextSpeed, veh->getCarFollowModel().getMaxDecel(), veh->getCarFollowModel().getHeadwayTime());
7544 // the minGap was subtracted from gap in MSLink::getLeaderInfo (enlarging the negative gap)
7545 // so the -2* makes it point in the right direction
7546 const double foeGap = -gap - veh->getLength() - 2 * getVehicleType().getMinGap();
7547#ifdef DEBUG_PLAN_MOVE_LEADERINFO
7548 if (DEBUG_COND) {
7549 std::cout << " foeGap=" << foeGap << " foeBGap=" << foeBrakeGap << "\n";
7550
7551 }
7552#endif
7553 if (foeGap < foeBrakeGap) {
7554 response = true;
7555 response2 = false;
7556 } else {
7557 response = false;
7558 response2 = true;
7559 }
7560 } else {
7561 // brake for stuck foe
7562 response = foeEntry->haveRed();
7563 response2 = entry->haveRed();
7564 }
7565 } else if (entry->havePriority() != foeEntry->havePriority()) {
7566 response = !entry->havePriority();
7567 response2 = !foeEntry->havePriority();
7568 } else if (entry->haveYellow() && foeEntry->haveYellow()) {
7569 // let the faster vehicle keep moving
7570 response = veh->getSpeed() >= getSpeed();
7571 response2 = getSpeed() >= veh->getSpeed();
7572 } else {
7573 // fallback if pedestrian crossings are involved
7574 response = logic->getResponseFor(link->getIndex()).test(foeLink->getIndex());
7575 response2 = logic->getResponseFor(foeLink->getIndex()).test(link->getIndex());
7576 }
7577#ifdef DEBUG_PLAN_MOVE_LEADERINFO
7578 if (DEBUG_COND) {
7579 std::cout << SIMTIME
7580 << " foeLane=" << foeLane->getID()
7581 << " foeLink=" << foeLink->getViaLaneOrLane()->getID()
7582 << " linkIndex=" << link->getIndex()
7583 << " foeLinkIndex=" << foeLink->getIndex()
7584 << " entryState=" << toString(entry->getState())
7585 << " entryState2=" << toString(foeEntry->getState())
7586 << " response=" << response
7587 << " response2=" << response2
7588 << "\n";
7589 }
7590#endif
7591 if (!response) {
7592 // if we have right of way over the foe, entryTime does not matter
7593 foeET = veh->myJunctionConflictEntryTime;
7594 egoET = myJunctionEntryTime;
7595 } else if (response && response2) {
7596 // in a mutual conflict scenario, use entry time to avoid deadlock
7597 foeET = veh->myJunctionConflictEntryTime;
7599 }
7600 }
7601 if (egoET == foeET) {
7602 // try to use speed as tie braker
7603 if (getSpeed() == veh->getSpeed()) {
7604 // use ID as tie braker
7605#ifdef DEBUG_PLAN_MOVE_LEADERINFO
7606 if (DEBUG_COND) {
7607 std::cout << SIMTIME << " veh=" << getID() << " equal ET " << egoET << " with foe " << veh->getID()
7608 << " foeIsLeaderByID=" << (getID() < veh->getID()) << "\n";
7609 }
7610#endif
7611 return getID() < veh->getID();
7612 } else {
7613#ifdef DEBUG_PLAN_MOVE_LEADERINFO
7614 if (DEBUG_COND) {
7615 std::cout << SIMTIME << " veh=" << getID() << " equal ET " << egoET << " with foe " << veh->getID()
7616 << " foeIsLeaderBySpeed=" << (getSpeed() < veh->getSpeed())
7617 << " v=" << getSpeed() << " foeV=" << veh->getSpeed()
7618 << "\n";
7619 }
7620#endif
7621 return getSpeed() < veh->getSpeed();
7622 }
7623 } else {
7624 // leader was on the junction first
7625#ifdef DEBUG_PLAN_MOVE_LEADERINFO
7626 if (DEBUG_COND) {
7627 std::cout << SIMTIME << " veh=" << getID() << " egoET " << egoET << " with foe " << veh->getID()
7628 << " foeET=" << foeET << " isLeader=" << (egoET > foeET) << "\n";
7629 }
7630#endif
7631 return egoET > foeET;
7632 }
7633 } else {
7634 // vehicle can only be partially on the junction. Must be a leader
7635 return true;
7636 }
7637 } else {
7638 // vehicle can only be partially on the junction. Must be a leader
7639 return true;
7640 }
7641}
7642
7643void
7646 // here starts the vehicle internal part (see loading)
7647 std::vector<std::string> internals;
7648 internals.push_back(toString(myParameter->parametersSet));
7649 internals.push_back(toString(myDeparture));
7650 internals.push_back(toString(distance(myRoute->begin(), myCurrEdge)));
7651 internals.push_back(toString(myDepartPos));
7652 internals.push_back(toString(myWaitingTime));
7653 internals.push_back(toString(myTimeLoss));
7654 internals.push_back(toString(myLastActionTime));
7655 internals.push_back(toString(isStopped()));
7656 internals.push_back(toString(myPastStops.size()));
7657 out.writeAttr(SUMO_ATTR_STATE, internals);
7659 out.writeAttr(SUMO_ATTR_SPEED, std::vector<double> { myState.mySpeed, myState.myPreviousSpeed });
7664 // save past stops
7666 stop.write(out, false);
7667 // do not write started and ended twice
7668 if ((stop.parametersSet & STOP_STARTED_SET) == 0) {
7669 out.writeAttr(SUMO_ATTR_STARTED, time2string(stop.started));
7670 }
7671 if ((stop.parametersSet & STOP_ENDED_SET) == 0) {
7672 out.writeAttr(SUMO_ATTR_ENDED, time2string(stop.ended));
7673 }
7674 stop.writeParams(out);
7675 out.closeTag();
7676 }
7677 // save upcoming stops
7678 for (MSStop& stop : myStops) {
7679 stop.write(out);
7680 }
7681 // save parameters and device states
7683 for (MSVehicleDevice* const dev : myDevices) {
7684 dev->saveState(out);
7685 }
7686 out.closeTag();
7687}
7688
7689void
7691 if (!attrs.hasAttribute(SUMO_ATTR_POSITION)) {
7692 throw ProcessError(TL("Error: Invalid vehicles in state (may be a meso state)!"));
7693 }
7694 int routeOffset;
7695 bool stopped;
7696 int pastStops;
7697
7698 std::istringstream bis(attrs.getString(SUMO_ATTR_STATE));
7699 bis >> myParameter->parametersSet;
7700 bis >> myDeparture;
7701 bis >> routeOffset;
7702 bis >> myDepartPos;
7703 bis >> myWaitingTime;
7704 bis >> myTimeLoss;
7705 bis >> myLastActionTime;
7706 bis >> stopped;
7707 bis >> pastStops;
7708
7710 bool ok;
7711 myArrivalPos = attrs.get<double>(SUMO_ATTR_ARRIVALPOS_RANDOMIZED, getID().c_str(), ok);
7712 }
7713 // load stops
7714 myStops.clear();
7716
7717 if (hasDeparted()) {
7718 myCurrEdge = myRoute->begin() + routeOffset;
7719 myDeparture -= offset;
7720 // fix stops
7721 while (pastStops > 0) {
7722 myPastStops.push_back(myStops.front().pars);
7723 myPastStops.back().routeIndex = (int)(myStops.front().edge - myRoute->begin());
7724 myStops.pop_front();
7725 pastStops--;
7726 }
7727 // see MSBaseVehicle constructor
7730 }
7731 // a (tentative lane is needed for calling hasArrivedInternal
7732 myLane = (*myCurrEdge)->getLanes()[0];
7733 }
7736 WRITE_WARNINGF(TL("Action steps are out of sync for loaded vehicle '%'."), getID());
7737 }
7738 std::istringstream pis(attrs.getString(SUMO_ATTR_POSITION));
7740 std::istringstream sis(attrs.getString(SUMO_ATTR_SPEED));
7745 std::istringstream dis(attrs.getString(SUMO_ATTR_DISTANCE));
7746 dis >> myOdometer >> myNumberReroutes;
7748 if (stopped) {
7749 myStops.front().startedFromState = true;
7750 myStopDist = 0;
7751 }
7753 // no need to reset myCachedPosition here since state loading happens directly after creation
7754}
7755
7756void
7758 SUMOTime arrivalTime, double arrivalSpeed,
7759 double arrivalSpeedBraking,
7760 double dist, double leaveSpeed) {
7761 // ensure that approach information is reset on the next call to setApproachingForAllLinks
7762 myLFLinkLanes.push_back(DriveProcessItem(link, 0, 0, setRequest,
7763 arrivalTime, arrivalSpeed, arrivalSpeedBraking, dist, leaveSpeed));
7764
7765}
7766
7767
7768std::shared_ptr<MSSimpleDriverState>
7772
7773
7774double
7776 return myFrictionDevice == nullptr ? 1. : myFrictionDevice->getMeasuredFriction();
7777}
7778
7779
7780void
7781MSVehicle::setPreviousSpeed(double prevSpeed, double prevAcceleration) {
7782 myState.mySpeed = MAX2(0., prevSpeed);
7783 // also retcon acceleration
7784 if (prevAcceleration != std::numeric_limits<double>::min()) {
7785 myAcceleration = prevAcceleration;
7786 } else {
7788 }
7789}
7790
7791
7792double
7794 //return MAX2(-myAcceleration, getCarFollowModel().getApparentDecel());
7796}
7797
7798/****************************************************************************/
7799bool
7803
7804/* -------------------------------------------------------------------------
7805 * methods of MSVehicle::manoeuvre
7806 * ----------------------------------------------------------------------- */
7807
7808MSVehicle::Manoeuvre::Manoeuvre() : myManoeuvreStop(""), myManoeuvreStartTime(0), myManoeuvreCompleteTime(0), myManoeuvreType(MSVehicle::MANOEUVRE_NONE), myGUIIncrement(0) {}
7809
7810
7812 myManoeuvreStop = manoeuvre.myManoeuvreStop;
7813 myManoeuvreStartTime = manoeuvre.myManoeuvreStartTime;
7814 myManoeuvreCompleteTime = manoeuvre.myManoeuvreCompleteTime;
7815 myManoeuvreType = manoeuvre.myManoeuvreType;
7816 myGUIIncrement = manoeuvre.myGUIIncrement;
7817}
7818
7819
7822 myManoeuvreStop = manoeuvre.myManoeuvreStop;
7823 myManoeuvreStartTime = manoeuvre.myManoeuvreStartTime;
7824 myManoeuvreCompleteTime = manoeuvre.myManoeuvreCompleteTime;
7825 myManoeuvreType = manoeuvre.myManoeuvreType;
7826 myGUIIncrement = manoeuvre.myGUIIncrement;
7827 return *this;
7828}
7829
7830
7831bool
7833 return (myManoeuvreStop != manoeuvre.myManoeuvreStop ||
7834 myManoeuvreStartTime != manoeuvre.myManoeuvreStartTime ||
7835 myManoeuvreCompleteTime != manoeuvre.myManoeuvreCompleteTime ||
7836 myManoeuvreType != manoeuvre.myManoeuvreType ||
7837 myGUIIncrement != manoeuvre.myGUIIncrement
7838 );
7839}
7840
7841
7842double
7844 return (myGUIIncrement);
7845}
7846
7847
7850 return (myManoeuvreType);
7851}
7852
7853
7858
7859
7860void
7864
7865
7866void
7868 myManoeuvreType = mType;
7869}
7870
7871
7872bool
7874 if (!veh->hasStops()) {
7875 return false; // should never happen - checked before call
7876 }
7877
7878 const SUMOTime currentTime = MSNet::getInstance()->getCurrentTimeStep();
7879 const MSStop& stop = veh->getNextStop();
7880
7881 int manoeuverAngle = stop.parkingarea->getLastFreeLotAngle();
7882 double GUIAngle = stop.parkingarea->getLastFreeLotGUIAngle();
7883 if (abs(GUIAngle) < 0.1) {
7884 GUIAngle = -0.1; // Wiggle vehicle on parallel entry
7885 }
7886 myManoeuvreVehicleID = veh->getID();
7887 myManoeuvreStop = stop.parkingarea->getID();
7888 myManoeuvreType = MSVehicle::MANOEUVRE_ENTRY;
7889 myManoeuvreStartTime = currentTime;
7890 myManoeuvreCompleteTime = currentTime + veh->myType->getEntryManoeuvreTime(manoeuverAngle);
7891 myGUIIncrement = GUIAngle / (STEPS2TIME(myManoeuvreCompleteTime - myManoeuvreStartTime) / TS);
7892
7893#ifdef DEBUG_STOPS
7894 if (veh->isSelected()) {
7895 std::cout << "ENTRY manoeuvre start: vehicle=" << veh->getID() << " Manoeuvre Angle=" << manoeuverAngle << " Rotation angle=" << RAD2DEG(GUIAngle) << " Road Angle" << RAD2DEG(veh->getAngle()) << " increment=" << RAD2DEG(myGUIIncrement) << " currentTime=" << currentTime <<
7896 " endTime=" << myManoeuvreCompleteTime << " manoeuvre time=" << myManoeuvreCompleteTime - currentTime << " parkArea=" << myManoeuvreStop << std::endl;
7897 }
7898#endif
7899
7900 return (true);
7901}
7902
7903
7904bool
7906 // At the moment we only want to set for parking areas
7907 if (!veh->hasStops()) {
7908 return true;
7909 }
7910 if (veh->getNextStop().parkingarea == nullptr) {
7911 return true;
7912 }
7913
7914 if (myManoeuvreType != MSVehicle::MANOEUVRE_NONE) {
7915 return (false);
7916 }
7917
7918 const SUMOTime currentTime = MSNet::getInstance()->getCurrentTimeStep();
7919
7920 int manoeuverAngle = veh->getCurrentParkingArea()->getManoeuverAngle(*veh);
7921 double GUIAngle = veh->getCurrentParkingArea()->getGUIAngle(*veh);
7922 if (abs(GUIAngle) < 0.1) {
7923 GUIAngle = 0.1; // Wiggle vehicle on parallel exit
7924 }
7925
7926 myManoeuvreVehicleID = veh->getID();
7927 myManoeuvreStop = veh->getCurrentParkingArea()->getID();
7928 myManoeuvreType = MSVehicle::MANOEUVRE_EXIT;
7929 myManoeuvreStartTime = currentTime;
7930 myManoeuvreCompleteTime = currentTime + veh->myType->getExitManoeuvreTime(manoeuverAngle);
7931 myGUIIncrement = -GUIAngle / (STEPS2TIME(myManoeuvreCompleteTime - myManoeuvreStartTime) / TS);
7932 if (veh->remainingStopDuration() > 0) {
7933 myManoeuvreCompleteTime += veh->remainingStopDuration();
7934 }
7935
7936#ifdef DEBUG_STOPS
7937 if (veh->isSelected()) {
7938 std::cout << "EXIT manoeuvre start: vehicle=" << veh->getID() << " Manoeuvre Angle=" << manoeuverAngle << " increment=" << RAD2DEG(myGUIIncrement) << " currentTime=" << currentTime
7939 << " endTime=" << myManoeuvreCompleteTime << " manoeuvre time=" << myManoeuvreCompleteTime - currentTime << " parkArea=" << myManoeuvreStop << std::endl;
7940 }
7941#endif
7942
7943 return (true);
7944}
7945
7946
7947bool
7949 // At the moment we only want to consider parking areas - need to check because we could be setting up a manoeuvre
7950 if (!veh->hasStops()) {
7951 return (true);
7952 }
7953 MSStop* currentStop = &veh->myStops.front();
7954 if (currentStop->parkingarea == nullptr) {
7955 return true;
7956 } else if (currentStop->parkingarea->getID() != myManoeuvreStop || MSVehicle::MANOEUVRE_ENTRY != myManoeuvreType) {
7957 if (configureEntryManoeuvre(veh)) {
7959 return (false);
7960 } else { // cannot configure entry so stop trying
7961 return true;
7962 }
7963 } else if (MSNet::getInstance()->getCurrentTimeStep() < myManoeuvreCompleteTime) {
7964 return false;
7965 } else { // manoeuvre complete
7966 myManoeuvreType = MSVehicle::MANOEUVRE_NONE;
7967 return true;
7968 }
7969}
7970
7971
7972bool
7974 if (checkType != myManoeuvreType) {
7975 return true; // we're not maneuvering / wrong manoeuvre
7976 }
7977
7978 if (MSNet::getInstance()->getCurrentTimeStep() < myManoeuvreCompleteTime) {
7979 return false;
7980 } else {
7981 return true;
7982 }
7983}
7984
7985
7986bool
7988 return (MSNet::getInstance()->getCurrentTimeStep() >= myManoeuvreCompleteTime);
7989}
7990
7991
7992bool
7996
7997
7998std::pair<double, double>
8000 if (hasStops()) {
8001 MSLane* lane = myLane;
8002 if (lane == nullptr) {
8003 // not in network
8004 lane = getEdge()->getLanes()[0];
8005 }
8006 const MSStop& stop = myStops.front();
8007 auto it = myCurrEdge + 1;
8008 // drive to end of current edge
8009 double dist = (lane->getLength() - getPositionOnLane());
8010 double travelTime = lane->getEdge().getMinimumTravelTime(this) * dist / lane->getLength();
8011 // drive until stop edge
8012 while (it != myRoute->end() && it < stop.edge) {
8013 travelTime += (*it)->getMinimumTravelTime(this);
8014 dist += (*it)->getLength();
8015 it++;
8016 }
8017 // drive up to the stop position
8018 const double stopEdgeDist = stop.pars.endPos - (lane == stop.lane ? lane->getLength() : 0);
8019 dist += stopEdgeDist;
8020 travelTime += stop.lane->getEdge().getMinimumTravelTime(this) * (stopEdgeDist / stop.lane->getLength());
8021 // estimate time loss due to acceleration and deceleration
8022 // maximum speed is limited by available distance:
8023 const double a = getCarFollowModel().getMaxAccel();
8024 const double b = getCarFollowModel().getMaxDecel();
8025 const double c = getSpeed();
8026 const double d = dist;
8027 const double len = getVehicleType().getLength();
8028 const double vs = MIN2(MAX2(stop.getSpeed(), 0.0), stop.lane->getVehicleMaxSpeed(this));
8029 // distAccel = (v - c)^2 / (2a)
8030 // distDecel = (v + vs)*(v - vs) / 2b = (v^2 - vs^2) / (2b)
8031 // distAccel + distDecel < d
8032 const double maxVD = MAX2(c, ((sqrt(MAX2(0.0, pow(2 * c * b, 2) + (4 * ((b * ((a * (2 * d * (b + a) + (vs * vs) - (c * c))) - (b * (c * c))))
8033 + pow((a * vs), 2))))) * 0.5) + (c * b)) / (b + a));
8034 it = myCurrEdge;
8035 double v0 = c;
8036 bool v0Stable = getAcceleration() == 0 && v0 > 0;
8037 double timeLossAccel = 0;
8038 double timeLossDecel = 0;
8039 double timeLossLength = 0;
8040 while (it != myRoute->end() && it <= stop.edge) {
8041 double v = MIN2(maxVD, (*it)->getVehicleMaxSpeed(this));
8042 double edgeLength = (it == stop.edge ? stop.pars.endPos : (*it)->getLength()) - (it == myCurrEdge ? getPositionOnLane() : 0);
8043 if (edgeLength <= len && v0Stable && v0 < v) {
8044 const double lengthDist = MIN2(len, edgeLength);
8045 const double dTL = lengthDist / v0 - lengthDist / v;
8046 //std::cout << " e=" << (*it)->getID() << " v0=" << v0 << " v=" << v << " el=" << edgeLength << " lDist=" << lengthDist << " newTLL=" << dTL<< "\n";
8047 timeLossLength += dTL;
8048 }
8049 if (edgeLength > len) {
8050 const double dv = v - v0;
8051 if (dv > 0) {
8052 // timeLossAccel = timeAccel - timeMaxspeed = dv / a - distAccel / v
8053 const double dTA = dv / a - dv * (v + v0) / (2 * a * v);
8054 //std::cout << " e=" << (*it)->getID() << " v0=" << v0 << " v=" << v << " newTLA=" << dTA << "\n";
8055 timeLossAccel += dTA;
8056 // time loss from vehicle length
8057 } else if (dv < 0) {
8058 // timeLossDecel = timeDecel - timeMaxspeed = dv / b - distDecel / v
8059 const double dTD = -dv / b + dv * (v + v0) / (2 * b * v0);
8060 //std::cout << " e=" << (*it)->getID() << " v0=" << v0 << " v=" << v << " newTLD=" << dTD << "\n";
8061 timeLossDecel += dTD;
8062 }
8063 v0 = v;
8064 v0Stable = true;
8065 }
8066 it++;
8067 }
8068 // final deceleration to stop (may also be acceleration or deceleration to waypoint speed)
8069 double v = vs;
8070 const double dv = v - v0;
8071 if (dv > 0) {
8072 // timeLossAccel = timeAccel - timeMaxspeed = dv / a - distAccel / v
8073 const double dTA = dv / a - dv * (v + v0) / (2 * a * v);
8074 //std::cout << " final e=" << (*it)->getID() << " v0=" << v0 << " v=" << v << " newTLA=" << dTA << "\n";
8075 timeLossAccel += dTA;
8076 // time loss from vehicle length
8077 } else if (dv < 0) {
8078 // timeLossDecel = timeDecel - timeMaxspeed = dv / b - distDecel / v
8079 const double dTD = -dv / b + dv * (v + v0) / (2 * b * v0);
8080 //std::cout << " final e=" << (*it)->getID() << " v0=" << v0 << " v=" << v << " newTLD=" << dTD << "\n";
8081 timeLossDecel += dTD;
8082 }
8083 const double result = travelTime + timeLossAccel + timeLossDecel + timeLossLength;
8084 //std::cout << SIMTIME << " v=" << c << " a=" << a << " b=" << b << " maxVD=" << maxVD << " tt=" << travelTime
8085 // << " ta=" << timeLossAccel << " td=" << timeLossDecel << " tl=" << timeLossLength << " res=" << result << "\n";
8086 return {MAX2(0.0, result), dist};
8087 } else {
8089 }
8090}
8091
8092
8093double
8095 if (hasStops() && myStops.front().pars.until >= 0) {
8096 const MSStop& stop = myStops.front();
8097 SUMOTime estimatedDepart = MSNet::getInstance()->getCurrentTimeStep() - DELTA_T;
8098 if (stop.reached) {
8099 return STEPS2TIME(estimatedDepart + stop.duration - stop.pars.until);
8100 }
8101 if (stop.pars.duration > 0) {
8102 estimatedDepart += stop.pars.duration;
8103 }
8104 estimatedDepart += TIME2STEPS(estimateTimeToNextStop().first);
8105 const double result = MAX2(0.0, STEPS2TIME(estimatedDepart - stop.pars.until));
8106 return result;
8107 } else {
8108 // vehicles cannot drive before 'until' so stop delay can never be
8109 // negative and we can use -1 to signal "undefined"
8110 return -1;
8111 }
8112}
8113
8114
8115double
8117 if (hasStops() && myStops.front().pars.arrival >= 0) {
8118 const MSStop& stop = myStops.front();
8119 if (stop.reached) {
8120 return STEPS2TIME(stop.pars.started - stop.pars.arrival);
8121 } else {
8122 return STEPS2TIME(MSNet::getInstance()->getCurrentTimeStep()) + estimateTimeToNextStop().first - STEPS2TIME(stop.pars.arrival);
8123 }
8124 } else {
8125 // vehicles can arrival earlier than planned so arrival delay can be negative
8126 return INVALID_DOUBLE;
8127 }
8128}
8129
8130
8131const MSEdge*
8133 return myLane != nullptr ? &myLane->getEdge() : getEdge();
8134}
8135
8136
8137const MSEdge*
8139 if (myLane == nullptr || (myCurrEdge + 1) == myRoute->end()) {
8140 return nullptr;
8141 }
8142 if (myLane->isInternal()) {
8144 } else {
8145 const MSEdge* nextNormal = succEdge(1);
8146 const MSEdge* nextInternal = myLane->getEdge().getInternalFollowingEdge(nextNormal, getVClass());
8147 return nextInternal ? nextInternal : nextNormal;
8148 }
8149}
8150
8151
8152const MSLane*
8153MSVehicle::getPreviousLane(const MSLane* current, int& furtherIndex) const {
8154 if (furtherIndex < (int)myFurtherLanes.size()) {
8155 return myFurtherLanes[furtherIndex++];
8156 } else {
8157 // try to use route information
8158 int routeIndex = getRoutePosition();
8159 bool resultInternal;
8160 if (MSGlobals::gUsingInternalLanes && MSNet::getInstance()->hasInternalLinks()) {
8161 if (myLane->isInternal()) {
8162 if (furtherIndex % 2 == 0) {
8163 routeIndex -= (furtherIndex + 0) / 2;
8164 resultInternal = false;
8165 } else {
8166 routeIndex -= (furtherIndex + 1) / 2;
8167 resultInternal = false;
8168 }
8169 } else {
8170 if (furtherIndex % 2 != 0) {
8171 routeIndex -= (furtherIndex + 1) / 2;
8172 resultInternal = false;
8173 } else {
8174 routeIndex -= (furtherIndex + 2) / 2;
8175 resultInternal = true;
8176 }
8177 }
8178 } else {
8179 routeIndex -= furtherIndex;
8180 resultInternal = false;
8181 }
8182 furtherIndex++;
8183 if (routeIndex >= 0) {
8184 if (resultInternal) {
8185 const MSEdge* prevNormal = myRoute->getEdges()[routeIndex];
8186 for (MSLane* cand : prevNormal->getLanes()) {
8187 for (MSLink* link : cand->getLinkCont()) {
8188 if (link->getLane() == current) {
8189 if (link->getViaLane() != nullptr) {
8190 return link->getViaLane();
8191 } else {
8192 return const_cast<MSLane*>(link->getLaneBefore());
8193 }
8194 }
8195 }
8196 }
8197 } else {
8198 return myRoute->getEdges()[routeIndex]->getLanes()[0];
8199 }
8200 }
8201 }
8202 return current;
8203}
8204
8207 // this vehicle currently has the highest priority on the allway_stop
8208 return link == myHaveStoppedFor ? SUMOTime_MAX : getWaitingTime();
8209}
8210
8211
8212void
8214 bool diverged = false;
8215 const ConstMSEdgeVector& route = myRoute->getEdges();
8216 int ri = getRoutePosition();
8217 for (const DriveProcessItem& dpi : myLFLinkLanes) {
8218 if (dpi.myLink != nullptr) {
8219 if (!diverged) {
8220 const MSEdge* next = route[ri + 1];
8221 if (&dpi.myLink->getLane()->getEdge() != next) {
8222 diverged = true;
8223 } else {
8224 if (dpi.myLink->getViaLane() == nullptr) {
8225 ri++;
8226 }
8227 }
8228 }
8229 if (diverged) {
8230 dpi.myLink->removeApproaching(this);
8231 }
8232 }
8233 }
8234}
8235
8236/****************************************************************************/
long long int SUMOTime
Definition GUI.h:36
#define RAD2DEG(x)
Definition GeomHelper.h:36
#define DEBUG_COND2(obj)
Definition MESegment.cpp:53
std::vector< const MSEdge * > ConstMSEdgeVector
Definition MSEdge.h:74
std::vector< MSEdge * > MSEdgeVector
Definition MSEdge.h:73
std::pair< const MSVehicle *, double > CLeaderDist
std::pair< const MSPerson *, double > PersonDist
Definition MSPModel.h:41
ConstMSEdgeVector::const_iterator MSRouteIterator
Definition MSRoute.h:57
#define NUMERICAL_EPS_SPEED
#define STOPPING_PLACE_OFFSET
#define JUNCTION_BLOCKAGE_TIME
#define DIST_TO_STOPLINE_EXPECT_PRIORITY
#define CRLL_LOOK_AHEAD
#define WRITE_WARNINGF(...)
Definition MsgHandler.h:288
#define WRITE_ERROR(msg)
Definition MsgHandler.h:296
#define WRITE_WARNING(msg)
Definition MsgHandler.h:287
#define TL(string)
Definition MsgHandler.h:305
std::shared_ptr< const MSRoute > ConstMSRoutePtr
Definition Route.h:32
SUMOTime DELTA_T
Definition SUMOTime.cpp:38
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 SPEED2DIST(x)
Definition SUMOTime.h:45
#define SIMSTEP
Definition SUMOTime.h:61
#define ACCEL2SPEED(x)
Definition SUMOTime.h:51
#define SUMOTime_MAX
Definition SUMOTime.h:34
#define TS
Definition SUMOTime.h:42
#define SIMTIME
Definition SUMOTime.h:62
#define TIME2STEPS(x)
Definition SUMOTime.h:57
#define DIST2SPEED(x)
Definition SUMOTime.h:47
#define SPEED2ACCEL(x)
Definition SUMOTime.h:53
bool isRailway(SVCPermissions permissions)
Returns whether an edge with the given permissions is a (exclusive) railway edge.
@ RAIL_CARGO
render as a cargo train
@ RAIL
render as a rail
@ PASSENGER_VAN
render as a van
@ PASSENGER
render as a passenger vehicle
@ RAIL_CAR
render as a (city) rail without locomotive
@ PASSENGER_HATCHBACK
render as a hatchback passenger vehicle ("Fliessheck")
@ BUS_FLEXIBLE
render as a flexible city bus
@ TRUCK_1TRAILER
render as a transport vehicle with one trailer
@ PASSENGER_SEDAN
render as a sedan passenger vehicle ("Stufenheck")
@ PASSENGER_WAGON
render as a wagon passenger vehicle ("Combi")
@ TRUCK_SEMITRAILER
render as a semi-trailer transport vehicle ("Sattelschlepper")
@ SVC_RAIL_CLASSES
classes which drive on tracks
@ SVC_EMERGENCY
public emergency vehicles
const long long int VEHPARS_FORCE_REROUTE
@ GIVEN
The lane is given.
@ GIVEN
The speed is given.
@ SPLIT_FRONT
depart position for a split vehicle is in front of the continuing vehicle
const long long int VEHPARS_CFMODEL_PARAMS_SET
@ GIVEN
The arrival lane is given.
@ GIVEN
The speed is given.
const int STOP_ENDED_SET
@ GIVEN
The arrival position is given.
const int STOP_STARTED_SET
@ SUMO_TAG_PARKING_AREA_REROUTE
entry for an alternative parking zone
@ SUMO_TAG_PARKING_AREA
A parking area.
@ SUMO_TAG_OVERHEAD_WIRE_SEGMENT
An overhead wire segment.
LinkDirection
The different directions a link between two lanes may take (or a stream between two edges)....
@ PARTLEFT
The link is a partial left direction.
@ RIGHT
The link is a (hard) right direction.
@ TURN
The link is a 180 degree turn.
@ LEFT
The link is a (hard) left direction.
@ STRAIGHT
The link is a straight direction.
@ TURN_LEFTHAND
The link is a 180 degree turn (left-hand network)
@ PARTRIGHT
The link is a partial right direction.
@ NODIR
The link has no direction (is a dead end link)
LinkState
The right-of-way state of a link between two lanes used when constructing a NBTrafficLightLogic,...
@ LINKSTATE_ALLWAY_STOP
This is an uncontrolled, all-way stop link.
@ LINKSTATE_EQUAL
This is an uncontrolled, right-before-left link.
@ LINKSTATE_ZIPPER
This is an uncontrolled, zipper-merge link.
@ LCA_KEEPRIGHT
The action is due to the default of keeping right "Rechtsfahrgebot".
@ LCA_BLOCKED
blocked in all directions
@ LCA_URGENT
The action is urgent (to be defined by lc-model)
@ LCA_STAY
Needs to stay on the current lane.
@ LCA_SUBLANE
used by the sublane model
@ LCA_WANTS_LANECHANGE_OR_STAY
lane can change or stay
@ LCA_COOPERATIVE
The action is done to help someone else.
@ LCA_OVERLAPPING
The vehicle is blocked being overlapping.
@ LCA_LEFT
Wants go to the left.
@ LCA_STRATEGIC
The action is needed to follow the route (navigational lc)
@ LCA_TRACI
The action is due to a TraCI request.
@ LCA_SPEEDGAIN
The action is due to the wish to be faster (tactical lc)
@ LCA_RIGHT
Wants go to the right.
@ SUMO_ATTR_JM_STOPLINE_GAP_MINOR
@ SUMO_ATTR_JM_STOPLINE_CROSSING_GAP
@ SUMO_ATTR_JM_IGNORE_KEEPCLEAR_TIME
@ SUMO_ATTR_SPEED
@ SUMO_ATTR_STARTED
@ SUMO_ATTR_MAXIMUMPOWER
Maximum Power.
@ SUMO_ATTR_WAITINGTIME
@ SUMO_ATTR_CF_IGNORE_IDS
@ SUMO_ATTR_JM_STOPLINE_GAP
@ SUMO_ATTR_POSITION_LAT
@ SUMO_ATTR_JM_DRIVE_AFTER_RED_TIME
@ SUMO_ATTR_JM_DRIVE_AFTER_YELLOW_TIME
@ SUMO_ATTR_ENDED
@ SUMO_ATTR_LCA_CONTRIGHT
@ SUMO_ATTR_ANGLE
@ SUMO_ATTR_DISTANCE
@ SUMO_ATTR_CF_IGNORE_TYPES
@ SUMO_ATTR_ARRIVALPOS_RANDOMIZED
@ SUMO_ATTR_FLEX_ARRIVAL
@ SUMO_ATTR_JM_IGNORE_JUNCTION_FOE_PROB
@ SUMO_ATTR_POSITION
@ SUMO_ATTR_STATE
The state of a link.
@ SUMO_ATTR_JM_DRIVE_RED_SPEED
int gPrecision
the precision for floating point outputs
Definition StdDefs.cpp:26
bool gDebugFlag1
global utility flags for debugging
Definition StdDefs.cpp:38
const double INVALID_DOUBLE
invalid double
Definition StdDefs.h:64
const double SUMO_const_laneWidth
Definition StdDefs.h:48
T MIN3(T a, T b, T c)
Definition StdDefs.h:89
T MIN2(T a, T b)
Definition StdDefs.h:76
const double SUMO_const_haltingSpeed
the speed threshold at which vehicles are considered as halting
Definition StdDefs.h:58
T MAX2(T a, T b)
Definition StdDefs.h:82
std::string toString(const T &t, std::streamsize accuracy=gPrecision)
Definition ToString.h:46
#define SOFT_ASSERT(expr)
define SOFT_ASSERT raise an assertion in debug mode everywhere except on the windows test server
double getDoubleOptional(SumoXMLAttr attr, const double def) const
Returns the value for a given key with an optional default. SUMO_ATTR_MASS and SUMO_ATTR_FRONTSURFACE...
void setDynamicValues(const SUMOTime stopDuration, const bool parking, const SUMOTime waitingTime, const double angle)
Sets the values which change possibly in every simulation step and are relevant for emsssion calculat...
static double naviDegree(const double angle)
static double fromNaviDegree(const double angle)
Interface for lane-change models.
double getLaneChangeCompletion() const
Get the current lane change completion ratio.
const std::vector< double > & getShadowFurtherLanesPosLat() const
double getManeuverDist() const
Returns the remaining unblocked distance for the current maneuver. (only used by sublane model)
int getLaneChangeDirection() const
return the direction of the current lane change maneuver
void resetChanged()
reset the flag whether a vehicle already moved to false
MSLane * getShadowLane() const
Returns the lane the vehicle's shadow is on during continuous/sublane lane change.
virtual void saveState(OutputDevice &out) const
Save the state of the laneChangeModel.
void endLaneChangeManeuver(const MSMoveReminder::Notification reason=MSMoveReminder::NOTIFICATION_LANE_CHANGE)
void setNoShadowPartialOccupator(MSLane *lane)
MSLane * getTargetLane() const
Returns the lane the vehicle has committed to enter during a sublane lane change.
SUMOTime remainingTime() const
Compute the remaining time until LC completion.
void setShadowApproachingInformation(MSLink *link) const
set approach information for the shadow vehicle
double getCooperativeHelpSpeed(const MSLane *lane, double distToLaneEnd) const
return speed for helping a vehicle that is blocked from changing
static MSAbstractLaneChangeModel * build(LaneChangeModel lcm, MSVehicle &vehicle)
Factory method for instantiating new lane changing models.
void changedToOpposite()
called when a vehicle changes between lanes in opposite directions
int getShadowDirection() const
return the direction in which the current shadow lane lies
virtual void loadState(const SUMOSAXAttributes &attrs)
Loads the state of the laneChangeModel from the given attributes.
double calcAngleOffset()
return the angle offset during a continuous change maneuver
void setPreviousAngleOffset(const double angleOffset)
set the angle offset of the previous time step
const std::vector< MSLane * > & getFurtherTargetLanes() const
double getAngleOffset() const
return the angle offset resulting from lane change and sigma
const std::vector< MSLane * > & getShadowFurtherLanes() const
bool isChangingLanes() const
return true if the vehicle currently performs a lane change maneuver
void setExtraImpatience(double value)
Sets routing behavior.
The base class for microscopic and mesoscopic vehicles.
double getMaxSpeed() const
Returns the maximum speed (the minimum of desired and technical maximum speed)
bool haveValidStopEdges(bool silent=false) const
check whether all stop.edge MSRouteIterators are valid and in order
virtual bool isSelected() const
whether this vehicle is selected in the GUI
std::list< MSStop > myStops
The vehicle's list of stops.
double getImpatience() const
Returns this vehicles impatience.
const std::vector< MSTransportable * > & getPersons() const
retrieve riding persons
virtual void initDevices()
const MSEdge * succEdge(int nSuccs) const
Returns the nSuccs'th successor of edge the vehicle is currently at.
void calculateArrivalParams(bool onInit)
(Re-)Calculates the arrival position and lane from the vehicle parameters
virtual double getArrivalPos() const
Returns this vehicle's desired arrivalPos for its current route (may change on reroute)
MoveReminderCont myMoveReminders
Currently relevant move reminders.
double myDepartPos
The real depart position.
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)
double getChosenSpeedFactor() const
Returns the precomputed factor by which the driver wants to be faster than the speed limit.
std::vector< MSVehicleDevice * > myDevices
The devices this vehicle has.
virtual void addTransportable(MSTransportable *transportable)
Adds a person or container to this vehicle.
const SUMOVehicleParameter::Stop * getNextStopParameter() const
return parameters for the next stop (SUMOVehicle Interface)
virtual bool replaceRoute(ConstMSRoutePtr route, const std::string &info, bool onInit=false, int offset=0, bool addRouteStops=true, bool removeStops=true, std::string *msgReturn=nullptr)
Replaces the current route by the given one.
bool isRail() const
MSVehicleType & getSingularType()
Replaces the current vehicle type with a new one used by this vehicle only.
const MSVehicleType * myType
This vehicle's type.
double getLength() const
Returns the vehicle's length.
bool isParking() const
Returns whether the vehicle is parking.
MSParkingArea * getCurrentParkingArea()
get the current parking area stop or nullptr
const MSEdge * getEdge() const
Returns the edge the vehicle is currently at.
int getPersonNumber() const
Returns the number of persons.
MSRouteIterator myCurrEdge
Iterator to current route-edge.
StopParVector myPastStops
The list of stops that the vehicle has already reached.
bool hasDeparted() const
Returns whether this vehicle has already departed.
ConstMSRoutePtr myRoute
This vehicle's route.
double getWidth() const
Returns the vehicle's width.
MSDevice_Transportable * myContainerDevice
The containers this vehicle may have.
const std::list< MSStop > & getStops() const
double getDesiredMaxSpeed() const
void addReminder(MSMoveReminder *rem, double pos=0)
Adds a MoveReminder dynamically.
SumoRNG * getRNG() const
SUMOTime getDeparture() const
Returns this vehicle's real departure time.
EnergyParams * getEmissionParameters() const
retrieve parameters for the energy consumption model
MSDevice_Transportable * myPersonDevice
The passengers this vehicle may have.
bool hasStops() const
Returns whether the vehicle has to stop somewhere.
virtual void activateReminders(const MSMoveReminder::Notification reason, const MSLane *enteredLane=0)
"Activates" all current move reminder
const MSStop & getNextStop() const
@ ROUTE_START_INVALID_PERMISSIONS
void addStops(const bool ignoreStopErrors, MSRouteIterator *searchStart=nullptr, bool addRouteStops=true)
Adds stops to the built vehicle.
SUMOVehicleClass getVClass() const
Returns the vehicle's access class.
MSParkingArea * getNextParkingArea()
get the upcoming parking area stop or nullptr
int myArrivalLane
The destination lane where the vehicle stops.
SUMOTime myDeparture
The real departure time.
bool isStoppedTriggered() const
Returns whether the vehicle is on a triggered stop.
void onDepart()
Called when the vehicle is inserted into the network.
virtual bool addTraciStop(SUMOVehicleParameter::Stop stop, std::string &errorMsg)
const MSRoute & getRoute() const
Returns the current route.
int getRoutePosition() const
return index of edge within route
bool replaceParkingArea(MSParkingArea *parkingArea, std::string &errorMsg)
replace the current parking area stop with a new stop with merge duration
static const SUMOTime NOT_YET_DEPARTED
bool myAmRegisteredAsWaiting
Whether this vehicle is registered as waiting for a person or container (for deadlock-recognition)
SUMOAbstractRouter< MSEdge, SUMOVehicle > & getRouterTT() const
EnergyParams * myEnergyParams
The emission parameters this vehicle may have.
const SUMOVehicleParameter * myParameter
This vehicle's parameter.
int myRouteValidity
status of the current vehicle route
const MSVehicleType & getVehicleType() const
Returns the vehicle's type definition.
bool isStopped() const
Returns whether the vehicle is at a stop.
MSDevice * getDevice(const std::type_info &type) const
Returns a device of the given type if it exists, nullptr otherwise.
int myNumberReroutes
The number of reroutings.
double myArrivalPos
The position on the destination lane where the vehicle stops.
virtual void saveState(OutputDevice &out)
Saves the (common) state of a vehicle.
virtual void replaceVehicleType(const MSVehicleType *type)
Replaces the current vehicle type by the one given.
double myOdometer
A simple odometer to keep track of the length of the route already driven.
int getContainerNumber() const
Returns the number of containers.
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)
Replaces the current route by the given edges.
The car-following model abstraction.
Definition MSCFModel.h:57
double estimateSpeedAfterDistance(const double dist, const double v, const double accel) const
virtual double maxNextSpeed(double speed, const MSVehicle *const veh) const
Returns the maximum speed given the current speed.
virtual double minNextSpeedEmergency(double speed, const MSVehicle *const veh=0) const
Returns the minimum speed after emergency braking, given the current speed (depends on the numerical ...
virtual VehicleVariables * createVehicleVariables() const
Returns model specific values which are stored inside a vehicle and must be used with casting.
Definition MSCFModel.h:252
double getEmergencyDecel() const
Get the vehicle type's maximal physically possible deceleration [m/s^2].
Definition MSCFModel.h:277
SUMOTime getStartupDelay() const
Get the vehicle type's startupDelay.
Definition MSCFModel.h:293
double getMinimalArrivalSpeed(double dist, double currentSpeed) const
Computes the minimal possible arrival speed after covering a given distance.
virtual void setHeadwayTime(double headwayTime)
Sets a new value for desired headway [s].
Definition MSCFModel.h:619
virtual double freeSpeed(const MSVehicle *const veh, double speed, double seen, double maxSpeed, const bool onInsertion=false, const CalcReason usage=CalcReason::CURRENT) const
Computes the vehicle's safe speed without a leader.
virtual double minNextSpeed(double speed, const MSVehicle *const veh=0) const
Returns the minimum speed given the current speed (depends on the numerical update scheme and its ste...
virtual double insertionFollowSpeed(const MSVehicle *const veh, double speed, double gap2pred, double predSpeed, double predMaxDecel, const MSVehicle *const pred=0) const
Computes the vehicle's safe speed (no dawdling) This method is used during the insertion stage....
SUMOTime getMinimalArrivalTime(double dist, double currentSpeed, double arrivalSpeed) const
Computes the minimal time needed to cover a distance given the desired speed at arrival.
virtual double finalizeSpeed(MSVehicle *const veh, double vPos) const
Applies interaction with stops and lane changing model influences. Called at most once per simulation...
@ FUTURE
the return value is used for calculating future speeds
Definition MSCFModel.h:83
@ CURRENT_WAIT
the return value is used for calculating junction stop speeds
Definition MSCFModel.h:85
double getApparentDecel() const
Get the vehicle type's apparent deceleration [m/s^2] (the one regarded by its followers.
Definition MSCFModel.h:285
double getMaxAccel() const
Get the vehicle type's maximum acceleration [m/s^2].
Definition MSCFModel.h:261
double brakeGap(const double speed) const
Returns the distance the vehicle needs to halt including driver's reaction time tau (i....
Definition MSCFModel.h:408
virtual double maximumLaneSpeedCF(const MSVehicle *const veh, double maxSpeed, double maxSpeedLane) const
Returns the maximum velocity the CF-model wants to achieve in the next step.
Definition MSCFModel.h:229
double maximumSafeStopSpeed(double gap, double decel, double currentSpeed, bool onInsertion=false, double headway=-1, bool relaxEmergency=true) const
Returns the maximum next velocity for stopping within gap.
double getMaxDecel() const
Get the vehicle type's maximal comfortable deceleration [m/s^2].
Definition MSCFModel.h:269
double getMinimalArrivalSpeedEuler(double dist, double currentSpeed) const
Computes the minimal possible arrival speed after covering a given distance for Euler update.
virtual double followSpeed(const MSVehicle *const veh, double speed, double gap2pred, double predSpeed, double predMaxDecel, const MSVehicle *const pred=0, const CalcReason usage=CalcReason::CURRENT) const =0
Computes the vehicle's follow speed (no dawdling)
double stopSpeed(const MSVehicle *const veh, const double speed, double gap, const CalcReason usage=CalcReason::CURRENT) const
Computes the vehicle's safe speed for approaching a non-moving obstacle (no dawdling)
Definition MSCFModel.h:173
virtual double getHeadwayTime() const
Get the driver's desired headway [s].
Definition MSCFModel.h:339
The ToC Device controls transition of control between automated and manual driving.
std::shared_ptr< MSSimpleDriverState > getDriverState() const
return internal state
void update()
update internal state
A device which collects info on the vehicle trip (mainly on departure and arrival)
double consumption(SUMOVehicle &veh, double a, double newSpeed)
return energy consumption in Wh (power multiplied by TS)
void setConsum(const double consumption)
double acceleration(SUMOVehicle &veh, double power, double oldSpeed)
double getConsum() const
Get consum.
A device which collects info on current friction Coefficient on the road.
A device which collects info on the vehicle trip (mainly on departure and arrival)
A device which collects info on the vehicle trip (mainly on departure and arrival)
void cancelCurrentCustomers()
remove the persons the taxi is currently waiting for from reservations
bool notifyMove(SUMOTrafficObject &veh, double oldPos, double newPos, double newSpeed)
Checks whether the vehicle is at a stop and transportable action is needed.
bool anyLeavingAtStop(const MSStop &stop) const
void transferAtSplitOrJoin(MSBaseVehicle *otherVeh)
transfers transportables that want to continue in the other train part (without boarding/loading dela...
void checkCollisionForInactive(MSLane *l)
trigger collision checking for inactive lane
A road/street connecting two junctions.
Definition MSEdge.h:77
static void clear()
Clears the dictionary.
Definition MSEdge.cpp:1098
const std::set< MSTransportable *, ComparatorNumericalIdLess > & getPersons() const
Returns this edge's persons set.
Definition MSEdge.h:204
const std::vector< MSLane * > & getLanes() const
Returns this edge's lanes.
Definition MSEdge.h:168
const MSEdge * getOppositeEdge() const
Returns the opposite direction edge if on exists else a nullptr.
Definition MSEdge.cpp:1346
bool isFringe() const
return whether this edge is at the fringe of the network
Definition MSEdge.h:764
const MSEdge * getNormalSuccessor() const
if this edge is an internal edge, return its first normal successor, otherwise the edge itself
Definition MSEdge.cpp:953
const std::vector< MSLane * > * allowedLanes(const MSEdge &destination, SUMOVehicleClass vclass=SVC_IGNORING, bool ignoreTransientPermissions=false) const
Get the allowed lanes to reach the destination-edge.
Definition MSEdge.cpp:480
const MSEdge * getBidiEdge() const
return opposite superposable/congruent edge, if it exist and 0 else
Definition MSEdge.h:282
bool isNormal() const
return whether this edge is an internal edge
Definition MSEdge.h:263
double getSpeedLimit() const
Returns the speed limit of the edge @caution The speed limit of the first lane is retured; should pro...
Definition MSEdge.cpp:1164
bool hasChangeProhibitions(SUMOVehicleClass svc, int index) const
return whether this edge prohibits changing for the given vClass when starting on the given lane inde...
Definition MSEdge.cpp:1368
bool hasLaneChanger() const
Definition MSEdge.h:738
const MSJunction * getToJunction() const
Definition MSEdge.h:418
const MSJunction * getFromJunction() const
Definition MSEdge.h:414
int getNumLanes() const
Definition MSEdge.h:172
double getMinimumTravelTime(const SUMOVehicle *const veh) const
returns the minimum travel time for the given vehicle
Definition MSEdge.h:476
bool isRoundabout() const
Definition MSEdge.h:721
bool isInternal() const
return whether this edge is an internal edge
Definition MSEdge.h:268
double getWidth() const
Returns the edges's width (sum over all lanes)
Definition MSEdge.h:656
bool isVaporizing() const
Returns whether vehicles on this edge shall be vaporized.
Definition MSEdge.h:434
void addWaiting(SUMOVehicle *vehicle) const
Adds a vehicle to the list of waiting vehicles.
Definition MSEdge.cpp:1457
const MSEdge * getInternalFollowingEdge(const MSEdge *followerAfterInternal, SUMOVehicleClass vClass) const
Definition MSEdge.cpp:906
void removeWaiting(const SUMOVehicle *vehicle) const
Removes a vehicle from the list of waiting vehicles.
Definition MSEdge.cpp:1466
const MSEdgeVector & getSuccessors(SUMOVehicleClass vClass=SVC_IGNORING) const
Returns the following edges, restricted by vClass.
Definition MSEdge.cpp:1264
static bool gModelParkingManoeuver
whether parking simulation includes manoeuver time and any associated lane blocking
Definition MSGlobals.h:162
static bool gUseMesoSim
Definition MSGlobals.h:106
static bool gUseStopStarted
Definition MSGlobals.h:134
static bool gCheckRoutes
Definition MSGlobals.h:91
static SUMOTime gStartupWaitThreshold
The minimum waiting time before applying startupDelay.
Definition MSGlobals.h:180
static double gTLSYellowMinDecel
The minimum deceleration at a yellow traffic light (only overruled by emergencyDecel)
Definition MSGlobals.h:171
static double gLateralResolution
Definition MSGlobals.h:100
static bool gSemiImplicitEulerUpdate
Definition MSGlobals.h:53
static bool gLefthand
Whether lefthand-drive is being simulated.
Definition MSGlobals.h:174
static bool gSublane
whether sublane simulation is enabled (sublane model or continuous lanechanging)
Definition MSGlobals.h:165
static SUMOTime gLaneChangeDuration
Definition MSGlobals.h:97
static double gEmergencyDecelWarningThreshold
threshold for warning about strong deceleration
Definition MSGlobals.h:152
static bool gUsingInternalLanes
Information whether the simulation regards internal lanes.
Definition MSGlobals.h:81
void add(SUMOVehicle *veh)
Adds a single vehicle for departure.
virtual const MSJunctionLogic * getLogic() const
Definition MSJunction.h:141
virtual const MSLogicJunction::LinkBits & getResponseFor(int linkIndex) const
Returns the response for the given link.
Representation of a lane in the micro simulation.
Definition MSLane.h:84
std::vector< StopWatch< std::chrono::nanoseconds > > & getStopWatch()
Definition MSLane.h:1291
const std::vector< MSMoveReminder * > & getMoveReminders() const
Return the list of this lane's move reminders.
Definition MSLane.h:323
std::pair< MSVehicle *const, double > getFollower(const MSVehicle *ego, double egoPos, double dist, MinorLinkMode mLinkMode) const
Find follower vehicle for the given ego vehicle (which may be on the opposite direction lane)
Definition MSLane.cpp:4389
std::pair< const MSPerson *, double > nextBlocking(double minPos, double minRight, double maxLeft, double stopTime=0, bool bidi=false) const
This is just a wrapper around MSPModel::nextBlocking. You should always check using hasPedestrians be...
Definition MSLane.cpp:4563
MSLane * getParallelLane(int offset, bool includeOpposite=true) const
Returns the lane with the given offset parallel to this one or 0 if it does not exist.
Definition MSLane.cpp:2839
virtual MSVehicle * removeVehicle(MSVehicle *remVehicle, MSMoveReminder::Notification notification, bool notify=true)
Definition MSLane.cpp:2821
int getVehicleNumber() const
Returns the number of vehicles on this lane (for which this lane is responsible)
Definition MSLane.h:456
MSVehicle * getFirstAnyVehicle() const
returns the first vehicle that is fully or partially on this lane
Definition MSLane.cpp:2669
const MSLink * getEntryLink() const
Returns the entry link if this is an internal lane, else nullptr.
Definition MSLane.cpp:2757
int getVehicleNumberWithPartials() const
Returns the number of vehicles on this lane (including partial occupators)
Definition MSLane.h:464
double getBruttoVehLenSum() const
Returns the sum of lengths of vehicles, including their minGaps, which were on the lane during the la...
Definition MSLane.h:1164
static std::vector< MSLink * >::const_iterator succLinkSec(const SUMOVehicle &veh, int nRouteSuccs, const MSLane &succLinkSource, const std::vector< MSLane * > &conts)
Definition MSLane.cpp:2683
void markRecalculateBruttoSum()
Set a flag to recalculate the brutto (including minGaps) occupancy of this lane (used if mingap is ch...
Definition MSLane.cpp:2422
const MSLink * getLinkTo(const MSLane *const) const
returns the link to the given lane or nullptr, if it is not connected
Definition MSLane.cpp:2734
void forceVehicleInsertion(MSVehicle *veh, double pos, MSMoveReminder::Notification notification, double posLat=0)
Inserts the given vehicle at the given position.
Definition MSLane.cpp:1381
double getVehicleStopOffset(const MSVehicle *veh) const
Returns vehicle class specific stopOffset for the vehicle.
Definition MSLane.cpp:3767
double getSpeedLimit() const
Returns the lane's maximum allowed speed.
Definition MSLane.h:597
std::vector< MSVehicle * > VehCont
Container for vehicles.
Definition MSLane.h:119
const MSEdge * getNextNormal() const
Returns the lane's follower if it is an internal lane, the edge of the lane otherwise.
Definition MSLane.cpp:2454
SVCPermissions getPermissions() const
Returns the vehicle class permissions for this lane.
Definition MSLane.h:619
const std::vector< IncomingLaneInfo > & getIncomingLanes() const
Definition MSLane.h:955
MSLane * getCanonicalPredecessorLane() const
Definition MSLane.cpp:3261
double getLength() const
Returns the lane's length.
Definition MSLane.h:611
double getMaximumBrakeDist() const
compute maximum braking distance on this lane
Definition MSLane.cpp:2896
const MSLane * getInternalFollowingLane(const MSLane *const) const
returns the internal lane leading to the given lane or nullptr, if there is none
Definition MSLane.cpp:2746
const MSLeaderInfo getLastVehicleInformation(const MSVehicle *ego, double latOffset, double minPos=0, bool allowCached=true) const
Returns the last vehicles on the lane.
Definition MSLane.cpp:1434
std::pair< MSVehicle *const, double > getLeaderOnConsecutive(double dist, double seen, double speed, const MSVehicle &veh, const std::vector< MSLane * > &bestLaneConts, bool considerCrossingFoes=true) const
Returns the immediate leader and the distance to him.
Definition MSLane.cpp:2980
bool isLinkEnd(std::vector< MSLink * >::const_iterator &i) const
Definition MSLane.h:858
bool allowsVehicleClass(SUMOVehicleClass vclass) const
Definition MSLane.h:930
virtual double setPartialOccupation(MSVehicle *v)
Sets the information about a vehicle lapping into this lane.
Definition MSLane.cpp:386
double getVehicleMaxSpeed(const SUMOTrafficObject *const veh) const
Returns the lane's maximum speed, given a vehicle's speed limit adaptation.
Definition MSLane.h:574
double getRightSideOnEdge() const
Definition MSLane.h:1200
bool hasPedestrians() const
whether the lane has pedestrians on it
Definition MSLane.cpp:4556
int getIndex() const
Returns the lane's index.
Definition MSLane.h:647
MSLane * getCanonicalSuccessorLane() const
Definition MSLane.cpp:3285
double getOppositePos(double pos) const
return the corresponding position on the opposite lane
Definition MSLane.cpp:4384
MSLane * getLogicalPredecessorLane() const
get the most likely precedecessor lane (sorted using by_connections_to_sorter). The result is cached ...
Definition MSLane.cpp:3205
double getCenterOnEdge() const
Definition MSLane.h:1208
bool isNormal() const
Definition MSLane.cpp:2615
MSVehicle * getLastAnyVehicle() const
returns the last vehicle that is fully or partially on this lane
Definition MSLane.cpp:2650
bool isInternal() const
Definition MSLane.cpp:2609
@ FOLLOW_NEVER
Definition MSLane.h:979
virtual void resetPartialOccupation(MSVehicle *v)
Removes the information about a vehicle lapping into this lane.
Definition MSLane.cpp:405
MSLane * getOpposite() const
return the neighboring opposite direction lane for lane changing or nullptr
Definition MSLane.cpp:4372
virtual const VehCont & getVehiclesSecure() const
Returns the vehicles container; locks it for microsimulation.
Definition MSLane.h:483
virtual void releaseVehicles() const
Allows to use the container for microsimulation again.
Definition MSLane.h:513
bool mustCheckJunctionCollisions() const
whether this lane must check for junction collisions
Definition MSLane.cpp:4674
double interpolateLanePosToGeometryPos(double lanePos) const
Definition MSLane.h:554
MSLane * getBidiLane() const
retrieve bidirectional lane or nullptr
Definition MSLane.cpp:4668
@ COLLISION_ACTION_WARN
Definition MSLane.h:203
virtual const PositionVector & getShape(bool) const
Definition MSLane.h:294
MSLane * getParallelOpposite() const
return the opposite direction lane of this lanes edge or nullptr
Definition MSLane.cpp:4378
MSEdge & getEdge() const
Returns the lane's edge.
Definition MSLane.h:769
double getSpaceTillLastStanding(const MSVehicle *ego, bool &foundStopped) const
return the empty space up to the last standing vehicle or the empty space on the whole lane if no veh...
Definition MSLane.cpp:4683
const MSLane * getNormalPredecessorLane() const
get normal lane leading to this internal lane, for normal lanes, the lane itself is returned
Definition MSLane.cpp:3230
MSLeaderDistanceInfo getFollowersOnConsecutive(const MSVehicle *ego, double backOffset, bool allSublanes, double searchDist=-1, MinorLinkMode mLinkMode=FOLLOW_ALWAYS) const
return the sublane followers with the largest missing rear gap among all predecessor lanes (within di...
Definition MSLane.cpp:3792
double getWidth() const
Returns the lane's width.
Definition MSLane.h:640
const std::vector< MSLink * > & getLinkCont() const
returns the container with all links !!!
Definition MSLane.h:729
MSVehicle * getFirstFullVehicle() const
returns the first vehicle for which this lane is responsible or 0
Definition MSLane.cpp:2641
const Position geometryPositionAtOffset(double offset, double lateralOffset=0) const
Definition MSLane.h:560
static CollisionAction getCollisionAction()
Definition MSLane.h:1362
saves leader/follower vehicles and their distances relative to an ego vehicle
virtual std::string toString() const
print a debugging representation
void fixOppositeGaps(bool isFollower)
subtract vehicle length from all gaps if the leader vehicle is driving in the opposite direction
virtual int addLeader(const MSVehicle *veh, double gap, double latOffset=0, int sublane=-1)
void setSublaneOffset(int offset)
set number of sublanes by which to shift positions
void removeOpposite(const MSLane *lane)
remove vehicles that are driving in the opposite direction (fully or partially) on the given lane
int numSublanes() const
virtual int addLeader(const MSVehicle *veh, bool beyond, double latOffset=0.)
virtual std::string toString() const
print a debugging representation
virtual void clear()
discard all information
bool hasVehicles() const
int getSublaneOffset() const
void getSubLanes(const MSVehicle *veh, double latOffset, int &rightmost, int &leftmost) const
Something on a lane to be noticed about vehicle movement.
Notification
Definition of a vehicle state.
@ NOTIFICATION_TELEPORT_ARRIVED
The vehicle was teleported out of the net.
@ NOTIFICATION_PARKING_REROUTE
The vehicle needs another parking area.
@ NOTIFICATION_DEPARTED
The vehicle has departed (was inserted into the network)
@ NOTIFICATION_LANE_CHANGE
The vehicle changes lanes (micro only)
@ NOTIFICATION_VAPORIZED_VAPORIZER
The vehicle got vaporized with a vaporizer.
@ NOTIFICATION_JUNCTION
The vehicle arrived at a junction.
@ NOTIFICATION_PARKING
The vehicle starts or ends parking.
@ NOTIFICATION_VAPORIZED_COLLISION
The vehicle got removed by a collision.
@ NOTIFICATION_LOAD_STATE
The vehicle has been loaded from a state file.
@ NOTIFICATION_TELEPORT
The vehicle is being teleported.
@ NOTIFICATION_TELEPORT_CONTINUATION
The vehicle continues being teleported past an edge.
The simulated network and simulation perfomer.
Definition MSNet.h:89
void removeVehicleStateListener(VehicleStateListener *listener)
Removes a vehicle states listener.
Definition MSNet.cpp:1276
VehicleState
Definition of a vehicle state.
Definition MSNet.h:614
@ STARTING_STOP
The vehicles starts to stop.
@ STARTING_PARKING
The vehicles starts to park.
@ STARTING_TELEPORT
The vehicle started to teleport.
@ ENDING_STOP
The vehicle ends to stop.
@ ARRIVED
The vehicle arrived at his destination (is deleted)
@ EMERGENCYSTOP
The vehicle had to brake harder than permitted.
@ MANEUVERING
Vehicle maneuvering either entering or exiting a parking space.
static MSNet * getInstance()
Returns the pointer to the unique instance of MSNet (singleton).
Definition MSNet.cpp:186
virtual MSTransportableControl & getContainerControl()
Returns the container control.
Definition MSNet.cpp:1209
std::string getStoppingPlaceID(const MSLane *lane, const double pos, const SumoXMLTag category) const
Returns the stop of the given category close to the given position.
Definition MSNet.cpp:1424
SUMOTime getCurrentTimeStep() const
Returns the current simulation step.
Definition MSNet.h:326
static bool hasInstance()
Returns whether the network was already constructed.
Definition MSNet.h:158
MSStoppingPlace * getStoppingPlace(const std::string &id, const SumoXMLTag category) const
Returns the named stopping place of the given category.
Definition MSNet.cpp:1403
void addVehicleStateListener(VehicleStateListener *listener)
Adds a vehicle states listener.
Definition MSNet.cpp:1268
bool hasContainers() const
Returns whether containers are simulated.
Definition MSNet.h:417
void informVehicleStateListener(const SUMOVehicle *const vehicle, VehicleState to, const std::string &info="")
Informs all added listeners about a vehicle's state change.
Definition MSNet.cpp:1285
bool hasPersons() const
Returns whether persons are simulated.
Definition MSNet.h:401
MSInsertionControl & getInsertionControl()
Returns the insertion control.
Definition MSNet.h:437
MSVehicleControl & getVehicleControl()
Returns the vehicle control.
Definition MSNet.h:384
virtual MSTransportableControl & getPersonControl()
Returns the person control.
Definition MSNet.cpp:1200
MSEdgeControl & getEdgeControl()
Returns the edge control.
Definition MSNet.h:427
bool hasElevation() const
return whether the network contains elevation data
Definition MSNet.h:796
static const double SAFETY_GAP
Definition MSPModel.h:59
A lane area vehicles can halt at.
int getOccupancyIncludingReservations(const SUMOVehicle *forVehicle) const
void leaveFrom(SUMOVehicle *what)
Called if a vehicle leaves this stop.
int getCapacity() const
Returns the area capacity.
void enter(SUMOVehicle *veh)
Called if a vehicle enters this stop.
int getLotIndex(const SUMOVehicle *veh) const
compute lot for this vehicle
int getLastFreeLotAngle() const
Return the angle of myLastFreeLot - the next parking lot only expected to be called after we have est...
bool parkOnRoad() const
whether vehicles park on the road
double getLastFreePosWithReservation(SUMOTime t, const SUMOVehicle &forVehicle, double brakePos)
Returns the last free position on this stop including reservations from the current lane and time ste...
double getLastFreeLotGUIAngle() const
Return the GUI angle of myLastFreeLot - the angle the GUI uses to rotate into the next parking lot as...
int getManoeuverAngle(const SUMOVehicle &forVehicle) const
Return the manoeuver angle of the lot where the vehicle is parked.
int getOccupancy() const
Returns the area occupancy.
double getGUIAngle(const SUMOVehicle &forVehicle) const
Return the GUI angle of the lot where the vehicle is parked.
void notifyApproach(const MSLink *link)
switch rail signal to active
static MSRailSignalControl & getInstance()
const ConstMSEdgeVector & getEdges() const
Definition MSRoute.h:125
const MSEdge * getLastEdge() const
returns the destination edge
Definition MSRoute.cpp:91
MSRouteIterator begin() const
Returns the begin of the list of edges to pass.
Definition MSRoute.cpp:73
const MSLane * lane
The lane to stop at (microsim only)
Definition MSStop.h:50
bool triggered
whether an arriving person lets the vehicle continue
Definition MSStop.h:69
bool containerTriggered
whether an arriving container lets the vehicle continue
Definition MSStop.h:71
SUMOTime timeToLoadNextContainer
The time at which the vehicle is able to load another container.
Definition MSStop.h:83
MSStoppingPlace * containerstop
(Optional) container stop if one is assigned to the stop
Definition MSStop.h:56
double getSpeed() const
return speed for passing waypoint / skipping on-demand stop
Definition MSStop.cpp:176
bool joinTriggered
whether coupling another vehicle (train) the vehicle continue
Definition MSStop.h:73
bool isOpposite
whether this an opposite-direction stop
Definition MSStop.h:87
SUMOTime getMinDuration(SUMOTime time) const
return minimum stop duration when starting stop at time
Definition MSStop.cpp:134
int numExpectedContainer
The number of still expected containers.
Definition MSStop.h:79
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
SUMOTime timeToBoardNextPerson
The time at which the vehicle is able to board another person.
Definition MSStop.h:81
bool skipOnDemand
whether the decision to skip this stop has been made
Definition MSStop.h:89
const MSEdge * getEdge() const
Definition MSStop.cpp:54
double getReachedThreshold() const
return startPos taking into account opposite stopping
Definition MSStop.cpp:64
SUMOTime endBoarding
the maximum time at which persons may board this vehicle
Definition MSStop.h:85
double getEndPos(const SUMOVehicle &veh) const
return halting position for upcoming stop;
Definition MSStop.cpp:35
int numExpectedPerson
The number of still expected persons.
Definition MSStop.h:77
MSParkingArea * parkingarea
(Optional) parkingArea if one is assigned to the stop
Definition MSStop.h:58
bool startedFromState
whether the 'started' value was loaded from simulaton state
Definition MSStop.h:91
MSStoppingPlace * chargingStation
(Optional) charging station if one is assigned to the stop
Definition MSStop.h:60
SUMOTime duration
The stopping duration.
Definition MSStop.h:67
SUMOTime getUntil() const
return until / ended time
Definition MSStop.cpp:151
const SUMOVehicleParameter::Stop pars
The stop parameter.
Definition MSStop.h:65
MSStoppingPlace * busstop
(Optional) bus stop if one is assigned to the stop
Definition MSStop.h:54
void stopBlocked(const SUMOVehicle *veh, SUMOTime time)
Definition MSStopOut.cpp:66
static bool active()
Definition MSStopOut.h:54
void stopNotStarted(const SUMOVehicle *veh)
Definition MSStopOut.cpp:75
void stopStarted(const SUMOVehicle *veh, int numPersons, int numContainers, SUMOTime time)
Definition MSStopOut.cpp:82
void stopEnded(const SUMOVehicle *veh, const SUMOVehicleParameter::Stop &stop, const std::string &laneOrEdgeID, bool simEnd=false)
static MSStopOut * getInstance()
Definition MSStopOut.h:60
double getBeginLanePosition() const
Returns the begin position of this stop.
bool fits(double pos, const SUMOVehicle &veh) const
return whether the given vehicle fits at the given position
double getEndLanePosition() const
Returns the end position of this stop.
void enter(SUMOVehicle *veh, bool parking)
Called if a vehicle enters this stop.
const MSLane & getLane() const
Returns the lane this stop is located at.
void leaveFrom(SUMOVehicle *what)
Called if a vehicle leaves this stop.
bool hasAnyWaiting(const MSEdge *edge, SUMOVehicle *vehicle) const
check whether any transportables are waiting for the given vehicle
bool loadAnyWaiting(const MSEdge *edge, SUMOVehicle *vehicle, SUMOTime &timeToLoadNext, SUMOTime &stopDuration, MSTransportable *const force=nullptr)
load any applicable transportables Loads any person / container that is waiting on that edge for the ...
bool isPerson() const
Whether it is a person.
A static instance of this class in GapControlState deactivates gap control for vehicles whose referen...
Definition MSVehicle.h:1354
void vehicleStateChanged(const SUMOVehicle *const vehicle, MSNet::VehicleState to, const std::string &info="")
Called if a vehicle changes its state.
Changes the wished vehicle speed / lanes.
Definition MSVehicle.h:1349
void setLaneChangeMode(int value)
Sets lane changing behavior.
TraciLaneChangePriority myTraciLaneChangePriority
flags for determining the priority of traci lane change requests
Definition MSVehicle.h:1671
bool getEmergencyBrakeRedLight() const
Returns whether red lights shall be a reason to brake.
Definition MSVehicle.h:1519
SUMOTime getLaneTimeLineEnd()
void adaptLaneTimeLine(int indexShift)
Adapts lane timeline when moving to a new lane and the lane index changes.
void setRemoteControlled(Position xyPos, MSLane *l, double pos, double posLat, double angle, int edgeOffset, const ConstMSEdgeVector &route, SUMOTime t)
bool isRemoteAffected(SUMOTime t) const
int getSpeedMode() const
return the current speed mode
void deactivateGapController()
Deactivates the gap control.
Influencer()
Constructor.
void setSpeedMode(int speedMode)
Sets speed-constraining behaviors.
std::shared_ptr< GapControlState > myGapControlState
The gap control state.
Definition MSVehicle.h:1616
int getSignals() const
Definition MSVehicle.h:1587
bool myConsiderMaxDeceleration
Whether the maximum deceleration shall be regarded.
Definition MSVehicle.h:1637
void setLaneTimeLine(const std::vector< std::pair< SUMOTime, int > > &laneTimeLine)
Sets a new lane timeline.
bool myRespectJunctionLeaderPriority
Whether the junction priority rules are respected (within)
Definition MSVehicle.h:1646
void setOriginalSpeed(double speed)
Stores the originally longitudinal speed.
double myOriginalSpeed
The velocity before influence.
Definition MSVehicle.h:1619
bool myConsiderSpeedLimit
Whether the speed limit shall be regarded.
Definition MSVehicle.h:1631
double implicitDeltaPosRemote(const MSVehicle *veh)
return the change in longitudinal position that is implicit in the new remote position
double implicitSpeedRemote(const MSVehicle *veh, double oldSpeed)
return the speed that is implicit in the new remote position
void postProcessRemoteControl(MSVehicle *v)
update position from remote control
double gapControlSpeed(SUMOTime currentTime, const SUMOVehicle *veh, double speed, double vSafe, double vMin, double vMax)
Applies gap control logic on the speed.
void setSublaneChange(double latDist)
Sets a new sublane-change request.
double getOriginalSpeed() const
Returns the originally longitudinal speed to use.
SUMOTime myLastRemoteAccess
Definition MSVehicle.h:1655
bool getRespectJunctionLeaderPriority() const
Returns whether junction priority rules within the junction shall be respected (concerns vehicles wit...
Definition MSVehicle.h:1527
LaneChangeMode myStrategicLC
lane changing which is necessary to follow the current route
Definition MSVehicle.h:1660
LaneChangeMode mySpeedGainLC
lane changing to travel with higher speed
Definition MSVehicle.h:1664
void init()
Static initalization.
LaneChangeMode mySublaneLC
changing to the prefered lateral alignment
Definition MSVehicle.h:1668
bool getRespectJunctionPriority() const
Returns whether junction priority rules shall be respected (concerns approaching vehicles outside the...
Definition MSVehicle.h:1511
static void cleanup()
Static cleanup.
int getLaneChangeMode() const
return the current lane change mode
SUMOTime getLaneTimeLineDuration()
double influenceSpeed(SUMOTime currentTime, double speed, double vSafe, double vMin, double vMax)
Applies stored velocity information on the speed to use.
double changeRequestRemainingSeconds(const SUMOTime currentTime) const
Return the remaining number of seconds of the current laneTimeLine assuming one exists.
bool myConsiderSafeVelocity
Whether the safe velocity shall be regarded.
Definition MSVehicle.h:1628
bool mySpeedAdaptationStarted
Whether influencing the speed has already started.
Definition MSVehicle.h:1625
~Influencer()
Destructor.
void setSignals(int signals)
Definition MSVehicle.h:1583
double myLatDist
The requested lateral change.
Definition MSVehicle.h:1622
bool considerSpeedLimit() const
Returns whether speed limits shall be considered.
Definition MSVehicle.h:1538
bool myEmergencyBrakeRedLight
Whether red lights are a reason to brake.
Definition MSVehicle.h:1643
LaneChangeMode myRightDriveLC
changing to the rightmost lane
Definition MSVehicle.h:1666
void setSpeedTimeLine(const std::vector< std::pair< SUMOTime, double > > &speedTimeLine)
Sets a new velocity timeline.
void updateRemoteControlRoute(MSVehicle *v)
update route if provided by remote control
SUMOTime getLastAccessTimeStep() const
Definition MSVehicle.h:1563
bool myConsiderMaxAcceleration
Whether the maximum acceleration shall be regarded.
Definition MSVehicle.h:1634
LaneChangeMode myCooperativeLC
lane changing with the intent to help other vehicles
Definition MSVehicle.h:1662
bool isRemoteControlled() const
bool myRespectJunctionPriority
Whether the junction priority rules are respected (approaching)
Definition MSVehicle.h:1640
int influenceChangeDecision(const SUMOTime currentTime, const MSEdge &currentEdge, const int currentLaneIndex, int state)
Applies stored LaneChangeMode information and laneTimeLine.
void activateGapController(double originalTau, double newTimeHeadway, double newSpaceHeadway, double duration, double changeRate, double maxDecel, MSVehicle *refVeh=nullptr)
Activates the gap control with the given parameters,.
Container for manouevering time associated with stopping.
Definition MSVehicle.h:1273
SUMOTime myManoeuvreCompleteTime
Time at which this manoeuvre should complete.
Definition MSVehicle.h:1325
MSVehicle::ManoeuvreType getManoeuvreType() const
Accessor (get) for manoeuvre type.
std::string myManoeuvreStop
The name of the stop associated with the Manoeuvre - for debug output.
Definition MSVehicle.h:1319
bool manoeuvreIsComplete() const
Check if any manoeuver is ongoing and whether the completion time is beyond currentTime.
bool configureExitManoeuvre(MSVehicle *veh)
Setup the myManoeuvre for exiting (Sets completion time and manoeuvre type)
void setManoeuvreType(const MSVehicle::ManoeuvreType mType)
Accessor (set) for manoeuvre type.
Manoeuvre & operator=(const Manoeuvre &manoeuvre)
Assignment operator.
Manoeuvre()
Constructor.
ManoeuvreType myManoeuvreType
Manoeuvre type - currently entry, exit or none.
Definition MSVehicle.h:1328
double getGUIIncrement() const
Accessor for GUI rotation step when parking (radians)
SUMOTime myManoeuvreStartTime
Time at which the Manoeuvre for this stop started.
Definition MSVehicle.h:1322
bool operator!=(const Manoeuvre &manoeuvre)
Operator !=.
bool entryManoeuvreIsComplete(MSVehicle *veh)
Configure an entry manoeuvre if nothing is configured - otherwise check if complete.
bool manoeuvreIsComplete(const ManoeuvreType checkType) const
Check if specific manoeuver is ongoing and whether the completion time is beyond currentTime.
bool configureEntryManoeuvre(MSVehicle *veh)
Setup the entry manoeuvre for this vehicle (Sets completion time and manoeuvre type)
Container that holds the vehicles driving state (position+speed).
Definition MSVehicle.h:87
double myPosLat
the stored lateral position
Definition MSVehicle.h:140
State(double pos, double speed, double posLat, double backPos, double previousSpeed)
Constructor.
double myPreviousSpeed
the speed at the begin of the previous time step
Definition MSVehicle.h:148
double myPos
the stored position
Definition MSVehicle.h:134
bool operator!=(const State &state)
Operator !=.
double myLastCoveredDist
Definition MSVehicle.h:154
double mySpeed
the stored speed (should be >=0 at any time)
Definition MSVehicle.h:137
State & operator=(const State &state)
Assignment operator.
double pos() const
Position of this state.
Definition MSVehicle.h:107
double myBackPos
the stored back position
Definition MSVehicle.h:145
void passTime(SUMOTime dt, bool waiting)
const std::string getState() const
SUMOTime cumulatedWaitingTime(SUMOTime memory=-1) const
void setState(const std::string &state)
WaitingTimeCollector(SUMOTime memory=MSGlobals::gWaitingTimeMemory)
Constructor.
void registerEmergencyStop()
register emergency stop
SUMOVehicle * getVehicle(const std::string &id) const
Returns the vehicle with the given id.
void registerStopEnded()
register emergency stop
void registerEmergencyBraking()
register emergency stop
void removeVType(const MSVehicleType *vehType)
void registerOneWaiting()
increases the count of vehicles waiting for a transport to allow recognition of person / container re...
void unregisterOneWaiting()
decreases the count of vehicles waiting for a transport to allow recognition of person / container re...
void registerStopStarted()
register emergency stop
Abstract in-vehicle device.
Representation of a vehicle in the micro simulation.
Definition MSVehicle.h:77
void setManoeuvreType(const MSVehicle::ManoeuvreType mType)
accessor function to myManoeuvre equivalent
TraciLaneChangePriority
modes for prioritizing traci lane change requests
Definition MSVehicle.h:1151
@ LCP_OPPORTUNISTIC
Definition MSVehicle.h:1155
double getRightSideOnEdge(const MSLane *lane=0) const
Get the vehicle's lateral position on the edge of the given lane (or its current edge if lane == 0)
bool wasRemoteControlled(SUMOTime lookBack=DELTA_T) const
Returns the information whether the vehicle is fully controlled via TraCI within the lookBack time.
void processLinkApproaches(double &vSafe, double &vSafeMin, double &vSafeMinDist)
This method iterates through the driveprocess items for the vehicle and adapts the given in/out param...
const MSLane * getPreviousLane(const MSLane *current, int &furtherIndex) const
void checkLinkLeader(const MSLink *link, const MSLane *lane, double seen, DriveProcessItem *const lastLink, double &v, double &vLinkPass, double &vLinkWait, bool &setRequest, bool isShadowLink=false) const
checks for link leaders on the given link
void checkRewindLinkLanes(const double lengthsInFront, DriveItemVector &lfLinks) const
runs heuristic for keeping the intersection clear in case of downstream jamming
bool willStop() const
Returns whether the vehicle will stop on the current edge.
bool hasDriverState() const
Whether this vehicle is equipped with a MSDriverState.
Definition MSVehicle.h:996
static int nextLinkPriority(const std::vector< MSLane * > &conts)
get a numerical value for the priority of the upcoming link
double getTimeGapOnLane() const
Returns the time gap in seconds to the leader of the vehicle on the same lane.
void updateBestLanes(bool forceRebuild=false, const MSLane *startLane=0)
computes the best lanes to use in order to continue the route
bool myAmIdling
Whether the vehicle is trying to enter the network (eg after parking so engine is running)
Definition MSVehicle.h:1930
SUMOTime myWaitingTime
The time the vehicle waits (is not faster than 0.1m/s) in seconds.
Definition MSVehicle.h:1866
double getStopDelay() const
Returns the public transport stop delay in seconds.
double computeAngle() const
compute the current vehicle angle
double myTimeLoss
the time loss in seconds due to driving with less than maximum speed
Definition MSVehicle.h:1870
SUMOTime myLastActionTime
Action offset (actions are taken at time myActionOffset + N*getActionStepLength()) Initialized to 0,...
Definition MSVehicle.h:1885
ConstMSEdgeVector::const_iterator getRerouteOrigin() const
Returns the starting point for reroutes (usually the current edge)
bool hasArrivedInternal(bool oppositeTransformed=true) const
Returns whether this vehicle has already arived (reached the arrivalPosition on its final edge) metho...
double getFriction() const
Returns the current friction on the road as perceived by the friction device.
bool ignoreFoe(const SUMOTrafficObject *foe) const
decide whether a given foe object may be ignored
void boardTransportables(MSStop &stop)
board persons and load transportables at the given stop
const std::vector< const MSLane * > getUpcomingLanesUntil(double distance) const
Returns the upcoming (best followed by default 0) sequence of lanes to continue the route starting at...
bool isOnRoad() const
Returns the information whether the vehicle is on a road (is simulated)
Definition MSVehicle.h:605
void adaptLaneEntering2MoveReminder(const MSLane &enteredLane)
Adapts the vehicle's entering of a new lane.
void addTransportable(MSTransportable *transportable)
Adds a person or container to this vehicle.
SUMOTime myJunctionConflictEntryTime
Definition MSVehicle.h:1948
double getLeftSideOnEdge(const MSLane *lane=0) const
Get the vehicle's lateral position on the edge of the given lane (or its current edge if lane == 0)
PositionVector getBoundingPoly(double offset=0) const
get bounding polygon
void setTentativeLaneAndPosition(MSLane *lane, double pos, double posLat=0)
set tentative lane and position during insertion to ensure that all cfmodels work (some of them requi...
bool brakeForOverlap(const MSLink *link, const MSLane *lane) const
handle with transitions
void workOnMoveReminders(double oldPos, double newPos, double newSpeed)
Processes active move reminder.
bool isStoppedOnLane() const
double getDistanceToPosition(double destPos, const MSLane *destLane) const
bool brokeDown() const
Returns how long the vehicle has been stopped already due to lack of energy.
double myAcceleration
The current acceleration after dawdling in m/s.
Definition MSVehicle.h:1912
void registerInsertionApproach(MSLink *link, double dist)
register approach on insertion
void cleanupFurtherLanes()
remove vehicle from further lanes (on leaving the network)
void adaptToLeaders(const MSLeaderInfo &ahead, double latOffset, const double seen, DriveProcessItem *const lastLink, const MSLane *const lane, double &v, double &vLinkPass) const
const MSLane * getBackLane() const
Returns the lane the where the rear of the object is currently at.
void enterLaneAtInsertion(MSLane *enteredLane, double pos, double speed, double posLat, MSMoveReminder::Notification notification)
Update when the vehicle enters a new lane in the emit step.
double getBackPositionOnLane() const
Get the vehicle's position relative to its current lane.
Definition MSVehicle.h:405
void setPreviousSpeed(double prevSpeed, double prevAcceleration)
Sets the influenced previous speed.
SUMOTime getArrivalTime(SUMOTime t, double seen, double v, double arrivalSpeed) const
double getAccumulatedWaitingSeconds() const
Returns the number of seconds waited (speed was lesser than 0.1m/s) within the last millisecs.
Definition MSVehicle.h:714
SUMOTime getWaitingTime(const bool accumulated=false) const
Returns the SUMOTime waited (speed was lesser than 0.1m/s)
Definition MSVehicle.h:670
bool isFrontOnLane(const MSLane *lane) const
Returns the information whether the front of the vehicle is on the given lane.
virtual ~MSVehicle()
Destructor.
void processLaneAdvances(std::vector< MSLane * > &passedLanes, std::string &emergencyReason)
This method checks if the vehicle has advanced over one or several lanes along its route and triggers...
MSAbstractLaneChangeModel & getLaneChangeModel()
void setEmergencyBlueLight(SUMOTime currentTime)
sets the blue flashing light for emergency vehicles
bool isActionStep(SUMOTime t) const
Returns whether the next simulation step will be an action point for the vehicle.
Definition MSVehicle.h:635
MSAbstractLaneChangeModel * myLaneChangeModel
Definition MSVehicle.h:1892
Position getPositionAlongBestLanes(double offset) const
Return the (x,y)-position, which the vehicle would reach if it continued along its best continuation ...
bool hasValidRouteStart(std::string &msg)
checks wether the vehicle can depart on the first edge
double getLeftSideOnLane() const
Get the lateral position of the vehicles left side on the lane:
std::vector< MSLane * > myFurtherLanes
The information into which lanes the vehicle laps into.
Definition MSVehicle.h:1919
bool signalSet(int which) const
Returns whether the given signal is on.
Definition MSVehicle.h:1187
MSCFModel::VehicleVariables * myCFVariables
The per vehicle variables of the car following model.
Definition MSVehicle.h:2160
bool betterContinuation(const LaneQ *bestConnectedNext, const LaneQ &m) const
comparison between different continuations from the same lane
bool addTraciStop(SUMOVehicleParameter::Stop stop, std::string &errorMsg)
void checkLinkLeaderCurrentAndParallel(const MSLink *link, const MSLane *lane, double seen, DriveProcessItem *const lastLink, double &v, double &vLinkPass, double &vLinkWait, bool &setRequest) const
checks for link leaders of the current link as well as the parallel link (if there is one)
void planMoveInternal(const SUMOTime t, MSLeaderInfo ahead, DriveItemVector &lfLinks, double &myStopDist, std::pair< double, const MSLink * > &myNextTurn) const
std::pair< double, const MSLink * > myNextTurn
the upcoming turn for the vehicle
Definition MSVehicle.h:1916
double getDistanceToLeaveJunction() const
get the distance from the start of this lane to the start of the next normal lane (or 0 if this lane ...
int influenceChangeDecision(int state)
allow TraCI to influence a lane change decision
double getMaxSpeedOnLane() const
Returns the maximal speed for the vehicle on its current lane (including speed factor and deviation,...
bool isRemoteControlled() const
Returns the information whether the vehicle is fully controlled via TraCI.
bool myAmOnNet
Whether the vehicle is on the network (not parking, teleported, vaporized, or arrived)
Definition MSVehicle.h:1927
void enterLaneAtMove(MSLane *enteredLane, bool onTeleporting=false)
Update when the vehicle enters a new lane in the move step.
void adaptBestLanesOccupation(int laneIndex, double density)
update occupation from MSLaneChanger
std::pair< double, double > estimateTimeToNextStop() const
return time (s) and distance to the next stop
double accelThresholdForWaiting() const
maximum acceleration to consider a vehicle as 'waiting' at low speed
Definition MSVehicle.h:2074
void setAngle(double angle, bool straightenFurther=false)
Set a custom vehicle angle in rad, optionally updates furtherLanePosLat.
std::vector< LaneQ >::iterator myCurrentLaneInBestLanes
Definition MSVehicle.h:1907
void setApproachingForAllLinks()
Register junction approaches for all link items in the current plan.
double getDeltaPos(const double accel) const
calculates the distance covered in the next integration step given an acceleration and assuming the c...
const MSLane * myLastBestLanesInternalLane
Definition MSVehicle.h:1895
void updateOccupancyAndCurrentBestLane(const MSLane *startLane)
updates LaneQ::nextOccupation and myCurrentLaneInBestLanes
const std::vector< MSLane * > getUpstreamOppositeLanes() const
Returns the sequence of opposite lanes corresponding to past lanes.
WaitingTimeCollector myWaitingTimeCollector
Definition MSVehicle.h:1867
void setRemoteState(Position xyPos)
sets position outside the road network
void fixPosition()
repair errors in vehicle position after changing between internal edges
double getAcceleration() const
Returns the vehicle's acceleration in m/s (this is computed as the last step's mean acceleration in c...
Definition MSVehicle.h:514
double getSpeedWithoutTraciInfluence() const
Returns the uninfluenced velocity.
PositionVector getBoundingBox(double offset=0) const
get bounding rectangle
ManoeuvreType
flag identifying which, if any, manoeuvre is in progress
Definition MSVehicle.h:1246
@ MANOEUVRE_ENTRY
Manoeuvre into stopping place.
Definition MSVehicle.h:1248
@ MANOEUVRE_NONE
not manouevring
Definition MSVehicle.h:1252
@ MANOEUVRE_EXIT
Manoeuvre out of stopping place.
Definition MSVehicle.h:1250
const MSEdge * getNextEdgePtr() const
returns the next edge (possibly an internal edge)
Position getPosition(const double offset=0) const
Return current position (x/y, cartesian)
void setBrakingSignals(double vNext)
sets the braking lights on/off
const std::vector< MSLane * > & getBestLanesContinuation() const
Returns the best sequence of lanes to continue the route starting at myLane.
const MSEdge * myLastBestLanesEdge
Definition MSVehicle.h:1894
bool ignoreCollision() const
whether this vehicle is except from collision checks
Influencer * myInfluencer
An instance of a velocity/lane influencing instance; built in "getInfluencer".
Definition MSVehicle.h:2163
void saveState(OutputDevice &out)
Saves the states of a vehicle.
void onRemovalFromNet(const MSMoveReminder::Notification reason)
Called when the vehicle is removed from the network.
void planMove(const SUMOTime t, const MSLeaderInfo &ahead, const double lengthsInFront)
Compute safe velocities for the upcoming lanes based on positions and speeds from the last time step....
bool resumeFromStopping()
int getBestLaneOffset() const
void adaptToJunctionLeader(const std::pair< const MSVehicle *, double > leaderInfo, const double seen, DriveProcessItem *const lastLink, const MSLane *const lane, double &v, double &vLinkPass, double distToCrossing=-1) const
double lateralDistanceToLane(const int offset) const
Get the minimal lateral distance required to move fully onto the lane at given offset.
double getBackPositionOnLane(const MSLane *lane) const
Get the vehicle's position relative to the given lane.
Definition MSVehicle.h:398
void leaveLaneBack(const MSMoveReminder::Notification reason, const MSLane *leftLane)
Update of reminders if vehicle back leaves a lane during (during forward movement.
void resetActionOffset(const SUMOTime timeUntilNextAction=0)
Resets the action offset for the vehicle.
std::vector< DriveProcessItem > DriveItemVector
Container for used Links/visited Lanes during planMove() and executeMove.
Definition MSVehicle.h:2017
void interpolateLateralZ(Position &pos, double offset, double posLat) const
perform lateral z interpolation in elevated networks
void setBlinkerInformation()
sets the blue flashing light for emergency vehicles
const MSEdge * getCurrentEdge() const
Returns the edge the vehicle is currently at (possibly an internal edge or nullptr)
void adaptToLeaderDistance(const MSLeaderDistanceInfo &ahead, double latOffset, double seen, DriveProcessItem *const lastLink, double &v, double &vLinkPass) const
DriveItemVector::iterator myNextDriveItem
iterator pointing to the next item in myLFLinkLanes
Definition MSVehicle.h:2030
bool unsafeLinkAhead(const MSLane *lane, double zipperDist) const
whether the vehicle may safely move to the given lane with regard to upcoming links
void leaveLane(const MSMoveReminder::Notification reason, const MSLane *approachedLane=0)
Update of members if vehicle leaves a new lane in the lane change step or at arrival.
const MSLink * myHaveStoppedFor
Definition MSVehicle.h:1952
bool isIdling() const
Returns whether a sim vehicle is waiting to enter a lane (after parking has completed)
Definition MSVehicle.h:621
std::shared_ptr< MSSimpleDriverState > getDriverState() const
Returns the vehicle driver's state.
void removeApproachingInformation(const DriveItemVector &lfLinks) const
unregister approach from all upcoming links
SUMOTime myJunctionEntryTimeNeverYield
Definition MSVehicle.h:1947
double getLatOffset(const MSLane *lane) const
Get the offset that that must be added to interpret myState.myPosLat for the given lane.
bool rerouteParkingArea(const std::string &parkingAreaID, std::string &errorMsg)
bool hasArrived() const
Returns whether this vehicle has already arived (reached the arrivalPosition on its final edge)
void switchOffSignal(int signal)
Switches the given signal off.
Definition MSVehicle.h:1170
double getStopArrivalDelay() const
Returns the estimated public transport stop arrival delay in seconds.
int mySignals
State of things of the vehicle that can be on or off.
Definition MSVehicle.h:1924
bool setExitManoeuvre()
accessor function to myManoeuvre equivalent
bool isOppositeLane(const MSLane *lane) const
whether the give lane is reverse direction of the current route or not
double myStopDist
distance to the next stop or doubleMax if there is none
Definition MSVehicle.h:1938
Signalling
Some boolean values which describe the state of some vehicle parts.
Definition MSVehicle.h:1105
@ VEH_SIGNAL_BLINKER_RIGHT
Right blinker lights are switched on.
Definition MSVehicle.h:1109
@ VEH_SIGNAL_BRAKELIGHT
The brake lights are on.
Definition MSVehicle.h:1115
@ VEH_SIGNAL_EMERGENCY_BLUE
A blue emergency light is on.
Definition MSVehicle.h:1131
@ VEH_SIGNAL_BLINKER_LEFT
Left blinker lights are switched on.
Definition MSVehicle.h:1111
SUMOTime getActionStepLength() const
Returns the vehicle's action step length in millisecs, i.e. the interval between two action points.
Definition MSVehicle.h:525
bool myHaveToWaitOnNextLink
Definition MSVehicle.h:1932
SUMOTime collisionStopTime() const
Returns the remaining time a vehicle needs to stop due to a collision. A negative value indicates tha...
const std::vector< const MSLane * > getPastLanesUntil(double distance) const
Returns the sequence of past lanes (right-most on edge) based on the route starting at the current la...
double getBestLaneDist() const
returns the distance that can be driven without lane change
void replaceVehicleType(const MSVehicleType *type)
Replaces the current vehicle type by the one given.
void updateState(double vNext, bool parking=false)
updates the vehicles state, given a next value for its speed. This value can be negative in case of t...
double slowDownForSchedule(double vMinComfortable) const
optionally return an upper bound on speed to stay within the schedule
bool executeMove()
Executes planned vehicle movements with regards to right-of-way.
const MSLane * getLane() const
Returns the lane the vehicle is on.
Definition MSVehicle.h:581
std::pair< const MSVehicle *const, double > getFollower(double dist=0) const
Returns the follower of the vehicle looking for a fixed distance.
SUMOTime getWaitingTimeFor(const MSLink *link) const
getWaitingTime, but taking into account having stopped for a stop-link
ChangeRequest
Requests set via TraCI.
Definition MSVehicle.h:191
@ REQUEST_HOLD
vehicle want's to keep the current lane
Definition MSVehicle.h:199
@ REQUEST_LEFT
vehicle want's to change to left lane
Definition MSVehicle.h:195
@ REQUEST_NONE
vehicle doesn't want to change
Definition MSVehicle.h:193
@ REQUEST_RIGHT
vehicle want's to change to right lane
Definition MSVehicle.h:197
bool isLeader(const MSLink *link, const MSVehicle *veh, const double gap) const
whether the given vehicle must be followed at the given junction
void resetApproachOnReroute()
reset rail signal approach information
void computeFurtherLanes(MSLane *enteredLane, double pos, bool collision=false)
updates myFurtherLanes on lane insertion or after collision
MSLane * getMutableLane() const
Returns the lane the vehicle is on Non const version indicates that something volatile is going on.
Definition MSVehicle.h:589
std::pair< const MSLane *, double > getLanePosAfterDist(double distance) const
return lane and position along bestlanes at the given distance
SUMOTime myCollisionImmunity
amount of time for which the vehicle is immune from collisions
Definition MSVehicle.h:1941
bool passingMinor() const
decide whether the vehicle is passing a minor link or has comitted to do so
void updateWaitingTime(double vNext)
Updates the vehicle's waiting time counters (accumulated and consecutive)
void enterLaneAtLaneChange(MSLane *enteredLane)
Update when the vehicle enters a new lane in the laneChange step.
BaseInfluencer & getBaseInfluencer()
Returns the velocity/lane influencer.
Influencer & getInfluencer()
bool isBidiOn(const MSLane *lane) const
whether this vehicle is driving against lane
double getRightSideOnLane() const
Get the lateral position of the vehicles right side on the lane:
double getCurrentApparentDecel() const
get apparent deceleration based on vType parameters and current acceleration
double updateFurtherLanes(std::vector< MSLane * > &furtherLanes, std::vector< double > &furtherLanesPosLat, const std::vector< MSLane * > &passedLanes)
update a vector of further lanes and return the new backPos
DriveItemVector myLFLinkLanesPrev
planned speeds from the previous step for un-registering from junctions after the new container is fi...
Definition MSVehicle.h:2023
std::vector< std::vector< LaneQ > > myBestLanes
Definition MSVehicle.h:1902
void setActionStepLength(double actionStepLength, bool resetActionOffset=true)
Sets the action steplength of the vehicle.
double getLateralPositionOnLane() const
Get the vehicle's lateral position on the lane.
Definition MSVehicle.h:413
double getSlope() const
Returns the slope of the road at vehicle's position in degrees.
bool myActionStep
The flag myActionStep indicates whether the current time step is an action point for the vehicle.
Definition MSVehicle.h:1882
const Position getBackPosition() const
bool congested() const
void loadState(const SUMOSAXAttributes &attrs, const SUMOTime offset)
Loads the state of this vehicle from the given description.
SUMOTime myTimeSinceStartup
duration of driving (speed > SUMO_const_haltingSpeed) after the last halting episode
Definition MSVehicle.h:1951
double getSpeed() const
Returns the vehicle's current speed.
Definition MSVehicle.h:490
SUMOTime remainingStopDuration() const
Returns the remaining stop duration for a stopped vehicle or 0.
bool keepStopping(bool afterProcessing=false) const
Returns whether the vehicle is stopped and must continue to do so.
void workOnIdleReminders()
cycle through vehicle devices invoking notifyIdle
static std::vector< MSLane * > myEmptyLaneVector
Definition MSVehicle.h:1909
Position myCachedPosition
Definition MSVehicle.h:1943
bool replaceRoute(ConstMSRoutePtr route, const std::string &info, bool onInit=false, int offset=0, bool addStops=true, bool removeStops=true, std::string *msgReturn=nullptr)
Replaces the current route by the given one.
MSVehicle::ManoeuvreType getManoeuvreType() const
accessor function to myManoeuvre equivalent
double checkReversal(bool &canReverse, double speedThreshold=SUMO_const_haltingSpeed, double seen=0) const
void updateLaneBruttoSum()
Update the lane brutto occupancy after a change in minGap.
void removePassedDriveItems()
Erase passed drive items from myLFLinkLanes (and unregister approaching information for corresponding...
const std::vector< MSLane * > & getFurtherLanes() const
Definition MSVehicle.h:835
const std::vector< LaneQ > & getBestLanes() const
Returns the description of best lanes to use in order to continue the route.
std::vector< double > myFurtherLanesPosLat
lateral positions on further lanes
Definition MSVehicle.h:1921
bool checkActionStep(const SUMOTime t)
Returns whether the vehicle is supposed to take action in the current simulation step Updates myActio...
const MSCFModel & getCarFollowModel() const
Returns the vehicle's car following model definition.
Definition MSVehicle.h:969
Position validatePosition(Position result, double offset=0) const
ensure that a vehicle-relative position is not invalid
void loadPreviousApproaching(MSLink *link, bool setRequest, SUMOTime arrivalTime, double arrivalSpeed, double arrivalSpeedBraking, double dist, double leaveSpeed)
bool keepClear(const MSLink *link) const
decide whether the given link must be kept clear
bool manoeuvreIsComplete() const
accessor function to myManoeuvre equivalent
double processNextStop(double currentVelocity)
Processes stops, returns the velocity needed to reach the stop.
double myAngle
the angle in radians (
Definition MSVehicle.h:1935
bool ignoreRed(const MSLink *link, bool canBrake) const
decide whether a red (or yellow light) may be ignored
double getPositionOnLane() const
Get the vehicle's position along the lane.
Definition MSVehicle.h:374
void updateTimeLoss(double vNext)
Updates the vehicle's time loss.
MSDevice_DriverState * myDriverState
This vehicle's driver state.
Definition MSVehicle.h:1876
bool joinTrainPart(MSVehicle *veh)
try joining the given vehicle to the rear of this one (to resolve joinTriggered)
MSLane * myLane
The lane the vehicle is on.
Definition MSVehicle.h:1890
bool onFurtherEdge(const MSEdge *edge) const
whether this vehicle has its back (and no its front) on the given edge
double processTraCISpeedControl(double vSafe, double vNext)
Check for speed advices from the traci client and adjust the speed vNext in the current (euler) / aft...
Manoeuvre myManoeuvre
Definition MSVehicle.h:1335
double getLateralOverlap() const
return the amount by which the vehicle extends laterally outside it's primary lane
double getAngle() const
Returns the vehicle's direction in radians.
Definition MSVehicle.h:735
bool handleCollisionStop(MSStop &stop, const double distToStop)
bool hasInfluencer() const
whether the vehicle is individually influenced (via TraCI or special parameters)
Definition MSVehicle.h:1690
MSDevice_Friction * myFrictionDevice
This vehicle's friction perception.
Definition MSVehicle.h:1879
double getPreviousSpeed() const
Returns the vehicle's speed before the previous time step.
Definition MSVehicle.h:498
MSVehicle()
invalidated default constructor
bool joinTrainPartFront(MSVehicle *veh)
try joining the given vehicle to the front of this one (to resolve joinTriggered)
void updateActionOffset(const SUMOTime oldActionStepLength, const SUMOTime newActionStepLength)
Process an updated action step length value (only affects the vehicle's action offset,...
double getBrakeGap(bool delayed=false) const
get distance for coming to a stop (used for rerouting checks)
std::pair< const MSVehicle *const, double > getLeader(double dist=0, bool considerFoes=true) const
Returns the leader of the vehicle looking for a fixed distance.
void executeFractionalMove(double dist)
move vehicle forward by the given distance during insertion
LaneChangeMode
modes for resolving conflicts between external control (traci) and vehicle control over lane changing...
Definition MSVehicle.h:1143
virtual void drawOutsideNetwork(bool)
register vehicle for drawing while outside the network
Definition MSVehicle.h:1841
void initDevices()
void adaptToOncomingLeader(const std::pair< const MSVehicle *, double > leaderInfo, DriveProcessItem *const lastLink, double &v, double &vLinkPass) const
State myState
This Vehicles driving state (pos and speed)
Definition MSVehicle.h:1873
double getCenterOnEdge(const MSLane *lane=0) const
Get the vehicle's lateral position on the edge of the given lane (or its current edge if lane == 0)
void adaptToLeader(const std::pair< const MSVehicle *, double > leaderInfo, double seen, DriveProcessItem *const lastLink, double &v, double &vLinkPass) const
void switchOnSignal(int signal)
Switches the given signal on.
Definition MSVehicle.h:1162
static bool overlap(const MSVehicle *veh1, const MSVehicle *veh2)
Definition MSVehicle.h:763
int getLaneIndex() const
void updateParkingState()
update state while parking
DriveItemVector myLFLinkLanes
container for the planned speeds in the current step
Definition MSVehicle.h:2020
void updateDriveItems()
Check whether the drive items (myLFLinkLanes) are up to date, and update them if required.
SUMOTime myJunctionEntryTime
time at which the current junction was entered
Definition MSVehicle.h:1946
static MSVehicleTransfer * getInstance()
Returns the instance of this object.
void remove(MSVehicle *veh)
Remove a vehicle from this transfer object.
The car-following model and parameter.
double getLengthWithGap() const
Get vehicle's length including the minimum gap [m].
double getWidth() const
Get the width which vehicles of this class shall have when being drawn.
SUMOVehicleClass getVehicleClass() const
Get this vehicle type's vehicle class.
double getMaxSpeed() const
Get vehicle's (technical) maximum speed [m/s].
const std::string & getID() const
Returns the name of the vehicle type.
double getMinGap() const
Get the free space in front of vehicles of this class.
LaneChangeModel getLaneChangeModel() const
void setLength(const double &length)
Set a new value for this type's length.
SUMOTime getExitManoeuvreTime(const int angle) const
Accessor function for parameter equivalent returning exit time for a specific manoeuver angle.
const MSCFModel & getCarFollowModel() const
Returns the vehicle type's car following model definition (const version)
bool isVehicleSpecific() const
Returns whether this type belongs to a single vehicle only (was modified)
void setActionStepLength(const SUMOTime actionStepLength, bool resetActionOffset)
Set a new value for this type's action step length.
double getLength() const
Get vehicle's length [m].
SUMOVehicleShape getGuiShape() const
Get this vehicle type's shape.
SUMOTime getEntryManoeuvreTime(const int angle) const
Accessor function for parameter equivalent returning entry time for a specific manoeuver angle.
const SUMOVTypeParameter & getParameter() const
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 storage of an output device and its base (abstract) implementation.
OutputDevice & writeAttr(const SumoXMLAttr attr, const T &val)
writes a named attribute
bool closeTag(const std::string &comment="")
Closes the most recently opened tag and optionally adds a comment.
bool hasParameter(const std::string &key) const
Returns whether the parameter is set.
virtual const std::string getParameter(const std::string &key, const std::string defaultValue="") const
Returns the value for a given key.
void writeParams(OutputDevice &device) const
write Params in the given outputdevice
A point in 2D or 3D with translation and scaling methods.
Definition Position.h:37
double slopeTo2D(const Position &other) const
returns the slope of the vector pointing from here to the other position (in radians between -M_PI an...
Definition Position.h:288
static const Position INVALID
used to indicate that a position is valid
Definition Position.h:319
double distanceTo2D(const Position &p2) const
returns the euclidean distance in the x-y-plane
Definition Position.h:273
void setz(double z)
set position z
Definition Position.h:77
double z() const
Returns the z-position.
Definition Position.h:62
double angleTo2D(const Position &other) const
returns the angle in the plane of the vector pointing from here to the other position (in radians bet...
Definition Position.h:283
A list of positions.
double length2D() const
Returns the length.
void append(const PositionVector &v, double sameThreshold=2.0)
double rotationAtOffset(double pos) const
Returns the rotation at the given length.
Position positionAtOffset(double pos, double lateralOffset=0) const
Returns the position at the given length.
void move2side(double amount, double maxExtension=100)
move position vector to side using certain amount
double slopeDegreeAtOffset(double pos) const
Returns the slope at the given length.
void extrapolate2D(const double val, const bool onlyFirst=false)
extrapolate position vector in two dimensions (Z is ignored)
void scaleRelative(double factor)
enlarges/shrinks the polygon by a factor based at the centroid
PositionVector reverse() const
reverse position vector
static double rand(SumoRNG *rng=nullptr)
Returns a random real number in [0, 1)
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.
virtual std::string getString(int id, bool *isPresent=nullptr) 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.
double getFloat(int id) const
Returns the double-value of the named (by its enum-value) attribute.
Representation of a vehicle, person, or container.
virtual const MSVehicleType & getVehicleType() const =0
Returns the object's "vehicle" type.
virtual double getSpeed() const =0
Returns the object's current speed.
double locomotiveLength
the length of the locomotive
double speedFactorPremature
the possible speed reduction when a train is ahead of schedule
double getLCParam(const SumoXMLAttr attr, const double defaultValue) const
Returns the named value from the map, or the default if it is not contained there.
double getJMParam(const SumoXMLAttr attr, const double defaultValue) const
Returns the named value from the map, or the default if it is not contained there.
Representation of a vehicle.
Definition SUMOVehicle.h:62
Definition of vehicle stop (position and duration)
SUMOTime started
the time at which this stop was reached
ParkingType parking
whether the vehicle is removed from the net while stopping
SUMOTime extension
The maximum time extension for boarding / loading.
std::string split
the id of the vehicle (train portion) that splits of upon reaching this stop
double startPos
The stopping position start.
std::string line
the new line id of the trip within a cyclical public transport route
double posLat
the lateral offset when stopping
bool onDemand
whether the stop may be skipped
std::string join
the id of the vehicle (train portion) to which this vehicle shall be joined
SUMOTime until
The time at which the vehicle may continue its journey.
SUMOTime ended
the time at which this stop was ended
double endPos
The stopping position end.
SUMOTime waitUntil
The earliest pickup time for a taxi stop.
std::string tripId
id of the trip within a cyclical public transport route
bool collision
Whether this stop was triggered by a collision.
SUMOTime arrival
The (expected) time at which the vehicle reaches the stop.
SUMOTime duration
The stopping duration.
Structure representing possible vehicle parameter.
int departLane
(optional) The lane the vehicle shall depart from (index in edge)
ArrivalSpeedDefinition arrivalSpeedProcedure
Information how the vehicle's end speed shall be chosen.
double departSpeed
(optional) The initial speed of the vehicle
std::vector< std::string > via
List of the via-edges the vehicle must visit.
ArrivalLaneDefinition arrivalLaneProcedure
Information how the vehicle shall choose the lane to arrive on.
long long int parametersSet
Information for the router which parameter were set, TraCI may modify this (when changing color)
DepartLaneDefinition departLaneProcedure
Information how the vehicle shall choose the lane to depart from.
bool wasSet(long long int what) const
Returns whether the given parameter was set.
DepartSpeedDefinition departSpeedProcedure
Information how the vehicle's initial speed shall be chosen.
double arrivalPos
(optional) The position the vehicle shall arrive on
ArrivalPosDefinition arrivalPosProcedure
Information how the vehicle shall choose the arrival position.
double arrivalSpeed
(optional) The final speed of the vehicle (not used yet)
int arrivalEdge
(optional) The final edge within the route of the vehicle
DepartPosDefinition departPosProcedure
Information how the vehicle shall choose the departure position.
static SUMOTime processActionStepLength(double given)
Checks and converts given value for the action step length from seconds to miliseconds assuring it be...
std::vector< std::string > getVector()
return vector of strings
#define DEBUG_COND
Definition json.hpp:4471
NLOHMANN_BASIC_JSON_TPL_DECLARATION void swap(nlohmann::NLOHMANN_BASIC_JSON_TPL &j1, nlohmann::NLOHMANN_BASIC_JSON_TPL &j2) noexcept(//NOLINT(readability-inconsistent-declaration-parameter-name) is_nothrow_move_constructible< nlohmann::NLOHMANN_BASIC_JSON_TPL >::value &&//NOLINT(misc-redundant-expression) is_nothrow_move_assignable< nlohmann::NLOHMANN_BASIC_JSON_TPL >::value)
exchanges the values of two JSON objects
Definition json.hpp:21884
#define M_PI
Definition odrSpiral.cpp:45
Drive process items represent bounds on the safe velocity corresponding to the upcoming links.
Definition MSVehicle.h:1959
void adaptStopSpeed(const double v)
Definition MSVehicle.h:2006
double getLeaveSpeed() const
Definition MSVehicle.h:2010
void adaptLeaveSpeed(const double v)
Definition MSVehicle.h:1998
static std::map< const MSVehicle *, GapControlState * > refVehMap
stores reference vehicles currently in use by a gapController
Definition MSVehicle.h:1408
static GapControlVehStateListener * myVehStateListener
Definition MSVehicle.h:1411
void activate(double tauOriginal, double tauTarget, double additionalGap, double duration, double changeRate, double maxDecel, const MSVehicle *refVeh)
Start gap control with given params.
static void cleanup()
Static cleanup (removes vehicle state listener)
void deactivate()
Stop gap control.
static void init()
Static initalization (adds vehicle state listener)
A structure representing the best lanes for continuing the current route starting at 'lane'.
Definition MSVehicle.h:857
double length
The overall length which may be driven when using this lane without a lane change.
Definition MSVehicle.h:861
bool allowsContinuation
Whether this lane allows to continue the drive.
Definition MSVehicle.h:871
double nextOccupation
As occupation, but without the first lane.
Definition MSVehicle.h:867
std::vector< MSLane * > bestContinuations
Definition MSVehicle.h:877
MSLane * lane
The described lane.
Definition MSVehicle.h:859
double currentLength
The length which may be driven on this lane.
Definition MSVehicle.h:863
int bestLaneOffset
The (signed) number of lanes to be crossed to get to the lane which allows to continue the drive.
Definition MSVehicle.h:869
double occupation
The overall vehicle sum on consecutive lanes which can be passed without a lane change.
Definition MSVehicle.h:865