5 #include "trainrouteplanner.h"
6 #include "trainrouter.h"
14 TrainRoutePlanner::TrainRoutePlanner(Layout &layout)
16 const map<unsigned, Train *> &trains = layout.get_trains();
17 for(map<unsigned, Train *>::const_iterator i=trains.begin(); i!=trains.end(); ++i)
19 TrainRoutingInfo info(*i->second);
20 if(info.router && info.router->get_destination())
21 routed_trains.push_back(info);
24 steps.push_back(RoutingStep());
25 RoutingStep &start = steps.back();
26 for(vector<TrainRoutingInfo>::iterator i=routed_trains.begin(); i!=routed_trains.end(); ++i)
27 start.trains.push_back(TrainRoutingState(*i));
30 void TrainRoutePlanner::plan()
32 RoutingStep *goal = 0;
33 for(list<RoutingStep>::iterator i=steps.begin(); i!=steps.end(); ++i)
48 void TrainRoutePlanner::add_steps(RoutingStep &step)
50 list<RoutingStep> new_steps;
51 step.create_successors(new_steps);
53 steps.merge(new_steps);
56 void TrainRoutePlanner::create_routes(RoutingStep &goal)
58 for(vector<TrainRoutingInfo>::iterator i=routed_trains.begin(); i!=routed_trains.end(); ++i)
60 i->route = new Route(i->train->get_layout());
61 i->route->set_name("Router");
62 i->route->set_temporary(true);
65 for(RoutingStep *i=&goal; i; i=i->prev)
67 for(vector<TrainRoutingState>::iterator j=i->trains.begin(); j!=i->trains.end(); ++j)
69 if(j->state==WAITING || j->state==BLOCKED)
70 j->info->waits.push_front(&*j);
71 j->info->route->add_track(*j->track);
75 for(vector<TrainRoutingInfo>::iterator i=routed_trains.begin(); i!=routed_trains.end(); ++i)
77 i->router->set_route(i->route);
78 TrainRoutingState *current_wait = 0;
79 for(list<TrainRoutingState *>::iterator j=i->waits.begin(); j!=i->waits.end(); ++j)
80 if(!current_wait || (*j)->track.track()!=current_wait->track.track())
82 Block &block = (*j)->track.next()->get_block();
83 i->router->add_wait(block, 0);
90 TrainRoutePlanner::TrainRoutingInfo::TrainRoutingInfo(Train &t):
92 speed(train->get_maximum_speed()),
93 router(train->get_ai_of_type<TrainRouter>()),
96 // If no maximum speed is specified, use a sensible default
98 speed = 20*train->get_layout().get_catalogue().get_scale();
102 TrainRoutePlanner::OccupiedTrack::OccupiedTrack(Track &t, unsigned p, OccupiedTrack *n):
104 path_length(track->get_type().get_path_length(p)),
106 n_tracks(next ? next->n_tracks+1 : 1),
113 TrainRoutePlanner::OccupiedTrack::OccupiedTrack(const OccupiedTrack &other):
115 path_length(other.path_length),
117 n_tracks(other.n_tracks),
124 TrainRoutePlanner::OccupiedTrack::~OccupiedTrack()
126 if(next && !--next->refcount)
131 TrainRoutePlanner::TrainRoutingState::TrainRoutingState(TrainRoutingInfo &inf):
135 delay(info->router->get_departure_delay()),
136 waypoint(info->router->get_n_waypoints() ? 0 : -1),
139 const Vehicle *veh = &info->train->get_vehicle(0);
141 TrackOffsetIter track_and_offs = veh->get_placement().get_position(VehiclePlacement::FRONT_BUFFER);
142 track = track_and_offs.track_iter();
143 offset = track_and_offs.offset();
144 path = track->get_active_path();
146 while(Vehicle *next = veh->get_link(1))
148 track_and_offs = veh->get_placement().get_position(VehiclePlacement::BACK_BUFFER);
149 back_offset = track_and_offs.offset();
151 TrackIter iter = track_and_offs.track_iter();
154 occupied_tracks = new OccupiedTrack(*iter, iter->get_active_path(), occupied_tracks);
155 if(iter.track()==track.track())
161 TrainRoutePlanner::TrainRoutingState::TrainRoutingState(const TrainRoutingState &other):
165 occupied_tracks(other.occupied_tracks),
166 offset(other.offset),
167 back_offset(other.back_offset),
170 waypoint(other.waypoint),
171 blocked_by(other.blocked_by)
173 ++occupied_tracks->refcount;
176 TrainRoutePlanner::TrainRoutingState::~TrainRoutingState()
178 if(!--occupied_tracks->refcount)
179 delete occupied_tracks;
182 Time::TimeDelta TrainRoutePlanner::TrainRoutingState::get_time_to_next_track() const
184 return ((track->get_type().get_path_length(path)-offset)/info->speed)*Time::sec+delay;
187 bool TrainRoutePlanner::TrainRoutingState::is_occupied(Track &trk) const
189 OccupiedTrack *occ = occupied_tracks;
190 for(unsigned n=occ->n_tracks; n>0; --n, occ=occ->next)
196 bool TrainRoutePlanner::TrainRoutingState::check_arrival()
198 TrainRouter &router = *info->router;
199 TrackIter next_track = track.next(path);
201 if(waypoint<0 && router.is_destination(*track) && !router.is_destination(*next_track))
206 else if(waypoint>=0 && router.is_waypoint(waypoint, *track) && !router.is_waypoint(waypoint, *next_track))
209 if(waypoint>=static_cast<int>(router.get_n_waypoints()))
216 void TrainRoutePlanner::TrainRoutingState::advance(float distance)
219 back_offset += distance;
221 OccupiedTrack *last_occ = occupied_tracks;
222 for(unsigned n=occupied_tracks->n_tracks; n>1; --n)
223 last_occ = last_occ->next;
225 // XXX What if there's multiple tracks to remove?
226 if(back_offset>last_occ->path_length)
228 back_offset -= last_occ->path_length;
229 if(occupied_tracks->refcount>1)
231 --occupied_tracks->refcount;
232 occupied_tracks = new OccupiedTrack(*occupied_tracks);
234 --occupied_tracks->n_tracks;
238 void TrainRoutePlanner::TrainRoutingState::advance_track(unsigned next_path)
240 float distance = occupied_tracks->path_length-offset;
241 track = track.next(path);
243 occupied_tracks = new OccupiedTrack(*track, path, occupied_tracks);
249 TrainRoutePlanner::RoutingStep::RoutingStep():
253 TrainRoutePlanner::RoutingStep::RoutingStep(RoutingStep *p):
259 void TrainRoutePlanner::RoutingStep::create_successors(list<RoutingStep> &new_steps)
261 RoutingStep next(this);
262 if(next.update_states())
264 if(next.check_deadlocks())
267 new_steps.push_back(next);
271 int train_index = find_next_train();
275 TrainRoutingState &train = next.trains[train_index];
277 Time::TimeDelta dt = train.get_time_to_next_track();
280 if(train.check_arrival())
282 new_steps.push_back(next);
286 TrackIter next_track = train.track.next(train.path);
287 train.advance_track(0);
289 const TrackType::Endpoint &next_entry_ep = next_track.endpoint();
290 for(unsigned i=0; next_entry_ep.paths>>i; ++i)
291 if(next_entry_ep.has_path(i))
295 new_steps.push_back(next);
298 if(next_entry_ep.paths!=next_track->get_type().get_paths())
300 RoutingStep wait(this);
302 wait.trains[train_index].state = WAITING;
304 new_steps.push_back(wait);
308 bool TrainRoutePlanner::RoutingStep::update_states()
310 bool changes = false;
311 for(vector<TrainRoutingState>::iterator i=trains.begin(); i!=trains.end(); ++i)
313 if(i->state==ARRIVED)
316 TrainState old_state = i->state;
318 TrackIter next_track = i->track.next(i->path);
321 i->blocked_by = get_occupant(*next_track);
324 else if(i->state==BLOCKED)
330 if(i->state!=old_state)
337 bool TrainRoutePlanner::RoutingStep::check_deadlocks() const
339 for(unsigned i=0; i<trains.size(); ++i)
341 const TrainRoutingState &train = trains[i];
342 if(train.state!=BLOCKED)
345 if(train.blocked_by<0)
348 if(trains[train.blocked_by].blocked_by==static_cast<int>(i))
355 int TrainRoutePlanner::RoutingStep::get_occupant(Track &track) const
357 for(unsigned i=0; i<trains.size(); ++i)
358 if(trains[i].is_occupied(track))
364 int TrainRoutePlanner::RoutingStep::find_next_train() const
366 Time::TimeDelta min_dt;
368 for(unsigned i=0; i<trains.size(); ++i)
369 if(trains[i].state==MOVING)
371 Time::TimeDelta dt = trains[i].get_time_to_next_track();
372 if(dt<min_dt || next_train<0)
382 void TrainRoutePlanner::RoutingStep::advance(const Time::TimeDelta &dt)
385 for(vector<TrainRoutingState>::iterator i=trains.begin(); i!=trains.end(); ++i)
390 if(i->delay>Time::zero)
392 i->delay = Time::zero;
394 else if(i->state==MOVING)
395 i->advance(i->info->speed*(dt/Time::sec));
399 bool TrainRoutePlanner::RoutingStep::is_viable() const
401 for(vector<TrainRoutingState>::const_iterator i=trains.begin(); i!=trains.end(); ++i)
408 bool TrainRoutePlanner::RoutingStep::is_goal() const
410 for(vector<TrainRoutingState>::const_iterator i=trains.begin(); i!=trains.end(); ++i)
411 if(i->state!=ARRIVED)
416 bool TrainRoutePlanner::RoutingStep::operator<(const RoutingStep &other) const
418 return time<other.time;