Jostein Løwer
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Jostein Løwer has a total of 7 co-authors. Here are the top co-authors by number of shared publications:
- Øyvind Stavdahl
Department of Engineering Cybernetics, Norwegian University of Science and Technology, Trondheim, Norway
2 shared publications Damiano Varagnolo
Department of Engineering Cybernetics, Norwegian University of Science and Technology, Trondheim, Norway
1 shared publication- Damiano Varagnolo
Department of Engineering Cybernetics, Norwegian University of Science and Technology, Trondheim, Norway
1 shared publication - Irja Gravdahl
Department of Engineering Cybernetics, Norwegian University of Science and Technology (NTNU), Trondheim, Norway
1 shared publication - Irja Gravdahl
Department of Engineering Cybernetics, Norwegian University of Science and Technology, Trondheim, Norway
1 shared publication - Kristin Ytterstad Pettersen
Norwegian University of Science and Technology (NTNU)
1 shared publication
Latest Publications
- Open Access
- 30 September 2025
- Published by Springer Nature in Artificial Life and Robotics
- Vol. 31 (1) , 185-201
Form closure-based path-planning in obstacle-aided locomotion for snake robots
Snake robots are hyperredundant manipulators with a wide range of potential applications ranging from search-and-rescue to ocean and outer space exploration. When snake robots use obstacles in the environment to push themselves forward it is referred to as obstacle-aided locomotion (OAL). The problem of finding a path that optimally exploits available obstacles in the environment for OAL currently does not have a general solution. A snake robot in contact with a set of obstacles is fundamentally similar to an object being grasped by a robotic hand. By interpreting the environment-robot contact as a grasp, we can employ the form closure concept for assessing the robustness of a given configuration; if the snake robot’s “grasp” of its environment has continual form closure when following a given path, the robot is guaranteed to not drift off that path. This presents a potential technique for analyzing the path-planning problem for OAL. This paper assesses the form closure of a rigid object on a planar surface by means of a novel method as well as a traditional method based on the grasp matrix. Furthermore, it introduces the notion of a form closure margin as a measure of how much a configuration must change before form closure is lost, and proposes three metrics that quantify this property. Finally, the applicability of the proposed metrics is demonstrated through their application to optimal path-planning for three specific scenarios. The results indicate that the proposed algorithm has strong potential to contribute to robust path-planning for OAL.
- 30 September 2025
- Published by Springer Nature in Artificial Life and Robotics
- Vol. 31 (1) , 185-201
Open AccessForm closure-based path-planning in obstacle-aided locomotion for snake robots
Snake robots are hyperredundant manipulators with a wide range of potential applications ranging from search-and-rescue to ocean and outer space exploration. When snake robots use obstacles in the environment to push themselves forward it is referred to as obstacle-aided locomotion (OAL). The problem of finding a path that optimally exploits available obstacles in the environment for OAL currently does not have a general solution. A snake robot in contact with a set of obstacles is fundamentally similar to an object being grasped by a robotic hand. By interpreting the environment-robot contact as a grasp, we can employ the form closure concept for assessing the robustness of a given configuration; if the snake robot’s “grasp” of its environment has continual form closure when following a given path, the robot is guaranteed to not drift off that path. This presents a potential technique for analyzing the path-planning problem for OAL. This paper assesses the form closure of a rigid object on a planar surface by means of a novel method as well as a traditional method based on the grasp matrix. Furthermore, it introduces the notion of a form closure margin as a measure of how much a configuration must change before form closure is lost, and proposes three metrics that quantify this property. Finally, the applicability of the proposed metrics is demonstrated through their application to optimal path-planning for three specific scenarios. The results indicate that the proposed algorithm has strong potential to contribute to robust path-planning for OAL.
- 19 September 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Robotics and Automation Letters
- Vol. 8 (11) , 7360-7367
Form Closure for Fully Actuated and Robust Obstacle-Aided Locomotion in Snake Robots
In this paper we adapt the theory of form closure to define the form closed region: The subset of a snake robot's configuration space for which the constraints imposed by the obstacles in its environment render the system fully actuated. We show that the identification of form closed configurations is numerically feasible, and introduce the relaxed condition of form boundedness to achieve robustness in the presence of model uncertainties. We moreover show an example application where the concept of form closed region is used to produce predictable constrained motion in a cluttered environment using lateral undulation.
- 19 September 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Robotics and Automation Letters
- Vol. 8 (11) , 7360-7367
Form Closure for Fully Actuated and Robust Obstacle-Aided Locomotion in Snake Robots
In this paper we adapt the theory of form closure to define the form closed region: The subset of a snake robot's configuration space for which the constraints imposed by the obstacles in its environment render the system fully actuated. We show that the identification of form closed configurations is numerically feasible, and introduce the relaxed condition of form boundedness to achieve robustness in the presence of model uncertainties. We moreover show an example application where the concept of form closed region is used to produce predictable constrained motion in a cluttered environment using lateral undulation.
- Open Access
- 25 May 2023
- Published by Frontiers Media SA in Frontiers in Robotics and AI
- Vol. 10, 1190349
Improved Jacobian matrix estimation applied to snake robots
Two manipulator Jacobian matrix estimators for constrained planar snake robots are developed and tested, which enables the implementation of Jacobian-based obstacle-aided locomotion (OAL) control schemes. These schemes use obstacles in the robot’s vicinity to obtain propulsion. The devised estimators infer manipulator Jacobians for constrained planar snake robots in situations where the positions and number of surrounding obstacle constraints might change or are not precisely known. The first proposed estimator is an adaptation of contemporary research in soft robots and builds on convex optimization. The second estimator builds on the unscented Kalman filter. By simulations, we evaluate and compare the two devised algorithms in terms of their statistical performance, execution times, and robustness to measurement noise. We find that both algorithms lead to Jacobian matrix estimates that are similarly useful to predict end-effector movements. However, the unscented filter approach requires significantly lower computing resources and is not poised by convergence issues displayed by the convex optimization-based method. We foresee that the estimators may have use in other fields of research, such as soft robotics and visual servoing. The estimators may also be adapted for use in general non-planar snake robots.
- 25 May 2023
- Published by Frontiers Media SA in Frontiers in Robotics and AI
- Vol. 10, 1190349
Open AccessImproved Jacobian matrix estimation applied to snake robots
Two manipulator Jacobian matrix estimators for constrained planar snake robots are developed and tested, which enables the implementation of Jacobian-based obstacle-aided locomotion (OAL) control schemes. These schemes use obstacles in the robot’s vicinity to obtain propulsion. The devised estimators infer manipulator Jacobians for constrained planar snake robots in situations where the positions and number of surrounding obstacle constraints might change or are not precisely known. The first proposed estimator is an adaptation of contemporary research in soft robots and builds on convex optimization. The second estimator builds on the unscented Kalman filter. By simulations, we evaluate and compare the two devised algorithms in terms of their statistical performance, execution times, and robustness to measurement noise. We find that both algorithms lead to Jacobian matrix estimates that are similarly useful to predict end-effector movements. However, the unscented filter approach requires significantly lower computing resources and is not poised by convergence issues displayed by the convex optimization-based method. We foresee that the estimators may have use in other fields of research, such as soft robotics and visual servoing. The estimators may also be adapted for use in general non-planar snake robots.