source/libr2c2/trainrouteplanner.h

   1 #ifndef LIBR2C2_TRAINROUTEPLANNER_H_
   2 #define LIBR2C2_TRAINROUTEPLANNER_H_
   3
   4 #include <list>
   5 #include <vector>
   6 #include <msp/core/thread.h>
   7 #include <msp/time/timedelta.h>
   8 #include "trackiter.h"
   9 #include "trainrouter.h"
  10
  11 namespace R2C2 {
  12
  13 class Layout;
  14 class Route;
  15 class Track;
  16 class Train;
  17
  18 class TrainRoutePlanner
  19 {
  20 public:
  21         enum Result
  22         {
  23                 PENDING,
  24                 COMPLETE,
  25                 FAILED
  26         };
  27
  28 private:
  29         struct TrainRoutingState;
  30
  31         struct TrainRoutingInfo
  32         {
  33                 Train *train;
  34                 float length;
  35                 float speed;
  36                 Block *first_noncritical;
  37                 TrainRouter *router;
  38                 std::vector<TrainRouter::Waypoint> waypoints;
  39                 std::vector<const TrainRouteMetric *> metrics;
  40                 bool has_duration;
  41                 std::list<Route *> routes;
  42                 Track *track_history[2];
  43                 std::list<TrainRouter::SequencePoint> sequence;
  44
  45                 TrainRoutingInfo(Train &);
  46         };
  47
  48         struct OccupiedTrack
  49         {
  50                 Track *track;
  51                 float path_length;
  52                 OccupiedTrack *next;
  53                 unsigned n_tracks;
  54                 unsigned refcount;
  55
  56                 OccupiedTrack(Track &, unsigned, OccupiedTrack *);
  57                 OccupiedTrack(const OccupiedTrack &);
  58                 ~OccupiedTrack();
  59         };
  60
  61         enum TrainState
  62         {
  63                 MOVING,
  64                 WAITING,
  65                 BLOCKED,
  66                 ARRIVED
  67         };
  68
  69         struct TrainRoutingState
  70         {
  71                 TrainRoutingInfo *info;
  72                 TrackIter track;
  73                 unsigned char path;
  74                 bool critical;
  75                 OccupiedTrack *occupied_tracks;
  76                 float offset;
  77                 float back_offset;
  78                 TrainState state;
  79                 Msp::Time::TimeDelta delay;
  80                 Msp::Time::TimeDelta duration;
  81                 unsigned waypoint;
  82                 float distance_traveled;
  83                 float remaining_estimate;
  84                 Msp::Time::TimeDelta wait_time;
  85                 Msp::Time::TimeDelta estimated_wait;
  86                 int blocked_by;
  87
  88                 TrainRoutingState(TrainRoutingInfo &);
  89                 TrainRoutingState(const TrainRoutingState &);
  90                 ~TrainRoutingState();
  91
  92                 Msp::Time::TimeDelta get_time_to_next_track() const;
  93                 Msp::Time::TimeDelta get_time_to_pass(Track &) const;
  94                 bool is_occupying(Track &) const;
  95                 bool check_arrival();
  96                 void advance(float);
  97                 void advance(const Msp::Time::TimeDelta &);
  98                 void advance_track(unsigned);
  99                 void set_path(unsigned);
 100                 void update_estimate();
 101                 bool is_viable() const;
 102         };
 103
 104         struct RoutingStep
 105         {
 106                 Msp::Time::TimeDelta time;
 107                 Msp::Time::TimeDelta cost_estimate;
 108                 bool preferred;
 109                 std::vector<TrainRoutingState> trains;
 110                 const RoutingStep *prev;
 111
 112                 RoutingStep();
 113                 RoutingStep(const RoutingStep *);
 114
 115                 void create_successors(std::list<RoutingStep> &) const;
 116                 static void create_successor(RoutingStep &, unsigned, unsigned, std::list<RoutingStep> &);
 117                 bool update_states();
 118                 bool check_deadlocks() const;
 119                 int get_occupant(Track &) const;
 120                 int find_next_train() const;
 121                 void advance(const Msp::Time::TimeDelta &);
 122                 void update_estimate();
 123                 bool is_viable() const;
 124                 bool is_goal() const;
 125
 126                 bool operator<(const RoutingStep &) const;
 127         };
 128
 129         class PlanningThread: public Msp::Thread
 130         {
 131         private:
 132                 TrainRoutePlanner &planner;
 133
 134         public:
 135                 PlanningThread(TrainRoutePlanner &);
 136
 137         private:
 138                 virtual void main();
 139         };
 140
 141         std::vector<TrainRoutingInfo> routed_trains;
 142         std::list<RoutingStep> steps;
 143         std::list<RoutingStep> queue;
 144         const RoutingStep *goal;
 145         Msp::Time::TimeDelta path_switch_bias;
 146         Msp::Time::TimeDelta timeout;
 147         Result result;
 148         PlanningThread *thread;
 149
 150 public:
 151         TrainRoutePlanner(Layout &);
 152         ~TrainRoutePlanner();
 153
 154         void set_timeout(const Msp::Time::TimeDelta &);
 155         Result plan();
 156         void plan_async();
 157         Result check();
 158         Result get_result() const { return result; }
 159         const std::list<Route *> &get_routes_for(const Train &) const;
 160         const std::list<TrainRouter::SequencePoint> &get_sequence_for(const Train &) const;
 161 private:
 162         const TrainRoutingInfo &get_train_info(const Train &) const;
 163         const RoutingStep &get_step();
 164         void prepare_plan();
 165         void create_plan();
 166         void add_steps(const RoutingStep &);
 167         void finalize_plan();
 168 };
 169
 170 } // namespace R2C2
 171
 172 #endif