X-Git-Url: http://git.tdb.fi/?a=blobdiff_plain;f=source%2Flibr2c2%2Ftrainrouteplanner.cpp;h=b4f01ab6a860084901add49d3ab21de3405d49d0;hb=bf321305d7bf65aa5033a835f61370cd48f54619;hp=e813b366fe88a4829d4cc155f9d731d41108d461;hpb=4232c65cb556d278dee218866de77402ff888f1e;p=r2c2.git

diff --git a/source/libr2c2/trainrouteplanner.cpp b/source/libr2c2/trainrouteplanner.cpp
index e813b36..b4f01ab 100644
--- a/source/libr2c2/trainrouteplanner.cpp
+++ b/source/libr2c2/trainrouteplanner.cpp
@@ -1,7 +1,9 @@
+#include <msp/core/maputils.h>
 #include "catalogue.h"
 #include "layout.h"
 #include "route.h"
 #include "train.h"
+#include "trainroutemetric.h"
 #include "trainrouteplanner.h"
 #include "trainrouter.h"
 #include "vehicle.h"
@@ -11,7 +13,10 @@ using namespace Msp;
 
 namespace R2C2 {
 
-TrainRoutePlanner::TrainRoutePlanner(Layout &layout)
+TrainRoutePlanner::TrainRoutePlanner(Layout &layout):
+	goal(0),
+	result(PENDING),
+	thread(0)
 {
 	const map<unsigned, Train *> &trains = layout.get_trains();
 	for(map<unsigned, Train *>::const_iterator i=trains.begin(); i!=trains.end(); ++i)
@@ -20,29 +25,98 @@ TrainRoutePlanner::TrainRoutePlanner(Layout &layout)
 		if(info.router && info.router->get_destination())
 			routed_trains.push_back(info);
 	}
+}
+
+TrainRoutePlanner::~TrainRoutePlanner()
+{
+	delete thread;
+}
+
+TrainRoutePlanner::Result TrainRoutePlanner::plan()
+{
+	prepare_plan();
+	create_plan();
+	if(result==PENDING)
+		finalize_plan();
+
+	return result;
+}
+
+void TrainRoutePlanner::plan_async()
+{
+	if(thread)
+		throw logic_error("already planning");
+
+	prepare_plan();
+	thread = new PlanningThread(*this);
+}
+
+TrainRoutePlanner::Result TrainRoutePlanner::check()
+{
+	if(result==PENDING && goal)
+	{
+		finalize_plan();
+		delete thread;
+		thread = 0;
+	}
+
+	return result;
+}
+
+const list<Route *> &TrainRoutePlanner::get_routes_for(const Train &train) const
+{
+	return get_train_info(train).routes;
+}
+
+const list<TrainRouter::SequencePoint> &TrainRoutePlanner::get_sequence_for(const Train &train) const
+{
+	return get_train_info(train).sequence;
+}
+
+const TrainRoutePlanner::TrainRoutingInfo &TrainRoutePlanner::get_train_info(const Train &train) const
+{
+	for(vector<TrainRoutingInfo>::const_iterator i=routed_trains.begin(); i!=routed_trains.end(); ++i)
+		if(i->train==&train)
+			return *i;
+
+	throw key_error(train.get_name());
+}
+
+const TrainRoutePlanner::RoutingStep &TrainRoutePlanner::get_step()
+{
+	steps.splice(steps.end(), queue, queue.begin());
+	return steps.back();
+}
+
+void TrainRoutePlanner::prepare_plan()
+{
+	steps.clear();
+	queue.clear();
+	goal = 0;
+	result = PENDING;
 
-	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()
+void TrainRoutePlanner::create_plan()
 {
-	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;
-			break;
+			goal = &step;
+			return;
 		}
 
-		add_steps(*i);
+		add_steps(step);
 	}
 
-	if(goal)
-		create_routes(*goal);
+	result = FAILED;
 }
 
 void TrainRoutePlanner::add_steps(const RoutingStep &step)
@@ -50,48 +124,92 @@ 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)
+void TrainRoutePlanner::finalize_plan()
 {
 	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;
 	}
 
-	for(const RoutingStep *i=&goal; i; i=i->prev)
-	{
+	map<Track *, TrainRouter::SequencePoint *> 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;
 
-	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())
+			Route *route = 0;
+			bool start_new_route = true;
+			if(!j->info->routes.empty())
 			{
-				Block &block = (*j)->track.next()->get_block();
-				i->router->add_wait(block, 0);
-				current_wait = *j;
+				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 *, TrainRouter::SequencePoint *>::iterator k = sequenced_tracks.find(j->track.track());
+			if(k!=sequenced_tracks.end())
+			{
+				if(!k->second->preceding_train)
+				{
+					k->second->preceding_train = j->info->train;
+					k->second->sequence_in = sequence;
+				}
+				j->info->sequence.push_front(TrainRouter::SequencePoint(j->track->get_block(), sequence));
+				if(waitable)
+					k->second = &j->info->sequence.front();
+				--sequence;
+			}
+			else if(waitable)
+			{
+				j->info->sequence.push_front(TrainRouter::SequencePoint(j->track->get_block(), sequence));
+				sequenced_tracks[j->track.track()] = &j->info->sequence.front();
+				--sequence;
+			}
+		}
+
+	result = COMPLETE;
 }
 
 
 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)
@@ -156,6 +274,8 @@ TrainRoutePlanner::TrainRoutingState::TrainRoutingState(TrainRoutingInfo &inf):
 			break;
 		iter = iter.next();
 	}
+
+	update_estimate();
 }
 
 TrainRoutePlanner::TrainRoutingState::TrainRoutingState(const TrainRoutingState &other):
@@ -168,6 +288,9 @@ TrainRoutePlanner::TrainRoutingState::TrainRoutingState(const TrainRoutingState
 	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;
@@ -175,7 +298,7 @@ TrainRoutePlanner::TrainRoutingState::TrainRoutingState(const TrainRoutingState
 
 TrainRoutePlanner::TrainRoutingState::~TrainRoutingState()
 {
-	if(!--occupied_tracks->refcount)
+	if(occupied_tracks && !--occupied_tracks->refcount)
 		delete occupied_tracks;
 }
 
@@ -233,6 +356,30 @@ void TrainRoutePlanner::TrainRoutingState::advance(float distance)
 		}
 		--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)
@@ -245,6 +392,14 @@ 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)
@@ -252,6 +407,7 @@ TrainRoutePlanner::RoutingStep::RoutingStep():
 
 TrainRoutePlanner::RoutingStep::RoutingStep(const RoutingStep *p):
 	time(p->time),
+	cost_estimate(p->cost_estimate),
 	trains(p->trains),
 	prev(p)
 { }
@@ -291,6 +447,8 @@ void TrainRoutePlanner::RoutingStep::create_successors(list<RoutingStep> &new_st
 		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);
 		}
@@ -390,21 +548,23 @@ void TrainRoutePlanner::RoutingStep::advance(const Time::TimeDelta &dt)
 {
 	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;
@@ -422,7 +582,19 @@ bool TrainRoutePlanner::RoutingStep::is_goal() const
 
 bool TrainRoutePlanner::RoutingStep::operator<(const RoutingStep &other) const
 {
-	return time<other.time;
+	return cost_estimate<other.cost_estimate;
+}
+
+
+TrainRoutePlanner::PlanningThread::PlanningThread(TrainRoutePlanner &p):
+	planner(p)
+{
+	launch();
+}
+
+void TrainRoutePlanner::PlanningThread::main()
+{
+	planner.create_plan();
 }
 
 } // namespace R2C2