#include "layout.h"
#include "route.h"
#include "train.h"
+#include "trainroutemetric.h"
#include "trainrouteplanner.h"
#include "trainrouter.h"
#include "vehicle.h"
routed_trains.push_back(info);
}
- steps.push_back(RoutingStep());
- RoutingStep &start = steps.back();
+ 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();
}
void TrainRoutePlanner::plan()
{
- RoutingStep *goal = 0;
- for(list<RoutingStep>::iterator i=steps.begin(); i!=steps.end(); ++i)
+ const RoutingStep *goal = 0;
+ 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);
}
-void TrainRoutePlanner::add_steps(RoutingStep &step)
+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(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();
break;
iter = iter.next();
}
+
+ update_estimate();
}
TrainRoutePlanner::TrainRoutingState::TrainRoutingState(const TrainRoutingState &other):
state(other.state),
delay(other.delay),
waypoint(other.waypoint),
+ remaining_estimate(other.remaining_estimate),
blocked_by(other.blocked_by)
{
++occupied_tracks->refcount;
TrainRoutePlanner::TrainRoutingState::~TrainRoutingState()
{
- if(!--occupied_tracks->refcount)
+ if(occupied_tracks && !--occupied_tracks->refcount)
delete occupied_tracks;
}
return ((track->get_type().get_path_length(path)-offset)/info->speed)*Time::sec+delay;
}
-bool TrainRoutePlanner::TrainRoutingState::is_occupied(Track &trk) const
+bool TrainRoutePlanner::TrainRoutingState::is_occupying(Track &trk) const
{
OccupiedTrack *occ = occupied_tracks;
for(unsigned n=occ->n_tracks; n>0; --n, occ=occ->next)
}
--occupied_tracks->n_tracks;
}
+
+ remaining_estimate -= (distance/info->speed)*Time::sec;
+ if(remaining_estimate<Time::zero)
+ remaining_estimate = Time::zero;
}
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/info->speed)*Time::sec+delay;
+}
+
TrainRoutePlanner::RoutingStep::RoutingStep():
prev(0)
{ }
-TrainRoutePlanner::RoutingStep::RoutingStep(RoutingStep *p):
+TrainRoutePlanner::RoutingStep::RoutingStep(const RoutingStep *p):
time(p->time),
+ total_estimate(p->total_estimate),
trains(p->trains),
prev(p)
{ }
-void TrainRoutePlanner::RoutingStep::create_successors(list<RoutingStep> &new_steps)
+void TrainRoutePlanner::RoutingStep::create_successors(list<RoutingStep> &new_steps) const
{
RoutingStep next(this);
if(next.update_states())
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);
}
bool TrainRoutePlanner::RoutingStep::check_deadlocks() const
{
- for(unsigned i=0; i<trains.size(); ++i)
+ for(vector<TrainRoutingState>::const_iterator i=trains.begin(); i!=trains.end(); ++i)
{
- const TrainRoutingState &train = trains[i];
- if(train.state!=BLOCKED)
+ if(i->state!=BLOCKED)
continue;
- if(train.blocked_by<0)
+ if(i->blocked_by<0)
return true;
- if(trains[train.blocked_by].blocked_by==static_cast<int>(i))
- 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))
+ if(trains[i].is_occupying(track))
return i;
return -1;
}
}
+void TrainRoutePlanner::RoutingStep::update_estimate()
+{
+ 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;
+ }
+}
+
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->state==MOVING)
return true;
bool TrainRoutePlanner::RoutingStep::operator<(const RoutingStep &other) const
{
- return time<other.time;
+ return total_estimate<other.total_estimate;
}
} // namespace R2C2
projects / r2c2.git / blobdiff