From 4b4421e29271be29aefb419e27207c780e919819 Mon Sep 17 00:00:00 2001 From: Jean-Philippe ARGAUD Date: Sun, 6 Feb 2022 15:02:09 +0100 Subject: [PATCH] Minor documentation and code review corrections (20) --- doc/en/ref_algorithm_TabuSearch.rst | 2 ++ doc/en/ref_algorithm_UnscentedKalmanFilter.rst | 4 ++-- doc/fr/ref_algorithm_TabuSearch.rst | 2 ++ doc/fr/ref_algorithm_UnscentedKalmanFilter.rst | 2 +- 4 files changed, 7 insertions(+), 3 deletions(-) diff --git a/doc/en/ref_algorithm_TabuSearch.rst b/doc/en/ref_algorithm_TabuSearch.rst index 51bc869..7340de7 100644 --- a/doc/en/ref_algorithm_TabuSearch.rst +++ b/doc/en/ref_algorithm_TabuSearch.rst @@ -64,6 +64,8 @@ Positions already explored are kept in a list of finite length. .. ------------------------------------ .. .. include:: snippets/Header2Algo03AdOp.rst +.. include:: snippets/BoundsWithNone.rst + .. include:: snippets/LengthOfTabuList.rst .. include:: snippets/MaximumNumberOfSteps_50.rst diff --git a/doc/en/ref_algorithm_UnscentedKalmanFilter.rst b/doc/en/ref_algorithm_UnscentedKalmanFilter.rst index 09f9d42..2e26be2 100644 --- a/doc/en/ref_algorithm_UnscentedKalmanFilter.rst +++ b/doc/en/ref_algorithm_UnscentedKalmanFilter.rst @@ -58,8 +58,8 @@ with the help of the :ref:`section_ref_algorithm_LinearityTest`. A difference is made between the "unscented" Kalman filter taking into account bounds on the states (the variant named "2UKF", which is recommended and used -by default), and the "unscented" Kalman filter conducted without any constraint -(the variant named "UKF", which is not recommended). +by default), and the canonical "unscented" Kalman filter conducted without any +constraint (the variant named "UKF", which is not recommended). .. ------------------------------------ .. .. include:: snippets/Header2Algo02.rst diff --git a/doc/fr/ref_algorithm_TabuSearch.rst b/doc/fr/ref_algorithm_TabuSearch.rst index 61d2ae5..4b19204 100644 --- a/doc/fr/ref_algorithm_TabuSearch.rst +++ b/doc/fr/ref_algorithm_TabuSearch.rst @@ -66,6 +66,8 @@ liste de longueur finie. .. ------------------------------------ .. .. include:: snippets/Header2Algo03AdOp.rst +.. include:: snippets/BoundsWithNone.rst + .. include:: snippets/LengthOfTabuList.rst .. include:: snippets/MaximumNumberOfSteps_50.rst diff --git a/doc/fr/ref_algorithm_UnscentedKalmanFilter.rst b/doc/fr/ref_algorithm_UnscentedKalmanFilter.rst index 91a64da..facee3c 100644 --- a/doc/fr/ref_algorithm_UnscentedKalmanFilter.rst +++ b/doc/fr/ref_algorithm_UnscentedKalmanFilter.rst @@ -59,7 +59,7 @@ opérateurs à l'aide de l':ref:`section_ref_algorithm_LinearityTest`. On fait une différence entre le filtre de Kalman "unscented" tenant compte de bornes sur les états (la variante nommée "2UKF", qui est recommandée et qui est -utilisée par défaut), et le filtre de Kalman "unscented" conduit sans +utilisée par défaut), et le filtre de Kalman "unscented" canonique conduit sans aucune contrainte (la variante nommée "UKF", qui n'est pas recommandée). .. ------------------------------------ .. -- 2.39.2