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 i->route = new Route(i->train->get_layout());
70 i->route->set_name("Router");
71 i->route->set_temporary(true);
74 for(const RoutingStep *i=&goal; i; i=i->prev)
76 for(vector<TrainRoutingState>::const_iterator j=i->trains.begin(); j!=i->trains.end(); ++j)
78 if(j->state==WAITING || j->state==BLOCKED)
79 j->info->waits.push_front(&*j);
80 j->info->route->add_track(*j->track);
84 for(vector<TrainRoutingInfo>::iterator i=routed_trains.begin(); i!=routed_trains.end(); ++i)
86 i->router->set_route(i->route);
87 const TrainRoutingState *current_wait = 0;
88 for(list<const TrainRoutingState *>::const_iterator j=i->waits.begin(); j!=i->waits.end(); ++j)
89 if(!current_wait || (*j)->track.track()!=current_wait->track.track())
91 Block &block = (*j)->track.next()->get_block();
92 i->router->add_wait(block, 0);
99 TrainRoutePlanner::TrainRoutingInfo::TrainRoutingInfo(Train &t):
101 speed(train->get_maximum_speed()),
102 router(train->get_ai_of_type<TrainRouter>()),
105 // If no maximum speed is specified, use a sensible default
107 speed = 20*train->get_layout().get_catalogue().get_scale();
111 TrainRoutePlanner::OccupiedTrack::OccupiedTrack(Track &t, unsigned p, OccupiedTrack *n):
113 path_length(track->get_type().get_path_length(p)),
115 n_tracks(next ? next->n_tracks+1 : 1),
122 TrainRoutePlanner::OccupiedTrack::OccupiedTrack(const OccupiedTrack &other):
124 path_length(other.path_length),
126 n_tracks(other.n_tracks),
133 TrainRoutePlanner::OccupiedTrack::~OccupiedTrack()
135 if(next && !--next->refcount)
140 TrainRoutePlanner::TrainRoutingState::TrainRoutingState(TrainRoutingInfo &inf):
144 delay(info->router->get_departure_delay()),
145 waypoint(info->router->get_n_waypoints() ? 0 : -1),
148 const Vehicle *veh = &info->train->get_vehicle(0);
150 TrackOffsetIter track_and_offs = veh->get_placement().get_position(VehiclePlacement::FRONT_BUFFER);
151 track = track_and_offs.track_iter();
152 offset = track_and_offs.offset();
153 path = track->get_active_path();
155 while(Vehicle *next = veh->get_link(1))
157 track_and_offs = veh->get_placement().get_position(VehiclePlacement::BACK_BUFFER);
158 back_offset = track_and_offs.offset();
160 TrackIter iter = track_and_offs.track_iter();
163 occupied_tracks = new OccupiedTrack(*iter, iter->get_active_path(), occupied_tracks);
164 if(iter.track()==track.track())
172 TrainRoutePlanner::TrainRoutingState::TrainRoutingState(const TrainRoutingState &other):
176 occupied_tracks(other.occupied_tracks),
177 offset(other.offset),
178 back_offset(other.back_offset),
181 waypoint(other.waypoint),
182 remaining_estimate(other.remaining_estimate),
183 blocked_by(other.blocked_by)
185 ++occupied_tracks->refcount;
188 TrainRoutePlanner::TrainRoutingState::~TrainRoutingState()
190 if(occupied_tracks && !--occupied_tracks->refcount)
191 delete occupied_tracks;
194 Time::TimeDelta TrainRoutePlanner::TrainRoutingState::get_time_to_next_track() const
196 return ((track->get_type().get_path_length(path)-offset)/info->speed)*Time::sec+delay;
199 bool TrainRoutePlanner::TrainRoutingState::is_occupying(Track &trk) const
201 OccupiedTrack *occ = occupied_tracks;
202 for(unsigned n=occ->n_tracks; n>0; --n, occ=occ->next)
208 bool TrainRoutePlanner::TrainRoutingState::check_arrival()
210 TrainRouter &router = *info->router;
211 TrackIter next_track = track.next(path);
213 if(waypoint<0 && router.is_destination(*track) && !router.is_destination(*next_track))
218 else if(waypoint>=0 && router.is_waypoint(waypoint, *track) && !router.is_waypoint(waypoint, *next_track))
221 if(waypoint>=static_cast<int>(router.get_n_waypoints()))
228 void TrainRoutePlanner::TrainRoutingState::advance(float distance)
231 back_offset += distance;
233 OccupiedTrack *last_occ = occupied_tracks;
234 for(unsigned n=occupied_tracks->n_tracks; n>1; --n)
235 last_occ = last_occ->next;
237 // XXX What if there's multiple tracks to remove?
238 if(back_offset>last_occ->path_length)
240 back_offset -= last_occ->path_length;
241 if(occupied_tracks->refcount>1)
243 --occupied_tracks->refcount;
244 occupied_tracks = new OccupiedTrack(*occupied_tracks);
246 --occupied_tracks->n_tracks;
249 remaining_estimate -= (distance/info->speed)*Time::sec;
250 if(remaining_estimate<Time::zero)
251 remaining_estimate = Time::zero;
254 void TrainRoutePlanner::TrainRoutingState::advance_track(unsigned next_path)
256 float distance = occupied_tracks->path_length-offset;
257 track = track.next(path);
259 occupied_tracks = new OccupiedTrack(*track, path, occupied_tracks);
264 void TrainRoutePlanner::TrainRoutingState::update_estimate()
266 TrackIter iter = track.reverse(path);
267 float distance = info->router->get_metric(waypoint).get_distance_from(*iter.track(), iter.entry());
268 distance += track->get_type().get_path_length(path)-offset;
269 remaining_estimate = (distance/info->speed)*Time::sec+delay;
273 TrainRoutePlanner::RoutingStep::RoutingStep():
277 TrainRoutePlanner::RoutingStep::RoutingStep(const RoutingStep *p):
279 total_estimate(p->total_estimate),
284 void TrainRoutePlanner::RoutingStep::create_successors(list<RoutingStep> &new_steps) const
286 RoutingStep next(this);
287 if(next.update_states())
289 if(next.check_deadlocks())
292 new_steps.push_back(next);
296 int train_index = find_next_train();
300 TrainRoutingState &train = next.trains[train_index];
302 Time::TimeDelta dt = train.get_time_to_next_track();
305 if(train.check_arrival())
307 new_steps.push_back(next);
311 TrackIter next_track = train.track.next(train.path);
312 train.advance_track(0);
314 const TrackType::Endpoint &next_entry_ep = next_track.endpoint();
315 for(unsigned i=0; next_entry_ep.paths>>i; ++i)
316 if(next_entry_ep.has_path(i))
319 train.update_estimate();
320 next.update_estimate();
322 new_steps.push_back(next);
325 if(next_entry_ep.paths!=next_track->get_type().get_paths())
327 RoutingStep wait(this);
329 wait.trains[train_index].state = WAITING;
331 new_steps.push_back(wait);
335 bool TrainRoutePlanner::RoutingStep::update_states()
337 bool changes = false;
338 for(vector<TrainRoutingState>::iterator i=trains.begin(); i!=trains.end(); ++i)
340 if(i->state==ARRIVED)
343 TrainState old_state = i->state;
345 TrackIter next_track = i->track.next(i->path);
348 i->blocked_by = get_occupant(*next_track);
351 else if(i->state==BLOCKED)
357 if(i->state!=old_state)
364 bool TrainRoutePlanner::RoutingStep::check_deadlocks() const
366 for(vector<TrainRoutingState>::const_iterator i=trains.begin(); i!=trains.end(); ++i)
368 if(i->state!=BLOCKED)
374 int slow = i->blocked_by;
375 int fast = trains[slow].blocked_by;
376 while(fast>=0 && trains[fast].blocked_by>=0)
381 slow = trains[slow].blocked_by;
382 fast = trains[trains[fast].blocked_by].blocked_by;
389 int TrainRoutePlanner::RoutingStep::get_occupant(Track &track) const
391 for(unsigned i=0; i<trains.size(); ++i)
392 if(trains[i].is_occupying(track))
398 int TrainRoutePlanner::RoutingStep::find_next_train() const
400 Time::TimeDelta min_dt;
402 for(unsigned i=0; i<trains.size(); ++i)
403 if(trains[i].state==MOVING)
405 Time::TimeDelta dt = trains[i].get_time_to_next_track();
406 if(dt<min_dt || next_train<0)
416 void TrainRoutePlanner::RoutingStep::advance(const Time::TimeDelta &dt)
419 for(vector<TrainRoutingState>::iterator i=trains.begin(); i!=trains.end(); ++i)
424 if(i->delay>Time::zero)
426 i->delay = Time::zero;
428 else if(i->state==MOVING)
429 i->advance(i->info->speed*(dt/Time::sec));
433 void TrainRoutePlanner::RoutingStep::update_estimate()
435 for(vector<TrainRoutingState>::const_iterator i=trains.begin(); i!=trains.end(); ++i)
437 if(i->remaining_estimate<Time::zero)
439 total_estimate = i->remaining_estimate;
443 Time::TimeDelta t = time+i->remaining_estimate;
444 if(i==trains.begin() || t>total_estimate)
449 bool TrainRoutePlanner::RoutingStep::is_viable() const
451 if(total_estimate<Time::zero)
454 for(vector<TrainRoutingState>::const_iterator i=trains.begin(); i!=trains.end(); ++i)
461 bool TrainRoutePlanner::RoutingStep::is_goal() const
463 for(vector<TrainRoutingState>::const_iterator i=trains.begin(); i!=trains.end(); ++i)
464 if(i->state!=ARRIVED)
469 bool TrainRoutePlanner::RoutingStep::operator<(const RoutingStep &other) const
471 return total_estimate<other.total_estimate;