#include "layout.h"
#include "route.h"
#include "train.h"
+#include "trainroutemetric.h"
#include "trainrouteplanner.h"
#include "trainrouter.h"
#include "vehicle.h"
if(info.router && info.router->get_destination())
routed_trains.push_back(info);
}
-
- steps.push_back(RoutingStep());
- RoutingStep &start = steps.back();
- for(vector<TrainRoutingInfo>::iterator i=routed_trains.begin(); i!=routed_trains.end(); ++i)
- start.trains.push_back(TrainRoutingState(*i));
}
void TrainRoutePlanner::plan()
{
+ steps.clear();
+ queue.clear();
+
+ queue.push_back(RoutingStep());
+ RoutingStep &start = queue.back();
+ for(vector<TrainRoutingInfo>::iterator i=routed_trains.begin(); i!=routed_trains.end(); ++i)
+ start.trains.push_back(TrainRoutingState(*i));
+ start.update_estimate();
+
const RoutingStep *goal = 0;
- for(list<RoutingStep>::iterator i=steps.begin(); i!=steps.end(); ++i)
+ while(!queue.empty())
{
- if(i->is_goal())
+ const RoutingStep &step = get_step();
+ if(step.is_goal())
{
- goal = &*i;
+ goal = &step;
break;
}
- add_steps(*i);
+ add_steps(step);
}
if(goal)
create_routes(*goal);
}
+const TrainRoutePlanner::RoutingStep &TrainRoutePlanner::get_step()
+{
+ steps.splice(steps.end(), queue, queue.begin());
+ return steps.back();
+}
+
void TrainRoutePlanner::add_steps(const RoutingStep &step)
{
list<RoutingStep> new_steps;
step.create_successors(new_steps);
new_steps.sort();
- steps.merge(new_steps);
+ queue.merge(new_steps);
}
void TrainRoutePlanner::create_routes(const RoutingStep &goal)
{
for(vector<TrainRoutingInfo>::iterator i=routed_trains.begin(); i!=routed_trains.end(); ++i)
{
- i->route = new Route(i->train->get_layout());
- i->route->set_name("Router");
- i->route->set_temporary(true);
+ i->routes.clear();
+ i->sequence.clear();
+ for(unsigned j=0; j<3; ++j)
+ i->track_history[j] = 0;
}
+ map<Track *, SequencingInfo *> sequenced_tracks;
+ unsigned sequence = steps.size();
for(const RoutingStep *i=&goal; i; i=i->prev)
- {
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);
- j->info->route->add_track(*j->track);
+ Track **history = j->info->track_history;
+ if(j->track.track()==history[0])
+ continue;
+
+ Route *route = 0;
+ bool start_new_route = true;
+ if(!j->info->routes.empty())
+ {
+ route = j->info->routes.front();
+ start_new_route = route->has_track(*j->track);
+ if(!start_new_route)
+ {
+ unsigned nls = j->track->get_n_link_slots();
+ for(unsigned k=0; (!start_new_route && k<nls); ++k)
+ {
+ Track *link = j->track->get_link(k);
+ start_new_route = (link && link!=history[0] && route->has_track(*link));
+ }
+ }
+ }
+
+ if(start_new_route)
+ {
+ route = new Route(j->info->train->get_layout());
+ route->set_name("Router");
+ route->set_temporary(true);
+ for(unsigned k=2; k>0; --k)
+ if(history[k])
+ route->add_track(*history[k]);
+ j->info->routes.push_front(route);
+ }
+
+ if(history[0])
+ route->add_track(*history[0]);
+ for(unsigned k=2; k>0; --k)
+ history[k] = history[k-1];
+ history[0] = j->track.track();
+
+ bool waitable = j->track.endpoint().paths!=j->track->get_type().get_paths();
+ map<Track *, SequencingInfo *>::iterator k = sequenced_tracks.find(j->track.track());
+ if(k!=sequenced_tracks.end())
+ {
+ if(!k->second->preceding)
+ {
+ k->second->preceding = j->info;
+ k->second->sequence_in = sequence;
+ }
+ j->info->sequence.push_front(SequencingInfo(j->track.track(), sequence));
+ if(waitable)
+ k->second = &j->info->sequence.front();
+ --sequence;
+ }
+ else if(waitable)
+ {
+ j->info->sequence.push_front(SequencingInfo(j->track.track(), sequence));
+ sequenced_tracks[j->track.track()] = &j->info->sequence.front();
+ --sequence;
+ }
}
- }
for(vector<TrainRoutingInfo>::iterator i=routed_trains.begin(); i!=routed_trains.end(); ++i)
{
- i->router->set_route(i->route);
- 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();
- i->router->add_wait(block, 0);
- current_wait = *j;
- }
+ for(list<Route *>::iterator j=i->routes.begin(); j!=i->routes.end(); ++j)
+ {
+ if(j==i->routes.begin())
+ i->router->set_route(*j);
+ else
+ i->router->add_route(**j);
+ }
+
+ for(list<SequencingInfo>::iterator j=i->sequence.begin(); j!=i->sequence.end(); ++j)
+ {
+ if(j->preceding && j->preceding!=&*i)
+ i->router->add_sequence_point(j->track->get_block(), *j->preceding->train, j->sequence_in, j->sequence_out);
+ else
+ i->router->add_sequence_point(j->track->get_block(), j->sequence_out);
+ }
}
}
+TrainRoutePlanner::SequencingInfo::SequencingInfo(Track *t, unsigned o):
+ track(t),
+ preceding(0),
+ sequence_in(0),
+ sequence_out(o)
+{ }
+
+
TrainRoutePlanner::TrainRoutingInfo::TrainRoutingInfo(Train &t):
train(&t),
speed(train->get_maximum_speed()),
- router(train->get_ai_of_type<TrainRouter>()),
- route(0)
+ router(train->get_ai_of_type<TrainRouter>())
{
// If no maximum speed is specified, use a sensible default
if(!speed)
break;
iter = iter.next();
}
+
+ update_estimate();
}
TrainRoutePlanner::TrainRoutingState::TrainRoutingState(const TrainRoutingState &other):
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;
}
+
+ 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)
offset = 0;
}
+void TrainRoutePlanner::TrainRoutingState::update_estimate()
+{
+ 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;
+}
+
TrainRoutePlanner::RoutingStep::RoutingStep():
prev(0)
TrainRoutePlanner::RoutingStep::RoutingStep(const RoutingStep *p):
time(p->time),
+ cost_estimate(p->cost_estimate),
trains(p->trains),
prev(p)
{ }
if(next_entry_ep.has_path(i))
{
train.path = i;
+ train.update_estimate();
+ next.update_estimate();
if(next.is_viable())
new_steps.push_back(next);
}
{
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>=0)
+ cost_estimate += i->wait_time+((i->distance_traveled+i->remaining_estimate)/i->info->speed)*Time::sec;
}
bool TrainRoutePlanner::RoutingStep::is_viable() const
{
+ 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)
return true;
bool TrainRoutePlanner::RoutingStep::operator<(const RoutingStep &other) const
{
- return time<other.time;
+ return cost_estimate<other.cost_estimate;
}
} // namespace R2C2
projects / r2c2.git / blobdiff