7 citations · 20 across the 13 of their papers we have counts for
13 papers
Accelerated Reeds-Shepp and Under-Specified Reeds-Shepp Algorithms for Mobile Robot Path Planning
Ibrahim Ibrahim, Wilm Decré, Jan Swevers
In this study, we present a simple and intuitive method for accelerating optimal Reeds-Shepp path computation. Our approach uses geometrical reasoning to analyze the behavior of op…
From Instantaneous to Predictive Control: A More Intuitive and Tunable MPC Formulation for Robot Manipulators
Johan Ubbink, Ruan Viljoen, Erwin Aertbeliën +2
Model predictive control (MPC) has become increasingly popular for the control of robot manipulators due to its improved performance compared to instantaneous control approaches. H…
Exact Wavefront Propagation for Globally Optimal One-to-All Path Planning on 2D Cartesian Grids
Ibrahim Ibrahim, Joris Gillis, Wilm Decré +1
This paper introduces an efficient compute and memory complexity algorithm for globally optimal path planning on 2D Cartesian grids. Unlike existing marching metho…
Fast Generation of Feasible Trajectories in Direct Optimal Control
David Kiessling, Katrin Baumgärtner, Jonathan Frey +3
This paper examines the question of finding feasible points to discrete-time optimal control problems. The optimization problem of finding a feasible trajectory is transcribed to a…
An Efficient Solution to the 2D Visibility Problem in Cartesian Grid Maps and its Application in Heuristic Path Planning
Ibrahim Ibrahim, Joris Gillis, Wilm Decré +1
This paper introduces a novel, lightweight method to solve the visibility problem for 2D grids. The proposed method evaluates the existence of lines-of-sight from a source point to…
An Almost Feasible Sequential Linear Programming Algorithm
David Kiessling, Charlie Vanaret, Alejandro Astudillo +2
This paper proposes an almost feasible Sequential Linear Programming (afSLP) algorithm. In the first part, the practical limitations of previously proposed Feasible Sequential Line…
PV-OSIMr: A Lowest Order Complexity Algorithm for Computing the Delassus Matrix
Ajay Suresha Sathya, Wilm Decre, Jan Swevers
We present PV-OSIMr, an efficient algorithm for computing the Delassus matrix (also known as the inverse operational space inertia matrix) for a kinematic tree, with the lowest ord…
Efficient Constrained Dynamics Algorithms based on an Equivalent LQR Formulation using Gauss' Principle of Least Constraint
Ajay Suresha Sathya, Herman Bruyninckx, Wilm Decre +1
We derive a family of efficient constrained dynamics algorithms by formulating an equivalent linear quadratic regulator (LQR) problem using Gauss principle of least constraint and…
Energy-Efficient Control of Cable Robots Exploiting Natural Dynamics and Task Knowledge
Boris Deroo, Erwin Aertbeliën, Wilm Decré +1
This paper focusses on the energy-efficient control of a cable-driven robot for tasks that only require precise positioning at few points in their motion, and where that accuracy c…
FATROP : A Fast Constrained Optimal Control Problem Solver for Robot Trajectory Optimization and Control
Lander Vanroye, Ajay Sathya, Joris De Schutter +1
Trajectory optimization is a powerful tool for robot motion planning and control. State-of-the-art general-purpose nonlinear programming solvers are versatile, handle constraints e…
A Generalization of the Riccati Recursion for Equality-Constrained Linear Quadratic Optimal Control
Lander Vanroye, Joris De Schutter, Wilm Decré
This paper introduces a generalization of the well-known Riccati recursion for solving the discrete-time equality-constrained linear quadratic optimal control problem. The recursio…
An optimal open-loop strategy for handling a flexible beam with a robot manipulator
Shamil Mamedov, Alejandro Astudillo, Daniele Ronzani +3
Fast and safe manipulation of flexible objects with a robot manipulator necessitates measures to cope with vibrations. Existing approaches either increase the task execution time o…
Safe-Planner: A Single-Outcome Replanner for Computing Strong Cyclic Policies in Fully Observable Non-Deterministic Domains
Vahid Mokhtari, Ajay Suresha Sathya, Nikolaos Tsiogkas +1
Replanners are efficient methods for solving non-deterministic planning problems. Despite showing good scalability, existing replanners often fail to solve problems involving a lar…