state(other.state),
delay(other.delay),
waypoint(other.waypoint),
+ distance_traveled(other.distance_traveled),
remaining_estimate(other.remaining_estimate),
+ wait_time(other.wait_time),
blocked_by(other.blocked_by)
{
++occupied_tracks->refcount;
--occupied_tracks->n_tracks;
}
- remaining_estimate -= (distance/info->speed)*Time::sec;
- if(remaining_estimate<Time::zero)
- remaining_estimate = Time::zero;
+ distance_traveled += distance;
+ remaining_estimate -= distance;
+}
+
+void TrainRoutePlanner::TrainRoutingState::advance(const Time::TimeDelta &dt)
+{
+ if(delay>=dt)
+ {
+ delay -= dt;
+ return;
+ }
+
+ float secs = dt/Time::sec;
+ if(delay)
+ {
+ secs -= delay/Time::sec;
+ delay = Time::zero;
+ }
+
+ if(state==MOVING)
+ advance(info->speed*secs);
+ else if(state!=ARRIVED)
+ wait_time += secs*Time::sec;
}
void TrainRoutePlanner::TrainRoutingState::advance_track(unsigned next_path)
TrackIter iter = track.reverse(path);
float distance = info->router->get_metric(waypoint).get_distance_from(*iter.track(), iter.entry());
distance += track->get_type().get_path_length(path)-offset;
- remaining_estimate = (distance/info->speed)*Time::sec+delay;
+ remaining_estimate = distance;
}
TrainRoutePlanner::RoutingStep::RoutingStep(const RoutingStep *p):
time(p->time),
- total_estimate(p->total_estimate),
+ cost_estimate(p->cost_estimate),
trains(p->trains),
prev(p)
{ }
{
time += dt;
for(vector<TrainRoutingState>::iterator i=trains.begin(); i!=trains.end(); ++i)
- {
- if(i->delay)
- {
- i->delay -= dt;
- if(i->delay>Time::zero)
- continue;
- i->delay = Time::zero;
- }
- else if(i->state==MOVING)
- i->advance(i->info->speed*(dt/Time::sec));
- }
+ i->advance(dt);
}
void TrainRoutePlanner::RoutingStep::update_estimate()
{
+ cost_estimate = Time::zero;
for(vector<TrainRoutingState>::const_iterator i=trains.begin(); i!=trains.end(); ++i)
- {
- if(i->remaining_estimate<Time::zero)
- {
- total_estimate = i->remaining_estimate;
- return;
- }
-
- Time::TimeDelta t = time+i->remaining_estimate;
- if(i==trains.begin() || t>total_estimate)
- total_estimate = t;
- }
+ if(i->remaining_estimate>=0)
+ cost_estimate += i->wait_time+((i->distance_traveled+i->remaining_estimate)/i->info->speed)*Time::sec;
}
bool TrainRoutePlanner::RoutingStep::is_viable() const
{
- if(total_estimate<Time::zero)
- return false;
+ for(vector<TrainRoutingState>::const_iterator i=trains.begin(); i!=trains.end(); ++i)
+ if(i->remaining_estimate<0)
+ return false;
for(vector<TrainRoutingState>::const_iterator i=trains.begin(); i!=trains.end(); ++i)
if(i->state==MOVING)
bool TrainRoutePlanner::RoutingStep::operator<(const RoutingStep &other) const
{
- return total_estimate<other.total_estimate;
+ return cost_estimate<other.cost_estimate;
}
} // namespace R2C2