diff --git a/test1.py b/test1.py
index ee8ad958874477fe05a3d720db8a04dad49fde5a..23f9facae86db1d31ff8d30573fc19889d607bc0 100644
--- a/test1.py
+++ b/test1.py
@@ -33,6 +33,7 @@ rbprmBuilder.boundSO3([-0.4,0.4,-3,3,-3,3])
 from hpp.corbaserver.rbprm.problem_solver import ProblemSolver
 ps = ProblemSolver( rbprmBuilder )
 r = Viewer (ps)
+r.loadObstacleModel (packageName, "darpa", "planning")
 
 # Setting initial and goal configurations
 q_init = rbprmBuilder.getCurrentConfig ();
@@ -45,12 +46,6 @@ ps.addPathOptimizer("RandomShortcut")
 ps.setInitialConfig (q_init)
 ps.addGoalConfig (q_goal)
 
-# Choosing RBPRM shooter and path validation methods.
-# Note that the standard RRT algorithm is used.
-ps.client.problem.selectConFigurationShooter("RbprmShooter")
-ps.client.problem.selectPathValidation("RbprmPathValidation",0.05)
-r.loadObstacleModel (packageName, "darpa", "planning")
-
 from hpp.corbaserver.affordance import Client
 c = Client ()
 c.affordance.analyseAll ()
@@ -66,6 +61,11 @@ for aff in objs:
 		r.client.gui.addToGroup('tri' + str(count), 'planning')
 		count += 1
 
+# Choosing RBPRM shooter and path validation methods.
+# Note that the standard RRT algorithm is used.
+ps.client.problem.selectConFigurationShooter("RbprmShooter")
+ps.client.problem.selectPathValidation("RbprmPathValidation",0.05)
+
 # Solve the problem
 t = ps.solve ()