#!/usr/bin/ruby

# planner -o <domain file> -f <problem file> -p <plan file> -k <DCK folder>

objective = "runtime"

parameters = {}
ARGV[0..ARGV.length-1].each_index { |i|
	if (i%2 == 0)
		parameters[ARGV[i]] = ARGV[i+1]
	end
}

domainFile = parameters["-o"]
problemFile = parameters["-f"]
planFileOutput = parameters["-p"]
dckFolder = parameters["-k"]

configuration = ""

if (!dckFolder.nil?)
	File.open("#{dckFolder}/winningDesignUntransformedArgumentString.txt", "r") { |file|
		configuration = file.gets
	}

	puts "Using learned knowledge configuration [#{configuration}]"
else
	configuration = "-zero_num_A 0 -no_pruning 0 -ri_list 0 -bestfirst 1 -evaluation_function 1 -weight_mutex_in_relaxed_plan 1.0 -notabu_fct 0 -notabu_act 0 -improve_reachability 0 -no_mutex_with_additive_effects 0 -avoid_best_action_cycles 0 -vicinato 4 -mutex_and_additive_effects 0 -walkplan 0 -reset_extended_unsupported_facts 0 -not_supported_preconds_evaluation 0 -cri_intermediate_levels 1 -not_extended_unsupported_facts 0 -twalkplan 0 -no_cut 0 -initializeichoice 0 -evaluate_threated_supported_preconds_of_neighb_action 0 -numrestart 9 -h 6 -triomemory 0 -static_noise 0 -noise 0.1 -inst_duplicate_param 0 -stop_remove_act 0 -cri_update_iterations 0 -cri_insertion_add_mutex 0 -donot_try_suspected_actions 0 -no_insert_threated_act_in_neighb 0 -choose_min_numA_fact 0 -extended_unsupported_goals 0 -criprecond 6 -fast_best_action_evaluation 0 -relaxed_neighborhood_evaluation 0 -nonuniform_random 0 -remove_act_next_step 0 -maxnoise 60 -evaluate_mutex_for_action_remotion 0 -tabu_length 5 -extended_effects_evaluation 0 -verifyAf 0 -verifyinit 0"

	puts "Using default configuration [#{configuration}]"
end

command = "ruby algorithms/lpg/run.rb #{objective} #{domainFile} #{problemFile} 1000000 1212453253267 2011 --useResourceLimits false --runOutputFile #{planFileOutput} #{configuration}"

IO.popen(command) { |io|
	while (line = io.gets)
		puts line
	end
}

puts "Finished!"
