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 for(const RoutingStep *i=&goal; i; i=i->prev)
80 for(vector<TrainRoutingState>::const_iterator j=i->trains.begin(); j!=i->trains.end(); ++j)
82 Track **history = j->info->track_history;
83 if(j->track.track()==history[0])
86 if(j->state==WAITING || j->state==BLOCKED)
87 j->info->waits.push_front(&*j);
89 Route *route = j->info->routes.front();
90 if(route->has_track(*j->track))
92 route = new Route(j->info->train->get_layout());
93 route->set_name("Router");
94 route->set_temporary(true);
95 for(unsigned k=2; k>0; --k)
96 route->add_track(*history[k]);
97 j->info->routes.push_front(route);
101 route->add_track(*history[0]);
102 for(unsigned k=2; k>0; --k)
103 history[k] = history[k-1];
104 history[0] = j->track.track();
108 for(vector<TrainRoutingInfo>::iterator i=routed_trains.begin(); i!=routed_trains.end(); ++i)
110 for(list<Route *>::iterator j=i->routes.begin(); j!=i->routes.end(); ++j)
112 if(j==i->routes.begin())
113 i->router->set_route(*j);
115 i->router->add_route(**j);
118 const TrainRoutingState *current_wait = 0;
119 for(list<const TrainRoutingState *>::const_iterator j=i->waits.begin(); j!=i->waits.end(); ++j)
120 if(!current_wait || (*j)->track.track()!=current_wait->track.track())
122 Block &block = (*j)->track.next()->get_block();
123 i->router->add_wait(block, 0);
130 TrainRoutePlanner::TrainRoutingInfo::TrainRoutingInfo(Train &t):
132 speed(train->get_maximum_speed()),
133 router(train->get_ai_of_type<TrainRouter>())
135 // If no maximum speed is specified, use a sensible default
137 speed = 20*train->get_layout().get_catalogue().get_scale();
141 TrainRoutePlanner::OccupiedTrack::OccupiedTrack(Track &t, unsigned p, OccupiedTrack *n):
143 path_length(track->get_type().get_path_length(p)),
145 n_tracks(next ? next->n_tracks+1 : 1),
152 TrainRoutePlanner::OccupiedTrack::OccupiedTrack(const OccupiedTrack &other):
154 path_length(other.path_length),
156 n_tracks(other.n_tracks),
163 TrainRoutePlanner::OccupiedTrack::~OccupiedTrack()
165 if(next && !--next->refcount)
170 TrainRoutePlanner::TrainRoutingState::TrainRoutingState(TrainRoutingInfo &inf):
174 delay(info->router->get_departure_delay()),
175 waypoint(info->router->get_n_waypoints() ? 0 : -1),
178 const Vehicle *veh = &info->train->get_vehicle(0);
180 TrackOffsetIter track_and_offs = veh->get_placement().get_position(VehiclePlacement::FRONT_BUFFER);
181 track = track_and_offs.track_iter();
182 offset = track_and_offs.offset();
183 path = track->get_active_path();
185 while(Vehicle *next = veh->get_link(1))
187 track_and_offs = veh->get_placement().get_position(VehiclePlacement::BACK_BUFFER);
188 back_offset = track_and_offs.offset();
190 TrackIter iter = track_and_offs.track_iter();
193 occupied_tracks = new OccupiedTrack(*iter, iter->get_active_path(), occupied_tracks);
194 if(iter.track()==track.track())
202 TrainRoutePlanner::TrainRoutingState::TrainRoutingState(const TrainRoutingState &other):
206 occupied_tracks(other.occupied_tracks),
207 offset(other.offset),
208 back_offset(other.back_offset),
211 waypoint(other.waypoint),
212 distance_traveled(other.distance_traveled),
213 remaining_estimate(other.remaining_estimate),
214 wait_time(other.wait_time),
215 blocked_by(other.blocked_by)
217 ++occupied_tracks->refcount;
220 TrainRoutePlanner::TrainRoutingState::~TrainRoutingState()
222 if(occupied_tracks && !--occupied_tracks->refcount)
223 delete occupied_tracks;
226 Time::TimeDelta TrainRoutePlanner::TrainRoutingState::get_time_to_next_track() const
228 return ((track->get_type().get_path_length(path)-offset)/info->speed)*Time::sec+delay;
231 bool TrainRoutePlanner::TrainRoutingState::is_occupying(Track &trk) const
233 OccupiedTrack *occ = occupied_tracks;
234 for(unsigned n=occ->n_tracks; n>0; --n, occ=occ->next)
240 bool TrainRoutePlanner::TrainRoutingState::check_arrival()
242 TrainRouter &router = *info->router;
243 TrackIter next_track = track.next(path);
245 if(waypoint<0 && router.is_destination(*track) && !router.is_destination(*next_track))
250 else if(waypoint>=0 && router.is_waypoint(waypoint, *track) && !router.is_waypoint(waypoint, *next_track))
253 if(waypoint>=static_cast<int>(router.get_n_waypoints()))
260 void TrainRoutePlanner::TrainRoutingState::advance(float distance)
263 back_offset += distance;
265 OccupiedTrack *last_occ = occupied_tracks;
266 for(unsigned n=occupied_tracks->n_tracks; n>1; --n)
267 last_occ = last_occ->next;
269 // XXX What if there's multiple tracks to remove?
270 if(back_offset>last_occ->path_length)
272 back_offset -= last_occ->path_length;
273 if(occupied_tracks->refcount>1)
275 --occupied_tracks->refcount;
276 occupied_tracks = new OccupiedTrack(*occupied_tracks);
278 --occupied_tracks->n_tracks;
281 distance_traveled += distance;
282 remaining_estimate -= distance;
285 void TrainRoutePlanner::TrainRoutingState::advance(const Time::TimeDelta &dt)
293 float secs = dt/Time::sec;
296 secs -= delay/Time::sec;
301 advance(info->speed*secs);
302 else if(state!=ARRIVED)
303 wait_time += secs*Time::sec;
306 void TrainRoutePlanner::TrainRoutingState::advance_track(unsigned next_path)
308 float distance = occupied_tracks->path_length-offset;
309 track = track.next(path);
311 occupied_tracks = new OccupiedTrack(*track, path, occupied_tracks);
316 void TrainRoutePlanner::TrainRoutingState::update_estimate()
318 TrackIter iter = track.reverse(path);
319 float distance = info->router->get_metric(waypoint).get_distance_from(*iter.track(), iter.entry());
320 distance += track->get_type().get_path_length(path)-offset;
321 remaining_estimate = distance;
325 TrainRoutePlanner::RoutingStep::RoutingStep():
329 TrainRoutePlanner::RoutingStep::RoutingStep(const RoutingStep *p):
331 cost_estimate(p->cost_estimate),
336 void TrainRoutePlanner::RoutingStep::create_successors(list<RoutingStep> &new_steps) const
338 RoutingStep next(this);
339 if(next.update_states())
341 if(next.check_deadlocks())
344 new_steps.push_back(next);
348 int train_index = find_next_train();
352 TrainRoutingState &train = next.trains[train_index];
354 Time::TimeDelta dt = train.get_time_to_next_track();
357 if(train.check_arrival())
359 new_steps.push_back(next);
363 TrackIter next_track = train.track.next(train.path);
364 train.advance_track(0);
366 const TrackType::Endpoint &next_entry_ep = next_track.endpoint();
367 for(unsigned i=0; next_entry_ep.paths>>i; ++i)
368 if(next_entry_ep.has_path(i))
371 train.update_estimate();
372 next.update_estimate();
374 new_steps.push_back(next);
377 if(next_entry_ep.paths!=next_track->get_type().get_paths())
379 RoutingStep wait(this);
381 wait.trains[train_index].state = WAITING;
383 new_steps.push_back(wait);
387 bool TrainRoutePlanner::RoutingStep::update_states()
389 bool changes = false;
390 for(vector<TrainRoutingState>::iterator i=trains.begin(); i!=trains.end(); ++i)
392 if(i->state==ARRIVED)
395 TrainState old_state = i->state;
397 TrackIter next_track = i->track.next(i->path);
400 i->blocked_by = get_occupant(*next_track);
403 else if(i->state==BLOCKED)
409 if(i->state!=old_state)
416 bool TrainRoutePlanner::RoutingStep::check_deadlocks() const
418 for(vector<TrainRoutingState>::const_iterator i=trains.begin(); i!=trains.end(); ++i)
420 if(i->state!=BLOCKED)
426 int slow = i->blocked_by;
427 int fast = trains[slow].blocked_by;
428 while(fast>=0 && trains[fast].blocked_by>=0)
433 slow = trains[slow].blocked_by;
434 fast = trains[trains[fast].blocked_by].blocked_by;
441 int TrainRoutePlanner::RoutingStep::get_occupant(Track &track) const
443 for(unsigned i=0; i<trains.size(); ++i)
444 if(trains[i].is_occupying(track))
450 int TrainRoutePlanner::RoutingStep::find_next_train() const
452 Time::TimeDelta min_dt;
454 for(unsigned i=0; i<trains.size(); ++i)
455 if(trains[i].state==MOVING)
457 Time::TimeDelta dt = trains[i].get_time_to_next_track();
458 if(dt<min_dt || next_train<0)
468 void TrainRoutePlanner::RoutingStep::advance(const Time::TimeDelta &dt)
471 for(vector<TrainRoutingState>::iterator i=trains.begin(); i!=trains.end(); ++i)
475 void TrainRoutePlanner::RoutingStep::update_estimate()
477 cost_estimate = Time::zero;
478 for(vector<TrainRoutingState>::const_iterator i=trains.begin(); i!=trains.end(); ++i)
479 if(i->remaining_estimate>=0)
480 cost_estimate += i->wait_time+((i->distance_traveled+i->remaining_estimate)/i->info->speed)*Time::sec;
483 bool TrainRoutePlanner::RoutingStep::is_viable() const
485 for(vector<TrainRoutingState>::const_iterator i=trains.begin(); i!=trains.end(); ++i)
486 if(i->remaining_estimate<0)
489 for(vector<TrainRoutingState>::const_iterator i=trains.begin(); i!=trains.end(); ++i)
496 bool TrainRoutePlanner::RoutingStep::is_goal() const
498 for(vector<TrainRoutingState>::const_iterator i=trains.begin(); i!=trains.end(); ++i)
499 if(i->state!=ARRIVED)
504 bool TrainRoutePlanner::RoutingStep::operator<(const RoutingStep &other) const
506 return cost_estimate<other.cost_estimate;