Merge branch 'main' into statprob

Author: Grufoony

src/dsf/bindings.cpp

@@ -475,6 +475,7 @@ PYBIND11_MODULE(dsf_cpp, m) {
            dsf::g_docstrings.at("dsf::mobility::RoadDynamics::initTurnCounts").c_str())
       .def("updatePaths",
            &dsf::mobility::FirstOrderDynamics::updatePaths,
+           pybind11::arg("throw_on_empty") = true,
            dsf::g_docstrings.at("dsf::mobility::RoadDynamics::updatePaths").c_str())
       .def(
           "addAgentsUniformly",

src/dsf/dsf.hpp

@@ -6,7 +6,7 @@
 
 static constexpr uint8_t DSF_VERSION_MAJOR = 4;
 static constexpr uint8_t DSF_VERSION_MINOR = 4;
-static constexpr uint8_t DSF_VERSION_PATCH = 6;
+static constexpr uint8_t DSF_VERSION_PATCH = 9;
 
 static auto const DSF_VERSION =
     std::format("{}.{}.{}", DSF_VERSION_MAJOR, DSF_VERSION_MINOR, DSF_VERSION_PATCH);

src/dsf/mobility/Itinerary.cpp

@@ -36,9 +36,6 @@ namespace dsf::mobility {
     m_path = std::move(pathCollection);
   }
 
-  Id Itinerary::id() const { return m_id; }
-  Id Itinerary::destination() const { return m_destination; }
-  PathCollection const& Itinerary::path() const { return m_path; }
   void Itinerary::save(const std::string& fileName) const {
     // Open binary file
     std::ofstream outFile{fileName, std::ios::binary};

src/dsf/mobility/Itinerary.hpp

@@ -48,13 +48,16 @@ namespace dsf::mobility {
 
     /// @brief Get the itinerary's id
     /// @return Id, The itinerary's id
-    Id id() const;
+    inline auto id() const noexcept { return m_id; };
     /// @brief Get the itinerary's destination
     /// @return Id, The itinerary's destination
-    Id destination() const;
+    inline auto destination() const noexcept { return m_destination; };
     /// @brief Get the itinerary's path
     /// @return PathCollection const&, The itinerary's path
-    PathCollection const& path() const;
+    inline auto const& path() const noexcept { return m_path; };
+    /// @brief Check if the itinerary's path is empty
+    /// @return true if the itinerary's path is empty, false otherwise
+    inline auto empty() const noexcept { return m_path.empty(); };
     /// @brief Save the itinerary to a binary file
     /// @param fileName The name of the file to save the itinerary to
     void save(const std::string& fileName) const;

src/dsf/mobility/RoadDynamics.hpp

@@ -191,7 +191,10 @@ namespace dsf::mobility {
     void resetTurnCounts();
 
     /// @brief Update the paths of the itineraries based on the given weight function
-    void updatePaths();
+    /// @param throw_on_empty If true, throws an exception if an itinerary has an empty path (default is true)
+    /// If false, removes the itinerary with empty paths and the associated node from the origin/destination nodes
+    /// @throws std::runtime_error if throw_on_empty is true and an itinerary has an empty path
+    void updatePaths(bool const throw_on_empty = true);
     /// @brief Add agents uniformly on the road network
     /// @param nAgents The number of agents to add
     /// @param itineraryId The id of the itinerary to use (default is std::nullopt)
@@ -413,7 +416,6 @@ namespace dsf::mobility {
     for (auto const& [nodeId, weight] : this->m_destinationNodes) {
       m_itineraries.emplace(nodeId, std::make_unique<Itinerary>(nodeId, nodeId));
     }
-    // updatePaths();
     std::for_each(
         this->graph().edges().cbegin(),
         this->graph().edges().cend(),
@@ -470,12 +472,6 @@ namespace dsf::mobility {
 
     auto const& path{this->graph().allPathsTo(
         pItinerary->destination(), m_weightFunction, m_weightTreshold)};
-    if (path.empty()) {
-      throw std::runtime_error(
-          std::format("No path found for itinerary {} with destination node {}",
-                      pItinerary->id(),
-                      pItinerary->destination()));
-    }
     pItinerary->setPath(path);
     auto const newSize{pItinerary->path().size()};
     if (oldSize > 0 && newSize != oldSize) {
@@ -534,18 +530,21 @@ namespace dsf::mobility {
     double cumulativeProbability = 0.0;
 
     for (const auto outEdgeId : outgoingEdges) {
-      if (forbiddenTurns.contains(outEdgeId)) {
-        continue;
-      }
-
       auto const& pStreetOut{this->graph().edge(outEdgeId)};
 
       // Check if this is a valid path target for non-random agents
-      bool bIsPathTarget = true;
+      bool bIsPathTarget = false;
       if (!pathTargets.empty()) {
         bIsPathTarget =
             std::find(pathTargets.cbegin(), pathTargets.cend(), pStreetOut->target()) !=
             pathTargets.cend();
+      }
+
+      if (forbiddenTurns.contains(outEdgeId) && !bIsPathTarget) {
+        continue;
+      }
+
+      if (!pathTargets.empty()) {
         if (!this->m_errorProbability.has_value() && !bIsPathTarget) {
           continue;
         }
@@ -570,7 +569,7 @@ namespace dsf::mobility {
       if (previousNodeId.has_value() && pStreetOut->target() == previousNodeId.value()) {
         if (pNode->isRoundabout()) {
           probability *= U_TURN_PENALTY_FACTOR;
-        } else {
+        } else if (!bIsPathTarget) {
           continue;  // No U-turns allowed
         }
       }
@@ -581,11 +580,16 @@ namespace dsf::mobility {
 
     // Select street based on weighted probabilities
     if (transitionProbabilities.empty()) {
-      spdlog::trace("No valid transitions found for {} at {}", *pAgent, *pNode);
+      spdlog::debug("No valid transitions found for {} at {}", *pAgent, *pNode);
       return std::nullopt;
     }
     if (transitionProbabilities.size() == 1) {
-      return transitionProbabilities.cbegin()->first;
+      auto const& onlyStreetId = transitionProbabilities.cbegin()->first;
+      spdlog::debug("Only one valid transition for {} at {}: street {}",
+                    *pAgent,
+                    *pNode,
+                    onlyStreetId);
+      return onlyStreetId;
     }
 
     std::uniform_real_distribution<double> uniformDist{0., cumulativeProbability};
@@ -598,7 +602,10 @@ namespace dsf::mobility {
       }
     }
     // Return last one as fallback
-    return std::prev(transitionProbabilities.cend())->first;
+    auto const fallbackStreetId = std::prev(transitionProbabilities.cend())->first;
+    spdlog::debug(
+        "Fallback selection for {} at {}: street {}", *pAgent, *pNode, fallbackStreetId);
+    return fallbackStreetId;
   }
 
   template <typename delay_t>
@@ -689,15 +696,15 @@ namespace dsf::mobility {
       if (pStreet->isStochastic() &&
           uniformDist(this->m_generator) >
               dynamic_cast<StochasticStreet&>(*pStreet).flowRate()) {
-        spdlog::debug("Skipping due to flow rate {:.2f} < random value",
+        spdlog::trace("Skipping due to flow rate {:.2f} < random value",
                       dynamic_cast<StochasticStreet&>(*pStreet).flowRate());
         continue;
       }
       if (i == std::ceil(transportCapacity) - 1) {
         double integral;
         double fractional = std::modf(transportCapacity, &integral);
         if (fractional != 0. && uniformDist(this->m_generator) > fractional) {
-          spdlog::debug("Skipping due to fractional capacity {:.2f} < random value",
+          spdlog::trace("Skipping due to fractional capacity {:.2f} < random value",
                         fractional);
           continue;
         }
@@ -709,7 +716,7 @@ namespace dsf::mobility {
         // Logger::debug("Taking temp agent");
         auto const& pAgentTemp{pStreet->queue(queueIndex).front()};
         if (pAgentTemp->freeTime() > this->time_step()) {
-          spdlog::debug("Skipping due to time {} < free time {}",
+          spdlog::trace("Skipping due to time {} < free time {}",
                         this->time_step(),
                         pAgentTemp->freeTime());
           continue;
@@ -738,14 +745,14 @@ namespace dsf::mobility {
         pAgentTemp->setSpeed(0.);
         const auto& destinationNode{this->graph().node(pStreet->target())};
         if (destinationNode->isFull()) {
-          spdlog::debug("Skipping due to full destination node {}", *destinationNode);
+          spdlog::trace("Skipping due to full destination node {}", *destinationNode);
           continue;
         }
         if (destinationNode->isTrafficLight()) {
           auto& tl = dynamic_cast<TrafficLight&>(*destinationNode);
           auto const direction{pStreet->laneMapping().at(queueIndex)};
           if (!tl.isGreen(pStreet->id(), direction)) {
-            spdlog::debug("Skipping due to red light on street {} and direction {}",
+            spdlog::trace("Skipping due to red light on street {} and direction {}",
                           pStreet->id(),
                           directionToString.at(direction));
             continue;
@@ -1243,12 +1250,39 @@ namespace dsf::mobility {
 
   template <typename delay_t>
     requires(is_numeric_v<delay_t>)
-  void RoadDynamics<delay_t>::updatePaths() {
+  void RoadDynamics<delay_t>::updatePaths(bool const throw_on_empty) {
     spdlog::debug("Init updating paths...");
+    tbb::concurrent_vector<Id> emptyItineraries;
     tbb::parallel_for_each(
         this->itineraries().cbegin(),
         this->itineraries().cend(),
-        [this](auto const& pair) -> void { this->m_updatePath(pair.second); });
+        [this, throw_on_empty, &emptyItineraries](auto const& pair) -> void {
+          auto const& pItinerary{pair.second};
+          this->m_updatePath(pItinerary);
+          if (pItinerary->empty()) {
+            if (!throw_on_empty) {
+              spdlog::warn("No path found for itinerary {} with destination node {}",
+                           pItinerary->id(),
+                           pItinerary->destination());
+              emptyItineraries.push_back(pItinerary->id());
+              return;
+            }
+            throw std::runtime_error(
+                std::format("No path found for itinerary {} with destination node {}",
+                            pItinerary->id(),
+                            pItinerary->destination()));
+          }
+        });
+    if (!emptyItineraries.empty()) {
+      spdlog::warn("Removing {} itineraries with no valid path from the dynamics.",
+                   emptyItineraries.size());
+      for (auto const& id : emptyItineraries) {
+        auto const destination = m_itineraries.at(id)->destination();
+        m_destinationNodes.erase(destination);
+        m_originNodes.erase(destination);
+        m_itineraries.erase(id);
+      }
+    }
     spdlog::debug("End updating paths.");
   }
 

src/dsf/mobility/RoadNetwork.cpp

@@ -247,14 +247,16 @@ namespace dsf::mobility {
                        name,
                        geometry));
       // Check if there is coilcode property
-      if (!edge_properties.at_key("coilcode").error() &&
-          edge_properties["coilcode"].has_value()) {
-        if (edge_properties["coilcode"].is_string()) {
-          std::string strCoilCode{edge_properties["coilcode"].get_string().value()};
+      if (!edge_properties.at_key("coilcode").error()) {
+        auto const& epCoilCode = edge_properties["coilcode"];
+        if (epCoilCode.is_string()) {
+          std::string strCoilCode{epCoilCode.get_string().value()};
           addCoil(edge_id, strCoilCode);
-        } else if (edge_properties["coilcode"].is_number()) {
-          std::string strCoilCode =
-              std::to_string(edge_properties["coilcode"].get_uint64());
+        } else if (epCoilCode.is_uint64()) {
+          std::string strCoilCode = std::to_string(epCoilCode.get_uint64());
+          addCoil(edge_id, strCoilCode);
+        } else if (epCoilCode.is_int64()) {
+          std::string strCoilCode = std::to_string(epCoilCode.get_int64());
           addCoil(edge_id, strCoilCode);
         } else {
           spdlog::warn("Invalid coilcode for edge {}, adding default", edge_id);

test/mobility/Test_dynamics.cpp

@@ -425,6 +425,27 @@ TEST_CASE("FirstOrderDynamics") {
         }
       }
     }
+    GIVEN("A disconnected graph") {
+      Street s1{0, std::make_pair(0, 1), 10.};
+      RoadNetwork graph;
+      graph.addStreets(s1);
+      FirstOrderDynamics dynamics{graph, false, 69, 0., dsf::PathWeight::LENGTH};
+
+      WHEN(
+          "We add an impossible itinerary (to source node) and update paths with "
+          "throw_on_empty=true") {
+        dynamics.addItinerary(std::unique_ptr<Itinerary>(new Itinerary(0, 0)));
+        THEN("It throws an exception") { CHECK_THROWS(dynamics.updatePaths(true)); }
+      }
+
+      WHEN(
+          "We add an impossible itinerary (to source node) and update paths with "
+          "throw_on_empty=false") {
+        dynamics.addItinerary(std::unique_ptr<Itinerary>(new Itinerary(0, 0)));
+        dynamics.updatePaths(false);
+        THEN("The itinerary is removed") { CHECK(dynamics.itineraries().empty()); }
+      }
+    }
   }
   SUBCASE("Evolve") {
     GIVEN("A dynamics object and an itinerary") {
@@ -549,7 +570,7 @@ TEST_CASE("FirstOrderDynamics") {
       }
     }
     GIVEN("A simple network and an agent with forced itinerary") {
-      spdlog::set_level(spdlog::level::trace);
+      // spdlog::set_level(spdlog::level::trace);
       Street s0_1{1, std::make_pair(0, 1), 30., 15.};
       Street s1_0{3, std::make_pair(1, 0), 30., 15.};
       Street s1_2{5, std::make_pair(1, 2), 30., 15.};
@@ -586,7 +607,7 @@ TEST_CASE("FirstOrderDynamics") {
           CHECK_EQ(dynamics.nAgents(), 0);
         }
       }
-      spdlog::set_level(spdlog::level::info);
+      // spdlog::set_level(spdlog::level::info);
     }
   }
   SUBCASE("TrafficLights") {