Dynamical System Framework
Loading...
Searching...
No Matches
dsf::mobility Namespace Reference

Traffic model: road networks, junctions, agents and dynamics. More...

Classes

class  Agent
 The Agent class represents an agent in the network. More...
class  AgentComparator
struct  AgentStats
 Agent counters of a FirstOrderDynamics. More...
struct  AgentStreetRecord
 The passage of an agent through a street. More...
struct  AverageStatsRecord
struct  ConditionalOrigin
 An origin weight with its conditional (destination, weight) pairs. More...
class  Counter
 The Counter class is used to count events. More...
class  FirstOrderDynamics
 The FirstOrderDynamics class represents the dynamics of the network. More...
class  Intersection
 The Intersection class represents a node in the network. More...
struct  Lane
 A lane of a street: its exit queue, the turns it serves and its exit gate. More...
struct  ODEntry
 An origin-destination pair with an associated weight. More...
class  Road
 The Road class represents a road in the network. More...
class  RoadJunction
class  RoadNetwork
 The RoadNetwork class represents a graph in the network. More...
class  Roundabout
 The Roundabout class represents a roundabout node in the network. More...
class  Router
 Plans routes on a road network with the A* algorithm. More...
class  Station
struct  StepDataRequest
struct  StepDataResult
class  Street
 The Street class represents a street in the network. More...
struct  StreetDataRecord
class  TrafficLight
class  TrafficLightPhase
 One phase in a TrafficLight program. More...
class  TrafficSimulator
struct  TravelRecord
 The distance travelled by an agent and its travel time. More...
struct  WeightedId
 An id with an associated weight (e.g. an origin or a destination). More...

Typedefs

using TurnCountsDict

Enumerations

enum class  AgentInsertionMethod : std::uint8_t {
  RANDOM = 0 , RANDOM_WEIGHTED_ORIGIN , ODS = 2 , RANDOM_ODS ,
  UNIFORM = 4 , CONDITIONAL_RANDOM_ODS
}
 The method for inserting agents into the network.
enum class  DynamicsMode : std::uint8_t { EDGES = 0 , NODES = 1 }
 How the ids of origins, destinations and OD pairs are interpreted. More...
enum class  RoadStatus : std::uint8_t { OPEN = 0 , CLOSED = 1 }
enum class  RouteWeights : std::uint8_t { FREE_FLOW = 0 , CURRENT = 1 }
 The street costs a route is planned on. More...
enum class  RouteAlgorithm : std::uint8_t { ASTAR = 0 , DIJKSTRA = 1 }
 The search algorithm of the routes. More...
enum class  CounterPosition : uint8_t { ENTRY = 0 , MIDDLE = 1 , EXIT = 2 }
 The position of the counter on the street.

Detailed Description

Traffic model: road networks, junctions, agents and dynamics.

This file contains the definition of the Intersection class. The Intersection class represents a node in the road network. It is derived from the Node class and has a multimap of agents waiting to pass through the intersection. Agents are ordered by their angle difference, emulating real-world precedence.

This file contains the definition of the Roundabout class. The Roundabout class represents a roundabout node in the road network. It is derived from the Node class and has a queue of agents waiting to exit the roundabout.

Typedef Documentation

◆ TurnCountsDict

using dsf::mobility::TurnCountsDict
Initial value:
tbb::concurrent_unordered_map<Id, tbb::concurrent_unordered_map<Id, std::size_t>>

Enumeration Type Documentation

◆ DynamicsMode

enum class dsf::mobility::DynamicsMode : std::uint8_t
strong

How the ids of origins, destinations and OD pairs are interpreted.

Enumerator
EDGES 

Ids are street ids: agents start from the origin street's source node and travel it, and arrive at the end of the destination street, after travelling it.

NODES 

Ids are node ids, each spread over the node's outgoing streets for an origin and over its ingoing streets for a destination: agents start from and arrive at the node.

◆ RouteAlgorithm

enum class dsf::mobility::RouteAlgorithm : std::uint8_t
strong

The search algorithm of the routes.

Enumerator
ASTAR 

A*, with the straight-line distance heuristic when coordinates allow it.

DIJKSTRA 

Dijkstra's algorithm.

◆ RouteWeights

enum class dsf::mobility::RouteWeights : std::uint8_t
strong

The street costs a route is planned on.

Enumerator
FREE_FLOW 

The free-flow travel time of each street, i.e. length / maxSpeed.

CURRENT 

The network's weight function (see Router::setEdgeWeight), as of the last snapshot (see Router::updateCurrentWeights).