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)
43 int next_train = find_next_train(*i);
45 add_steps(*i, next_train);
53 bool TrainRoutePlanner::update_states(RoutingStep &step)
55 RoutingStep next(&step);
57 for(vector<TrainRoutingState>::iterator i=next.trains.begin(); i!=next.trains.end(); ++i)
62 TrainState old_state = i->state;
66 TrackIter next_track = i->track.next(i->path);
70 for(vector<TrainRoutingState>::iterator j=next.trains.begin(); j!=next.trains.end(); ++j)
73 if(j->track.track()==next_track.track())
75 unsigned other_exit = j->track.reverse(j->path).entry();
76 if(next_track.entry()==other_exit)
79 else if(!j->is_occupied(*next_track))
85 if(i->state!=old_state)
91 list<RoutingStep>::iterator i;
92 for(i=steps.begin(); (i!=steps.end() && !(next<*i)); ++i) ;
93 steps.insert(i, next);
99 int TrainRoutePlanner::find_next_train(RoutingStep &step)
101 Time::TimeDelta min_dt;
103 for(unsigned i=0; i<step.trains.size(); ++i)
104 if(step.trains[i].state==MOVING)
106 Time::TimeDelta dt = step.trains[i].get_time_to_next_track();
107 if(dt<min_dt || next_train<0)
117 void TrainRoutePlanner::add_steps(RoutingStep &step, unsigned train_index)
119 TrainRoutingState &train = step.trains[train_index];
120 Time::TimeDelta dt = train.get_time_to_next_track();
121 TrackIter next_track = train.track.next(train.path);
123 list<RoutingStep> new_steps;
125 RoutingStep next(&step);
127 TrainRouter &router = *train.info->router;
128 if(train.waypoint<0 && router.is_destination(*train.track) && !router.is_destination(*next_track))
130 next.trains[train_index].state = ARRIVED;
131 new_steps.push_back(next);
135 if(train.waypoint>=0 && router.is_waypoint(train.waypoint, *train.track) && !router.is_waypoint(train.waypoint, *next_track))
137 ++next.trains[train_index].waypoint;
138 if(next.trains[train_index].waypoint>=static_cast<int>(router.get_n_waypoints()))
139 next.trains[train_index].waypoint = -1;
142 next.trains[train_index].advance_track(0);
144 const TrackType::Endpoint &next_entry_ep = next_track.endpoint();
145 for(unsigned i=0; next_entry_ep.paths>>i; ++i)
146 if(next_entry_ep.has_path(i))
148 next.trains[train_index].path = i;
150 new_steps.push_back(next);
153 if(next_entry_ep.paths!=next_track->get_type().get_paths())
155 RoutingStep wait(&step);
157 wait.trains[train_index].state = WAITING;
159 new_steps.push_back(wait);
164 steps.merge(new_steps);
167 void TrainRoutePlanner::create_routes(RoutingStep &goal)
169 for(vector<TrainRoutingInfo>::iterator i=routed_trains.begin(); i!=routed_trains.end(); ++i)
171 i->route = new Route(i->train->get_layout());
172 i->route->set_name("Router");
173 i->route->set_temporary(true);
176 for(RoutingStep *i=&goal; i; i=i->prev)
178 for(vector<TrainRoutingState>::iterator j=i->trains.begin(); j!=i->trains.end(); ++j)
180 if(j->state==WAITING || j->state==BLOCKED)
181 j->info->waits.push_front(&*j);
182 j->info->route->add_track(*j->track);
186 for(vector<TrainRoutingInfo>::iterator i=routed_trains.begin(); i!=routed_trains.end(); ++i)
188 i->router->set_route(i->route);
189 TrainRoutingState *current_wait = 0;
190 for(list<TrainRoutingState *>::iterator j=i->waits.begin(); j!=i->waits.end(); ++j)
191 if(!current_wait || (*j)->track.track()!=current_wait->track.track())
193 Block &block = (*j)->track.next()->get_block();
194 i->router->add_wait(block, 0);
201 TrainRoutePlanner::TrainRoutingInfo::TrainRoutingInfo(Train &t):
203 speed(train->get_maximum_speed()),
204 router(train->get_ai_of_type<TrainRouter>()),
207 // If no maximum speed is specified, use a sensible default
209 speed = 20*train->get_layout().get_catalogue().get_scale();
213 TrainRoutePlanner::OccupiedTrack::OccupiedTrack(Track &t, unsigned p, OccupiedTrack *n):
215 path_length(track->get_type().get_path_length(p)),
217 n_tracks(next ? next->n_tracks+1 : 1),
224 TrainRoutePlanner::OccupiedTrack::OccupiedTrack(const OccupiedTrack &other):
226 path_length(other.path_length),
228 n_tracks(other.n_tracks),
235 TrainRoutePlanner::OccupiedTrack::~OccupiedTrack()
237 if(next && !--next->refcount)
242 TrainRoutePlanner::TrainRoutingState::TrainRoutingState(TrainRoutingInfo &inf):
246 delay(info->router->get_departure_delay()),
247 waypoint(info->router->get_n_waypoints() ? 0 : -1)
249 const Vehicle *veh = &info->train->get_vehicle(0);
251 TrackOffsetIter track_and_offs = veh->get_placement().get_position(VehiclePlacement::FRONT_BUFFER);
252 track = track_and_offs.track_iter();
253 offset = track_and_offs.offset();
254 path = track->get_active_path();
256 while(Vehicle *next = veh->get_link(1))
258 track_and_offs = veh->get_placement().get_position(VehiclePlacement::BACK_BUFFER);
259 back_offset = track_and_offs.offset();
261 TrackIter iter = track_and_offs.track_iter();
264 occupied_tracks = new OccupiedTrack(*iter, iter->get_active_path(), occupied_tracks);
265 if(iter.track()==track.track())
271 TrainRoutePlanner::TrainRoutingState::TrainRoutingState(const TrainRoutingState &other):
275 occupied_tracks(other.occupied_tracks),
276 offset(other.offset),
277 back_offset(other.back_offset),
280 waypoint(other.waypoint)
282 ++occupied_tracks->refcount;
285 TrainRoutePlanner::TrainRoutingState::~TrainRoutingState()
287 if(!--occupied_tracks->refcount)
288 delete occupied_tracks;
291 Time::TimeDelta TrainRoutePlanner::TrainRoutingState::get_time_to_next_track() const
293 return ((track->get_type().get_path_length(path)-offset)/info->speed)*Time::sec+delay;
296 bool TrainRoutePlanner::TrainRoutingState::is_occupied(Track &trk) const
298 OccupiedTrack *occ = occupied_tracks;
299 for(unsigned n=occ->n_tracks; n>0; --n, occ=occ->next)
305 void TrainRoutePlanner::TrainRoutingState::advance(float distance)
308 back_offset += distance;
310 OccupiedTrack *last_occ = occupied_tracks;
311 for(unsigned n=occupied_tracks->n_tracks; n>1; --n)
312 last_occ = last_occ->next;
314 // XXX What if there's multiple tracks to remove?
315 if(back_offset>last_occ->path_length)
317 back_offset -= last_occ->path_length;
318 if(occupied_tracks->refcount>1)
320 --occupied_tracks->refcount;
321 occupied_tracks = new OccupiedTrack(*occupied_tracks);
323 --occupied_tracks->n_tracks;
327 void TrainRoutePlanner::TrainRoutingState::advance_track(unsigned next_path)
329 float distance = occupied_tracks->path_length-offset;
330 track = track.next(path);
332 occupied_tracks = new OccupiedTrack(*track, path, occupied_tracks);
338 TrainRoutePlanner::RoutingStep::RoutingStep():
342 TrainRoutePlanner::RoutingStep::RoutingStep(RoutingStep *p):
348 void TrainRoutePlanner::RoutingStep::advance(const Time::TimeDelta &dt)
351 for(vector<TrainRoutingState>::iterator i=trains.begin(); i!=trains.end(); ++i)
356 if(i->delay>Time::zero)
358 i->delay = Time::zero;
360 else if(i->state==MOVING)
361 i->advance(i->info->speed*(dt/Time::sec));
365 bool TrainRoutePlanner::RoutingStep::is_viable() const
367 for(vector<TrainRoutingState>::const_iterator i=trains.begin(); i!=trains.end(); ++i)
374 bool TrainRoutePlanner::RoutingStep::is_goal() const
376 for(vector<TrainRoutingState>::const_iterator i=trains.begin(); i!=trains.end(); ++i)
377 if(i->state!=ARRIVED)
382 bool TrainRoutePlanner::RoutingStep::operator<(const RoutingStep &other) const
384 return time<other.time;