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