+#include "catalogue.h"
#include "layout.h"
#include "route.h"
#include "train.h"
void TrainRoutePlanner::plan()
{
- RoutingStep *goal = 0;
+ const RoutingStep *goal = 0;
for(list<RoutingStep>::iterator i=steps.begin(); i!=steps.end(); ++i)
{
if(i->is_goal())
break;
}
- if(update_states(*i))
- {
- int next_train = find_next_train(*i);
- if(next_train>=0)
- add_steps(*i, next_train);
- }
+ add_steps(*i);
}
if(goal)
create_routes(*goal);
}
-bool TrainRoutePlanner::update_states(RoutingStep &step)
+void TrainRoutePlanner::add_steps(const RoutingStep &step)
{
- RoutingStep next(&step);
- bool changes = false;
- for(vector<TrainRoutingState>::iterator i=next.trains.begin(); i!=next.trains.end(); ++i)
- {
- TrainState old_state = i->state;
- if(i->state==BLOCKED)
- i->state = MOVING;
-
- TrackIter next_track = i->track.next(i->path);
- if(!next_track)
- return false;
-
- for(vector<TrainRoutingState>::iterator j=next.trains.begin(); j!=next.trains.end(); ++j)
- if(j!=i)
- {
- if(j->track.track()==next_track.track())
- {
- unsigned other_exit = j->track.reverse(j->path).entry();
- if(next_track.entry()==other_exit)
- return false;
- }
- else if(!j->is_occupied(*next_track))
- continue;
-
- i->state = BLOCKED;
- }
-
- if(i->state!=old_state)
- changes = true;
- }
-
- if(changes)
- {
- list<RoutingStep>::iterator i;
- for(i=steps.begin(); (i!=steps.end() && !(next<*i)); ++i) ;
- steps.insert(i, next);
- }
-
- return !changes;
-}
-
-int TrainRoutePlanner::find_next_train(RoutingStep &step)
-{
- Time::TimeDelta min_dt;
- int next_train = -1;
- for(unsigned i=0; i<step.trains.size(); ++i)
- if(step.trains[i].state==MOVING)
- {
- Time::TimeDelta dt = step.trains[i].get_time_to_next_track();
- if(dt<min_dt || next_train<0)
- {
- min_dt = dt;
- next_train = i;
- }
- }
-
- return next_train;
-}
-
-void TrainRoutePlanner::add_steps(RoutingStep &step, unsigned train_index)
-{
- TrainRoutingState &train = step.trains[train_index];
- Time::TimeDelta dt = train.get_time_to_next_track();
- TrackIter next_track = train.track.next(train.path);
-
list<RoutingStep> new_steps;
-
- RoutingStep next(&step);
- next.advance(dt);
- TrainRouter &router = *train.info->router;
- if(router.is_destination(*train.track) && !router.is_destination(*next_track))
- {
- next.trains[train_index].state = ARRIVED;
- new_steps.push_back(next);
- }
- else
- {
- next.trains[train_index].advance_track(0);
-
- const TrackType::Endpoint &next_entry_ep = next_track.endpoint();
- for(unsigned i=0; next_entry_ep.paths>>i; ++i)
- if(next_entry_ep.has_path(i))
- {
- next.trains[train_index].path = i;
- new_steps.push_back(next);
- }
-
- if(next_entry_ep.paths!=next_track->get_type().get_paths())
- {
- RoutingStep wait(&step);
- wait.advance(dt);
- wait.trains[train_index].state = WAITING;
- new_steps.push_back(wait);
- }
- }
-
+ step.create_successors(new_steps);
new_steps.sort();
steps.merge(new_steps);
}
-void TrainRoutePlanner::create_routes(RoutingStep &goal)
+void TrainRoutePlanner::create_routes(const RoutingStep &goal)
{
for(vector<TrainRoutingInfo>::iterator i=routed_trains.begin(); i!=routed_trains.end(); ++i)
{
i->route->set_temporary(true);
}
- for(RoutingStep *i=&goal; i; i=i->prev)
+ for(const RoutingStep *i=&goal; i; i=i->prev)
{
- for(vector<TrainRoutingState>::iterator j=i->trains.begin(); j!=i->trains.end(); ++j)
+ for(vector<TrainRoutingState>::const_iterator j=i->trains.begin(); j!=i->trains.end(); ++j)
{
if(j->state==WAITING || j->state==BLOCKED)
j->info->waits.push_front(&*j);
for(vector<TrainRoutingInfo>::iterator i=routed_trains.begin(); i!=routed_trains.end(); ++i)
{
i->router->set_route(i->route);
- TrainRoutingState *current_wait = 0;
- for(list<TrainRoutingState *>::iterator j=i->waits.begin(); j!=i->waits.end(); ++j)
+ const TrainRoutingState *current_wait = 0;
+ for(list<const TrainRoutingState *>::const_iterator j=i->waits.begin(); j!=i->waits.end(); ++j)
if(!current_wait || (*j)->track.track()!=current_wait->track.track())
{
Block &block = (*j)->track.next()->get_block();
TrainRoutePlanner::TrainRoutingInfo::TrainRoutingInfo(Train &t):
train(&t),
+ speed(train->get_maximum_speed()),
router(train->get_ai_of_type<TrainRouter>()),
route(0)
-{ }
+{
+ // If no maximum speed is specified, use a sensible default
+ if(!speed)
+ speed = 20*train->get_layout().get_catalogue().get_scale();
+}
TrainRoutePlanner::OccupiedTrack::OccupiedTrack(Track &t, unsigned p, OccupiedTrack *n):
info(&inf),
occupied_tracks(0),
state(MOVING),
- delay(info->router->get_departure_delay())
+ delay(info->router->get_departure_delay()),
+ waypoint(info->router->get_n_waypoints() ? 0 : -1),
+ blocked_by(-1)
{
const Vehicle *veh = &info->train->get_vehicle(0);
// TODO margins
occupied_tracks(other.occupied_tracks),
offset(other.offset),
back_offset(other.back_offset),
- state(other.state)
+ state(other.state),
+ delay(other.delay),
+ waypoint(other.waypoint),
+ blocked_by(other.blocked_by)
{
++occupied_tracks->refcount;
}
Time::TimeDelta TrainRoutePlanner::TrainRoutingState::get_time_to_next_track() const
{
- // TODO Consider the speed of the train
- return (track->get_type().get_path_length(path)-offset)*Time::sec+delay;
+ return ((track->get_type().get_path_length(path)-offset)/info->speed)*Time::sec+delay;
}
bool TrainRoutePlanner::TrainRoutingState::is_occupied(Track &trk) const
return false;
}
+bool TrainRoutePlanner::TrainRoutingState::check_arrival()
+{
+ TrainRouter &router = *info->router;
+ TrackIter next_track = track.next(path);
+
+ if(waypoint<0 && router.is_destination(*track) && !router.is_destination(*next_track))
+ {
+ state = ARRIVED;
+ return true;
+ }
+ else if(waypoint>=0 && router.is_waypoint(waypoint, *track) && !router.is_waypoint(waypoint, *next_track))
+ {
+ ++waypoint;
+ if(waypoint>=static_cast<int>(router.get_n_waypoints()))
+ waypoint = -1;
+ }
+
+ return false;
+}
+
void TrainRoutePlanner::TrainRoutingState::advance(float distance)
{
offset += distance;
prev(0)
{ }
-TrainRoutePlanner::RoutingStep::RoutingStep(RoutingStep *p):
+TrainRoutePlanner::RoutingStep::RoutingStep(const RoutingStep *p):
time(p->time),
trains(p->trains),
prev(p)
{ }
+void TrainRoutePlanner::RoutingStep::create_successors(list<RoutingStep> &new_steps) const
+{
+ RoutingStep next(this);
+ if(next.update_states())
+ {
+ if(next.check_deadlocks())
+ return;
+
+ new_steps.push_back(next);
+ return;
+ }
+
+ int train_index = find_next_train();
+ if(train_index<0)
+ return;
+
+ TrainRoutingState &train = next.trains[train_index];
+
+ Time::TimeDelta dt = train.get_time_to_next_track();
+ next.advance(dt);
+
+ if(train.check_arrival())
+ {
+ new_steps.push_back(next);
+ return;
+ }
+
+ TrackIter next_track = train.track.next(train.path);
+ train.advance_track(0);
+
+ const TrackType::Endpoint &next_entry_ep = next_track.endpoint();
+ for(unsigned i=0; next_entry_ep.paths>>i; ++i)
+ if(next_entry_ep.has_path(i))
+ {
+ train.path = i;
+ if(next.is_viable())
+ new_steps.push_back(next);
+ }
+
+ if(next_entry_ep.paths!=next_track->get_type().get_paths())
+ {
+ RoutingStep wait(this);
+ wait.advance(dt);
+ wait.trains[train_index].state = WAITING;
+ if(wait.is_viable())
+ new_steps.push_back(wait);
+ }
+}
+
+bool TrainRoutePlanner::RoutingStep::update_states()
+{
+ bool changes = false;
+ for(vector<TrainRoutingState>::iterator i=trains.begin(); i!=trains.end(); ++i)
+ {
+ if(i->state==ARRIVED)
+ continue;
+
+ TrainState old_state = i->state;
+
+ TrackIter next_track = i->track.next(i->path);
+ if(next_track)
+ {
+ i->blocked_by = get_occupant(*next_track);
+ if(i->blocked_by>=0)
+ i->state = BLOCKED;
+ else if(i->state==BLOCKED)
+ i->state = MOVING;
+ }
+ else
+ i->state = BLOCKED;
+
+ if(i->state!=old_state)
+ changes = true;
+ }
+
+ return changes;
+}
+
+bool TrainRoutePlanner::RoutingStep::check_deadlocks() const
+{
+ for(vector<TrainRoutingState>::const_iterator i=trains.begin(); i!=trains.end(); ++i)
+ {
+ if(i->state!=BLOCKED)
+ continue;
+
+ if(i->blocked_by<0)
+ return true;
+
+ int slow = i->blocked_by;
+ int fast = trains[slow].blocked_by;
+ while(fast>=0 && trains[fast].blocked_by>=0)
+ {
+ if(fast==slow)
+ return true;
+
+ slow = trains[slow].blocked_by;
+ fast = trains[trains[fast].blocked_by].blocked_by;
+ }
+ }
+
+ return false;
+}
+
+int TrainRoutePlanner::RoutingStep::get_occupant(Track &track) const
+{
+ for(unsigned i=0; i<trains.size(); ++i)
+ if(trains[i].is_occupied(track))
+ return i;
+
+ return -1;
+}
+
+int TrainRoutePlanner::RoutingStep::find_next_train() const
+{
+ Time::TimeDelta min_dt;
+ int next_train = -1;
+ for(unsigned i=0; i<trains.size(); ++i)
+ if(trains[i].state==MOVING)
+ {
+ Time::TimeDelta dt = trains[i].get_time_to_next_track();
+ if(dt<min_dt || next_train<0)
+ {
+ min_dt = dt;
+ next_train = i;
+ }
+ }
+
+ return next_train;
+}
+
void TrainRoutePlanner::RoutingStep::advance(const Time::TimeDelta &dt)
{
time += dt;
i->delay = Time::zero;
}
else if(i->state==MOVING)
- {
- float distance = dt/Time::sec;
- i->advance(distance);
- }
+ i->advance(i->info->speed*(dt/Time::sec));
}
}
+bool TrainRoutePlanner::RoutingStep::is_viable() const
+{
+ for(vector<TrainRoutingState>::const_iterator i=trains.begin(); i!=trains.end(); ++i)
+ if(i->state==MOVING)
+ return true;
+
+ return false;
+}
+
bool TrainRoutePlanner::RoutingStep::is_goal() const
{
for(vector<TrainRoutingState>::const_iterator i=trains.begin(); i!=trains.end(); ++i)