1 #include <msp/core/maputils.h>
6 #include "trainroutemetric.h"
7 #include "trainrouteplanner.h"
8 #include "trainrouter.h"
16 TrainRoutePlanner::TrainRoutePlanner(Layout &layout):
19 const map<unsigned, Train *> &trains = layout.get_trains();
20 for(map<unsigned, Train *>::const_iterator i=trains.begin(); i!=trains.end(); ++i)
22 TrainRoutingInfo info(*i->second);
23 if(info.router && info.router->get_destination())
24 routed_trains.push_back(info);
28 void TrainRoutePlanner::plan()
34 queue.push_back(RoutingStep());
35 RoutingStep &start = queue.back();
36 for(vector<TrainRoutingInfo>::iterator i=routed_trains.begin(); i!=routed_trains.end(); ++i)
37 start.trains.push_back(TrainRoutingState(*i));
38 start.update_estimate();
40 const RoutingStep *goal = 0;
43 const RoutingStep &step = get_step();
62 const list<Route *> &TrainRoutePlanner::get_routes_for(const Train &train) const
64 return get_train_info(train).routes;
67 const list<TrainRouter::SequencePoint> &TrainRoutePlanner::get_sequence_for(const Train &train) const
69 return get_train_info(train).sequence;
72 const TrainRoutePlanner::TrainRoutingInfo &TrainRoutePlanner::get_train_info(const Train &train) const
74 for(vector<TrainRoutingInfo>::const_iterator i=routed_trains.begin(); i!=routed_trains.end(); ++i)
78 throw key_error(train.get_name());
81 const TrainRoutePlanner::RoutingStep &TrainRoutePlanner::get_step()
83 steps.splice(steps.end(), queue, queue.begin());
87 void TrainRoutePlanner::add_steps(const RoutingStep &step)
89 list<RoutingStep> new_steps;
90 step.create_successors(new_steps);
92 queue.merge(new_steps);
95 void TrainRoutePlanner::create_routes(const RoutingStep &goal)
97 for(vector<TrainRoutingInfo>::iterator i=routed_trains.begin(); i!=routed_trains.end(); ++i)
101 for(unsigned j=0; j<3; ++j)
102 i->track_history[j] = 0;
105 map<Track *, TrainRouter::SequencePoint *> sequenced_tracks;
106 unsigned sequence = steps.size();
107 for(const RoutingStep *i=&goal; i; i=i->prev)
108 for(vector<TrainRoutingState>::const_iterator j=i->trains.begin(); j!=i->trains.end(); ++j)
110 Track **history = j->info->track_history;
111 if(j->track.track()==history[0])
115 bool start_new_route = true;
116 if(!j->info->routes.empty())
118 route = j->info->routes.front();
119 start_new_route = route->has_track(*j->track);
122 unsigned nls = j->track->get_n_link_slots();
123 for(unsigned k=0; (!start_new_route && k<nls); ++k)
125 Track *link = j->track->get_link(k);
126 start_new_route = (link && link!=history[0] && route->has_track(*link));
133 route = new Route(j->info->train->get_layout());
134 route->set_name("Router");
135 route->set_temporary(true);
136 for(unsigned k=2; k>0; --k)
138 route->add_track(*history[k]);
139 j->info->routes.push_front(route);
143 route->add_track(*history[0]);
144 for(unsigned k=2; k>0; --k)
145 history[k] = history[k-1];
146 history[0] = j->track.track();
148 bool waitable = j->track.endpoint().paths!=j->track->get_type().get_paths();
149 map<Track *, TrainRouter::SequencePoint *>::iterator k = sequenced_tracks.find(j->track.track());
150 if(k!=sequenced_tracks.end())
152 if(!k->second->preceding_train)
154 k->second->preceding_train = j->info->train;
155 k->second->sequence_in = sequence;
157 j->info->sequence.push_front(TrainRouter::SequencePoint(j->track->get_block(), sequence));
159 k->second = &j->info->sequence.front();
164 j->info->sequence.push_front(TrainRouter::SequencePoint(j->track->get_block(), sequence));
165 sequenced_tracks[j->track.track()] = &j->info->sequence.front();
172 TrainRoutePlanner::TrainRoutingInfo::TrainRoutingInfo(Train &t):
174 speed(train->get_maximum_speed()),
175 router(train->get_ai_of_type<TrainRouter>())
177 // If no maximum speed is specified, use a sensible default
179 speed = 20*train->get_layout().get_catalogue().get_scale();
183 TrainRoutePlanner::OccupiedTrack::OccupiedTrack(Track &t, unsigned p, OccupiedTrack *n):
185 path_length(track->get_type().get_path_length(p)),
187 n_tracks(next ? next->n_tracks+1 : 1),
194 TrainRoutePlanner::OccupiedTrack::OccupiedTrack(const OccupiedTrack &other):
196 path_length(other.path_length),
198 n_tracks(other.n_tracks),
205 TrainRoutePlanner::OccupiedTrack::~OccupiedTrack()
207 if(next && !--next->refcount)
212 TrainRoutePlanner::TrainRoutingState::TrainRoutingState(TrainRoutingInfo &inf):
216 delay(info->router->get_departure_delay()),
217 waypoint(info->router->get_n_waypoints() ? 0 : -1),
220 const Vehicle *veh = &info->train->get_vehicle(0);
222 TrackOffsetIter track_and_offs = veh->get_placement().get_position(VehiclePlacement::FRONT_BUFFER);
223 track = track_and_offs.track_iter();
224 offset = track_and_offs.offset();
225 path = track->get_active_path();
227 while(Vehicle *next = veh->get_link(1))
229 track_and_offs = veh->get_placement().get_position(VehiclePlacement::BACK_BUFFER);
230 back_offset = track_and_offs.offset();
232 TrackIter iter = track_and_offs.track_iter();
235 occupied_tracks = new OccupiedTrack(*iter, iter->get_active_path(), occupied_tracks);
236 if(iter.track()==track.track())
244 TrainRoutePlanner::TrainRoutingState::TrainRoutingState(const TrainRoutingState &other):
248 occupied_tracks(other.occupied_tracks),
249 offset(other.offset),
250 back_offset(other.back_offset),
253 waypoint(other.waypoint),
254 distance_traveled(other.distance_traveled),
255 remaining_estimate(other.remaining_estimate),
256 wait_time(other.wait_time),
257 blocked_by(other.blocked_by)
259 ++occupied_tracks->refcount;
262 TrainRoutePlanner::TrainRoutingState::~TrainRoutingState()
264 if(occupied_tracks && !--occupied_tracks->refcount)
265 delete occupied_tracks;
268 Time::TimeDelta TrainRoutePlanner::TrainRoutingState::get_time_to_next_track() const
270 return ((track->get_type().get_path_length(path)-offset)/info->speed)*Time::sec+delay;
273 bool TrainRoutePlanner::TrainRoutingState::is_occupying(Track &trk) const
275 OccupiedTrack *occ = occupied_tracks;
276 for(unsigned n=occ->n_tracks; n>0; --n, occ=occ->next)
282 bool TrainRoutePlanner::TrainRoutingState::check_arrival()
284 TrainRouter &router = *info->router;
285 TrackIter next_track = track.next(path);
287 if(waypoint<0 && router.is_destination(*track) && !router.is_destination(*next_track))
292 else if(waypoint>=0 && router.is_waypoint(waypoint, *track) && !router.is_waypoint(waypoint, *next_track))
295 if(waypoint>=static_cast<int>(router.get_n_waypoints()))
302 void TrainRoutePlanner::TrainRoutingState::advance(float distance)
305 back_offset += distance;
307 OccupiedTrack *last_occ = occupied_tracks;
308 for(unsigned n=occupied_tracks->n_tracks; n>1; --n)
309 last_occ = last_occ->next;
311 // XXX What if there's multiple tracks to remove?
312 if(back_offset>last_occ->path_length)
314 back_offset -= last_occ->path_length;
315 if(occupied_tracks->refcount>1)
317 --occupied_tracks->refcount;
318 occupied_tracks = new OccupiedTrack(*occupied_tracks);
320 --occupied_tracks->n_tracks;
323 distance_traveled += distance;
324 remaining_estimate -= distance;
327 void TrainRoutePlanner::TrainRoutingState::advance(const Time::TimeDelta &dt)
335 float secs = dt/Time::sec;
338 secs -= delay/Time::sec;
343 advance(info->speed*secs);
344 else if(state!=ARRIVED)
345 wait_time += secs*Time::sec;
348 void TrainRoutePlanner::TrainRoutingState::advance_track(unsigned next_path)
350 float distance = occupied_tracks->path_length-offset;
351 track = track.next(path);
353 occupied_tracks = new OccupiedTrack(*track, path, occupied_tracks);
358 void TrainRoutePlanner::TrainRoutingState::update_estimate()
360 TrackIter iter = track.reverse(path);
361 float distance = info->router->get_metric(waypoint).get_distance_from(*iter.track(), iter.entry());
362 distance += track->get_type().get_path_length(path)-offset;
363 remaining_estimate = distance;
367 TrainRoutePlanner::RoutingStep::RoutingStep():
371 TrainRoutePlanner::RoutingStep::RoutingStep(const RoutingStep *p):
373 cost_estimate(p->cost_estimate),
378 void TrainRoutePlanner::RoutingStep::create_successors(list<RoutingStep> &new_steps) const
380 RoutingStep next(this);
381 if(next.update_states())
383 if(next.check_deadlocks())
386 new_steps.push_back(next);
390 int train_index = find_next_train();
394 TrainRoutingState &train = next.trains[train_index];
396 Time::TimeDelta dt = train.get_time_to_next_track();
399 if(train.check_arrival())
401 new_steps.push_back(next);
405 TrackIter next_track = train.track.next(train.path);
406 train.advance_track(0);
408 const TrackType::Endpoint &next_entry_ep = next_track.endpoint();
409 for(unsigned i=0; next_entry_ep.paths>>i; ++i)
410 if(next_entry_ep.has_path(i))
413 train.update_estimate();
414 next.update_estimate();
416 new_steps.push_back(next);
419 if(next_entry_ep.paths!=next_track->get_type().get_paths())
421 RoutingStep wait(this);
423 wait.trains[train_index].state = WAITING;
425 new_steps.push_back(wait);
429 bool TrainRoutePlanner::RoutingStep::update_states()
431 bool changes = false;
432 for(vector<TrainRoutingState>::iterator i=trains.begin(); i!=trains.end(); ++i)
434 if(i->state==ARRIVED)
437 TrainState old_state = i->state;
439 TrackIter next_track = i->track.next(i->path);
442 i->blocked_by = get_occupant(*next_track);
445 else if(i->state==BLOCKED)
451 if(i->state!=old_state)
458 bool TrainRoutePlanner::RoutingStep::check_deadlocks() const
460 for(vector<TrainRoutingState>::const_iterator i=trains.begin(); i!=trains.end(); ++i)
462 if(i->state!=BLOCKED)
468 int slow = i->blocked_by;
469 int fast = trains[slow].blocked_by;
470 while(fast>=0 && trains[fast].blocked_by>=0)
475 slow = trains[slow].blocked_by;
476 fast = trains[trains[fast].blocked_by].blocked_by;
483 int TrainRoutePlanner::RoutingStep::get_occupant(Track &track) const
485 for(unsigned i=0; i<trains.size(); ++i)
486 if(trains[i].is_occupying(track))
492 int TrainRoutePlanner::RoutingStep::find_next_train() const
494 Time::TimeDelta min_dt;
496 for(unsigned i=0; i<trains.size(); ++i)
497 if(trains[i].state==MOVING)
499 Time::TimeDelta dt = trains[i].get_time_to_next_track();
500 if(dt<min_dt || next_train<0)
510 void TrainRoutePlanner::RoutingStep::advance(const Time::TimeDelta &dt)
513 for(vector<TrainRoutingState>::iterator i=trains.begin(); i!=trains.end(); ++i)
517 void TrainRoutePlanner::RoutingStep::update_estimate()
519 cost_estimate = Time::zero;
520 for(vector<TrainRoutingState>::const_iterator i=trains.begin(); i!=trains.end(); ++i)
521 if(i->remaining_estimate>=0)
522 cost_estimate += i->wait_time+((i->distance_traveled+i->remaining_estimate)/i->info->speed)*Time::sec;
525 bool TrainRoutePlanner::RoutingStep::is_viable() const
527 for(vector<TrainRoutingState>::const_iterator i=trains.begin(); i!=trains.end(); ++i)
528 if(i->remaining_estimate<0)
531 for(vector<TrainRoutingState>::const_iterator i=trains.begin(); i!=trains.end(); ++i)
538 bool TrainRoutePlanner::RoutingStep::is_goal() const
540 for(vector<TrainRoutingState>::const_iterator i=trains.begin(); i!=trains.end(); ++i)
541 if(i->state!=ARRIVED)
546 bool TrainRoutePlanner::RoutingStep::operator<(const RoutingStep &other) const
548 return cost_estimate<other.cost_estimate;