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 if(route->has_track(*j->track))
90 route = new Route(j->info->train->get_layout());
91 route->set_name("Router");
92 route->set_temporary(true);
93 for(unsigned k=2; k>0; --k)
94 route->add_track(*history[k]);
95 j->info->routes.push_front(route);
99 route->add_track(*history[0]);
100 for(unsigned k=2; k>0; --k)
101 history[k] = history[k-1];
102 history[0] = j->track.track();
104 bool waitable = j->track.endpoint().paths!=j->track->get_type().get_paths();
105 map<Track *, SequencingInfo *>::iterator k = sequenced_tracks.find(j->track.track());
106 if(k!=sequenced_tracks.end())
108 if(!k->second->preceding)
110 k->second->preceding = j->info;
111 k->second->sequence_in = sequence;
113 j->info->sequence.push_front(SequencingInfo(j->track.track(), sequence));
115 k->second = &j->info->sequence.front();
120 j->info->sequence.push_front(SequencingInfo(j->track.track(), sequence));
121 sequenced_tracks[j->track.track()] = &j->info->sequence.front();
126 for(vector<TrainRoutingInfo>::iterator i=routed_trains.begin(); i!=routed_trains.end(); ++i)
128 for(list<Route *>::iterator j=i->routes.begin(); j!=i->routes.end(); ++j)
130 if(j==i->routes.begin())
131 i->router->set_route(*j);
133 i->router->add_route(**j);
136 for(list<SequencingInfo>::iterator j=i->sequence.begin(); j!=i->sequence.end(); ++j)
138 if(j->preceding && j->preceding!=&*i)
139 i->router->add_sequence_point(j->track->get_block(), *j->preceding->train, j->sequence_in, j->sequence_out);
141 i->router->add_sequence_point(j->track->get_block(), j->sequence_out);
147 TrainRoutePlanner::SequencingInfo::SequencingInfo(Track *t, unsigned o):
155 TrainRoutePlanner::TrainRoutingInfo::TrainRoutingInfo(Train &t):
157 speed(train->get_maximum_speed()),
158 router(train->get_ai_of_type<TrainRouter>())
160 // If no maximum speed is specified, use a sensible default
162 speed = 20*train->get_layout().get_catalogue().get_scale();
166 TrainRoutePlanner::OccupiedTrack::OccupiedTrack(Track &t, unsigned p, OccupiedTrack *n):
168 path_length(track->get_type().get_path_length(p)),
170 n_tracks(next ? next->n_tracks+1 : 1),
177 TrainRoutePlanner::OccupiedTrack::OccupiedTrack(const OccupiedTrack &other):
179 path_length(other.path_length),
181 n_tracks(other.n_tracks),
188 TrainRoutePlanner::OccupiedTrack::~OccupiedTrack()
190 if(next && !--next->refcount)
195 TrainRoutePlanner::TrainRoutingState::TrainRoutingState(TrainRoutingInfo &inf):
199 delay(info->router->get_departure_delay()),
200 waypoint(info->router->get_n_waypoints() ? 0 : -1),
203 const Vehicle *veh = &info->train->get_vehicle(0);
205 TrackOffsetIter track_and_offs = veh->get_placement().get_position(VehiclePlacement::FRONT_BUFFER);
206 track = track_and_offs.track_iter();
207 offset = track_and_offs.offset();
208 path = track->get_active_path();
210 while(Vehicle *next = veh->get_link(1))
212 track_and_offs = veh->get_placement().get_position(VehiclePlacement::BACK_BUFFER);
213 back_offset = track_and_offs.offset();
215 TrackIter iter = track_and_offs.track_iter();
218 occupied_tracks = new OccupiedTrack(*iter, iter->get_active_path(), occupied_tracks);
219 if(iter.track()==track.track())
227 TrainRoutePlanner::TrainRoutingState::TrainRoutingState(const TrainRoutingState &other):
231 occupied_tracks(other.occupied_tracks),
232 offset(other.offset),
233 back_offset(other.back_offset),
236 waypoint(other.waypoint),
237 distance_traveled(other.distance_traveled),
238 remaining_estimate(other.remaining_estimate),
239 wait_time(other.wait_time),
240 blocked_by(other.blocked_by)
242 ++occupied_tracks->refcount;
245 TrainRoutePlanner::TrainRoutingState::~TrainRoutingState()
247 if(occupied_tracks && !--occupied_tracks->refcount)
248 delete occupied_tracks;
251 Time::TimeDelta TrainRoutePlanner::TrainRoutingState::get_time_to_next_track() const
253 return ((track->get_type().get_path_length(path)-offset)/info->speed)*Time::sec+delay;
256 bool TrainRoutePlanner::TrainRoutingState::is_occupying(Track &trk) const
258 OccupiedTrack *occ = occupied_tracks;
259 for(unsigned n=occ->n_tracks; n>0; --n, occ=occ->next)
265 bool TrainRoutePlanner::TrainRoutingState::check_arrival()
267 TrainRouter &router = *info->router;
268 TrackIter next_track = track.next(path);
270 if(waypoint<0 && router.is_destination(*track) && !router.is_destination(*next_track))
275 else if(waypoint>=0 && router.is_waypoint(waypoint, *track) && !router.is_waypoint(waypoint, *next_track))
278 if(waypoint>=static_cast<int>(router.get_n_waypoints()))
285 void TrainRoutePlanner::TrainRoutingState::advance(float distance)
288 back_offset += distance;
290 OccupiedTrack *last_occ = occupied_tracks;
291 for(unsigned n=occupied_tracks->n_tracks; n>1; --n)
292 last_occ = last_occ->next;
294 // XXX What if there's multiple tracks to remove?
295 if(back_offset>last_occ->path_length)
297 back_offset -= last_occ->path_length;
298 if(occupied_tracks->refcount>1)
300 --occupied_tracks->refcount;
301 occupied_tracks = new OccupiedTrack(*occupied_tracks);
303 --occupied_tracks->n_tracks;
306 distance_traveled += distance;
307 remaining_estimate -= distance;
310 void TrainRoutePlanner::TrainRoutingState::advance(const Time::TimeDelta &dt)
318 float secs = dt/Time::sec;
321 secs -= delay/Time::sec;
326 advance(info->speed*secs);
327 else if(state!=ARRIVED)
328 wait_time += secs*Time::sec;
331 void TrainRoutePlanner::TrainRoutingState::advance_track(unsigned next_path)
333 float distance = occupied_tracks->path_length-offset;
334 track = track.next(path);
336 occupied_tracks = new OccupiedTrack(*track, path, occupied_tracks);
341 void TrainRoutePlanner::TrainRoutingState::update_estimate()
343 TrackIter iter = track.reverse(path);
344 float distance = info->router->get_metric(waypoint).get_distance_from(*iter.track(), iter.entry());
345 distance += track->get_type().get_path_length(path)-offset;
346 remaining_estimate = distance;
350 TrainRoutePlanner::RoutingStep::RoutingStep():
354 TrainRoutePlanner::RoutingStep::RoutingStep(const RoutingStep *p):
356 cost_estimate(p->cost_estimate),
361 void TrainRoutePlanner::RoutingStep::create_successors(list<RoutingStep> &new_steps) const
363 RoutingStep next(this);
364 if(next.update_states())
366 if(next.check_deadlocks())
369 new_steps.push_back(next);
373 int train_index = find_next_train();
377 TrainRoutingState &train = next.trains[train_index];
379 Time::TimeDelta dt = train.get_time_to_next_track();
382 if(train.check_arrival())
384 new_steps.push_back(next);
388 TrackIter next_track = train.track.next(train.path);
389 train.advance_track(0);
391 const TrackType::Endpoint &next_entry_ep = next_track.endpoint();
392 for(unsigned i=0; next_entry_ep.paths>>i; ++i)
393 if(next_entry_ep.has_path(i))
396 train.update_estimate();
397 next.update_estimate();
399 new_steps.push_back(next);
402 if(next_entry_ep.paths!=next_track->get_type().get_paths())
404 RoutingStep wait(this);
406 wait.trains[train_index].state = WAITING;
408 new_steps.push_back(wait);
412 bool TrainRoutePlanner::RoutingStep::update_states()
414 bool changes = false;
415 for(vector<TrainRoutingState>::iterator i=trains.begin(); i!=trains.end(); ++i)
417 if(i->state==ARRIVED)
420 TrainState old_state = i->state;
422 TrackIter next_track = i->track.next(i->path);
425 i->blocked_by = get_occupant(*next_track);
428 else if(i->state==BLOCKED)
434 if(i->state!=old_state)
441 bool TrainRoutePlanner::RoutingStep::check_deadlocks() const
443 for(vector<TrainRoutingState>::const_iterator i=trains.begin(); i!=trains.end(); ++i)
445 if(i->state!=BLOCKED)
451 int slow = i->blocked_by;
452 int fast = trains[slow].blocked_by;
453 while(fast>=0 && trains[fast].blocked_by>=0)
458 slow = trains[slow].blocked_by;
459 fast = trains[trains[fast].blocked_by].blocked_by;
466 int TrainRoutePlanner::RoutingStep::get_occupant(Track &track) const
468 for(unsigned i=0; i<trains.size(); ++i)
469 if(trains[i].is_occupying(track))
475 int TrainRoutePlanner::RoutingStep::find_next_train() const
477 Time::TimeDelta min_dt;
479 for(unsigned i=0; i<trains.size(); ++i)
480 if(trains[i].state==MOVING)
482 Time::TimeDelta dt = trains[i].get_time_to_next_track();
483 if(dt<min_dt || next_train<0)
493 void TrainRoutePlanner::RoutingStep::advance(const Time::TimeDelta &dt)
496 for(vector<TrainRoutingState>::iterator i=trains.begin(); i!=trains.end(); ++i)
500 void TrainRoutePlanner::RoutingStep::update_estimate()
502 cost_estimate = Time::zero;
503 for(vector<TrainRoutingState>::const_iterator i=trains.begin(); i!=trains.end(); ++i)
504 if(i->remaining_estimate>=0)
505 cost_estimate += i->wait_time+((i->distance_traveled+i->remaining_estimate)/i->info->speed)*Time::sec;
508 bool TrainRoutePlanner::RoutingStep::is_viable() const
510 for(vector<TrainRoutingState>::const_iterator i=trains.begin(); i!=trains.end(); ++i)
511 if(i->remaining_estimate<0)
514 for(vector<TrainRoutingState>::const_iterator i=trains.begin(); i!=trains.end(); ++i)
521 bool TrainRoutePlanner::RoutingStep::is_goal() const
523 for(vector<TrainRoutingState>::const_iterator i=trains.begin(); i!=trains.end(); ++i)
524 if(i->state!=ARRIVED)
529 bool TrainRoutePlanner::RoutingStep::operator<(const RoutingStep &other) const
531 return cost_estimate<other.cost_estimate;