diff --git a/src/Mod/Robot/App/kdl_cp/treefksolverpos_recursive.cpp b/src/Mod/Robot/App/kdl_cp/treefksolverpos_recursive.cpp
index 08039f088..0685d2844 100644
--- a/src/Mod/Robot/App/kdl_cp/treefksolverpos_recursive.cpp
+++ b/src/Mod/Robot/App/kdl_cp/treefksolverpos_recursive.cpp
@@ -40,8 +40,7 @@ namespace KDL {
         else if(it == tree.getSegments().end()) //if the segment name is not found
          	return -2;
         else{
-        	const TreeElement& currentElement = it->second;
-			p_out = recursiveFk(q_in, it);	
+		p_out = recursiveFk(q_in, it);	
         	return 0;        	
         }
     }
diff --git a/src/Mod/Robot/App/kdl_cp/treeiksolvervel_wdls.cpp b/src/Mod/Robot/App/kdl_cp/treeiksolvervel_wdls.cpp
index 04b959467..b40abc97f 100644
--- a/src/Mod/Robot/App/kdl_cp/treeiksolvervel_wdls.cpp
+++ b/src/Mod/Robot/App/kdl_cp/treeiksolvervel_wdls.cpp
@@ -81,6 +81,7 @@ namespace KDL {
         
         // Compute the SVD of the weighted jacobian
         int ret = svd_eigen_HH(Wy_J_Wq, U, S, V, tmp);
+        (void)ret;
         
         //Pre-multiply U and V by the task space and joint space weighting matrix respectively
         Wy_t = (Wy * t).lazy();