Eclipse SUMO - Simulation of Urban MObility
Loading...
Searching...
No Matches
PedestrianRouter.h
Go to the documentation of this file.
1/****************************************************************************/
2// Eclipse SUMO, Simulation of Urban MObility; see https://eclipse.dev/sumo
3// Copyright (C) 2001-2023 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/****************************************************************************/
18// The Pedestrian Router builds a special network and delegates to a SUMOAbstractRouter.
19/****************************************************************************/
20#pragma once
21#include <config.h>
22
23#include <string>
24#include <vector>
25#include <algorithm>
26#include <assert.h>
30#include "SUMOAbstractRouter.h"
31#include "DijkstraRouter.h"
32#include "IntermodalNetwork.h"
33
34//#define PedestrianRouter_DEBUG_ROUTES
35
36
37// ===========================================================================
38// class definitions
39// ===========================================================================
44template<class E, class L, class N, class V>
45class PedestrianRouter : public SUMOAbstractRouter<E, IntermodalTrip<E, N, V> > {
46private:
51
52public:
55 SUMOAbstractRouter<E, _IntermodalTrip>("PedestrianRouter", true, nullptr, nullptr, false, false), myAmClone(false) {
56 myPedNet = new _IntermodalNetwork(E::getAllEdges(), true);
59 nullptr, false, nullptr, true);
60 }
61
63 SUMOAbstractRouter<E, _IntermodalTrip>("PedestrianRouterClone", true, nullptr, nullptr, false, false), myAmClone(true) {
64 myPedNet = net;
67 nullptr, false, nullptr, true);
68 }
69
72 delete myInternalRouter;
73 if (!myAmClone) {
74 delete myPedNet;
75 }
76 }
77
81
84 double compute(const E* from, const E* to, double departPos, double arrivalPos, double speed,
85 SUMOTime msTime, const N* onlyNode, std::vector<const E*>& into, bool allEdges = false) {
86 if (getSidewalk<E, L>(from) == 0) {
87 WRITE_WARNINGF(TL("Departure edge '%' does not allow pedestrians."), from->getID());
88 return false;
89 }
90 if (getSidewalk<E, L>(to) == 0) {
91 WRITE_WARNINGF(TL("Destination edge '%' does not allow pedestrians."), to->getID());
92 return false;
93 }
94 _IntermodalTrip trip(from, to, departPos, arrivalPos, speed, msTime, onlyNode);
95 std::vector<const _IntermodalEdge*> intoPed;
96 const bool success = myInternalRouter->compute(myPedNet->getDepartConnector(from),
98 &trip, msTime, intoPed);
99 double time = 0.;
100 if (success) {
101 for (const _IntermodalEdge* pedEdge : intoPed) {
102 if (pedEdge->includeInRoute(allEdges)) {
103 into.push_back(pedEdge->getEdge());
104 }
105 time += myInternalRouter->getEffort(pedEdge, &trip, time);
106 }
107 }
108#ifdef PedestrianRouter_DEBUG_ROUTES
109 std::cout << TIME2STEPS(msTime) << " trip from " << from->getID() << " to " << to->getID()
110 << " departPos=" << departPos
111 << " arrivalPos=" << arrivalPos
112 << " onlyNode=" << (onlyNode == 0 ? "NULL" : onlyNode->getID())
113 << " edges=" << toString(intoPed)
114 << " resultEdges=" << toString(into)
115 << " time=" << time
116 << "\n";
117#endif
118 return success ? time : -1.;
119 }
120
123 bool compute(const E*, const E*, const _IntermodalTrip* const,
124 SUMOTime, std::vector<const E*>&, bool) {
125 throw ProcessError(TL("Do not use this method"));
126 }
127
128 void prohibit(const std::vector<E*>& toProhibit) {
129 std::vector<_IntermodalEdge*> toProhibitPE;
130 for (typename std::vector<E*>::const_iterator it = toProhibit.begin(); it != toProhibit.end(); ++it) {
131 toProhibitPE.push_back(myPedNet->getBothDirections(*it).first);
132 toProhibitPE.push_back(myPedNet->getBothDirections(*it).second);
133 }
134 myInternalRouter->prohibit(toProhibitPE);
135 }
136
137private:
138 const bool myAmClone;
141
142
143private:
146
147};
long long int SUMOTime
Definition GUI.h:36
#define WRITE_WARNINGF(...)
Definition MsgHandler.h:271
#define TL(string)
Definition MsgHandler.h:287
#define TIME2STEPS(x)
Definition SUMOTime.h:57
double gWeightsRandomFactor
Definition StdDefs.cpp:31
std::string toString(const T &t, std::streamsize accuracy=gPrecision)
Definition ToString.h:46
Computes the shortest path through a network using the Dijkstra algorithm.
bool compute(const E *from, const E *to, const V *const vehicle, SUMOTime msTime, std::vector< const E * > &into, bool silent=false)
Builds the route between the given edges using the minimum effort at the given time The definition of...
the base edge type that is given to the internal router (SUMOAbstractRouter)
static double getTravelTimeStatic(const IntermodalEdge *const edge, const IntermodalTrip< E, N, V > *const trip, double time)
static double getTravelTimeStaticRandomized(const IntermodalEdge *const edge, const IntermodalTrip< E, N, V > *const trip, double time)
the intermodal network storing edges, connections and the mappings to the "real" edges
const std::vector< _IntermodalEdge * > & getAllEdges()
_IntermodalEdge * getArrivalConnector(const E *e, const int splitIndex=0) const
Returns the arriving intermodal connector at the given split offset.
const EdgePair & getBothDirections(const E *e) const
Returns the pair of forward and backward edge.
_IntermodalEdge * getDepartConnector(const E *e, const int splitIndex=0) const
Returns the departing intermodal connector at the given split offset.
the "vehicle" type that is given to the internal router (SUMOAbstractRouter)
void prohibit(const std::vector< E * > &toProhibit)
PedestrianRouter & operator=(const PedestrianRouter &s)
Invalidated assignment operator.
DijkstraRouter< _IntermodalEdge, _IntermodalTrip > _InternalRouter
_IntermodalNetwork * myPedNet
IntermodalTrip< E, N, V > _IntermodalTrip
PedestrianRouter(_IntermodalNetwork *net)
IntermodalNetwork< E, L, N, V > _IntermodalNetwork
bool compute(const E *, const E *, const _IntermodalTrip *const, SUMOTime, std::vector< const E * > &, bool)
Builds the route between the given edges using the minimum effort at the given time The definition of...
PedestrianRouter()
Constructor.
IntermodalEdge< E, L, N, V > _IntermodalEdge
virtual SUMOAbstractRouter< E, _IntermodalTrip > * clone()
double compute(const E *from, const E *to, double departPos, double arrivalPos, double speed, SUMOTime msTime, const N *onlyNode, std::vector< const E * > &into, bool allEdges=false)
Builds the route between the given edges using the minimum effort at the given time The definition of...
virtual ~PedestrianRouter()
Destructor.
_InternalRouter * myInternalRouter
virtual void prohibit(const std::vector< E * > &toProhibit)
double getEffort(const E *const e, const V *const v, double t) const