source/libr2c2/trainrouteplanner.cpp

   1 #include "layout.h"
   2 #include "route.h"
   3 #include "train.h"
   4 #include "trainrouteplanner.h"
   5 #include "trainrouter.h"
   6 #include "vehicle.h"
   7
   8 using namespace std;
   9 using namespace Msp;
  10
  11 namespace R2C2 {
  12
  13 TrainRoutePlanner::TrainRoutePlanner(Layout &layout)
  14 {
  15         const map<unsigned, Train *> &trains = layout.get_trains();
  16         for(map<unsigned, Train *>::const_iterator i=trains.begin(); i!=trains.end(); ++i)
  17         {
  18                 TrainRoutingInfo info(*i->second);
  19                 if(info.router && info.router->get_destination())
  20                         routed_trains.push_back(info);
  21         }
  22
  23         steps.push_back(RoutingStep());
  24         RoutingStep &start = steps.back();
  25         for(vector<TrainRoutingInfo>::iterator i=routed_trains.begin(); i!=routed_trains.end(); ++i)
  26                 start.trains.push_back(TrainRoutingState(*i));
  27 }
  28
  29 void TrainRoutePlanner::plan()
  30 {
  31         RoutingStep *goal = 0;
  32         for(list<RoutingStep>::iterator i=steps.begin(); i!=steps.end(); ++i)
  33         {
  34                 if(i->is_goal())
  35                 {
  36                         goal = &*i;
  37                         break;
  38                 }
  39
  40                 if(update_states(*i))
  41                 {
  42                         int next_train = find_next_train(*i);
  43                         if(next_train>=0)
  44                                 add_steps(*i, next_train);
  45                 }
  46         }
  47
  48         if(goal)
  49                 create_routes(*goal);
  50 }
  51
  52 bool TrainRoutePlanner::update_states(RoutingStep &step)
  53 {
  54         RoutingStep next(&step);
  55         bool changes = false;
  56         for(vector<TrainRoutingState>::iterator i=next.trains.begin(); i!=next.trains.end(); ++i)
  57         {
  58                 TrainState old_state = i->state;
  59                 if(i->state==BLOCKED)
  60                         i->state = MOVING;
  61
  62                 TrackIter next_track = i->track.next(i->path);
  63                 if(!next_track)
  64                         return false;
  65
  66                 for(vector<TrainRoutingState>::iterator j=next.trains.begin(); j!=next.trains.end(); ++j)
  67                         if(j!=i)
  68                         {
  69                                 if(j->track.track()==next_track.track())
  70                                 {
  71                                         unsigned other_exit = j->track.reverse(j->path).entry();
  72                                         if(next_track.entry()==other_exit)
  73                                                 return false;
  74                                 }
  75                                 else if(!j->is_occupied(*next_track))
  76                                         continue;
  77
  78                                 i->state = BLOCKED;
  79                         }
  80
  81                 if(i->state!=old_state)
  82                         changes = true;
  83         }
  84
  85         if(changes)
  86         {
  87                 list<RoutingStep>::iterator i;
  88                 for(i=steps.begin(); (i!=steps.end() && !(next<*i)); ++i) ;
  89                 steps.insert(i, next);
  90         }
  91
  92         return !changes;
  93 }
  94
  95 int TrainRoutePlanner::find_next_train(RoutingStep &step)
  96 {
  97         Time::TimeDelta min_dt;
  98         int next_train = -1;
  99         for(unsigned i=0; i<step.trains.size(); ++i)
 100                 if(step.trains[i].state==MOVING)
 101                 {
 102                         Time::TimeDelta dt = step.trains[i].get_time_to_next_track();
 103                         if(dt<min_dt || next_train<0)
 104                         {
 105                                 min_dt = dt;
 106                                 next_train = i;
 107                         }
 108                 }
 109
 110         return next_train;
 111 }
 112
 113 void TrainRoutePlanner::add_steps(RoutingStep &step, unsigned train_index)
 114 {
 115         TrainRoutingState &train = step.trains[train_index];
 116         Time::TimeDelta dt = train.get_time_to_next_track();
 117         TrackIter next_track = train.track.next(train.path);
 118
 119         list<RoutingStep> new_steps;
 120
 121         RoutingStep next(&step);
 122         next.advance(dt);
 123         TrainRouter &router = *train.info->router;
 124         if(train.waypoint<0 && router.is_destination(*train.track) && !router.is_destination(*next_track))
 125         {
 126                 next.trains[train_index].state = ARRIVED;
 127                 new_steps.push_back(next);
 128         }
 129         else
 130         {
 131                 if(train.waypoint>=0 && router.is_waypoint(train.waypoint, *train.track) && !router.is_waypoint(train.waypoint, *next_track))
 132                 {
 133                         ++next.trains[train_index].waypoint;
 134                         if(next.trains[train_index].waypoint>=static_cast<int>(router.get_n_waypoints()))
 135                                 next.trains[train_index].waypoint = -1;
 136                 }
 137
 138                 next.trains[train_index].advance_track(0);
 139
 140                 const TrackType::Endpoint &next_entry_ep = next_track.endpoint();
 141                 for(unsigned i=0; next_entry_ep.paths>>i; ++i)
 142                         if(next_entry_ep.has_path(i))
 143                         {
 144                                 next.trains[train_index].path = i;
 145                                 new_steps.push_back(next);
 146                         }
 147
 148                 if(next_entry_ep.paths!=next_track->get_type().get_paths())
 149                 {
 150                         RoutingStep wait(&step);
 151                         wait.advance(dt);
 152                         wait.trains[train_index].state = WAITING;
 153                         new_steps.push_back(wait);
 154                 }
 155         }
 156
 157         new_steps.sort();
 158         steps.merge(new_steps);
 159 }
 160
 161 void TrainRoutePlanner::create_routes(RoutingStep &goal)
 162 {
 163         for(vector<TrainRoutingInfo>::iterator i=routed_trains.begin(); i!=routed_trains.end(); ++i)
 164         {
 165                 i->route = new Route(i->train->get_layout());
 166                 i->route->set_name("Router");
 167                 i->route->set_temporary(true);
 168         }
 169
 170         for(RoutingStep *i=&goal; i; i=i->prev)
 171         {
 172                 for(vector<TrainRoutingState>::iterator j=i->trains.begin(); j!=i->trains.end(); ++j)
 173                 {
 174                         if(j->state==WAITING || j->state==BLOCKED)
 175                                 j->info->waits.push_front(&*j);
 176                         j->info->route->add_track(*j->track);
 177                 }
 178         }
 179
 180         for(vector<TrainRoutingInfo>::iterator i=routed_trains.begin(); i!=routed_trains.end(); ++i)
 181         {
 182                 i->router->set_route(i->route);
 183                 TrainRoutingState *current_wait = 0;
 184                 for(list<TrainRoutingState *>::iterator j=i->waits.begin(); j!=i->waits.end(); ++j)
 185                         if(!current_wait || (*j)->track.track()!=current_wait->track.track())
 186                         {
 187                                 Block &block = (*j)->track.next()->get_block();
 188                                 i->router->add_wait(block, 0);
 189                                 current_wait = *j;
 190                         }
 191         }
 192 }
 193
 194
 195 TrainRoutePlanner::TrainRoutingInfo::TrainRoutingInfo(Train &t):
 196         train(&t),
 197         router(train->get_ai_of_type<TrainRouter>()),
 198         route(0)
 199 { }
 200
 201
 202 TrainRoutePlanner::OccupiedTrack::OccupiedTrack(Track &t, unsigned p, OccupiedTrack *n):
 203         track(&t),
 204         path_length(track->get_type().get_path_length(p)),
 205         next(n),
 206         n_tracks(next ? next->n_tracks+1 : 1),
 207         refcount(1)
 208 {
 209         if(next)
 210                 ++next->refcount;
 211 }
 212
 213 TrainRoutePlanner::OccupiedTrack::OccupiedTrack(const OccupiedTrack &other):
 214         track(other.track),
 215         path_length(other.path_length),
 216         next(other.next),
 217         n_tracks(other.n_tracks),
 218         refcount(1)
 219 {
 220         if(next)
 221                 ++next->refcount;
 222 }
 223
 224 TrainRoutePlanner::OccupiedTrack::~OccupiedTrack()
 225 {
 226         if(next && !--next->refcount)
 227                 delete next;
 228 }
 229
 230
 231 TrainRoutePlanner::TrainRoutingState::TrainRoutingState(TrainRoutingInfo &inf):
 232         info(&inf),
 233         occupied_tracks(0),
 234         state(MOVING),
 235         delay(info->router->get_departure_delay()),
 236         waypoint(info->router->get_n_waypoints() ? 0 : -1)
 237 {
 238         const Vehicle *veh = &info->train->get_vehicle(0);
 239         // TODO margins
 240         TrackOffsetIter track_and_offs = veh->get_placement().get_position(VehiclePlacement::FRONT_BUFFER);
 241         track = track_and_offs.track_iter();
 242         offset = track_and_offs.offset();
 243         path = track->get_active_path();
 244
 245         while(Vehicle *next = veh->get_link(1))
 246                 veh = next;
 247         track_and_offs = veh->get_placement().get_position(VehiclePlacement::BACK_BUFFER);
 248         back_offset = track_and_offs.offset();
 249
 250         TrackIter iter = track_and_offs.track_iter();
 251         while(1)
 252         {
 253                 occupied_tracks = new OccupiedTrack(*iter, iter->get_active_path(), occupied_tracks);
 254                 if(iter.track()==track.track())
 255                         break;
 256                 iter = iter.next();
 257         }
 258 }
 259
 260 TrainRoutePlanner::TrainRoutingState::TrainRoutingState(const TrainRoutingState &other):
 261         info(other.info),
 262         track(other.track),
 263         path(other.path),
 264         occupied_tracks(other.occupied_tracks),
 265         offset(other.offset),
 266         back_offset(other.back_offset),
 267         state(other.state),
 268         delay(other.delay),
 269         waypoint(other.waypoint)
 270 {
 271         ++occupied_tracks->refcount;
 272 }
 273
 274 TrainRoutePlanner::TrainRoutingState::~TrainRoutingState()
 275 {
 276         if(!--occupied_tracks->refcount)
 277                 delete occupied_tracks;
 278 }
 279
 280 Time::TimeDelta TrainRoutePlanner::TrainRoutingState::get_time_to_next_track() const
 281 {
 282         // TODO Consider the speed of the train
 283         return (track->get_type().get_path_length(path)-offset)*Time::sec+delay;
 284 }
 285
 286 bool TrainRoutePlanner::TrainRoutingState::is_occupied(Track &trk) const
 287 {
 288         OccupiedTrack *occ = occupied_tracks;
 289         for(unsigned n=occ->n_tracks; n>0; --n, occ=occ->next)
 290                 if(occ->track==&trk)
 291                         return true;
 292         return false;
 293 }
 294
 295 void TrainRoutePlanner::TrainRoutingState::advance(float distance)
 296 {
 297         offset += distance;
 298         back_offset += distance;
 299
 300         OccupiedTrack *last_occ = occupied_tracks;
 301         for(unsigned n=occupied_tracks->n_tracks; n>1; --n)
 302                 last_occ = last_occ->next;
 303
 304         // XXX What if there's multiple tracks to remove?
 305         if(back_offset>last_occ->path_length)
 306         {
 307                 back_offset -= last_occ->path_length;
 308                 if(occupied_tracks->refcount>1)
 309                 {
 310                         --occupied_tracks->refcount;
 311                         occupied_tracks = new OccupiedTrack(*occupied_tracks);
 312                 }
 313                 --occupied_tracks->n_tracks;
 314         }
 315 }
 316
 317 void TrainRoutePlanner::TrainRoutingState::advance_track(unsigned next_path)
 318 {
 319         float distance = occupied_tracks->path_length-offset;
 320         track = track.next(path);
 321         path = next_path;
 322         occupied_tracks = new OccupiedTrack(*track, path, occupied_tracks);
 323         advance(distance);
 324         offset = 0;
 325 }
 326
 327
 328 TrainRoutePlanner::RoutingStep::RoutingStep():
 329         prev(0)
 330 { }
 331
 332 TrainRoutePlanner::RoutingStep::RoutingStep(RoutingStep *p):
 333         time(p->time),
 334         trains(p->trains),
 335         prev(p)
 336 { }
 337
 338 void TrainRoutePlanner::RoutingStep::advance(const Time::TimeDelta &dt)
 339 {
 340         time += dt;
 341         for(vector<TrainRoutingState>::iterator i=trains.begin(); i!=trains.end(); ++i)
 342         {
 343                 if(i->delay)
 344                 {
 345                         i->delay -= dt;
 346                         if(i->delay>Time::zero)
 347                                 continue;
 348                         i->delay = Time::zero;
 349                 }
 350                 else if(i->state==MOVING)
 351                 {
 352                         float distance = dt/Time::sec;
 353                         i->advance(distance);
 354                 }
 355         }
 356 }
 357
 358 bool TrainRoutePlanner::RoutingStep::is_goal() const
 359 {
 360         for(vector<TrainRoutingState>::const_iterator i=trains.begin(); i!=trains.end(); ++i)
 361                 if(i->state!=ARRIVED)
 362                         return false;
 363         return true;
 364 }
 365
 366 bool TrainRoutePlanner::RoutingStep::operator<(const RoutingStep &other) const
 367 {
 368         return time<other.time;
 369 }
 370
 371 } // namespace R2C2