source/libr2c2/trainrouteplanner.cpp

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