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