5 #include "trainroutemetric.h"
6 #include "trainrouteplanner.h"
7 #include "trainrouter.h"
15 TrainRoutePlanner::TrainRoutePlanner(Layout &layout)
17 const map<unsigned, Train *> &trains = layout.get_trains();
18 for(map<unsigned, Train *>::const_iterator i=trains.begin(); i!=trains.end(); ++i)
20 TrainRoutingInfo info(*i->second);
21 if(info.router && info.router->get_destination())
22 routed_trains.push_back(info);
25 queue.push_back(RoutingStep());
26 RoutingStep &start = queue.back();
27 for(vector<TrainRoutingInfo>::iterator i=routed_trains.begin(); i!=routed_trains.end(); ++i)
28 start.trains.push_back(TrainRoutingState(*i));
29 start.update_estimate();
32 void TrainRoutePlanner::plan()
34 const RoutingStep *goal = 0;
37 const RoutingStep &step = get_step();
51 const TrainRoutePlanner::RoutingStep &TrainRoutePlanner::get_step()
53 steps.splice(steps.end(), queue, queue.begin());
57 void TrainRoutePlanner::add_steps(const RoutingStep &step)
59 list<RoutingStep> new_steps;
60 step.create_successors(new_steps);
62 queue.merge(new_steps);
65 void TrainRoutePlanner::create_routes(const RoutingStep &goal)
67 for(vector<TrainRoutingInfo>::iterator i=routed_trains.begin(); i!=routed_trains.end(); ++i)
69 Route *route = new Route(i->train->get_layout());
70 route->set_name("Router");
71 route->set_temporary(true);
72 i->routes.push_front(route);
74 for(unsigned j=0; j<3; ++j)
75 i->track_history[j] = 0;
78 map<Track *, SequencingInfo *> sequenced_tracks;
79 unsigned sequence = steps.size();
80 for(const RoutingStep *i=&goal; i; i=i->prev)
81 for(vector<TrainRoutingState>::const_iterator j=i->trains.begin(); j!=i->trains.end(); ++j)
83 Track **history = j->info->track_history;
84 if(j->track.track()==history[0])
87 Route *route = j->info->routes.front();
88 bool start_new_route = route->has_track(*j->track);
91 unsigned nls = j->track->get_n_link_slots();
92 for(unsigned k=0; (!start_new_route && k<nls); ++k)
94 Track *link = j->track->get_link(k);
95 start_new_route = (link && link!=history[0] && route->has_track(*link));
101 route = new Route(j->info->train->get_layout());
102 route->set_name("Router");
103 route->set_temporary(true);
104 for(unsigned k=2; k>0; --k)
105 route->add_track(*history[k]);
106 j->info->routes.push_front(route);
110 route->add_track(*history[0]);
111 for(unsigned k=2; k>0; --k)
112 history[k] = history[k-1];
113 history[0] = j->track.track();
115 bool waitable = j->track.endpoint().paths!=j->track->get_type().get_paths();
116 map<Track *, SequencingInfo *>::iterator k = sequenced_tracks.find(j->track.track());
117 if(k!=sequenced_tracks.end())
119 if(!k->second->preceding)
121 k->second->preceding = j->info;
122 k->second->sequence_in = sequence;
124 j->info->sequence.push_front(SequencingInfo(j->track.track(), sequence));
126 k->second = &j->info->sequence.front();
131 j->info->sequence.push_front(SequencingInfo(j->track.track(), sequence));
132 sequenced_tracks[j->track.track()] = &j->info->sequence.front();
137 for(vector<TrainRoutingInfo>::iterator i=routed_trains.begin(); i!=routed_trains.end(); ++i)
139 for(list<Route *>::iterator j=i->routes.begin(); j!=i->routes.end(); ++j)
141 if(j==i->routes.begin())
142 i->router->set_route(*j);
144 i->router->add_route(**j);
147 for(list<SequencingInfo>::iterator j=i->sequence.begin(); j!=i->sequence.end(); ++j)
149 if(j->preceding && j->preceding!=&*i)
150 i->router->add_sequence_point(j->track->get_block(), *j->preceding->train, j->sequence_in, j->sequence_out);
152 i->router->add_sequence_point(j->track->get_block(), j->sequence_out);
158 TrainRoutePlanner::SequencingInfo::SequencingInfo(Track *t, unsigned o):
166 TrainRoutePlanner::TrainRoutingInfo::TrainRoutingInfo(Train &t):
168 speed(train->get_maximum_speed()),
169 router(train->get_ai_of_type<TrainRouter>())
171 // If no maximum speed is specified, use a sensible default
173 speed = 20*train->get_layout().get_catalogue().get_scale();
177 TrainRoutePlanner::OccupiedTrack::OccupiedTrack(Track &t, unsigned p, OccupiedTrack *n):
179 path_length(track->get_type().get_path_length(p)),
181 n_tracks(next ? next->n_tracks+1 : 1),
188 TrainRoutePlanner::OccupiedTrack::OccupiedTrack(const OccupiedTrack &other):
190 path_length(other.path_length),
192 n_tracks(other.n_tracks),
199 TrainRoutePlanner::OccupiedTrack::~OccupiedTrack()
201 if(next && !--next->refcount)
206 TrainRoutePlanner::TrainRoutingState::TrainRoutingState(TrainRoutingInfo &inf):
210 delay(info->router->get_departure_delay()),
211 waypoint(info->router->get_n_waypoints() ? 0 : -1),
214 const Vehicle *veh = &info->train->get_vehicle(0);
216 TrackOffsetIter track_and_offs = veh->get_placement().get_position(VehiclePlacement::FRONT_BUFFER);
217 track = track_and_offs.track_iter();
218 offset = track_and_offs.offset();
219 path = track->get_active_path();
221 while(Vehicle *next = veh->get_link(1))
223 track_and_offs = veh->get_placement().get_position(VehiclePlacement::BACK_BUFFER);
224 back_offset = track_and_offs.offset();
226 TrackIter iter = track_and_offs.track_iter();
229 occupied_tracks = new OccupiedTrack(*iter, iter->get_active_path(), occupied_tracks);
230 if(iter.track()==track.track())
238 TrainRoutePlanner::TrainRoutingState::TrainRoutingState(const TrainRoutingState &other):
242 occupied_tracks(other.occupied_tracks),
243 offset(other.offset),
244 back_offset(other.back_offset),
247 waypoint(other.waypoint),
248 distance_traveled(other.distance_traveled),
249 remaining_estimate(other.remaining_estimate),
250 wait_time(other.wait_time),
251 blocked_by(other.blocked_by)
253 ++occupied_tracks->refcount;
256 TrainRoutePlanner::TrainRoutingState::~TrainRoutingState()
258 if(occupied_tracks && !--occupied_tracks->refcount)
259 delete occupied_tracks;
262 Time::TimeDelta TrainRoutePlanner::TrainRoutingState::get_time_to_next_track() const
264 return ((track->get_type().get_path_length(path)-offset)/info->speed)*Time::sec+delay;
267 bool TrainRoutePlanner::TrainRoutingState::is_occupying(Track &trk) const
269 OccupiedTrack *occ = occupied_tracks;
270 for(unsigned n=occ->n_tracks; n>0; --n, occ=occ->next)
276 bool TrainRoutePlanner::TrainRoutingState::check_arrival()
278 TrainRouter &router = *info->router;
279 TrackIter next_track = track.next(path);
281 if(waypoint<0 && router.is_destination(*track) && !router.is_destination(*next_track))
286 else if(waypoint>=0 && router.is_waypoint(waypoint, *track) && !router.is_waypoint(waypoint, *next_track))
289 if(waypoint>=static_cast<int>(router.get_n_waypoints()))
296 void TrainRoutePlanner::TrainRoutingState::advance(float distance)
299 back_offset += distance;
301 OccupiedTrack *last_occ = occupied_tracks;
302 for(unsigned n=occupied_tracks->n_tracks; n>1; --n)
303 last_occ = last_occ->next;
305 // XXX What if there's multiple tracks to remove?
306 if(back_offset>last_occ->path_length)
308 back_offset -= last_occ->path_length;
309 if(occupied_tracks->refcount>1)
311 --occupied_tracks->refcount;
312 occupied_tracks = new OccupiedTrack(*occupied_tracks);
314 --occupied_tracks->n_tracks;
317 distance_traveled += distance;
318 remaining_estimate -= distance;
321 void TrainRoutePlanner::TrainRoutingState::advance(const Time::TimeDelta &dt)
329 float secs = dt/Time::sec;
332 secs -= delay/Time::sec;
337 advance(info->speed*secs);
338 else if(state!=ARRIVED)
339 wait_time += secs*Time::sec;
342 void TrainRoutePlanner::TrainRoutingState::advance_track(unsigned next_path)
344 float distance = occupied_tracks->path_length-offset;
345 track = track.next(path);
347 occupied_tracks = new OccupiedTrack(*track, path, occupied_tracks);
352 void TrainRoutePlanner::TrainRoutingState::update_estimate()
354 TrackIter iter = track.reverse(path);
355 float distance = info->router->get_metric(waypoint).get_distance_from(*iter.track(), iter.entry());
356 distance += track->get_type().get_path_length(path)-offset;
357 remaining_estimate = distance;
361 TrainRoutePlanner::RoutingStep::RoutingStep():
365 TrainRoutePlanner::RoutingStep::RoutingStep(const RoutingStep *p):
367 cost_estimate(p->cost_estimate),
372 void TrainRoutePlanner::RoutingStep::create_successors(list<RoutingStep> &new_steps) const
374 RoutingStep next(this);
375 if(next.update_states())
377 if(next.check_deadlocks())
380 new_steps.push_back(next);
384 int train_index = find_next_train();
388 TrainRoutingState &train = next.trains[train_index];
390 Time::TimeDelta dt = train.get_time_to_next_track();
393 if(train.check_arrival())
395 new_steps.push_back(next);
399 TrackIter next_track = train.track.next(train.path);
400 train.advance_track(0);
402 const TrackType::Endpoint &next_entry_ep = next_track.endpoint();
403 for(unsigned i=0; next_entry_ep.paths>>i; ++i)
404 if(next_entry_ep.has_path(i))
407 train.update_estimate();
408 next.update_estimate();
410 new_steps.push_back(next);
413 if(next_entry_ep.paths!=next_track->get_type().get_paths())
415 RoutingStep wait(this);
417 wait.trains[train_index].state = WAITING;
419 new_steps.push_back(wait);
423 bool TrainRoutePlanner::RoutingStep::update_states()
425 bool changes = false;
426 for(vector<TrainRoutingState>::iterator i=trains.begin(); i!=trains.end(); ++i)
428 if(i->state==ARRIVED)
431 TrainState old_state = i->state;
433 TrackIter next_track = i->track.next(i->path);
436 i->blocked_by = get_occupant(*next_track);
439 else if(i->state==BLOCKED)
445 if(i->state!=old_state)
452 bool TrainRoutePlanner::RoutingStep::check_deadlocks() const
454 for(vector<TrainRoutingState>::const_iterator i=trains.begin(); i!=trains.end(); ++i)
456 if(i->state!=BLOCKED)
462 int slow = i->blocked_by;
463 int fast = trains[slow].blocked_by;
464 while(fast>=0 && trains[fast].blocked_by>=0)
469 slow = trains[slow].blocked_by;
470 fast = trains[trains[fast].blocked_by].blocked_by;
477 int TrainRoutePlanner::RoutingStep::get_occupant(Track &track) const
479 for(unsigned i=0; i<trains.size(); ++i)
480 if(trains[i].is_occupying(track))
486 int TrainRoutePlanner::RoutingStep::find_next_train() const
488 Time::TimeDelta min_dt;
490 for(unsigned i=0; i<trains.size(); ++i)
491 if(trains[i].state==MOVING)
493 Time::TimeDelta dt = trains[i].get_time_to_next_track();
494 if(dt<min_dt || next_train<0)
504 void TrainRoutePlanner::RoutingStep::advance(const Time::TimeDelta &dt)
507 for(vector<TrainRoutingState>::iterator i=trains.begin(); i!=trains.end(); ++i)
511 void TrainRoutePlanner::RoutingStep::update_estimate()
513 cost_estimate = Time::zero;
514 for(vector<TrainRoutingState>::const_iterator i=trains.begin(); i!=trains.end(); ++i)
515 if(i->remaining_estimate>=0)
516 cost_estimate += i->wait_time+((i->distance_traveled+i->remaining_estimate)/i->info->speed)*Time::sec;
519 bool TrainRoutePlanner::RoutingStep::is_viable() const
521 for(vector<TrainRoutingState>::const_iterator i=trains.begin(); i!=trains.end(); ++i)
522 if(i->remaining_estimate<0)
525 for(vector<TrainRoutingState>::const_iterator i=trains.begin(); i!=trains.end(); ++i)
532 bool TrainRoutePlanner::RoutingStep::is_goal() const
534 for(vector<TrainRoutingState>::const_iterator i=trains.begin(); i!=trains.end(); ++i)
535 if(i->state!=ARRIVED)
540 bool TrainRoutePlanner::RoutingStep::operator<(const RoutingStep &other) const
542 return cost_estimate<other.cost_estimate;